{"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/8","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":8,"pages_in_order":14,"rows_per_page":100,"rows":[701,800],"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/7","next":"/task/stochastic-optimization/papers/9","papers":[{"url":null,"slug":"decentralized-stochastic-optimization-with","title":"Decentralized Stochastic Optimization with Inherent Privacy Protection","date":"2022-05-08","arxiv_id":"2205.03884","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-and-inference-by-stochastic-1","title":"Estimation and Inference by Stochastic Optimization","date":"2022-05-06","arxiv_id":"2205.03254","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-qd-suite-developing-a-set-of","title":"Towards QD-suite: developing a set of benchmarks for Quality-Diversity algorithms","date":"2022-05-06","arxiv_id":"2205.03207","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-descent-stochastic-optimization-and","title":"Gradient Descent, Stochastic Optimization, and Other Tales","date":"2022-05-02","arxiv_id":"2205.00832","repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-efficient-dynamic-edge-computing-with","title":"Energy-Efficient Dynamic Edge Computing with Electromagnetic Field Exposure Constraints","date":"2022-04-27","arxiv_id":"2204.12988","repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-algorithms-for-high-dimensional","title":"Streaming Algorithms for High-Dimensional Robust Statistics","date":"2022-04-26","arxiv_id":"2204.12399","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-arbitrary-compression-for-decentralized","title":"On Arbitrary Compression for Decentralized Consensus and Stochastic Optimization over Directed Networks","date":"2022-04-18","arxiv_id":"2204.08160","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-algorithms-for-limiting-the","title":"Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits","date":"2022-04-12","arxiv_id":"2204.05597","repositories_listed":0,"syntology":null},{"url":null,"slug":"rockafellian-relaxation-in-optimization-under","title":"Rockafellian Relaxation and Stochastic Optimization under Perturbations","date":"2022-04-10","arxiv_id":"2204.04762","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-evolution-strategies-for-black","title":"Distributed Evolution Strategies for Black-box Stochastic Optimization","date":"2022-04-09","arxiv_id":"2204.04450","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-gradient-mappings-and-stochastic","title":"Nonlinear gradient mappings and stochastic optimization: A general framework with applications to heavy-tail noise","date":"2022-04-06","arxiv_id":"2204.02593","repositories_listed":0,"syntology":null},{"url":"/paper/adasmooth-an-adaptive-learning-rate-method","slug":"adasmooth-an-adaptive-learning-rate-method","title":"AdaSmooth: An Adaptive Learning Rate Method based on Effective Ratio","date":"2022-04-02","arxiv_id":"2204.00825","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-sampling-affects-the-complexity-of","title":"Data Sampling Affects the Complexity of Online SGD over Dependent Data","date":"2022-03-31","arxiv_id":"2204.00006","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-management-of-a-smart-port-with-shore","title":"Optimal Management of a Smart Port with Shore-Connection and Hydrogen Supplying by Stochastic Model Predictive Control","date":"2022-03-31","arxiv_id":"2204.00453","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-timescale-resource-allocation-for","title":"Two-timescale Resource Allocation for Automated Networks in IIoT","date":"2022-03-24","arxiv_id":"2203.12900","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-local-convergence-theory-for-the-stochastic","title":"A Local Convergence Theory for the Stochastic Gradient Descent Method in Non-Convex Optimization With Non-isolated Local Minima","date":"2022-03-21","arxiv_id":"2203.10973","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-parameter-free-online-learning-with","title":"Implicit Parameter-free Online Learning with Truncated Linear Models","date":"2022-03-19","arxiv_id":"2203.10327","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-stochastic-probabilistic","title":"Accelerating Stochastic Probabilistic Inference","date":"2022-03-15","arxiv_id":"2203.07585","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-role-of-local-steps-in-local-sgd","title":"The Role of Local Steps in Local SGD","date":"2022-03-14","arxiv_id":"2203.06798","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-machine-learning-approach-for-prosumer","title":"A Machine Learning Approach for Prosumer Management in Intraday Electricity Markets","date":"2022-03-11","arxiv_id":"2203.06053","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-scheduling-for-minimizing-aoi-in","title":"Minimizing the AoI in Resource-Constrained Multi-Source Relaying Systems: Dynamic and Learning-based Scheduling","date":"2022-03-10","arxiv_id":"2203.05656","repositories_listed":0,"syntology":null},{"url":null,"slug":"false-data-injection-attack-on-electric","title":"False Data Injection Attack on Electric Vehicle-Assisted Voltage Regulation","date":"2022-03-09","arxiv_id":"2203.05087","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-alignment-of-distributional-word","title":"Unsupervised Alignment of Distributional Word Embeddings","date":"2022-03-09","arxiv_id":"2203.04863","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-modeling-of-unknown-dynamical-systems","title":"Robust Modeling of Unknown Dynamical Systems via Ensemble Averaged Learning","date":"2022-03-07","arxiv_id":"2203.03458","repositories_listed":0,"syntology":null},{"url":null,"slug":"goal-oriented-communication-for-edge-learning","title":"Goal-Oriented Communication for Edge Learning based on the Information Bottleneck","date":"2022-02-25","arxiv_id":"2202.12639","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-schedule-heuristics-for-the-1","title":"Learning to Schedule Heuristics for the Simultaneous Stochastic Optimization of Mining Complexes","date":"2022-02-25","arxiv_id":"2202.12866","repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-sum-compositional-stochastic","title":"Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applications","date":"2022-02-24","arxiv_id":"2202.12396","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-a-variance-reduction-correction-of-the","title":"Temporal Difference Learning with Continuous Time and State in the Stochastic Setting","date":"2022-02-16","arxiv_id":"2202.07960","repositories_listed":0,"syntology":null},{"url":null,"slug":"surgical-scheduling-via-optimization-and","title":"Surgical Scheduling via Optimization and Machine Learning with Long-Tailed Data","date":"2022-02-13","arxiv_id":"2202.06383","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-for-min-sum-set-cover-and","title":"Online Learning for Min Sum Set Cover and Pandora's Box","date":"2022-02-10","arxiv_id":"2202.04870","repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-efficiency-and-delay-tradeoff-in-an","title":"Energy Efficiency and Delay Tradeoff in an MEC-Enabled Mobile IoT Network","date":"2022-02-08","arxiv_id":"2202.03648","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduced-stochastic-optimization-over","title":"Variance reduced stochastic optimization over directed graphs with row and column stochastic weights","date":"2022-02-07","arxiv_id":"2202.03346","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-gradient-descent-with-dependent","title":"Stochastic Gradient Descent with Dependent Data for Offline Reinforcement Learning","date":"2022-02-06","arxiv_id":"2202.02850","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-nearest-neighbor-gaussian","title":"Variational Nearest Neighbor Gaussian Process","date":"2022-02-03","arxiv_id":"2202.01694","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-msgd-and-adagrad-for-1","title":"On the Convergence of mSGD and AdaGrad for Stochastic Optimization","date":"2022-01-26","arxiv_id":"2201.11204","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-device-scheduling-for","title":"Communication-Efficient Device Scheduling for Federated Learning Using Stochastic Optimization","date":"2022-01-19","arxiv_id":"2201.07912","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributionally-robust-neural-networks-for-1","title":"DISTRIBUTIONALLY ROBUST NEURAL NETWORKS FOR GROUP SHIFTS ON THE IMPORTANCE OF REGULARIZATION FOR WORST-CASE GENERALIZATION","date":"2022-01-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-autograd","title":"Stochastic Autograd","date":"2022-01-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-approximations-in-composite","title":"Consistent Approximations in Composite Optimization","date":"2022-01-13","arxiv_id":"2201.05250","repositories_listed":0,"syntology":null},{"url":null,"slug":"opportunities-of-hybrid-model-based","title":"Opportunities of Hybrid Model-based Reinforcement Learning for Cell Therapy Manufacturing Process Control","date":"2022-01-10","arxiv_id":"2201.03116","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-aware-distributed-day-ahead-dispatch","title":"Coordinated Day-ahead Dispatch of Multiple Power Distribution Grids hosting Stochastic Resources: An ADMM-based Framework","date":"2022-01-10","arxiv_id":"2201.03465","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-multi-task-stochastic","title":"Decentralized Multi-Task Stochastic Optimization With Compressed Communications","date":"2021-12-23","arxiv_id":"2112.12373","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-edge-computing-empowered-by","title":"Dynamic Edge Computing empowered by Reconfigurable Intelligent Surfaces","date":"2021-12-21","arxiv_id":"2112.11269","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-and-stochastic-optimization","title":"Distributed and Stochastic Optimization Methods with Gradient Compression and Local Steps","date":"2021-12-20","arxiv_id":"2112.10645","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlated-product-of-experts-for-sparse","title":"Correlated Product of Experts for Sparse Gaussian Process Regression","date":"2021-12-17","arxiv_id":"2112.09519","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathematical-models-of-covid-19-spread","title":"Mathematical models of COVID-19 spread","date":"2021-12-10","arxiv_id":"2112.05315","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-continuous-time-stochastic-gradient-descent","title":"A Continuous-time Stochastic Gradient Descent Method for Continuous Data","date":"2021-12-07","arxiv_id":"2112.03754","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-adaptive-algorithms-for","title":"Convergence of adaptive algorithms for constrained weakly convex optimization","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-stochastic-dual-dynamic-programming-1","title":"Neural Stochastic Dual Dynamic Programming","date":"2021-12-01","arxiv_id":"2112.00874","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-bias-variance-cost-tradeoff-of","title":"On the Bias-Variance-Cost Tradeoff of Stochastic Optimization","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"taming-communication-and-sample-complexities","title":"Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"test-time-classifier-adjustment-module-for","title":"Test-Time Classifier Adjustment Module for Model-Agnostic Domain Generalization","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-first-and-second-order-algorithms","title":"Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning","date":"2021-11-29","arxiv_id":"2111.14761","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-policy-gradient-with-variance","title":"Distributed Policy Gradient with Variance Reduction in Multi-Agent Reinforcement Learning","date":"2021-11-25","arxiv_id":"2111.12961","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-schedule-heuristics-for-the","title":"Learning to Schedule Heuristics for the Simultaneous Stochastic Optimization of Mining Complexes","date":"2021-11-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predprop-bidirectional-stochastic","title":"PredProp: Bidirectional Stochastic Optimization with Precision Weighted Predictive Coding","date":"2021-11-16","arxiv_id":"2111.08792","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-projection-free-online-convex","title":"Efficient Projection-Free Online Convex Optimization with Membership Oracle","date":"2021-11-10","arxiv_id":"2111.05818","repositories_listed":0,"syntology":null},{"url":null,"slug":"does-momentum-help-a-sample-complexity","title":"Does Momentum Help? A Sample Complexity Analysis","date":"2021-10-29","arxiv_id":"2110.15547","repositories_listed":0,"syntology":null},{"url":null,"slug":"earning-sans-learning-noisy-decision-making","title":"Fair Incentives for Repeated Engagement","date":"2021-10-28","arxiv_id":"2111.00002","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributionally-robust-day-ahead-scheduling","title":"Fast Distributed Stochastic Scheduling for A Multi-Energy Industrial Park","date":"2021-10-27","arxiv_id":"2110.14209","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictive-machine-learning-for-prescriptive","title":"Predictive machine learning for prescriptive applications: a coupled training-validating approach","date":"2021-10-22","arxiv_id":"2110.11826","repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-free-algorithm-for-stochastic-bi","title":"Projection-Free Algorithm for Stochastic Bi-level Optimization","date":"2021-10-22","arxiv_id":"2110.11721","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-wasserstein-barycenters-with-c","title":"Variational Wasserstein Barycenters with c-Cyclical Monotonicity","date":"2021-10-22","arxiv_id":"2110.11707","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-learning-rate-optimization-in-the","title":"Stochastic Learning Rate Optimization in the Stochastic Approximation and Online Learning Settings","date":"2021-10-20","arxiv_id":"2110.10710","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilevel-stochastic-optimization-for","title":"Multilevel Stochastic Optimization for Imputation in Massive Medical Data Records","date":"2021-10-19","arxiv_id":"2110.09680","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-q-learning-based-approach-for-distributed","title":"A Q-Learning-based Approach for Distributed Beam Scheduling in mmWave Networks","date":"2021-10-17","arxiv_id":"2110.08704","repositories_listed":0,"syntology":null},{"url":null,"slug":"nys-curve-nystrom-approximated-curvature-for","title":"Nys-Newton: Nyström-Approximated Curvature for Stochastic Optimization","date":"2021-10-16","arxiv_id":"2110.08577","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-algorithms-for-gmm-estimation-a-finite","title":"Robust Generalized Method of Moments: A Finite Sample Viewpoint","date":"2021-10-06","arxiv_id":"2110.03070","repositories_listed":0,"syntology":null},{"url":null,"slug":"kkt-conditions-first-order-and-second-order","title":"KKT Conditions, First-Order and Second-Order Optimization, and Distributed Optimization: Tutorial and Survey","date":"2021-10-05","arxiv_id":"2110.01858","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-convergence-and-stability-of","title":"Global Convergence and Stability of Stochastic Gradient Descent","date":"2021-10-04","arxiv_id":"2110.01663","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-anderson-mixing-for-nonconvex","title":"Stochastic Anderson Mixing for Nonconvex Stochastic Optimization","date":"2021-10-04","arxiv_id":"2110.01543","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-class-of-short-term-recurrence-anderson","title":"A Class of Short-term Recurrence Anderson Mixing Methods and Their Applications","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-two-time-scale-stochastic-optimization","title":"A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning","date":"2021-09-29","arxiv_id":"2109.14756","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-training-for-end-to-end-deep","title":"Compositional Training for End-to-End Deep AUC Maximization","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-improve-sample-complexity-of-sgd-over","title":"How to Improve Sample Complexity of SGD over Highly Dependent Data?","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-schedule-learning-rate-with-graph","title":"Learning to Schedule Learning rate with Graph Neural Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-markov-controlled-sde-stochastic","title":"Neural Markov Controlled SDE: Stochastic Optimization for Continuous-Time Data","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sgdem-stochastic-gradient-descent-with-energy","title":"SGDEM: stochastic gradient descent with energy and momentum","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-sampling-quasi-newton-methods-for-1","title":"Adaptive Sampling Quasi-Newton Methods for Zeroth-Order Stochastic Optimization","date":"2021-09-24","arxiv_id":"2109.12213","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-equivalence-of-different-adaptive","title":"On the equivalence of different adaptive batch size selection strategies for stochastic gradient descent methods","date":"2021-09-22","arxiv_id":"2109.10933","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimizing-aoi-in-resource-constrained-multi","title":"Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals","date":"2021-09-10","arxiv_id":"2109.05106","repositories_listed":0,"syntology":null},{"url":null,"slug":"urban-fire-station-location-planning-a","title":"Urban Fire Station Location Planning using Predicted Demand and Service Quality Index","date":"2021-09-05","arxiv_id":"2109.02160","repositories_listed":0,"syntology":null},{"url":null,"slug":"application-of-monte-carlo-stochastic","title":"Application of Monte Carlo Stochastic Optimization (MOST) to Deep Learning","date":"2021-09-02","arxiv_id":"2109.02441","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-minimax-complexity-of-distributed","title":"The Minimax Complexity of Distributed Optimization","date":"2021-09-01","arxiv_id":"2109.00534","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximating-pandora-s-box-with-correlations","title":"Approximating Pandora's Box with Correlations","date":"2021-08-30","arxiv_id":"2108.12976","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-based-dictionary-learning-and","title":"Deep learning based dictionary learning and tomographic image reconstruction","date":"2021-08-26","arxiv_id":"2108.11730","repositories_listed":0,"syntology":null},{"url":null,"slug":"heavy-tailed-streaming-statistical-estimation","title":"Heavy-tailed Streaming Statistical Estimation","date":"2021-08-25","arxiv_id":"2108.11483","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-stochastic-optimization-in","title":"Sequential Stochastic Optimization in Separable Learning Environments","date":"2021-08-21","arxiv_id":"2108.09585","repositories_listed":0,"syntology":null},{"url":null,"slug":"whittle-index-for-a-class-of-restless-bandits","title":"Low-Complexity Algorithm for Restless Bandits with Imperfect Observations","date":"2021-08-09","arxiv_id":"2108.03812","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-subgradient-descent-escapes-active","title":"Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions","date":"2021-08-04","arxiv_id":"2108.02072","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-properties-of-stochastic","title":"Generalization Bounds using Lower Tail Exponents in Stochastic Optimizers","date":"2021-08-02","arxiv_id":"2108.00781","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-monte-carlo-methods-for-noisy-and","title":"A survey of Monte Carlo methods for noisy and costly densities with application to reinforcement learning and ABC","date":"2021-08-01","arxiv_id":"2108.00490","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-assessment-and-tuning-of-pid","title":"Performance assessment and tuning of PID control using TLBO: the single-loop case and PI/P cascade case","date":"2021-07-31","arxiv_id":"2108.00184","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-sustainable-power-grid-stochastic","title":"Towards a Sustainable Power Grid: Stochastic Hierarchical Planning for High Renewable Integration","date":"2021-07-30","arxiv_id":"2107.14558","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-differentially-private","title":"High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data","date":"2021-07-23","arxiv_id":"2107.11136","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-annealed-importance-sampling","title":"Differentiable Annealed Importance Sampling and the Perils of Gradient Noise","date":"2021-07-21","arxiv_id":"2107.10211","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-learning-rates-for-stochastic","title":"Improved Learning Rates for Stochastic Optimization: Two Theoretical Viewpoints","date":"2021-07-19","arxiv_id":"2107.08686","repositories_listed":0,"syntology":null},{"url":null,"slug":"renyi-differential-privacy-of-the-subsampled","title":"Renyi Differential Privacy of the Subsampled Shuffle Model in Distributed Learning","date":"2021-07-19","arxiv_id":"2107.08763","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-stochastic","title":"Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings","date":"2021-07-12","arxiv_id":"2107.05585","repositories_listed":0,"syntology":null},{"url":null,"slug":"kafisto-a-kalman-filtering-framework-for","title":"KOALA: A Kalman Optimization Algorithm with Loss Adaptivity","date":"2021-07-07","arxiv_id":"2107.03331","repositories_listed":0,"syntology":null}],"record_sha256":"8f39c9014d5312ff125ae30e50af0540c0c1b62dc582dceaad6f83e11f4b74ef","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}