{"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/12","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":12,"pages_in_order":14,"rows_per_page":100,"rows":[1101,1200],"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/11","next":"/task/stochastic-optimization/papers/13","papers":[{"url":null,"slug":"uniform-in-time-weak-error-analysis-for","title":"Uniform-in-Time Weak Error Analysis for Stochastic Gradient Descent Algorithms via Diffusion Approximation","date":"2019-02-02","arxiv_id":"1902.00635","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-monte-carlo-variational-inference","title":"Multilevel Monte Carlo Variational Inference","date":"2019-02-01","arxiv_id":"1902.00468","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-analysis-for-nonconvex-sgd-escaping","title":"Sharp Analysis for Nonconvex SGD Escaping from Saddle Points","date":"2019-02-01","arxiv_id":"1902.00247","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimate-sequences-for-stochastic-composite","title":"Estimate Sequences for Stochastic Composite Optimization: Variance Reduction, Acceleration, and Robustness to Noise","date":"2019-01-25","arxiv_id":"1901.08788","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-rate-of-stochastic","title":"New nonasymptotic convergence rates of stochastic proximal pointalgorithm for convex optimization problems","date":"2019-01-22","arxiv_id":"1901.08663","repositories_listed":0,"syntology":null},{"url":null,"slug":"block-randomized-stochastic-proximal-gradient","title":"Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization","date":"2019-01-16","arxiv_id":"1901.05529","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-approximation-algorithms-for","title":"Stochastic Approximation Algorithms for Principal Component Analysis","date":"2019-01-07","arxiv_id":"1901.01798","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-dirichlet-allocation-in-generative","title":"Latent Dirichlet Allocation in Generative Adversarial Networks","date":"2018-12-17","arxiv_id":"1812.06571","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-gradient-descent-for-spectral","title":"Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint","date":"2018-12-13","arxiv_id":"1812.05721","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-stochastic-gradient-langevin-dynamics-with","title":"On stochastic gradient Langevin dynamics with dependent data streams in the logconcave case","date":"2018-12-06","arxiv_id":"1812.02709","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-uncensored-mean-first-passage-time","title":"On Uncensored Mean First-Passage-Time Performance Experiments with Multiwalk in $\\mathbb{R}^p$: a New Stochastic Optimization Algorithm","date":"2018-12-06","arxiv_id":"1812.03075","repositories_listed":0,"syntology":null},{"url":null,"slug":"droppruning-for-model-compression","title":"Stochastic Model Pruning via Weight Dropping Away and Back","date":"2018-12-05","arxiv_id":"1812.02035","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-learning-in-concave-n-person-games-1","title":"Bandit Learning in Concave N-Person Games","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"spider-near-optimal-non-convex-optimization","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path-Integrated Differential Estimator","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"third-order-smoothness-helps-faster","title":"Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"zeroth-order-non-convex-stochastic","title":"Zeroth-order (Non)-Convex Stochastic Optimization via Conditional Gradient and Gradient Updates","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-for-dc-functions-and","title":"Stochastic Optimization for DC Functions and Non-smooth Non-convex Regularizers with Non-asymptotic Convergence","date":"2018-11-28","arxiv_id":"1811.11829","repositories_listed":0,"syntology":null},{"url":"/paper/dissimilarity-coefficient-based-weakly","slug":"dissimilarity-coefficient-based-weakly","title":"Dissimilarity Coefficient based Weakly Supervised Object Detection","date":"2018-11-25","arxiv_id":"1811.10016","repositories_listed":0,"syntology":null},{"url":null,"slug":"inexact-sarah-algorithm-for-stochastic","title":"Inexact SARAH Algorithm for Stochastic Optimization","date":"2018-11-25","arxiv_id":"1811.10105","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sufficient-condition-for-convergences-of","title":"A Sufficient Condition for Convergences of Adam and RMSProp","date":"2018-11-23","arxiv_id":"1811.09358","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-sequential-monte-carlo-for","title":"Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization","date":"2018-11-23","arxiv_id":"1811.09469","repositories_listed":0,"syntology":null},{"url":null,"slug":"physics-aware-deep-generative-models-for","title":"Physics-aware Deep Generative Models for Creating Synthetic Microstructures","date":"2018-11-21","arxiv_id":"1811.09669","repositories_listed":0,"syntology":null},{"url":null,"slug":"r-spider-a-fast-riemannian-stochastic","title":"R-SPIDER: A Fast Riemannian Stochastic Optimization Algorithm with Curvature Independent Rate","date":"2018-11-10","arxiv_id":"1811.04194","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-determinantal-point-processes-via","title":"Fast determinantal point processes via distortion-free intermediate sampling","date":"2018-11-08","arxiv_id":"1811.03717","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-large-ensembles-of-control-variates-for","title":"Using Large Ensembles of Control Variates for Variational Inference","date":"2018-10-30","arxiv_id":"1810.12482","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-models-with-uniform-performance-via","title":"Learning Models with Uniform Performance via Distributionally Robust Optimization","date":"2018-10-20","arxiv_id":"1810.08750","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphical-convergence-of-subgradients-in","title":"Graphical Convergence of Subgradients in Nonconvex Optimization and Learning","date":"2018-10-17","arxiv_id":"1810.07590","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-gradient-free-and-projection-free","title":"Towards Gradient Free and Projection Free Stochastic Optimization","date":"2018-10-08","arxiv_id":"1810.03233","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-the-adam-algorithm-from-a","title":"Convergence and Dynamical Behavior of the ADAM Algorithm for Non-Convex Stochastic Optimization","date":"2018-10-04","arxiv_id":"1810.02263","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-learning-in-concave-n-person-games","title":"Bandit learning in concave $N$-person games","date":"2018-10-03","arxiv_id":"1810.01925","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-stochastic-gradual","title":"Privacy-preserving Stochastic Gradual Learning","date":"2018-09-30","arxiv_id":"1810.00383","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-curvature-noise-in-large-batch","title":"Exploring Curvature Noise in Large-Batch Stochastic Optimization","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-stochastic-algorithms-for-low-rank-and","title":"Fast Stochastic Algorithms for Low-rank and Nonsmooth Matrix Problems","date":"2018-09-27","arxiv_id":"1809.10477","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-decentralized-accelerated","title":"Asynchronous decentralized accelerated stochastic gradient descent","date":"2018-09-24","arxiv_id":"1809.09258","repositories_listed":0,"syntology":null},{"url":null,"slug":"pricing-american-options-by-exercise-rate","title":"Pricing American Options by Exercise Rate Optimization","date":"2018-09-19","arxiv_id":"1809.07300","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-matrix-momentum-stochastic","title":"Optimal Matrix Momentum Stochastic Approximation and Applications to Q-learning","date":"2018-09-17","arxiv_id":"1809.06277","repositories_listed":0,"syntology":null},{"url":null,"slug":"zeroth-order-nonconvex-stochastic","title":"Zeroth-order Nonconvex Stochastic Optimization: Handling Constraints, High-Dimensionality and Saddle-Points","date":"2018-09-17","arxiv_id":"1809.06474","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-stage-algorithm-for-acoustic-physical","title":"A Multi-Stage Algorithm for Acoustic Physical Model Parameters Estimation","date":"2018-09-14","arxiv_id":"1809.05483","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-convergence-of-stochastic-gradient","title":"Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Non-Asymptotic Performance Bounds and Momentum-Based Acceleration","date":"2018-09-12","arxiv_id":"1809.04618","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-parametric-variational-inference-with","title":"Non-Parametric Variational Inference with Graph Convolutional Networks for Gaussian Processes","date":"2018-09-08","arxiv_id":"1809.02838","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-adaptive-methods-universality-and","title":"Online Adaptive Methods, Universality and Acceleration","date":"2018-09-08","arxiv_id":"1809.02864","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-ground-and-aerial-package-delivery","title":"Joint Ground and Aerial Package Delivery Services: A Stochastic Optimization Approach","date":"2018-08-14","arxiv_id":"1808.04617","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-weighted-adagrad-with","title":"A Unified Analysis of AdaGrad with Weighted Aggregation and Momentum Acceleration","date":"2018-08-10","arxiv_id":"1808.03408","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-a-class-of-adam-type","title":"On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimization","date":"2018-08-08","arxiv_id":"1808.02941","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-solution-summaries-to-integer","title":"Predicting Tactical Solutions to Operational Planning Problems under Imperfect Information","date":"2018-07-31","arxiv_id":"1807.11876","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-pdf-probabilistic-surface-optimization","title":"Deep PDF: Probabilistic Surface Optimization and Density Estimation","date":"2018-07-27","arxiv_id":"1807.10728","repositories_listed":0,"syntology":null},{"url":null,"slug":"particle-filtering-methods-for-stochastic","title":"Particle Filtering Methods for Stochastic Optimization with Application to Large-Scale Empirical Risk Minimization","date":"2018-07-23","arxiv_id":"1807.08534","repositories_listed":0,"syntology":null},{"url":null,"slug":"signprox-one-bit-proximal-algorithm-for","title":"signProx: One-Bit Proximal Algorithm for Nonconvex Stochastic Optimization","date":"2018-07-20","arxiv_id":"1807.08023","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-aggregation-via-finding-consensus","title":"Online Label Aggregation: A Variational Bayesian Approach","date":"2018-07-19","arxiv_id":"1807.07291","repositories_listed":0,"syntology":null},{"url":null,"slug":"spider-near-optimal-non-convex-optimization-1","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator","date":"2018-07-04","arxiv_id":"1807.01695","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-and-discrete-time-accelerated","title":"Continuous and Discrete-time Accelerated Stochastic Mirror Descent for Strongly Convex Functions","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-satisficing-measure-and-ranking","title":"Data-driven satisficing measure and ranking","date":"2018-07-01","arxiv_id":"1807.00325","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-pca-with-ell_2-and-ell_1","title":"Stochastic PCA with $\\ell_2$ and $\\ell_1$ Regularization","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-proximal-algorithms-for-auc","title":"Stochastic Proximal Algorithms for AUC Maximization","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-acceleration-of-saga-using-sampled","title":"Direct Acceleration of SAGA using Sampled Negative Momentum","date":"2018-06-28","arxiv_id":"1806.11048","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-local-minima-via-stochastic-nested","title":"Finding Local Minima via Stochastic Nested Variance Reduction","date":"2018-06-22","arxiv_id":"1806.08782","repositories_listed":0,"syntology":null},{"url":null,"slug":"swarming-for-faster-convergence-in-stochastic","title":"Swarming for Faster Convergence in Stochastic Optimization","date":"2018-06-11","arxiv_id":"1806.04207","repositories_listed":0,"syntology":null},{"url":null,"slug":"lightweight-stochastic-optimization-for","title":"Lightweight Stochastic Optimization for Minimizing Finite Sums with Infinite Data","date":"2018-06-08","arxiv_id":"1806.02927","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-randomized-coordinate-descent","title":"Accelerated Randomized Coordinate Descent Algorithms for Stochastic Optimization and Online Learning","date":"2018-06-05","arxiv_id":"1806.01600","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-realistic-degradations-in-non-blind","title":"Modeling Realistic Degradations in Non-blind Deconvolution","date":"2018-06-04","arxiv_id":"1806.01097","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-understanding-acceleration-tradeoff","title":"Towards Understanding Acceleration Tradeoff between Momentum and Asynchrony in Nonconvex Stochastic Optimization","date":"2018-06-04","arxiv_id":"1806.01660","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-joint-face-skull-modelling-for","title":"Probabilistic Joint Face-Skull Modelling for Facial Reconstruction","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-oracle-models-lower-bounds-and-gaps-for","title":"Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization","date":"2018-05-25","arxiv_id":"1805.10222","repositories_listed":0,"syntology":null},{"url":null,"slug":"interior-point-methods-with-adversarial","title":"Learning to Optimize Contextually Constrained Problems for Real-Time Decision-Generation","date":"2018-05-23","arxiv_id":"1805.09293","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-discriminative-quantum-neural","title":"Universal discriminative quantum neural networks","date":"2018-05-22","arxiv_id":"1805.08654","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-6d-object-pose-estimation-with","title":"Robust 6D Object Pose Estimation with Stochastic Congruent Sets","date":"2018-05-16","arxiv_id":"1805.06324","repositories_listed":0,"syntology":null},{"url":null,"slug":"dyna-a-method-of-momentum-for-stochastic","title":"Dyna: A Method of Momentum for Stochastic Optimization","date":"2018-05-13","arxiv_id":"1805.04933","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-utility-maximization-in-discrete-time","title":"Robust Utility Maximization in Discrete-Time Markets with Friction","date":"2018-05-10","arxiv_id":"1610.09230","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-virtualization-framework-for-cellular","title":"Optimal Virtualization Framework for Cellular Networks with Downlink Rate Coverage Probability Constraints","date":"2018-04-26","arxiv_id":"1804.09680","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-conditional-gradient-methods-from","title":"Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization","date":"2018-04-24","arxiv_id":"1804.09554","repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-shot-inversion-for-nonuniform","title":"Simultaneous shot inversion for nonuniform geometries using fast data interpolation","date":"2018-04-23","arxiv_id":"1804.08697","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-training-probabilistic-topic-models","title":"Towards Training Probabilistic Topic Models on Neuromorphic Multi-chip Systems","date":"2018-04-10","arxiv_id":"1804.03578","repositories_listed":0,"syntology":null},{"url":null,"slug":"byzantine-stochastic-gradient-descent","title":"Byzantine Stochastic Gradient Descent","date":"2018-03-23","arxiv_id":"1803.08917","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-error-bounds-for-the-stochastic","title":"Lower error bounds for the stochastic gradient descent optimization algorithm: Sharp convergence rates for slowly and fast decaying learning rates","date":"2018-03-22","arxiv_id":"1803.08600","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-semismooth-newton-method-for","title":"A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization","date":"2018-03-09","arxiv_id":"1803.03466","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-challenge-of-crafting-intelligible","title":"The Challenge of Crafting Intelligible Intelligence","date":"2018-03-09","arxiv_id":"1803.04263","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-reduction-for-stationary-time","title":"Dimensionality Reduction for Stationary Time Series via Stochastic Nonconvex Optimization","date":"2018-03-06","arxiv_id":"1803.02312","repositories_listed":0,"syntology":null},{"url":null,"slug":"admm-based-networked-stochastic-variational","title":"ADMM-based Networked Stochastic Variational Inference","date":"2018-02-27","arxiv_id":"1802.10168","repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-sufficient-decrease-for-stochastic","title":"Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization","date":"2018-02-26","arxiv_id":"1802.09933","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-stochastic-optimization-via-1","title":"Distributed Stochastic Optimization via Adaptive SGD","date":"2018-02-16","arxiv_id":"1802.05811","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-deeper-understanding-of-nonconvex","title":"A Diffusion Approximation Theory of Momentum SGD in Nonconvex Optimization","date":"2018-02-14","arxiv_id":"1802.05155","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-variance-reduced-hamilton-monte","title":"Stochastic Variance-Reduced Hamilton Monte Carlo Methods","date":"2018-02-13","arxiv_id":"1802.04791","repositories_listed":0,"syntology":null},{"url":null,"slug":"superposition-assisted-stochastic","title":"Superposition-Assisted Stochastic Optimization for Hawkes Processes","date":"2018-02-13","arxiv_id":"1802.04725","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-and-sparse-regression-in-glm-by","title":"Robust and Sparse Regression in GLM by Stochastic Optimization","date":"2018-02-09","arxiv_id":"1802.03127","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-does-stochastic-gradient-algorithm-work","title":"When Does Stochastic Gradient Algorithm Work Well?","date":"2018-01-18","arxiv_id":"1801.06159","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-stochastic-variational-inference","title":"Asynchronous Stochastic Variational Inference","date":"2018-01-12","arxiv_id":"1801.04289","repositories_listed":0,"syntology":null},{"url":null,"slug":"momentum-and-stochastic-momentum-for","title":"Momentum and Stochastic Momentum for Stochastic Gradient, Newton, Proximal Point and Subspace Descent Methods","date":"2017-12-27","arxiv_id":"1712.09677","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-inference-for-the-population","title":"Statistical Inference for the Population Landscape via Moment Adjusted Stochastic Gradients","date":"2017-12-20","arxiv_id":"1712.07519","repositories_listed":0,"syntology":null},{"url":null,"slug":"third-order-smoothness-helps-even-faster","title":"Third-order Smoothness Helps: Even Faster Stochastic Optimization Algorithms for Finding Local Minima","date":"2017-12-18","arxiv_id":"1712.06585","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-distributional-robustness-and","title":"Wasserstein Distributionally Robust Optimization and Variation Regularization","date":"2017-12-17","arxiv_id":"1712.06050","repositories_listed":0,"syntology":null},{"url":null,"slug":"proximodistal-exploration-in-motor-learning","title":"Proximodistal Exploration in Motor Learning as an Emergent Property of Optimization","date":"2017-12-14","arxiv_id":"1712.05249","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-particle-gradient-descent-for","title":"Stochastic Particle Gradient Descent for Infinite Ensembles","date":"2017-12-14","arxiv_id":"1712.05438","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-criteria-for","title":"Comparative analysis of criteria for filtering time series of word usage frequencies","date":"2017-12-10","arxiv_id":"1712.03512","repositories_listed":0,"syntology":null},{"url":null,"slug":"neumann-optimizer-a-practical-optimization","title":"Neumann Optimizer: A Practical Optimization Algorithm for Deep Neural Networks","date":"2017-12-08","arxiv_id":"1712.03298","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-svrg-methods-under-error-bound","title":"Adaptive SVRG Methods under Error Bound Conditions with Unknown Growth Parameter","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"admm-without-a-fixed-penalty-parameter-faster","title":"ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-mirror-descent-in-variationally","title":"Stochastic Mirror Descent in Variationally Coherent Optimization Problems","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-with-variance-1","title":"Stochastic Optimization with Variance Reduction for Infinite Datasets with Finite Sum Structure","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-analysis-via-stochastic","title":"Asymptotic Analysis via Stochastic Differential Equations of Gradient Descent Algorithms in Statistical and Computational Paradigms","date":"2017-11-27","arxiv_id":"1711.09514","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-gradient-extrapolation-for-distributed","title":"Random gradient extrapolation for distributed and stochastic optimization","date":"2017-11-15","arxiv_id":"1711.05762","repositories_listed":0,"syntology":null}],"record_sha256":"7ef404f95d1cffcf1b5a6dff934509b88fcb4ce6303eb421f85187e6b5d6506d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}