← Optimization
Mathematics & Optimization › Optimization ›

Stochastic Methods

2788 directly classified papers

Papers per year

Papers

Simple and Efficient Weighted Minwise Hashing NIPS 2016
Nested Mini-Batch K-Means NIPS 2016
Binary embeddings with structured hashed projections ICML 2016
Control Functionals for Quasi-Monte Carlo Integration AISTATS 2016
Asynchronous Parallel Greedy Coordinate Descent NIPS 2016
An optimal algorithm for the Thresholding Bandit Problem ICML 2016
A Superlinearly-Convergent Proximal Newton-type Method for the Optimization of Finite Sums ICML 2016
Shifting Regret, Mirror Descent, and Matrices ICML 2016
Cyclades: Conflict-free Asynchronous Machine Learning NIPS 2016
CMA-ES with Optimal Covariance Update and Storage Complexity NIPS 2016
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods NIPS 2016
Stochastic Variance Reduction Methods for Saddle-Point Problems NIPS 2016
Multi-Player Bandits – a Musical Chairs Approach ICML 2016
Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity ICML 2016
Training Neural Networks Without Gradients: A Scalable ADMM Approach ICML 2016
Social LSTM: Human Trajectory Prediction in Crowded Spaces CVPR 2016
Starting Small - Learning with Adaptive Sample Sizes ICML 2016
Fast and Provably Good Seedings for k-Means NIPS 2016
Local Minimax Complexity of Stochastic Convex Optimization NIPS 2016
Multistage Campaigning in Social Networks NIPS 2016
Stochastic Three-Composite Convex Minimization NIPS 2016
Dual Space Gradient Descent for Online Learning NIPS 2016
Regret of Queueing Bandits NIPS 2016
Efficient Globally Convergent Stochastic Optimization for Canonical Correlation Analysis NIPS 2016
Tracking the Best Expert in Non-stationary Stochastic Environments NIPS 2016