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
The Unreasonable Effectiveness of Structured Random Orthogonal Embeddings
NeurIPS 2017
Translation Synchronization via Truncated Least Squares
NeurIPS 2017
XOR-Sampling for Network Design with Correlated Stochastic Events
IJCAI 2017
Zonotope Hit-and-run for Efficient Sampling from Projection DPPs
ICML 2017
Accelerating Stochastic Composition Optimization
NeurIPS 2016
A Comprehensive Linear Speedup Analysis for Asynchronous Stochastic Parallel Optimization from Zeroth-Order to First-Order
NeurIPS 2016
A Consensus-Based Framework for Distributed Bundle Adjustment
CVPR 2016
AdaDelay: Delay Adaptive Distributed Stochastic Optimization
AISTATS 2016
Adaptive Skills Adaptive Partitions (ASAP)
NeurIPS 2016
A General Optimization Framework for Multi-Document Summarization Using Genetic Algorithms and Swarm Intelligence
COLING 2016
A Light Touch for Heavily Constrained SGD
COLT 2016
A Linearly-Convergent Stochastic L-BFGS Algorithm
AISTATS 2016
An optimal algorithm for the Thresholding Bandit Problem
ICML 2016
A Novel Risk-Estimation-Theoretic Framework for Speech Enhancement in Nonstationary and Non-Gaussian Noise Conditions
Interspeech 2016
Anytime Exploration for Multi-armed Bandits using Confidence Information
ICML 2016
Anytime optimal algorithms in stochastic multi-armed bandits
ICML 2016
A Statistical Perspective on Randomized Sketching for Ordinary Least-Squares
JMLR 2016
A Superlinearly-Convergent Proximal Newton-type Method for the Optimization of Finite Sums
ICML 2016
Asynchronous Parallel Greedy Coordinate Descent
NeurIPS 2016
(Bandit) Convex Optimization with Biased Noisy Gradient Oracles
AISTATS 2016
Batch Bayesian Optimization via Local Penalization
AISTATS 2016
Bayesian Optimization for Likelihood-Free Inference of Simulator-Based Statistical Models
JMLR 2016
Best-of-K-bandits
COLT 2016
Binary embeddings with structured hashed projections
ICML 2016
Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning
NeurIPS 2016