Research Explorer
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
About
Methodology
← Optimization
Mathematics & Optimization
›
Optimization
›
Stochastic Methods
2788 directly classified papers
Papers per year
2000: 1
2002: 2
2003: 5
2004: 1
2005: 2
2006: 10
2007: 13
2008: 16
2009: 15
2010: 23
2011: 33
2012: 43
2013: 69
2014: 77
2015: 82
2016: 112
2017: 144
2018: 173
2019: 265
2020: 292
2021: 316
2022: 314
2023: 353
2024: 307
2025: 98
2026: 22
Papers
Generalization Bounds with Minimal Dependency on Hypothesis Class via Distributionally Robust Optimization
NIPS 2022
Global Convergence and Stability of Stochastic Gradient Descent
NIPS 2022
Constrained Langevin Algorithms with L-mixing External Random Variables
NIPS 2022
Smooth Fictitious Play in Stochastic Games with Perturbed Payoffs and Unknown Transitions
NIPS 2022
Score-Based Diffusion meets Annealed Importance Sampling
NIPS 2022
Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression
NIPS 2022
Asymptotics of smoothed Wasserstein distances in the small noise regime
NIPS 2022
Multi-fidelity Monte Carlo: a pseudo-marginal approach
NIPS 2022
Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity
NIPS 2022
Reconstruction on Trees and Low-Degree Polynomials
NIPS 2022
Thinking Outside the Ball: Optimal Learning with Gradient Descent for Generalized Linear Stochastic Convex Optimization
NIPS 2022
Efficiency Ordering of Stochastic Gradient Descent
NIPS 2022
Network change point localisation under local differential privacy
NIPS 2022
Robust Generalized Method of Moments: A Finite Sample Viewpoint
NIPS 2022
A Quadrature Rule combining Control Variates and Adaptive Importance Sampling
NIPS 2022
Statistical Learning and Inverse Problems: A Stochastic Gradient Approach
NIPS 2022
Local Bayesian optimization via maximizing probability of descent
NIPS 2022
Langevin Monte Carlo for Contextual Bandits
ICML 2022
Accurate Quantization of Measures via Interacting Particle-based Optimization
ICML 2022
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
ICML 2022
Delay-Adaptive Step-sizes for Asynchronous Learning
ICML 2022
Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time
ICML 2022
Scalable Distributional Robustness in a Class of Non-Convex Optimization with Guarantees
NIPS 2022
Preconditioning for Scalable Gaussian Process Hyperparameter Optimization
ICML 2022
Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms
ICML 2022
<
1
…
34
35
36
…
112
>