{"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/online-variance-reduction-for-stochastic","title":"Online Variance Reduction for Stochastic Optimization","arxiv_id":"1802.04715","date":"2018-02-13","proceeding":null,"authors":["Zalán Borsos","Andreas Krause","Kfir. Y. Levy"],"abstract":"Modern stochastic optimization methods often rely on uniform sampling which\nis agnostic to the underlying characteristics of the data. This might degrade\nthe convergence by yielding estimates that suffer from a high variance. A\npossible remedy is to employ non-uniform importance sampling techniques, which\ntake the structure of the dataset into account. In this work, we investigate a\nrecently proposed setting which poses variance reduction as an online\noptimization problem with bandit feedback. We devise a novel and efficient\nalgorithm for this setting that finds a sequence of importance sampling\ndistributions competitive with the best fixed distribution in hindsight, the\nfirst result of this kind. While we present our method for sampling datapoints,\nit naturally extends to selecting coordinates or even blocks of thereof.\nEmpirical validations underline the benefits of our method in several settings.","url_abs":"http://arxiv.org/abs/1802.04715v3","url_pdf":"http://arxiv.org/pdf/1802.04715v3.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":"online-variance-reduction-for-stochastic","repo_url":"https://github.com/zalanborsos/online-variance-reduction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"online-variance-reduction-for-stochastic","repo_url":"https://github.com/zalanborsos/variance-reduction-mixtures","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.04715","atlas_url":"https://app.syntology.ai/?focus=1802.04715","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":"1802.04715"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.04715\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.04715"},"call":"get_concepts_for_paper(arxiv_id=\"1802.04715\")"}],"by_repo":[{"repo":"zalanborsos/online-variance-reduction","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zalanborsos/variance-reduction-mixtures","kind":"listed","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":"9b97e7155f68f964a26b7be0a3d4ccca4867c620e4130b4841c094d39d58fb94","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}