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
Dependent Relational Gamma Process Models for Longitudinal Networks
ICML 2018
Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities
NIPS 2018
Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization
NIPS 2018
Asymptotic optimality of adaptive importance sampling
NIPS 2018
Neural Guided Constraint Logic Programming for Program Synthesis
NIPS 2018
Log-concave sampling: Metropolis-Hastings algorithms are fast!
COLT 2018
The Vertex Sample Complexity of Free Energy is Polynomial
COLT 2018
Towards Understanding Acceleration Tradeoff between Momentum and Asynchrony in Nonconvex Stochastic Optimization
NIPS 2018
Evolutionary Stochastic Gradient Descent for Optimization of Deep Neural Networks
NIPS 2018
Rest-Katyusha: Exploiting the Solution's Structure via Scheduled Restart Schemes
NIPS 2018
ATOMO: Communication-efficient Learning via Atomic Sparsification
NIPS 2018
An Analytical and Experimental Comparison of Maximal Lottery Schemes
IJCAI 2018
Fast Rates of ERM and Stochastic Approximation: Adaptive to Error Bound Conditions
NIPS 2018
Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap
AISTATS 2018
Distributed Multi-Player Bandits - a Game of Thrones Approach
NIPS 2018
A Unified Analysis of Stochastic Optimization Methods Using Jump System Theory and Quadratic Constraints
COLT 2017
Adaptive SVRG Methods under Error Bound Conditions with Unknown Growth Parameter
NIPS 2017
Task-based End-to-end Model Learning in Stochastic Optimization
NIPS 2017
DPSCREEN: Dynamic Personalized Screening
NIPS 2017
Optimal Shrinkage of Singular Values Under Random Data Contamination
NIPS 2017
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
NIPS 2017
Adaptive Sampling Probabilities for Non-Smooth Optimization
ICML 2017
Efficient Use of Limited-Memory Accelerators for Linear Learning on Heterogeneous Systems
NIPS 2017
Boundary Crossing for General Exponential Families
ALT 2017
Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlo
COLT 2017
<
1
…
85
86
87
…
112
>