{"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/a-smoother-way-to-train-structured-prediction","title":"A Smoother Way to Train Structured Prediction Models","arxiv_id":"1902.03228","date":"2019-02-08","proceeding":"NeurIPS 2018 12","authors":["Krishna Pillutla","Vincent Roulet","Sham M. Kakade","Zaid Harchaoui"],"abstract":"We present a framework to train a structured prediction model by performing\nsmoothing on the inference algorithm it builds upon. Smoothing overcomes the\nnon-smoothness inherent to the maximum margin structured prediction objective,\nand paves the way for the use of fast primal gradient-based optimization\nalgorithms. We illustrate the proposed framework by developing a novel primal\nincremental optimization algorithm for the structural support vector machine.\nThe proposed algorithm blends an extrapolation scheme for acceleration and an\nadaptive smoothing scheme and builds upon the stochastic variance-reduced\ngradient algorithm. We establish its worst-case global complexity bound and\nstudy several practical variants, including extensions to deep structured\nprediction. We present experimental results on two real-world problems, namely\nnamed entity recognition and visual object localization. The experimental\nresults show that the proposed framework allows us to build upon efficient\ninference algorithms to develop large-scale optimization algorithms for\nstructured prediction which can achieve competitive performance on the two\nreal-world problems.","url_abs":"http://arxiv.org/abs/1902.03228v1","url_pdf":"http://arxiv.org/pdf/1902.03228v1.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":"a-smoother-way-to-train-structured-prediction","repo_url":"https://github.com/krishnap25/casimir","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"named-entity-recognition-1","task_name":"Named Entity Recognition"},{"task_slug":"named-entity-recognition-ner","task_name":"Named Entity Recognition (NER)"},{"task_slug":"object-localization","task_name":"Object Localization"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"structured-prediction","task_name":"Structured Prediction"},{"task_slug":"named-entity-recognition","task_name":"named-entity-recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.03228","atlas_url":"https://app.syntology.ai/?focus=1902.03228","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":"1902.03228"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.03228\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.03228"},"call":"get_concepts_for_paper(arxiv_id=\"1902.03228\")"}],"by_repo":[{"repo":"krishnap25/casimir","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":"cd55f0c9c279c216706bd1bd6fbf56070c5cb852aa3442023c1d4dd8ca45f1dc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}