{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/estimation-from-indirect-supervision-with","title":"Estimation from Indirect Supervision with Linear Moments","arxiv_id":"1608.03100","date":"2016-08-10","proceeding":null,"authors":["Aditi Raghunathan","Roy Frostig","John Duchi","Percy Liang"],"abstract":"In structured prediction problems where we have indirect supervision of the\noutput, maximum marginal likelihood faces two computational obstacles:\nnon-convexity of the objective and intractability of even a single gradient\ncomputation. In this paper, we bypass both obstacles for a class of what we\ncall linear indirectly-supervised problems. Our approach is simple: we solve a\nlinear system to estimate sufficient statistics of the model, which we then use\nto estimate parameters via convex optimization. We analyze the statistical\nproperties of our approach and show empirically that it is effective in two\nsettings: learning with local privacy constraints and learning from low-cost\ncount-based annotations.","url_abs":"http://arxiv.org/abs/1608.03100v1","url_pdf":"http://arxiv.org/pdf/1608.03100v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"estimation-from-indirect-supervision-with","repo_url":"https://worksheets.codalab.org/worksheets/0x6a264a96efea41158847eef9ec2f76bc","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"structured-prediction","task_name":"Structured Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1608.03100","atlas_url":"https://app.syntology.ai/?focus=1608.03100","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1608.03100"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1608.03100\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1608.03100"},"call":"get_concepts_for_paper(arxiv_id=\"1608.03100\")"}],"by_repo":[{"repo":"worksheets.codalab.org/worksheets/0x6a264a96efea41158847eef9ec2f76bc","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"641d9847ad942f6f22660ad760169f69794605f953a9413d5989f8ca9520aa09","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}