Online Learning

Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback ICML 2022 Online PAC-Bayes Learning NeurIPS 2022 Online Speaker Diarization with Core Samples Selection Interspeech 2022 Online Training Through Time for Spiking Neural Networks NeurIPS 2022 Online Updating of Conditional Linear Gaussian Bayesian Networks PGM 2022 Open Problem: Do you pay for Privacy in Online learning? COLT 2022 Open Problem: Finite-Time Instance Dependent Optimality for Stochastic Online Learning with Feedback Graphs COLT 2022 Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits ICML 2022 Optimal Dynamic Regret in LQR Control NeurIPS 2022 (Optimal) Online Bipartite Matching with Degree Information NeurIPS 2022 Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games NeurIPS 2022 Oracle-Efficient Online Learning for Smoothed Adversaries NeurIPS 2022 Parameter-free Mirror Descent COLT 2022 Personalized Online Federated Learning with Multiple Kernels NeurIPS 2022 Private Streaming SCO in ℓ_p geometry with Applications in High Dimensional Online Decision Making ICML 2022 Projection-free Distributed Online Learning with Sublinear Communication Complexity JMLR 2022 Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States COLT 2022 Random Effect Bandits AISTATS 2022 Rate-Optimal Online Convex Optimization in Adaptive Linear Control NeurIPS 2022 Real-Time Driver-Request Assignment in Ridesourcing AAAI 2022 Regret Minimization with Performative Feedback ICML 2022 Rejection sampling from shape-constrained distributions in sublinear time AISTATS 2022 Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits COLT 2022 Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness ICML 2022 Risk-Averse No-Regret Learning in Online Convex Games ICML 2022