{"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/10","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":10,"pages_in_order":14,"rows_per_page":100,"rows":[901,1000],"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/9","next":"/task/stochastic-optimization/papers/11","papers":[{"url":null,"slug":"adaptive-online-estimation-of-piecewise","title":"Adaptive Online Estimation of Piecewise Polynomial Trends","date":"2020-09-30","arxiv_id":"2010.00073","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentation-as-stochastic-optimization","title":"Data augmentation as stochastic optimization","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"escaping-saddle-points-faster-under","title":"Escaping Saddle-Points Faster under Interpolation-like Conditions","date":"2020-09-28","arxiv_id":"2009.13016","repositories_listed":0,"syntology":null},{"url":null,"slug":"f-divergence-variational-inference","title":"f-Divergence Variational Inference","date":"2020-09-28","arxiv_id":"2009.13093","repositories_listed":0,"syntology":null},{"url":null,"slug":"scheduling-and-power-control-for-wireless","title":"Scheduling and Power Control for Wireless Multicast Systems via Deep Reinforcement Learning","date":"2020-09-27","arxiv_id":"2011.14799","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-learning-based-robust-beamforming","title":"Stochastic Learning-Based Robust Beamforming Design for RIS-Aided Millimeter-Wave Systems in the Presence of Random Blockages","date":"2020-09-21","arxiv_id":"2009.09716","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-acceptable-parameter-regions-of","title":"Finding Acceptable Parameter Regions of Stochastic Hill functions for Multisite Phosphorylation Mechanism","date":"2020-09-14","arxiv_id":"2009.06313","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduced-off-policy-memory-efficient","title":"Variance-Reduced Off-Policy Memory-Efficient Policy Search","date":"2020-09-14","arxiv_id":"2009.06548","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-online-optimization-via-gradient","title":"GTAdam: Gradient Tracking with Adaptive Momentum for Distributed Online Optimization","date":"2020-09-03","arxiv_id":"2009.01745","repositories_listed":0,"syntology":null},{"url":null,"slug":"cost-aware-feature-selection-for-iot-device","title":"Cost-aware Feature Selection for IoT Device Classification","date":"2020-09-02","arxiv_id":"2009.01368","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-accurate-stochastic-optimization-for","title":"Robust, Accurate Stochastic Optimization for Variational Inference","date":"2020-09-01","arxiv_id":"2009.00666","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-variance-reduction-understanding-the","title":"Beyond variance reduction: Understanding the true impact of baselines on policy optimization","date":"2020-08-31","arxiv_id":"2008.13773","repositories_listed":0,"syntology":null},{"url":null,"slug":"root-sgd-sharp-nonasymptotics-and-asymptotic","title":"ROOT-SGD: Sharp Nonasymptotics and Near-Optimal Asymptotics in a Single Algorithm","date":"2020-08-28","arxiv_id":"2008.12690","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-and-detecting-convergence-for","title":"Understanding and Detecting Convergence for Stochastic Gradient Descent with Momentum","date":"2020-08-27","arxiv_id":"2008.12224","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduced-proximal-and-splitting","title":"Variance-Reduced Splitting Schemes for Monotone Stochastic Generalized Equations","date":"2020-08-26","arxiv_id":"2008.11348","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-stochastic-compositional-optimization","title":"Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimization","date":"2020-08-25","arxiv_id":"2008.10847","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-hybrid-combining-design-for","title":"Stochastic Hybrid Combining Design for Quantized Massive MIMO Systems","date":"2020-08-24","arxiv_id":"2008.10520","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-stochastic-subgradient","title":"Distributed Stochastic Optimization With Unbounded Subgradients Over Randomly Time-Varying Networks","date":"2020-08-20","arxiv_id":"2008.08796","repositories_listed":0,"syntology":null},{"url":null,"slug":"conservative-stochastic-optimization-with","title":"Conservative Stochastic Optimization with Expectation Constraints","date":"2020-08-13","arxiv_id":"2008.05758","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-regularization-for-accelerating","title":"Variance Regularization for Accelerating Stochastic Optimization","date":"2020-08-13","arxiv_id":"2008.05969","repositories_listed":0,"syntology":null},{"url":null,"slug":"d-mec-discontinuous-mobile-edge-computing","title":"Discontinuous Computation Offloading for Energy-Efficient Mobile Edge Computing","date":"2020-08-08","arxiv_id":"2008.03508","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-resource-optimization-for","title":"Dynamic Resource Optimization for Decentralized Estimation in Energy Harvesting IoT Networks","date":"2020-08-04","arxiv_id":"2008.01498","repositories_listed":0,"syntology":null},{"url":null,"slug":"resource-allocation-via-model-free-deep","title":"Resource Allocation via Model-Free Deep Learning in Free Space Optical Communications","date":"2020-07-27","arxiv_id":"2007.13709","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-stochastic-microscopic-traffic","title":"Modeling Stochastic Microscopic Traffic Behaviors: a Physics Regularized Gaussian Process Approach","date":"2020-07-17","arxiv_id":"2007.10109","repositories_listed":0,"syntology":null},{"url":null,"slug":"highway-traffic-state-estimation-using","title":"Macroscopic Traffic Flow Modeling with Physics Regularized Gaussian Process: Generalized Formulations","date":"2020-07-14","arxiv_id":"2007.07762","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fully-data-driven-approach-to-minimizing","title":"A fully data-driven approach to minimizing CVaR for portfolio of assets via SGLD with discontinuous updating","date":"2020-07-02","arxiv_id":"2007.01672","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-rates-and-variance-via-adaptive","title":"Balancing Rates and Variance via Adaptive Batch-Size for Stochastic Optimization Problems","date":"2020-07-02","arxiv_id":"2007.01219","repositories_listed":0,"syntology":null},{"url":null,"slug":"variable-selection-via-thompson-sampling","title":"Variable Selection via Thompson Sampling","date":"2020-07-01","arxiv_id":"2007.00187","repositories_listed":0,"syntology":null},{"url":null,"slug":"sampling-from-a-k-dpp-without-looking-at-all","title":"Sampling from a $k$-DPP without looking at all items","date":"2020-06-30","arxiv_id":"2006.16947","repositories_listed":0,"syntology":null},{"url":null,"slug":"nearest-neighbour-based-estimates-of","title":"Nearest Neighbour Based Estimates of Gradients: Sharp Nonasymptotic Bounds and Applications","date":"2020-06-26","arxiv_id":"2006.15043","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-consistent-conditional-expectation-under","title":"Time-consistent conditional expectation under probability distortion","date":"2020-06-25","arxiv_id":"1809.08262","repositories_listed":0,"syntology":null},{"url":null,"slug":"advances-in-asynchronous-parallel-and","title":"Advances in Asynchronous Parallel and Distributed Optimization","date":"2020-06-24","arxiv_id":"2006.13838","repositories_listed":0,"syntology":null},{"url":null,"slug":"second-order-information-in-non-convex","title":"Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations","date":"2020-06-24","arxiv_id":"2006.13476","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-mean-field-theory-for-learning-the","title":"A Mean-Field Theory for Learning the Schönberg Measure of Radial Basis Functions","date":"2020-06-23","arxiv_id":"2006.13330","repositories_listed":0,"syntology":null},{"url":null,"slug":"precise-expressions-for-random-projections","title":"Precise expressions for random projections: Low-rank approximation and randomized Newton","date":"2020-06-18","arxiv_id":"2006.10653","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-first-and-zeroth-order-variance","title":"Gradient Free Minimax Optimization: Variance Reduction and Faster Convergence","date":"2020-06-16","arxiv_id":"2006.09361","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-optimization-tools-for-large-scale","title":"Computing Large-Scale Matrix and Tensor Decomposition with Structured Factors: A Unified Nonconvex Optimization Perspective","date":"2020-06-15","arxiv_id":"2006.08183","repositories_listed":0,"syntology":null},{"url":null,"slug":"better-parameter-free-stochastic-optimization","title":"Better Parameter-free Stochastic Optimization with ODE Updates for Coin-Betting","date":"2020-06-12","arxiv_id":"2006.07507","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangled-representation-learning-and","title":"Disentangled Representation Learning and Generation with Manifold Optimization","date":"2020-06-12","arxiv_id":"2006.07046","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-control-variates-for-monte-carlo","title":"Scalable Control Variates for Monte Carlo Methods via Stochastic Optimization","date":"2020-06-12","arxiv_id":"2006.07487","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-gradient-langevin-with-delayed","title":"Stochastic Gradient Langevin with Delayed Gradients","date":"2020-06-12","arxiv_id":"2006.07362","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-adaptive-algorithms-for-weakly","title":"Convergence of adaptive algorithms for weakly convex constrained optimization","date":"2020-06-11","arxiv_id":"2006.06650","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiplicative-noise-and-heavy-tails-in","title":"Multiplicative noise and heavy tails in stochastic optimization","date":"2020-06-11","arxiv_id":"2006.06293","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-recovery-by-reduced-variance","title":"Sparse recovery by reduced variance stochastic approximation","date":"2020-06-11","arxiv_id":"2006.06365","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-saddle-point-optimization-for","title":"Stochastic Saddle-Point Optimization for Wasserstein Barycenters","date":"2020-06-11","arxiv_id":"2006.06763","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-subgradient-method-for","title":"A Stochastic Subgradient Method for Distributionally Robust Non-Convex Learning","date":"2020-06-08","arxiv_id":"2006.04873","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-with-non-stationary","title":"Beyond Worst-Case Analysis in Stochastic Approximation: Moment Estimation Improves Instance Complexity","date":"2020-06-08","arxiv_id":"2006.04429","repositories_listed":0,"syntology":null},{"url":null,"slug":"ufo-blo-unbiased-first-order-bilevel","title":"UFO-BLO: Unbiased First-Order Bilevel Optimization","date":"2020-06-05","arxiv_id":"2006.03631","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-stochastic-convex-optimization","title":"Online Stochastic Convex Optimization: Wasserstein Distance Variation","date":"2020-06-02","arxiv_id":"2006.01397","repositories_listed":0,"syntology":null},{"url":null,"slug":"recht-re-noncommutative-arithmetic-geometric","title":"Recht-Ré Noncommutative Arithmetic-Geometric Mean Conjecture is False","date":"2020-06-02","arxiv_id":"2006.01510","repositories_listed":0,"syntology":null},{"url":null,"slug":"factorial-powers-for-stochastic-optimization","title":"The Power of Factorial Powers: New Parameter settings for (Stochastic) Optimization","date":"2020-06-01","arxiv_id":"2006.01244","repositories_listed":0,"syntology":null},{"url":null,"slug":"momentum-based-variance-reduced-proximal","title":"Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization","date":"2020-05-31","arxiv_id":"2006.00425","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-analysis-of-riemannian-stochastic","title":"Convergence Analysis of Riemannian Stochastic Approximation Schemes","date":"2020-05-27","arxiv_id":"2005.13284","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-first-and-zeroth-order-methods-for","title":"Adaptive First-and Zeroth-order Methods for Weakly Convex Stochastic Optimization Problems","date":"2020-05-19","arxiv_id":"2005.09261","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-distributed-processing-of-data","title":"Scaling-up Distributed Processing of Data Streams for Machine Learning","date":"2020-05-18","arxiv_id":"2005.08854","repositories_listed":0,"syntology":null},{"url":null,"slug":"tiering-as-a-stochastic-submodular","title":"Tiering as a Stochastic Submodular Optimization Problem","date":"2020-05-16","arxiv_id":"2005.07893","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-estimate-driver-drowsiness-from","title":"Learning to Estimate Driver Drowsiness from Car Acceleration Sensors using Weakly Labeled Data","date":"2020-05-12","arxiv_id":"2005.05898","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-and-stochastic-optimization-beyond","title":"Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"breaking-global-barriers-in-parallel","title":"Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging","date":"2020-04-30","arxiv_id":"2005.00124","repositories_listed":0,"syntology":null},{"url":null,"slug":"ds-facto-doubly-separable-factorization","title":"DS-FACTO: Doubly Separable Factorization Machines","date":"2020-04-29","arxiv_id":"2004.13940","repositories_listed":0,"syntology":null},{"url":null,"slug":"doubly-stochastic-mining-for-heterogeneous","title":"Doubly-stochastic mining for heterogeneous retrieval","date":"2020-04-23","arxiv_id":"2004.10915","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-gradient-algorithms-from-ode","title":"Stochastic gradient algorithms from ODE splitting perspective","date":"2020-04-19","arxiv_id":"2004.08981","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-batch-size-for-adaptive","title":"Stochastic batch size for adaptive regularization in deep network optimization","date":"2020-04-14","arxiv_id":"2004.06341","repositories_listed":0,"syntology":null},{"url":null,"slug":"client-selection-and-bandwidth-allocation-in","title":"Client Selection and Bandwidth Allocation in Wireless Federated Learning Networks: A Long-Term Perspective","date":"2020-04-09","arxiv_id":"2004.04314","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-and-discrete-time-analysis-of","title":"Convergence rates and approximation results for SGD and its continuous-time counterpart","date":"2020-04-08","arxiv_id":"2004.04193","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-aggregating-stochastic-gradient","title":"Weighted Aggregating Stochastic Gradient Descent for Parallel Deep Learning","date":"2020-04-07","arxiv_id":"2004.03749","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-convex-stochastic-optimization-via-non","title":"Non-Convex Optimization via Non-Reversible Stochastic Gradient Langevin Dynamics","date":"2020-04-06","arxiv_id":"2004.02823","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-flows-and-geometric-optimization","title":"Stochastic Flows and Geometric Optimization on the Orthogonal Group","date":"2020-03-30","arxiv_id":"2003.13563","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-proximal-gradient-algorithm-with","title":"Stochastic Proximal Gradient Algorithm with Minibatches. Application to Large Scale Learning Models","date":"2020-03-30","arxiv_id":"2003.13332","repositories_listed":0,"syntology":null},{"url":"/paper/pipelined-backpropagation-at-scale-training","slug":"pipelined-backpropagation-at-scale-training","title":"Pipelined Backpropagation at Scale: Training Large Models without Batches","date":"2020-03-25","arxiv_id":"2003.11666","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-theory-of-decentralized-sgd-with","title":"A Unified Theory of Decentralized SGD with Changing Topology and Local Updates","date":"2020-03-23","arxiv_id":"2003.10422","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-many-objective-optimization","title":"Large Scale Many-Objective Optimization Driven by Distributional Adversarial Networks","date":"2020-03-16","arxiv_id":"2003.07013","repositories_listed":0,"syntology":null},{"url":null,"slug":"many-objective-estimation-of-distribution","title":"Many-Objective Estimation of Distribution Optimization Algorithm Based on WGAN-GP","date":"2020-03-16","arxiv_id":"2003.08295","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-hyper-parameter-tuning-for-stochastic","title":"On Hyper-parameter Tuning for Stochastic Optimization Algorithms","date":"2020-03-04","arxiv_id":"2003.02038","repositories_listed":0,"syntology":null},{"url":null,"slug":"conjugate-gradient-based-adam-for-stochastic","title":"Conjugate-gradient-based Adam for stochastic optimization and its application to deep learning","date":"2020-02-29","arxiv_id":"2003.00231","repositories_listed":0,"syntology":null},{"url":null,"slug":"affinity-guided-geometric-semi-supervised","title":"Affinity guided Geometric Semi-Supervised Metric Learning","date":"2020-02-27","arxiv_id":"2002.12394","repositories_listed":0,"syntology":null},{"url":null,"slug":"irs-aided-large-scale-mimo-systems-with","title":"IRS-aided Large-Scale MIMO Systems with Passive Constant Envelope Precoding","date":"2020-02-26","arxiv_id":"2002.10965","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-asymptotic-bounds-for-zeroth-order","title":"Non-asymptotic bounds for stochastic optimization with biased noisy gradient oracles","date":"2020-02-26","arxiv_id":"2002.11440","repositories_listed":0,"syntology":null},{"url":null,"slug":"biased-stochastic-gradient-descent-for","title":"Biased Stochastic First-Order Methods for Conditional Stochastic Optimization and Applications in Meta Learning","date":"2020-02-25","arxiv_id":"2002.10790","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-radar-inference-from-inverse","title":"Adversarial Radar Inference. From Inverse Tracking to Inverse Reinforcement Learning of Cognitive Radar","date":"2020-02-22","arxiv_id":"2002.10910","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-for-regularized","title":"Stochastic Optimization for Regularized Wasserstein Estimators","date":"2020-02-20","arxiv_id":"2002.08695","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-multi-output-regression-via","title":"Weakly-supervised Multi-output Regression via Correlated Gaussian Processes","date":"2020-02-19","arxiv_id":"2002.08412","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-diffusion-theory-for-deep-learning-dynamics","title":"A Diffusion Theory For Deep Learning Dynamics: Stochastic Gradient Descent Exponentially Favors Flat Minima","date":"2020-02-10","arxiv_id":"2002.03495","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-online-optimization-using-kalman","title":"Stochastic Online Optimization using Kalman Recursion","date":"2020-02-10","arxiv_id":"2002.03636","repositories_listed":0,"syntology":null},{"url":null,"slug":"developing-a-hybrid-data-driven-mechanistic","title":"Developing a Hybrid Data-Driven, Mechanistic Virtual Flow Meter -- a Case Study","date":"2020-02-07","arxiv_id":"2002.02737","repositories_listed":0,"syntology":null},{"url":null,"slug":"macroscopic-traffic-flow-modeling-with","title":"Macroscopic Traffic Flow Modeling with Physics Regularized Gaussian Process: A New Insight into Machine Learning Applications","date":"2020-02-06","arxiv_id":"2002.02374","repositories_listed":0,"syntology":null},{"url":null,"slug":"zeroth-order-algorithms-for-nonconvex-minimax","title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities","date":"2020-01-22","arxiv_id":"2001.07819","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-stochastic-natural-gradient-descent","title":"Dual Stochastic Natural Gradient Descent and convergence of interior half-space gradient approximations","date":"2020-01-19","arxiv_id":"2001.06744","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-stochastic-optimization","title":"Adaptive Stochastic Optimization","date":"2020-01-18","arxiv_id":"2001.06699","repositories_listed":0,"syntology":null},{"url":null,"slug":"adamt-a-stochastic-optimization-with-trend-1","title":"On the Trend-corrected Variant of Adaptive Stochastic Optimization Methods","date":"2020-01-17","arxiv_id":"2001.06130","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-debiased-variational-bayes-by","title":"Efficient Debiased Evidence Estimation by Multilevel Monte Carlo Sampling","date":"2020-01-14","arxiv_id":"2001.04676","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-the-sample-and-communication-1","title":"Improving the Sample and Communication Complexity for Decentralized Non-Convex Optimization: Joint Gradient Estimation and Tracking","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recht-re-noncommutative-arithmetic-geometric-1","title":"Recht-Re Noncommutative Arithmetic-Geometric Mean Conjecture is False","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recht-re-noncommutative-arithmetic-geometric-2","title":"Recht-Re Noncommutative Arithmetic-Geometric Mean Conjecture is False","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"self-modulating-nonparametric-event-tensor","title":"Self-Modulating Nonparametric Event-Tensor Factorization","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dynamic-sampling-adaptive-sgd-method-for","title":"A Dynamic Sampling Adaptive-SGD Method for Machine Learning","date":"2019-12-31","arxiv_id":"1912.13357","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-gradient-free-descents","title":"Stochastic gradient-free descents","date":"2019-12-31","arxiv_id":"1912.13305","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-recursive-variance-reduction-for","title":"Stochastic Recursive Variance Reduction for Efficient Smooth Non-Convex Compositional Optimization","date":"2019-12-31","arxiv_id":"1912.13515","repositories_listed":0,"syntology":null},{"url":null,"slug":"zeroth-order-stochastic-compositional","title":"Zeroth-order Stochastic Compositional Algorithms for Risk-Aware Learning","date":"2019-12-19","arxiv_id":"1912.09484","repositories_listed":0,"syntology":null},{"url":null,"slug":"complexity-of-stochastic-dual-dynamic","title":"Complexity of Stochastic Dual Dynamic Programming","date":"2019-12-16","arxiv_id":"1912.07702","repositories_listed":0,"syntology":null}],"record_sha256":"0898f0432705fbf9fe203ac1068264ba640f7636f71a677de9314897dd48aaa0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}