Stochastic Methods

Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions NeurIPS 2021 Majority Vote in Social Networks: Make Random Friends or Be Stubborn to Overpower Elites IJCAI 2021 Matrix games with bandit feedback UAI 2021 Measuring the relative importance of full text sections for information retrieval from scientific literature. NAACL 2021 Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization NeurIPS 2021 Mirror Langevin Monte Carlo: the Case Under Isoperimetry NeurIPS 2021 Misspecified Gaussian Process Bandit Optimization NeurIPS 2021 Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals JMLR 2021 Modeling Precomputation In Games Played Under Computational Constraints IJCAI 2021 Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NeurIPS 2021 Multi-Armed Bandits with Cost Subsidy AISTATS 2021 Multiplayer Bandit Learning, from Competition to Cooperation COLT 2021 Multiplicative Noise and Heavy Tails in Stochastic Optimization ICML 2021 Nearest neighbor search under uncertainty UAI 2021 Near-Optimal Confidence Sequences for Bounded Random Variables ICML 2021 Near-Optimal Entrywise Anomaly Detection for Low-Rank Matrices with Sub-Exponential Noise ICML 2021 NEO: Non Equilibrium Sampling on the Orbits of a Deterministic Transform NeurIPS 2021 Never Go Full Batch (in Stochastic Convex Optimization) NeurIPS 2021 Non-Euclidean Differentially Private Stochastic Convex Optimization COLT 2021 Non-Parametric Stochastic Sequential Assignment With Random Arrival Times IJCAI 2021 No-regret approximate inference via Bayesian optimisation UAI 2021 On a Utilitarian Approach to Privacy Preserving Text Generation NAACL 2021 One More Step Towards Reality: Cooperative Bandits with Imperfect Communication NeurIPS 2021 One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them JMLR 2021 On Estimation in Latent Variable Models ICML 2021