← Optimization & Theory
Machine Learning › Optimization & Theory ›

Stochastic Processes

2667 directly classified papers

Papers per year

Papers

Momentum-Based Policy Gradient Methods ICML 2020
Sub-sampling for Efficient Non-Parametric Bandit Exploration NIPS 2020
Demystifying Orthogonal Monte Carlo and Beyond NIPS 2020
Replica-Exchange Nos\'e-Hoover Dynamics for Bayesian Learning on Large Datasets NIPS 2020
Corruption-Tolerant Gaussian Process Bandit Optimization AISTATS 2020
Langevin Monte Carlo without smoothness AISTATS 2020
Dynamic content based ranking AISTATS 2020
Stochastic Optimization for Regularized Wasserstein Estimators ICML 2020
Stochastic Regret Minimization in Extensive-Form Games ICML 2020
The Intrinsic Robustness of Stochastic Bandits to Strategic Manipulation ICML 2020
FormulaZero: Distributionally Robust Online Adaptation via Offline Population Synthesis ICML 2020
Feature Selection using Stochastic Gates ICML 2020
LSGCN: Long Short-Term Traffic Prediction with Graph Convolutional Networks IJCAI 2020
Robust Algorithms for Online $k$-means Clustering ALT 2020
Cooperative Online Learning: Keeping your Neighbors Updated ALT 2020
Toward universal testing of dynamic network models ALT 2020
Mixing Time Estimation in Ergodic Markov Chains from a Single Trajectory with Contraction Methods ALT 2020
Decentralized Langevin Dynamics for Bayesian Learning NIPS 2020
High-Dimensional Sparse Linear Bandits NIPS 2020
Robustness of Community Detection to Random Geometric Perturbations NIPS 2020
Batched Coarse Ranking in Multi-Armed Bandits NIPS 2020
On the Power of Louvain in the Stochastic Block Model NIPS 2020
Gibbs Sampling with People NIPS 2020
Learning Kernel Tests Without Data Splitting NIPS 2020
Stochastic Normalizing Flows NIPS 2020