{"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/empirical-risk-minimization-for-stochastic","title":"Empirical Risk Minimization for Stochastic Convex Optimization: $O(1/n)$- and $O(1/n^2)$-type of Risk Bounds","arxiv_id":"1702.02030","date":"2017-02-07","proceeding":null,"authors":["Lijun Zhang","Tianbao Yang","Rong Jin"],"abstract":"Although there exist plentiful theories of empirical risk minimization (ERM)\nfor supervised learning, current theoretical understandings of ERM for a\nrelated problem---stochastic convex optimization (SCO), are limited. In this\nwork, we strengthen the realm of ERM for SCO by exploiting smoothness and\nstrong convexity conditions to improve the risk bounds. First, we establish an\n$\\widetilde{O}(d/n + \\sqrt{F_*/n})$ risk bound when the random function is\nnonnegative, convex and smooth, and the expected function is Lipschitz\ncontinuous, where $d$ is the dimensionality of the problem, $n$ is the number\nof samples, and $F_*$ is the minimal risk. Thus, when $F_*$ is small we obtain\nan $\\widetilde{O}(d/n)$ risk bound, which is analogous to the\n$\\widetilde{O}(1/n)$ optimistic rate of ERM for supervised learning. Second, if\nthe objective function is also $\\lambda$-strongly convex, we prove an\n$\\widetilde{O}(d/n + \\kappa F_*/n )$ risk bound where $\\kappa$ is the condition\nnumber, and improve it to $O(1/[\\lambda n^2] + \\kappa F_*/n)$ when\n$n=\\widetilde{\\Omega}(\\kappa d)$. As a result, we obtain an $O(\\kappa/n^2)$\nrisk bound under the condition that $n$ is large and $F_*$ is small, which to\nthe best of our knowledge, is the first $O(1/n^2)$-type of risk bound of ERM.\nThird, we stress that the above results are established in a unified framework,\nwhich allows us to derive new risk bounds under weaker conditions, e.g.,\nwithout convexity of the random function and Lipschitz continuity of the\nexpected function. Finally, we demonstrate that to achieve an $O(1/[\\lambda\nn^2] + \\kappa F_*/n)$ risk bound for supervised learning, the\n$\\widetilde{\\Omega}(\\kappa d)$ requirement on $n$ can be replaced with\n$\\Omega(\\kappa^2)$, which is dimensionality-independent.","url_abs":"http://arxiv.org/abs/1702.02030v1","url_pdf":"http://arxiv.org/pdf/1702.02030v1.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":[],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-classification-on-colored-mnist-with","task":"Image Classification","dataset":"Colored-MNIST(with spurious correlation)","model":"MLP-ERM","rank_in_archive_order":5,"of":6,"metrics":{"Accuracy ":"17.10"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.02030","atlas_url":"https://app.syntology.ai/?focus=1702.02030","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":"1702.02030"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.02030\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.02030"},"call":"get_concepts_for_paper(arxiv_id=\"1702.02030\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a9ee4638c6c6a895c9924ed44b2ef5c3ec99ddd46e5a2bc7e242f83dc7e5c2ee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}