{"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/variance-based-regularization-with-convex","title":"Variance-based regularization with convex objectives","arxiv_id":"1610.02581","date":"2016-10-08","proceeding":"NeurIPS 2017 12","authors":["John Duchi","Hongseok Namkoong"],"abstract":"We develop an approach to risk minimization and stochastic optimization that\nprovides a convex surrogate for variance, allowing near-optimal and\ncomputationally efficient trading between approximation and estimation error.\nOur approach builds off of techniques for distributionally robust optimization\nand Owen's empirical likelihood, and we provide a number of finite-sample and\nasymptotic results characterizing the theoretical performance of the estimator.\nIn particular, we show that our procedure comes with certificates of\noptimality, achieving (in some scenarios) faster rates of convergence than\nempirical risk minimization by virtue of automatically balancing bias and\nvariance. We give corroborating empirical evidence showing that in practice,\nthe estimator indeed trades between variance and absolute performance on a\ntraining sample, improving out-of-sample (test) performance over standard\nempirical risk minimization for a number of classification problems.","url_abs":"http://arxiv.org/abs/1610.02581v3","url_pdf":"http://arxiv.org/pdf/1610.02581v3.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":"variance-based-regularization-with-convex","repo_url":"https://github.com/hsnamkoong/robustopt","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1610.02581","atlas_url":"https://app.syntology.ai/?focus=1610.02581","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":"1610.02581"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1610.02581\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1610.02581"},"call":"get_concepts_for_paper(arxiv_id=\"1610.02581\")"}],"by_repo":[{"repo":"hsnamkoong/robustopt","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":"3af7d8031180c807f2ab79a41a935055cd5cb5ebdeea9e053b30a5c58905333a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}