{"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":"/task/stochastic-optimization/papers/4","list_of":"/task/stochastic-optimization","task":"Stochastic Optimization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":14,"rows_per_page":100,"rows":[301,400],"of":1387,"counts":{"archive_papers_tagged":1387,"with_a_code_link":337,"where_syntology_ran_a_sample":91,"not_listed_spam_title":0,"listed":1387,"listed_where_code_ran":91,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":75,"every_run_a_failure_of_syntologys_instrument":16,"listed_with_a_run_with_no_instrument_failure":75,"listed_every_run_a_failure_of_syntologys_instrument":16,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/stochastic-optimization","prev":"/task/stochastic-optimization/papers/3","next":"/task/stochastic-optimization/papers/5","papers":[{"url":"/paper/graph-pattern-mining-and-learning-through","slug":"graph-pattern-mining-and-learning-through","title":"Graph Pattern Mining and Learning through User-defined Relations (Extended Version)","date":"2018-09-14","arxiv_id":"1809.05241","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-gradient-descent-with-biased-but","slug":"stochastic-gradient-descent-with-biased-but","title":"Stochastic Gradient Descent with Biased but Consistent Gradient Estimators","date":"2018-07-31","arxiv_id":"1807.11880","repositories_listed":1,"syntology":null},{"url":"/paper/maximizing-invariant-data-perturbation-with","slug":"maximizing-invariant-data-perturbation-with","title":"Maximizing Invariant Data Perturbation with Stochastic Optimization","date":"2018-07-12","arxiv_id":"1807.05077","repositories_listed":1,"syntology":null},{"url":"/paper/variational-implicit-processes","slug":"variational-implicit-processes","title":"Variational Implicit Processes","date":"2018-06-06","arxiv_id":"1806.02390","repositories_listed":1,"syntology":null},{"url":"/paper/adagrad-stepsizes-sharp-convergence-over","slug":"adagrad-stepsizes-sharp-convergence-over","title":"AdaGrad stepsizes: Sharp convergence over nonconvex landscapes","date":"2018-06-05","arxiv_id":"1806.01811","repositories_listed":1,"syntology":null},{"url":"/paper/kernel-embedding-of-maps-for-sequential","slug":"kernel-embedding-of-maps-for-sequential","title":"Kernel embedding of maps for sequential Bayesian inference: The variational mapping particle filter","date":"2018-05-29","arxiv_id":"1805.11380","repositories_listed":1,"syntology":null},{"url":"/paper/zeroth-order-stochastic-variance-reduction","slug":"zeroth-order-stochastic-variance-reduction","title":"Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization","date":"2018-05-25","arxiv_id":"1805.10367","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/zeroth-order-stochastic-variance-reduction#ran","syntology_url":"https://syntology.ai/paper/1805.10367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.10367"}},"official":null}},{"url":"/paper/nonparametric-stochastic-compositional","slug":"nonparametric-stochastic-compositional","title":"Nonparametric Stochastic Compositional Gradient Descent for Q-Learning in Continuous Markov Decision Problems","date":"2018-04-19","arxiv_id":"1804.07323","repositories_listed":1,"syntology":null},{"url":"/paper/cauchy-noise-loss-for-stochastic-optimization","slug":"cauchy-noise-loss-for-stochastic-optimization","title":"Cauchy noise loss for stochastic optimization of random matrix models via free deterministic equivalents","date":"2018-04-09","arxiv_id":"1804.03154","repositories_listed":1,"syntology":null},{"url":"/paper/sever-a-robust-meta-algorithm-for-stochastic","slug":"sever-a-robust-meta-algorithm-for-stochastic","title":"Sever: A Robust Meta-Algorithm for Stochastic Optimization","date":"2018-03-07","arxiv_id":"1803.02815","repositories_listed":1,"syntology":null},{"url":"/paper/demystifying-parallel-and-distributed-deep","slug":"demystifying-parallel-and-distributed-deep","title":"Demystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysis","date":"2018-02-26","arxiv_id":"1802.09941","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-hyperparameter-optimization","slug":"stochastic-hyperparameter-optimization","title":"Stochastic Hyperparameter Optimization through Hypernetworks","date":"2018-02-26","arxiv_id":"1802.09419","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stochastic-hyperparameter-optimization#ran","syntology_url":"https://syntology.ai/paper/1802.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09419"}},"official":null}},{"url":"/paper/deeptype-multilingual-entity-linking-by","slug":"deeptype-multilingual-entity-linking-by","title":"DeepType: Multilingual Entity Linking by Neural Type System Evolution","date":"2018-02-03","arxiv_id":"1802.01021","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deeptype-multilingual-entity-linking-by#ran","syntology_url":"https://syntology.ai/paper/1802.01021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.01021"}},"official":{"repos":["openai/deeptype"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sgdlibrary-a-matlab-library-for-stochastic","slug":"sgdlibrary-a-matlab-library-for-stochastic","title":"SGDLibrary: A MATLAB library for stochastic gradient descent algorithms","date":"2017-10-27","arxiv_id":"1710.10951","repositories_listed":1,"syntology":null},{"url":"/paper/sgd-for-robot-motion-the-effectiveness-of","slug":"sgd-for-robot-motion-the-effectiveness-of","title":"SGD for robot motion? The effectiveness of stochastic optimization on a new benchmark for biped locomotion tasks","date":"2017-10-09","arxiv_id":"1710.03029","repositories_listed":1,"syntology":null},{"url":"/paper/style2vec-representation-learning-for-fashion","slug":"style2vec-representation-learning-for-fashion","title":"Style2Vec: Representation Learning for Fashion Items from Style Sets","date":"2017-08-14","arxiv_id":"1708.04014","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-submodular-rank-aggregation-on","slug":"unsupervised-submodular-rank-aggregation-on","title":"Unsupervised Submodular Rank Aggregation on Score-based Permutations","date":"2017-07-04","arxiv_id":"1707.01166","repositories_listed":1,"syntology":null},{"url":"/paper/biased-importance-sampling-for-deep-neural","slug":"biased-importance-sampling-for-deep-neural","title":"Biased Importance Sampling for Deep Neural Network Training","date":"2017-05-31","arxiv_id":"1706.00043","repositories_listed":1,"syntology":null},{"url":"/paper/bandit-structured-prediction-for-neural","slug":"bandit-structured-prediction-for-neural","title":"Bandit Structured Prediction for Neural Sequence-to-Sequence Learning","date":"2017-04-21","arxiv_id":"1704.06497","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-line-searches-for-stochastic","slug":"probabilistic-line-searches-for-stochastic","title":"Probabilistic Line Searches for Stochastic Optimization","date":"2017-03-29","arxiv_id":"1703.10034","repositories_listed":1,"syntology":null},{"url":"/paper/task-based-end-to-end-model-learning-in","slug":"task-based-end-to-end-model-learning-in","title":"Task-based End-to-end Model Learning in Stochastic Optimization","date":"2017-03-13","arxiv_id":"1703.04529","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/task-based-end-to-end-model-learning-in#ran","syntology_url":"https://syntology.ai/paper/1703.04529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04529"}},"official":{"repos":["locuslab/e2e-model-learning"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/coupling-adaptive-batch-sizes-with-learning","slug":"coupling-adaptive-batch-sizes-with-learning","title":"Coupling Adaptive Batch Sizes with Learning Rates","date":"2016-12-15","arxiv_id":"1612.05086","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/coupling-adaptive-batch-sizes-with-learning#ran","syntology_url":"https://syntology.ai/paper/1612.05086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.05086"}},"official":{"repos":["ProbabilisticNumerics/cabs"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/greedy-step-averaging-a-parameter-free","slug":"greedy-step-averaging-a-parameter-free","title":"Greedy Step Averaging: A parameter-free stochastic optimization method","date":"2016-11-11","arxiv_id":"1611.03608","repositories_listed":1,"syntology":null},{"url":"/paper/learning-deep-embeddings-with-histogram-loss","slug":"learning-deep-embeddings-with-histogram-loss","title":"Learning Deep Embeddings with Histogram Loss","date":"2016-11-02","arxiv_id":"1611.00822","repositories_listed":1,"syntology":null},{"url":"/paper/variance-based-regularization-with-convex","slug":"variance-based-regularization-with-convex","title":"Variance-based regularization with convex objectives","date":"2016-10-08","arxiv_id":"1610.02581","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-optimization-with-variance","slug":"stochastic-optimization-with-variance","title":"Stochastic Optimization with Variance Reduction for Infinite Datasets with Finite-Sum Structure","date":"2016-10-04","arxiv_id":"1610.00970","repositories_listed":1,"syntology":null},{"url":"/paper/generic-inference-in-latent-gaussian-process","slug":"generic-inference-in-latent-gaussian-process","title":"Generic Inference in Latent Gaussian Process Models","date":"2016-09-02","arxiv_id":"1609.00577","repositories_listed":1,"syntology":null},{"url":"/paper/seboost-boosting-stochastic-learning-using","slug":"seboost-boosting-stochastic-learning-using","title":"SEBOOST - Boosting Stochastic Learning Using Subspace Optimization Techniques","date":"2016-09-02","arxiv_id":"1609.00629","repositories_listed":1,"syntology":null},{"url":"/paper/cyclades-conflict-free-asynchronous-machine","slug":"cyclades-conflict-free-asynchronous-machine","title":"CYCLADES: Conflict-free Asynchronous Machine Learning","date":"2016-05-31","arxiv_id":"1605.09721","repositories_listed":1,"syntology":null},{"url":"/paper/barzilai-borwein-step-size-for-stochastic","slug":"barzilai-borwein-step-size-for-stochastic","title":"Barzilai-Borwein Step Size for Stochastic Gradient Descent","date":"2016-05-13","arxiv_id":"1605.04131","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/barzilai-borwein-step-size-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/1605.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.04131"}},"official":null}},{"url":"/paper/on-deep-multi-view-representation-learning","slug":"on-deep-multi-view-representation-learning","title":"On Deep Multi-View Representation Learning: Objectives and Optimization","date":"2016-02-02","arxiv_id":"1602.01024","repositories_listed":1,"syntology":null},{"url":"/paper/scope-scalable-composite-optimization-for","slug":"scope-scalable-composite-optimization-for","title":"SCOPE: Scalable Composite Optimization for Learning on Spark","date":"2016-01-30","arxiv_id":"1602.00133","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-gap-between-stochastic-gradient","slug":"bridging-the-gap-between-stochastic-gradient","title":"Bridging the Gap between Stochastic Gradient MCMC and Stochastic Optimization","date":"2015-12-25","arxiv_id":"1512.07962","repositories_listed":1,"syntology":null},{"url":"/paper/asynchronous-stochastic-convex-optimization","slug":"asynchronous-stochastic-convex-optimization","title":"Asynchronous stochastic convex optimization","date":"2015-08-04","arxiv_id":"1508.00882","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-line-searches-for-stochastic-1","slug":"probabilistic-line-searches-for-stochastic-1","title":"Probabilistic Line Searches for Stochastic Optimization","date":"2015-02-10","arxiv_id":"1502.02846","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/probabilistic-line-searches-for-stochastic-1#ran","syntology_url":"https://syntology.ai/paper/1502.02846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.02846"}},"official":null}},{"url":"/paper/from-predictive-to-prescriptive-analytics","slug":"from-predictive-to-prescriptive-analytics","title":"From Predictive to Prescriptive Analytics","date":"2014-02-22","arxiv_id":"1402.5481","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-distributed-1","slug":"communication-efficient-distributed-1","title":"Communication Efficient Distributed Optimization using an Approximate Newton-type Method","date":"2013-12-30","arxiv_id":"1312.7853","repositories_listed":1,"syntology":null},{"url":null,"slug":"first-order-methods-for-stochastic-and-finite","title":"First-order methods for stochastic and finite-sum convex optimization with deterministic constraints","date":"2025-06-25","arxiv_id":"2506.20630","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-momentum-based-optimization","title":"Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters","date":"2025-06-13","arxiv_id":"2506.11904","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sample-complexity-of-parameter-free","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","date":"2025-06-12","arxiv_id":"2506.11336","repositories_listed":0,"syntology":null},{"url":null,"slug":"underage-detection-through-a-multi-task-and","title":"Underage Detection through a Multi-Task and MultiAge Approach for Screening Minors in Unconstrained Imagery","date":"2025-06-12","arxiv_id":"2506.10689","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-are-my-options-explaining-rl-agents-with","title":"\"What are my options?\": Explaining RL Agents with Diverse Near-Optimal Alternatives (Extended)","date":"2025-06-11","arxiv_id":"2506.09901","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-free-m-estimation","title":"Distribution free M-estimation","date":"2025-05-28","arxiv_id":"2505.22807","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-distributed-optimization-for-spatio","title":"Online distributed optimization for spatio-temporally constrained real-time peer-to-peer energy trading","date":"2025-05-28","arxiv_id":"2505.21884","repositories_listed":0,"syntology":null},{"url":null,"slug":"padam-parallel-averaged-adam-reduces-the","title":"PADAM: Parallel averaged Adam reduces the error for stochastic optimization in scientific machine learning","date":"2025-05-28","arxiv_id":"2505.22085","repositories_listed":0,"syntology":null},{"url":"/paper/dynamically-learned-test-time-model-routing","slug":"dynamically-learned-test-time-model-routing","title":"Dynamically Learned Test-Time Model Routing in Language Model Zoos with Service Level Guarantees","date":"2025-05-26","arxiv_id":"2505.19947","repositories_listed":0,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dynamically-learned-test-time-model-routing#ran","syntology_url":"https://syntology.ai/paper/2505.19947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19947"}},"official":null}},{"url":null,"slug":"online-statistical-inference-of-constrained","title":"Online Statistical Inference of Constrained Stochastic Optimization via Random Scaling","date":"2025-05-23","arxiv_id":"2505.18327","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-learning-for-stochastic","title":"Contextual Learning for Stochastic Optimization","date":"2025-05-22","arxiv_id":"2505.16829","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-11360","title":"Efficient End-to-End Learning for Decision-Making: A Meta-Optimization Approach","date":"2025-05-16","arxiv_id":"2505.11360","repositories_listed":0,"syntology":null},{"url":null,"slug":"formal-uncertainty-propagation-for-stochastic","title":"Formal Uncertainty Propagation for Stochastic Dynamical Systems with Additive Noise","date":"2025-05-16","arxiv_id":"2505.11219","repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-krylov-accelerated-stochastic","title":"Streaming Krylov-Accelerated Stochastic Gradient Descent","date":"2025-05-11","arxiv_id":"2505.07046","repositories_listed":0,"syntology":null},{"url":null,"slug":"complexity-lower-bounds-of-adaptive-gradient","title":"Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness","date":"2025-05-07","arxiv_id":"2505.04599","repositories_listed":0,"syntology":null},{"url":null,"slug":"primal-dual-algorithm-for-contextual","title":"Primal-dual algorithm for contextual stochastic combinatorial optimization","date":"2025-05-07","arxiv_id":"2505.04757","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-market-makers-a-stochastic","title":"Automated Market Makers: A Stochastic Optimization Approach for Profitable Liquidity Concentration","date":"2025-04-23","arxiv_id":"2504.16542","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-min-fairness-for-stacked-intelligent","title":"Max-Min Fairness for Stacked Intelligent Metasurface-Assisted Multi-User MISO Systems","date":"2025-04-20","arxiv_id":"2504.14584","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-weaker-variance-assumptions-for","title":"Towards Weaker Variance Assumptions for Stochastic Optimization","date":"2025-04-14","arxiv_id":"2504.09951","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-load-dependent-decision-referrals-for","title":"Task load dependent decision referrals for joint binary classification in human-automation teams","date":"2025-04-05","arxiv_id":"2504.04248","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-with-optimal","title":"Stochastic Optimization with Optimal Importance Sampling","date":"2025-04-04","arxiv_id":"2504.03560","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-order-gflownets","title":"Global-Order GFlowNets","date":"2025-04-03","arxiv_id":"2504.02968","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-pairwise-learning-with-adaptive","title":"Randomized Pairwise Learning with Adaptive Sampling: A PAC-Bayes Analysis","date":"2025-04-03","arxiv_id":"2504.02957","repositories_listed":0,"syntology":null},{"url":null,"slug":"route-recommendations-for-traffic-management","title":"Route Recommendations for Traffic Management Under Learned Partial Driver Compliance","date":"2025-04-03","arxiv_id":"2504.02993","repositories_listed":0,"syntology":null},{"url":null,"slug":"steering-large-agent-populations-using-mean","title":"Steering Large Agent Populations using Mean-Field Schrodinger Bridges with Gaussian Mixture Models","date":"2025-03-31","arxiv_id":"2503.23705","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-knowledge-deficiencies-of","title":"Discovering Knowledge Deficiencies of Language Models on Massive Knowledge Base","date":"2025-03-30","arxiv_id":"2503.23361","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-complexity-in-byzantine-robust","title":"Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneity","date":"2025-03-20","arxiv_id":"2503.16337","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-inference-for-weighted-sample","title":"Statistical Inference for Weighted Sample Average Approximation in Contextual Stochastic Optimization","date":"2025-03-17","arxiv_id":"2503.12747","repositories_listed":0,"syntology":null},{"url":"/paper/benefits-of-learning-rate-annealing-for","slug":"benefits-of-learning-rate-annealing-for","title":"Benefits of Learning Rate Annealing for Tuning-Robustness in Stochastic Optimization","date":"2025-03-12","arxiv_id":"2503.09411","repositories_listed":0,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benefits-of-learning-rate-annealing-for#ran","syntology_url":"https://syntology.ai/paper/2503.09411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09411"}},"official":null}},{"url":null,"slug":"forecast-driven-scenario-generation-for","title":"Forecast-Driven Scenario Generation for Building Energy Management Using Stochastic Optimization","date":"2025-03-11","arxiv_id":"2503.08113","repositories_listed":0,"syntology":null},{"url":null,"slug":"proactive-robust-hardening-of-resilient-power","title":"Proactive Robust Hardening of Resilient Power Distribution Network: Decision-Dependent Uncertainty Modeling and Fast Solution Strategy","date":"2025-03-06","arxiv_id":"2503.04375","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-free-stochastic-optimization-for","title":"Gradient-free stochastic optimization for additive models","date":"2025-03-03","arxiv_id":"2503.02131","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-aware-joint-dnn-model-deployment-and","title":"Privacy-Aware Joint DNN Model Deployment and Partitioning Optimization for Collaborative Edge Inference Services","date":"2025-02-22","arxiv_id":"2502.16091","repositories_listed":0,"syntology":null},{"url":null,"slug":"fundamental-bias-in-inverting-random-sampling","title":"Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton","date":"2025-02-19","arxiv_id":"2502.13583","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-lower-bounds-for-stochastic-non-convex","title":"New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition","date":"2025-02-19","arxiv_id":"2502.14060","repositories_listed":0,"syntology":null},{"url":null,"slug":"fluid-antenna-enabled-over-the-air-federated","title":"Fluid Antenna Enabled Over-the-Air Federated Learning: Joint Optimization of Positioning, Beamforming, and User Selection","date":"2025-02-17","arxiv_id":"2503.00011","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-of-inventory-at-large","title":"Stochastic Optimization of Inventory at Large-scale Supply Chains","date":"2025-02-16","arxiv_id":"2502.11213","repositories_listed":0,"syntology":null},{"url":null,"slug":"concentration-inequalities-for-the-stochastic","title":"Concentration Inequalities for the Stochastic Optimization of Unbounded Objectives with Application to Denoising Score Matching","date":"2025-02-12","arxiv_id":"2502.08628","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-bounds-for-sparse-variational-gaussian","title":"New Bounds for Sparse Variational Gaussian Processes","date":"2025-02-12","arxiv_id":"2502.08730","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-generalization-error-of","title":"Understanding the Generalization Error of Markov algorithms through Poissonization","date":"2025-02-11","arxiv_id":"2502.07584","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-linear-quantum-monte-carlo","title":"Non-linear Quantum Monte Carlo","date":"2025-02-07","arxiv_id":"2502.05094","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-communication-based-on-generative-ai","title":"Semantic Communication based on Generative AI: A New Approach to Image Compression and Edge Optimization","date":"2025-02-01","arxiv_id":"2502.01675","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bias-correction-decentralized-stochastic","title":"A Bias-Correction Decentralized Stochastic Gradient Algorithm with Momentum Acceleration","date":"2025-01-31","arxiv_id":"2501.19082","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-single-loop-spider-type-stochastic","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","date":"2025-01-31","arxiv_id":"2501.19214","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-ai-for-lyapunov-optimization","title":"Generative AI for Lyapunov Optimization Theory in UAV-based Low-Altitude Economy Networking","date":"2025-01-27","arxiv_id":"2501.15928","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-stochastic-gradient-descent-effective-a","title":"Is Stochastic Gradient Descent Effective? A PDE Perspective on Machine Learning processes","date":"2025-01-14","arxiv_id":"2501.08425","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-gradient-tracking","title":"Differentially Private Gradient-Tracking-Based Distributed Stochastic Optimization over Directed Graphs","date":"2025-01-12","arxiv_id":"2501.06793","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-localsgd-and-scaffold-improved","title":"Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis","date":"2025-01-08","arxiv_id":"2501.04443","repositories_listed":0,"syntology":null},{"url":null,"slug":"dacapo-score-distillation-as-stacked-bridge","title":"DaCapo: Score Distillation as Stacked Bridge for Fast and High-quality 3D Editing","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"preconditioners-for-the-stochastic-training-1","title":"Preconditioners for the Stochastic Training of Neural Fields","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-stochastic-optimization-under-heavy","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","date":"2024-12-27","arxiv_id":"2412.19529","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-first-order-methods-with-multi","title":"A stochastic first-order method with multi-extrapolated momentum for highly smooth unconstrained optimization","date":"2024-12-19","arxiv_id":"2412.14488","repositories_listed":0,"syntology":null},{"url":null,"slug":"projected-gradient-methods-for-nonconvex-and","title":"Projected gradient methods for nonconvex and stochastic optimization: new complexities and auto-conditioned stepsizes","date":"2024-12-18","arxiv_id":"2412.14291","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-efficient-4-bit-preconditioned","title":"Memory-Efficient 4-bit Preconditioned Stochastic Optimization","date":"2024-12-14","arxiv_id":"2412.10663","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-gradient-descent-revisited","title":"Stochastic Gradient Descent Revisited","date":"2024-12-08","arxiv_id":"2412.06070","repositories_listed":0,"syntology":null},{"url":null,"slug":"equivariant-denoisers-for-image-restoration","title":"Equivariant Denoisers for Image Restoration","date":"2024-12-06","arxiv_id":"2412.05343","repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-stochastic-optimization-of-black-box","title":"Offline Stochastic Optimization of Black-Box Objective Functions","date":"2024-12-03","arxiv_id":"2412.02089","repositories_listed":0,"syntology":null},{"url":null,"slug":"resilience-oriented-planning-and-cost","title":"Resilience-oriented Planning and Cost Allocation of Energy Storage Integrated with Soft Open Point Based on Resilience Insurance","date":"2024-12-02","arxiv_id":"2412.01050","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-zero-order-sgd-under-high-order","title":"Accelerated zero-order SGD under high-order smoothness and overparameterized regime","date":"2024-11-21","arxiv_id":"2411.13999","repositories_listed":0,"syntology":null},{"url":null,"slug":"problem-dependent-convergence-bounds-for","title":"Problem-dependent convergence bounds for randomized linear gradient compression","date":"2024-11-19","arxiv_id":"2411.12898","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-reductions-and-representations-of-learning","title":"On Reductions and Representations of Learning Problems in Euclidean Spaces","date":"2024-11-16","arxiv_id":"2411.10784","repositories_listed":0,"syntology":null},{"url":null,"slug":"complexity-aware-training-of-deep-neural","title":"Complexity-Aware Training of Deep Neural Networks for Optimal Structure Discovery","date":"2024-11-14","arxiv_id":"2411.09127","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-generative-demand-learning-for","title":"Deep Generative Demand Learning for Newsvendor and Pricing","date":"2024-11-13","arxiv_id":"2411.08631","repositories_listed":0,"syntology":null}],"record_sha256":"b9264b5ecff5eda290a23c3e67ef6c059c81fd6a368949d65d632511eb850752","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}