← Optimization
Mathematics & Optimization › Optimization ›

Stochastic Methods

2788 directly classified papers

Papers per year

Papers

On the Bias-Variance-Cost Tradeoff of Stochastic Optimization NIPS 2021
On the Rate of Convergence of Regularized Learning in Games: From Bandits and Uncertainty to Optimism and Beyond NIPS 2021
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization NIPS 2021
Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NIPS 2021
Slice Sampling Reparameterization Gradients NIPS 2021
Locally differentially private estimation of functionals of discrete distributions NIPS 2021
Never Go Full Batch (in Stochastic Convex Optimization) NIPS 2021
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds NIPS 2021
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NIPS 2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NIPS 2021
Continuized Accelerations of Deterministic and Stochastic Gradient Descents, and of Gossip Algorithms NIPS 2021
FedDR – Randomized Douglas-Rachford Splitting Algorithms for Nonconvex Federated Composite Optimization NIPS 2021
The Complexity of Sparse Tensor PCA NIPS 2021
Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections NIPS 2021
Random Shuffling Beats SGD Only After Many Epochs on Ill-Conditioned Problems NIPS 2021
Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs NIPS 2021
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds NIPS 2021
Bandit Phase Retrieval NIPS 2021
On the Second-order Convergence Properties of Random Search Methods NIPS 2021
Mirror Langevin Monte Carlo: the Case Under Isoperimetry NIPS 2021
Fast and accurate randomized algorithms for low-rank tensor decompositions NIPS 2021
Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits NIPS 2021
Faster Non-asymptotic Convergence for Double Q-learning NIPS 2021
Regret Bounds for Gaussian-Process Optimization in Large Domains NIPS 2021
A Faster Decentralized Algorithm for Nonconvex Minimax Problems NIPS 2021