← Optimization
Mathematics & Optimization › Optimization ›

Stochastic Methods

2788 directly classified papers

Papers per year

Papers

Asynchronous Stochastic Optimization Robust to Arbitrary Delays NIPS 2021
High Probability Complexity Bounds for Line Search Based on Stochastic Oracles NIPS 2021
Distributed Zero-Order Optimization under Adversarial Noise NIPS 2021
Stochastic Bias-Reduced Gradient Methods NIPS 2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path NIPS 2021
Linear-Time Probabilistic Solution of Boundary Value Problems NIPS 2021
Stochastic optimization under time drift: iterate averaging, step-decay schedules, and high probability guarantees NIPS 2021
Learning with User-Level Privacy NIPS 2021
Constrained Two-step Look-Ahead Bayesian Optimization NIPS 2021
Sifting through the noise: Universal first-order methods for stochastic variational inequalities NIPS 2021
Convergence of adaptive algorithms for constrained weakly convex optimization NIPS 2021
Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation NIPS 2021
Determinantal point processes based on orthogonal polynomials for sampling minibatches in SGD NIPS 2021
Higher Order Kernel Mean Embeddings to Capture Filtrations of Stochastic Processes NIPS 2021
NEO: Non Equilibrium Sampling on the Orbits of a Deterministic Transform NIPS 2021
De-randomizing MCMC dynamics with the diffusion Stein operator NIPS 2021
Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions NIPS 2021
Distributed Estimation with Multiple Samples per User: Sharp Rates and Phase Transition NIPS 2021
Optimal Underdamped Langevin MCMC Method NIPS 2021
Stochastic bandits with groups of similar arms. NIPS 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
Graphical Models in Heavy-Tailed Markets NIPS 2021
Optimal Order Simple Regret for Gaussian Process Bandits NIPS 2021
Efficient and Local Parallel Random Walks NIPS 2021
Risk Bounds and Calibration for a Smart Predict-then-Optimize Method NIPS 2021