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
Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity
JMLR 2025
MobiZO: Enabling Efficient LLM Fine-Tuning at the Edge via Inference Engines
EMNLP 2025
MSQ: Memory-Efficient Bit Sparsification Quantization
ICCV 2025
Multi-Marginal Stochastic Flow Matching for High-Dimensional Snapshot Data at Irregular Time Points
ICML 2025
Multi-Pass Memory Lower Bounds for Learning Problems
COLT 2025
Multi-player Multi-armed Bandits with Delayed Feedback
IJCAI 2025
Nearly Optimal Sample Complexity for Learning with Label Proportions
ICML 2025
Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap
AAAI 2025
Near-Optimal Rates for O(1)-Smooth DP-SCO with a Single Epoch and Large Batches
ALT 2025
New Lower Bounds for Non-Convex Stochastic Optimization through Divergence Decomposition
COLT 2025
Noisy SIGNSGD Is More Differentially Private Than You (Might) Think
ICML 2025
Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson–Romberg Extrapolation
ICLR 2025
Non-Asymptotic and Non-Lipschitzian Bounds on Optimal Values in Stochastic Optimization Under Heavy Tails
ICML 2025
Non-asymptotic Error Bounds in W_2-Distance with Sqrt(d) Dimension Dependence and First Order Convergence for Langevin Monte Carlo beyond Log-Concavity
ICML 2025
Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
ICLR 2025
Online Covariance Estimation in Nonsmooth Stochastic Approximation
COLT 2025
Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
AAAI 2025
Online Resource Sharing: Better Robust Guarantees via Randomized Strategies
IJCAI 2025
On the Almost Sure Convergence of the Stochastic Three Points Algorithm
ICLR 2025
On the Asymptotic Optimality of Confidence Interval Based Algorithms for Fixed Confidence MABs
AAAI 2025
On the Benefits of Active Data Collection in Operator Learning
ICML 2025
On the Utility of Equal Batch Sizes for Inference in Stochastic Gradient Descent
JMLR 2025
Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneity
JMLR 2025
Optimal Sensor Scheduling and Selection for Continuous-Discrete Kalman Filtering with Auxiliary Dynamics
ICML 2025
Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling
ICLR 2025