{"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/9","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":9,"pages_in_order":14,"rows_per_page":100,"rows":[801,900],"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/8","next":"/task/stochastic-optimization/papers/10","papers":[{"url":null,"slug":"distributed-stochastic-optimization-with-1","title":"Distributed stochastic optimization with large delays","date":"2021-07-06","arxiv_id":"2107.02919","repositories_listed":0,"syntology":null},{"url":null,"slug":"momentum-accelerates-the-convergence-of","title":"Momentum Accelerates the Convergence of Stochastic AUPRC Maximization","date":"2021-07-02","arxiv_id":"2107.01173","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-probability-bounds-for-non-convex","title":"High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails","date":"2021-06-28","arxiv_id":"2106.14343","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-distributed-optimization-with-randomly","title":"Robust Distributed Optimization With Randomly Corrupted Gradients","date":"2021-06-28","arxiv_id":"2106.14956","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-chance-constrained-optimization","title":"Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency","date":"2021-06-23","arxiv_id":"2106.12199","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-linearized-proximal-method-of","title":"Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm","date":"2021-06-22","arxiv_id":"2106.11577","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-stochastic-optimization-robust","title":"Asynchronous Stochastic Optimization Robust to Arbitrary Delays","date":"2021-06-22","arxiv_id":"2106.11879","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-federated-learning-applications","title":"Compositional federated learning: Applications in distributionally robust averaging and meta learning","date":"2021-06-21","arxiv_id":"2106.11264","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-perils-of-learning-before-optimizing","title":"The Perils of Learning Before Optimizing","date":"2021-06-18","arxiv_id":"2106.10349","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-bias-reduced-gradient-methods","title":"Stochastic Bias-Reduced Gradient Methods","date":"2021-06-17","arxiv_id":"2106.09481","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-client-scheduling-and-resource","title":"Joint Client Scheduling and Resource Allocation under Channel Uncertainty in Federated Learning","date":"2021-06-12","arxiv_id":"2106.06796","repositories_listed":0,"syntology":null},{"url":null,"slug":"fractal-structure-and-generalization","title":"Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms","date":"2021-06-09","arxiv_id":"2106.04881","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-deep-neural-network-architecture-for-1","title":"A novel Deep Neural Network architecture for non-linear system identification","date":"2021-06-06","arxiv_id":"2106.03078","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandwidth-based-step-sizes-for-non-convex","title":"Bandwidth-based Step-Sizes for Non-Convex Stochastic Optimization","date":"2021-06-05","arxiv_id":"2106.02888","repositories_listed":0,"syntology":null},{"url":null,"slug":"escaping-saddle-points-faster-with-stochastic-1","title":"Escaping Saddle Points Faster with Stochastic Momentum","date":"2021-06-05","arxiv_id":"2106.02985","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-even-more-optimal-stochastic-optimization","title":"An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning","date":"2021-06-04","arxiv_id":"2106.02720","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-nonstationary-multivariate","title":"Stochastic Collapsed Variational Inference for Structured Gaussian Process Regression Network","date":"2021-06-01","arxiv_id":"2106.00719","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-resampling-and-reweighting-for","title":"Combining resampling and reweighting for faithful stochastic optimization","date":"2021-05-31","arxiv_id":"2105.14694","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-clipping-helps-in-non-smooth","title":"Gradient Clipping Helps in Non-Smooth Stochastic Optimization with Heavy-Tailed Noise","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"last-iterate-convergence-of-sgd-for-least-1","title":"Last iterate convergence of SGD for Least-Squares in the Interpolation regime.","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-under-time-drift-1","title":"Stochastic optimization under time drift: iterate averaging, step-decay schedules, and high probability guarantees","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-trajectory-and-offloading-control-of","title":"Dynamic Trajectory and Offloading Control of UAV-enabled MEC under User Mobility","date":"2021-05-19","arxiv_id":"2105.09042","repositories_listed":0,"syntology":null},{"url":null,"slug":"removing-data-heterogeneity-influence","title":"Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGD","date":"2021-05-17","arxiv_id":"2105.08023","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-effectively-use-machine-learning","title":"How to effectively use machine learning models to predict the solutions for optimization problems: lessons from loss function","date":"2021-05-14","arxiv_id":"2105.06618","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-projection-free-optimization","title":"Scalable Projection-Free Optimization","date":"2021-05-07","arxiv_id":"2105.03527","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-stochastic-variance-reduced","title":"Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization","date":"2021-05-05","arxiv_id":"2105.02266","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-stochastic-optimization-via-primal","title":"Two-Stage Stochastic Optimization via Primal-Dual Decomposition and Deep Unrolling","date":"2021-05-05","arxiv_id":"2105.01853","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-swimming-escape-patterns-under","title":"Learning swimming escape patterns for larval fish under energy constraints","date":"2021-05-03","arxiv_id":"2105.00771","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-power-control-adaptation-via-meta","title":"Fast Power Control Adaptation via Meta-Learning for Random Edge Graph Neural Networks","date":"2021-05-02","arxiv_id":"2105.00459","repositories_listed":0,"syntology":null},{"url":null,"slug":"contracts-in-electricity-markets-under-eu-ets","title":"Contracts in Electricity Markets under EU ETS: A Stochastic Programming Approach","date":"2021-04-30","arxiv_id":"2104.15062","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-investment-strategies-in-occupational","title":"On the Investment Strategies in Occupational Pension Plans","date":"2021-04-18","arxiv_id":"2104.08956","repositories_listed":0,"syntology":null},{"url":null,"slug":"day-ahead-and-intra-day-planning-of","title":"Day-Ahead and Intra-Day Planning of Integrated BESS-PV Systems providing Frequency Regulation","date":"2021-04-15","arxiv_id":"2104.07352","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-algorithm-for-deep-stochastic","title":"An Efficient Algorithm for Deep Stochastic Contextual Bandits","date":"2021-04-12","arxiv_id":"2104.05613","repositories_listed":0,"syntology":null},{"url":null,"slug":"sgd-implicitly-regularizes-generalization","title":"SGD Implicitly Regularizes Generalization Error","date":"2021-04-10","arxiv_id":"2104.04874","repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-efficient-edge-computing-when-lyapunov","title":"Energy Efficient Edge Computing: When Lyapunov Meets Distributed Reinforcement Learning","date":"2021-03-31","arxiv_id":"2103.16985","repositories_listed":0,"syntology":null},{"url":null,"slug":"competing-adaptive-networks","title":"Competing Adaptive Networks","date":"2021-03-29","arxiv_id":"2103.15664","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-variational-inequality-approach-to-bayesian","title":"A Variational Inequality Approach to Bayesian Regression Games","date":"2021-03-24","arxiv_id":"2103.13509","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-analysis-of-nonconvex-distributed","title":"Convergence Analysis of Nonconvex Distributed Stochastic Zeroth-order Coordinate Method","date":"2021-03-24","arxiv_id":"2103.12954","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-importance-sampling-for-finite-sum-1","title":"Adaptive Importance Sampling for Finite-Sum Optimization and Sampling with Decreasing Step-Sizes","date":"2021-03-23","arxiv_id":"2103.12243","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-hybrid-approximation-for","title":"Stochastic Hybrid Approximation for Uncertainty Management in Gas-Electric Systems","date":"2021-03-23","arxiv_id":"2103.12246","repositories_listed":0,"syntology":null},{"url":null,"slug":"taming-wild-price-fluctuations-monotone","title":"Algorithmic Challenges in Ensuring Fairness at the Time of Decision","date":"2021-03-16","arxiv_id":"2103.09287","repositories_listed":0,"syntology":null},{"url":null,"slug":"retrospective-approximation-for-smooth","title":"A Retrospective Approximation Approach for Smooth Stochastic Optimization","date":"2021-03-07","arxiv_id":"2103.04392","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bounding-rate-distortion-from-samples","title":"Lower Bounding Rate-Distortion From Samples","date":"2021-03-04","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-probabilistically-motivated-learning-rate","title":"A Probabilistically Motivated Learning Rate Adaptation for Stochastic Optimization","date":"2021-02-22","arxiv_id":"2102.10880","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-and-inference-by-stochastic","title":"Estimation and Inference by Stochastic Optimization: Three Examples","date":"2021-02-20","arxiv_id":"2102.10443","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-prediction-in-mean-variance","title":"Integrating prediction in mean-variance portfolio optimization","date":"2021-02-18","arxiv_id":"2102.09287","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-step-decay-step-size","title":"On the Convergence of Step Decay Step-Size for Stochastic Optimization","date":"2021-02-18","arxiv_id":"2102.09393","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-last-iterate-convergence-of-momentum","title":"On the Last Iterate Convergence of Momentum Methods","date":"2021-02-13","arxiv_id":"2102.07002","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-variance-reduced-method-for","title":"A Hybrid Variance-Reduced Method for Decentralized Stochastic Non-Convex Optimization","date":"2021-02-12","arxiv_id":"2102.06752","repositories_listed":0,"syntology":null},{"url":"/paper/a-large-batch-optimizer-reality-check","slug":"a-large-batch-optimizer-reality-check","title":"A Large Batch Optimizer Reality Check: Traditional, Generic Optimizers Suffice Across Batch Sizes","date":"2021-02-12","arxiv_id":"2102.06356","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-single-timescale-stochastic-bilevel","title":"A Single-Timescale Method for Stochastic Bilevel Optimization","date":"2021-02-09","arxiv_id":"2102.04671","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-adaptive-differential-evolution","title":"Learning adaptive differential evolution algorithm from optimization experiences by policy gradient","date":"2021-02-06","arxiv_id":"2102.03572","repositories_listed":0,"syntology":null},{"url":null,"slug":"last-iterate-convergence-of-sgd-for-least","title":"Last iterate convergence of SGD for Least-Squares in the Interpolation regime","date":"2021-02-05","arxiv_id":"2102.03183","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-statistical-inference-for-gradient","title":"Online Statistical Inference for Stochastic Optimization via Kiefer-Wolfowitz Methods","date":"2021-02-05","arxiv_id":"2102.03389","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-complexity-of-least-absolute-deviation","title":"Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergence","date":"2021-02-03","arxiv_id":"2102.02322","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-1","title":"Information-Theoretic Generalization Bounds for Stochastic Gradient Descent","date":"2021-02-01","arxiv_id":"2102.00931","repositories_listed":0,"syntology":null},{"url":null,"slug":"constraint-handling-techniques-for-particle","title":"Constraint-Handling Techniques for Particle Swarm Optimization Algorithms","date":"2021-01-25","arxiv_id":"2101.10933","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-variance-reduced-1","title":"Communication-Efficient Variance-Reduced Decentralized Stochastic Optimization over Time-Varying Directed Graphs","date":"2021-01-23","arxiv_id":"2101.09583","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-learning-approach-to-binary","title":"Stochastic Learning Approach to Binary Optimization for Optimal Design of Experiments","date":"2021-01-15","arxiv_id":"2101.05958","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-practical-adam-non-convexity","title":"Towards Practical Adam: Non-Convexity, Convergence Theory, and Mini-Batch Acceleration","date":"2021-01-14","arxiv_id":"2101.05471","repositories_listed":0,"syntology":null},{"url":null,"slug":"heteroscedasticity-aware-residuals-based","title":"Heteroscedasticity-aware residuals-based contextual stochastic optimization","date":"2021-01-08","arxiv_id":"2101.03139","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-optimal-and-parallel-some-results","title":"Accelerated, Optimal, and Parallel: Some Results on Model-Based Stochastic Optimization","date":"2021-01-07","arxiv_id":"2101.02696","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-fitted-q-iteration-based-optimal","title":"Neural Fitted Q Iteration based Optimal Bidding Strategy in Real Time Reactive Power Market_1","date":"2021-01-07","arxiv_id":"2101.02456","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-for-vaccine-and","title":"Stochastic Optimization for Vaccine and Testing Kit Allocation for the COVID-19 Pandemic","date":"2021-01-04","arxiv_id":"2101.01204","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrated-optimization-of-predictive-and","title":"Integrated Optimization of Predictive and Prescriptive Tasks","date":"2021-01-02","arxiv_id":"2101.00354","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-half-space-stochastic-projected-gradient","title":"A Half-Space Stochastic Projected Gradient Method for Group Sparsity Regularization","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-single-pass-stochastic-gradient","title":"Adaptive Single-Pass Stochastic Gradient Descent in Input Sparsity Time","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"apollo-an-adaptive-parameter-wised-diagonal","title":"Apollo: An Adaptive Parameter-wised Diagonal Quasi-Newton Method for Nonconvex Stochastic Optimization","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-feature-selection-for-efficient-and","title":"Dynamic Feature Selection for Efficient and Interpretable Human Activity Recognition","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-empirical-risk-minimization-via","title":"Fair Empirical Risk Minimization via Exponential Rényi Mutual Information","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sharper-generalization-bounds-for-learning","title":"Sharper Generalization Bounds for Learning with Gradient-dominated Objective Functions","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-with-non-stationary-1","title":"Stochastic Optimization with Non-stationary Noise: The Power of Moment Estimation","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/towards-practical-second-order-optimization","slug":"towards-practical-second-order-optimization","title":"Towards Practical Second Order Optimization for Deep Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-dirichlet-sampling-on-manifolds","title":"Data driven Dirichlet sampling on manifolds","date":"2020-12-29","arxiv_id":"2101.00947","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-compositional-gradient-descent-1","title":"Stochastic Compositional Gradient Descent under Compositional Constraints","date":"2020-12-17","arxiv_id":"2012.09400","repositories_listed":0,"syntology":null},{"url":null,"slug":"strong-overall-error-analysis-for-the","title":"Strong overall error analysis for the training of artificial neural networks via random initializations","date":"2020-12-15","arxiv_id":"2012.08443","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-stochastic-optimization-with","title":"Online Stochastic Optimization with Wasserstein Based Non-stationarity","date":"2020-12-13","arxiv_id":"2012.06961","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-with-momentum","title":"Stochastic optimization with momentum: convergence, fluctuations, and traps avoidance","date":"2020-12-07","arxiv_id":"2012.04002","repositories_listed":0,"syntology":null},{"url":null,"slug":"escaping-saddle-point-faster-under","title":"Escaping Saddle-Point Faster under Interpolation-like Conditions","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-devil-is-in-the-detail-a-framework-for","title":"The Devil is in the Detail: A Framework for Macroscopic Prediction via Microscopic Models","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adam-a-stochastic-method-with-adaptive-1","title":"Adam$^+$: A Stochastic Method with Adaptive Variance Reduction","date":"2020-11-24","arxiv_id":"2011.11985","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-algorithms-for-convex-nested","title":"Optimal Algorithms for Convex Nested Stochastic Composite Optimization","date":"2020-11-19","arxiv_id":"2011.10076","repositories_listed":0,"syntology":null},{"url":null,"slug":"state-of-charge-estimation-of-a-li-ion-1","title":"State-of-charge Estimation of a Li-ion Battery using Deep Learning and Stochastic Optimization","date":"2020-11-18","arxiv_id":"2011.09673","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-offline-contextual-bandits-with","title":"Improving Offline Contextual Bandits with Distributional Robustness","date":"2020-11-13","arxiv_id":"2011.06835","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-optimal-problem-dependent","title":"Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory","date":"2020-11-12","arxiv_id":"2011.06186","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-local-optimization-imposing-structure-on","title":"Non-local Optimization: Imposing Structure on Optimization Problems by Relaxation","date":"2020-11-11","arxiv_id":"2011.06064","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-network-compression-via-sparse","title":"Neural Network Compression Via Sparse Optimization","date":"2020-11-10","arxiv_id":"2011.04868","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-tuning-stochastic-optimization-with","title":"Self-Tuning Stochastic Optimization with Curvature-Aware Gradient Filtering","date":"2020-11-09","arxiv_id":"2011.04803","repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-time-analysis-of-decentralized","title":"Finite-Time Convergence Rates of Decentralized Stochastic Approximation with Applications in Multi-Agent and Multi-Task Learning","date":"2020-10-28","arxiv_id":"2010.15088","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-with-laggard-data","title":"Stochastic Optimization with Laggard Data Pipelines","date":"2020-10-26","arxiv_id":"2010.13639","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-homomorphic-perturbations-for-private","title":"Graph-Homomorphic Perturbations for Private Decentralized Learning","date":"2020-10-23","arxiv_id":"2010.12288","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentation-as-stochastic-optimization-1","title":"How Data Augmentation affects Optimization for Linear Regression","date":"2020-10-21","arxiv_id":"2010.11171","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-averaging-is-surprisingly-effective-for-1","title":"Dual Averaging is Surprisingly Effective for Deep Learning Optimization","date":"2020-10-20","arxiv_id":"2010.10502","repositories_listed":0,"syntology":null},{"url":null,"slug":"alphazero-based-post-storm-vehicle-routing","title":"AlphaZero Based Post-Storm Repair Crew Dispatch for Distribution Grid Restoration","date":"2020-10-14","arxiv_id":"2010.06764","repositories_listed":0,"syntology":null},{"url":null,"slug":"regret-minimization-in-stochastic-non-convex","title":"Regret minimization in stochastic non-convex learning via a proximal-gradient approach","date":"2020-10-13","arxiv_id":"2010.06250","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-and-distributed-control-for","title":"Online Learning and Distributed Control for Residential Demand Response","date":"2020-10-11","arxiv_id":"2010.05153","repositories_listed":0,"syntology":null},{"url":null,"slug":"three-dimensional-swarming-using-cyclic","title":"Three-Dimensional Swarming Using Cyclic Stochastic Optimization","date":"2020-10-11","arxiv_id":"2010.05328","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-step-size-policy-for-the-limited-1","title":"Learning the Step-size Policy for the Limited-Memory Broyden-Fletcher-Goldfarb-Shanno Algorithm","date":"2020-10-03","arxiv_id":"2010.01311","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-fpf-gain-function-approximation-in-high","title":"Deep FPF: Gain function approximation in high-dimensional setting","date":"2020-10-02","arxiv_id":"2010.01183","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduced-methods-for-machine-learning","title":"Variance-Reduced Methods for Machine Learning","date":"2020-10-02","arxiv_id":"2010.00892","repositories_listed":0,"syntology":null}],"record_sha256":"a1db5aa1ea60cd557ce902ec264a065cedfdf9619d9c95a48c0e1e5b00b964a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}