Stochastic Methods
2,991 papers
Papers per year
1
2
5
1
2
10
14
16
15
23
33
43
70
80
84
113
144
173
261
299
319
318
359
375
198
33
2000
'5
'10
'15
'20
'25
Papers
Zeroth Order Non-convex optimization with Dueling-Choice Bandits
UAI 2020
X-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks
ACML 2019
A Bootstrap Method for Error Estimation in Randomized Matrix Multiplication
JMLR 2019
Accelerated Incremental Gradient Descent using Momentum Acceleration with Scaling Factor
IJCAI 2019
Accelerated Linear Convergence of Stochastic Momentum Methods in Wasserstein Distances
ICML 2019
A Communication Efficient Stochastic Multi-Block Alternating Direction Method of Multipliers
NeurIPS 2019
A Composite Randomized Incremental Gradient Method
ICML 2019
Acoustic Model Optimization Based on Evolutionary Stochastic Gradient Descent with Anchors for Automatic Speech Recognition
Interspeech 2019
Active Mini-Batch Sampling Using Repulsive Point Processes
AAAI 2019
Adaptive Hard Thresholding for Near-optimal Consistent Robust Regression
COLT 2019
Adaptive MCMC via Combining Local Samplers
AISTATS 2019
Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits
ICML 2019
Adaptive Scale-Invariant Online Algorithms for Learning Linear Models
ICML 2019
A Fast Sampling Algorithm for Maximum Inner Product Search
AISTATS 2019
A Generic Acceleration Framework for Stochastic Composite Optimization
NeurIPS 2019
A Kernel Multiple Change-point Algorithm via Model Selection
JMLR 2019
Almost surely constrained convex optimization
ICML 2019
A minimax near-optimal algorithm for adaptive rejection sampling
ALT 2019
An Accelerated Decentralized Stochastic Proximal Algorithm for Finite Sums
NeurIPS 2019
Analysis of Langevin Monte Carlo via Convex Optimization
JMLR 2019
Analysis of Thompson Sampling for Combinatorial Multi-armed Bandit with Probabilistically Triggered Arms
AISTATS 2019
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover
IJCAI 2019
An Efficient Schmidt-EKF for 3D Visual-Inertial SLAM
CVPR 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free
COLT 2019
An Improved Generic Bet-and-Run Strategy with Performance Prediction for Stochastic Local Search
AAAI 2019