{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/stochastic-optimization-under-time-drift","title":"Stochastic Optimization under Distributional Drift","arxiv_id":"2108.07356","date":"2021-08-16","proceeding":"NeurIPS 2021 12","authors":["Joshua Cutler","Dmitriy Drusvyatskiy","Zaid Harchaoui"],"abstract":"We consider the problem of minimizing a convex function that is evolving according to unknown and possibly stochastic dynamics, which may depend jointly on time and on the decision variable itself. Such problems abound in the machine learning and signal processing literature, under the names of concept drift, stochastic tracking, and performative prediction. We provide novel non-asymptotic convergence guarantees for stochastic algorithms with iterate averaging, focusing on bounds valid both in expectation and with high probability. The efficiency estimates we obtain clearly decouple the contributions of optimization error, gradient noise, and time drift. Notably, we identify a low drift-to-noise regime in which the tracking efficiency of the proximal stochastic gradient method benefits significantly from a step decay schedule. Numerical experiments illustrate our results.","url_abs":"https://arxiv.org/abs/2108.07356v4","url_pdf":"https://arxiv.org/pdf/2108.07356v4.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":"stochastic-optimization-under-time-drift","repo_url":"https://github.com/joshuacutler/TimeDriftExperiments","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"},{"task_slug":null,"task_name":"valid"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2108.07356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07356"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/joshuacutler/TimeDriftExperiments","reach":null}],"summary":{"ran_fixture":2,"ran_draft_wrong":1,"ran_honours":3},"by_repo_kind":{"official":{"samples":6,"ran":6,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":6,"samples":[{"code_sha256_prefix":"e106aedb0c789b9b","entry":"grad","repo":"joshuacutler/TimeDriftExperiments","repo_kind":"official","path":"LogisticRegression/LR.py","file_url":"https://github.com/joshuacutler/TimeDriftExperiments/blob/HEAD/LogisticRegression/LR.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e106aedb0c789b9b"}},{"code_sha256_prefix":"643eb5445f28c8f7","entry":"labels","repo":"joshuacutler/TimeDriftExperiments","repo_kind":"official","path":"LogisticRegression/LR.py","file_url":"https://github.com/joshuacutler/TimeDriftExperiments/blob/HEAD/LogisticRegression/LR.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"643eb5445f28c8f7"}},{"code_sha256_prefix":"dee0c1d679077be7","entry":"matrix","repo":"joshuacutler/TimeDriftExperiments","repo_kind":"official","path":"LeastSquares/LS.py","file_url":"https://github.com/joshuacutler/TimeDriftExperiments/blob/HEAD/LeastSquares/LS.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"dee0c1d679077be7"}},{"code_sha256_prefix":"dc5c14e5975262cc","entry":"noiseball","repo":"joshuacutler/TimeDriftExperiments","repo_kind":"official","path":"LeastSquares/LS.py","file_url":"https://github.com/joshuacutler/TimeDriftExperiments/blob/HEAD/LeastSquares/LS.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"dc5c14e5975262cc"}},{"code_sha256_prefix":"86baf377dd6b146b","entry":"noisesphere","repo":"joshuacutler/TimeDriftExperiments","repo_kind":"official","path":"LeastSquares/LS.py","file_url":"https://github.com/joshuacutler/TimeDriftExperiments/blob/HEAD/LeastSquares/LS.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"86baf377dd6b146b"}},{"code_sha256_prefix":"73b57935522c994a","entry":"obj","repo":"joshuacutler/TimeDriftExperiments","repo_kind":"official","path":"LogisticRegression/LR.py","file_url":"https://github.com/joshuacutler/TimeDriftExperiments/blob/HEAD/LogisticRegression/LR.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"73b57935522c994a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}