conftrace_

online optimization

108 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) stochastic optimization (1060) convex optimization (1321) multi-armed bandit (1098) submodular optimization (261) gradient descent (1144) bandit feedback (118) competitive ratio (74) resource allocation (251)

Papers

Global Convergence of Online Optimization for Nonlinear Model Predictive Control NIPS 2021
Online Facility Location with Multiple Advice NIPS 2021
Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation AAAI 2021
Safe Reinforcement Learning Using Robust Action Governor L4DC 2021
Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence ICML 2021
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits NIPS 2020
The Nonstochastic Control Problem ALT 2020
Online Optimization with Memory and Competitive Control NIPS 2020
Cooperative Multi-player Bandit Optimization NIPS 2020
Incremental Fairness in Two-Sided Market Platforms: On Smoothly Updating Recommendations AAAI 2020
Semi-bandit Optimization in the Dispersed Setting UAI 2020
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints AISTATS 2020
Dimension-Free Bounds for Chasing Convex Functions COLT 2020
A Simple Approach for Non-stationary Linear Bandits AISTATS 2020
Modelling and Solving Online Optimisation Problems AAAI 2020
Delay and Cooperation in Nonstochastic Linear Bandits NIPS 2020
A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints NIPS 2020
Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent ICML 2020
Consistent Online Optimization: Convex and Submodular AISTATS 2019
Optimizing in the Dark: Learning an Optimal Solution through a Simple Request Interface AAAI 2019
Lifelong Optimization with Low Regret AISTATS 2019
Low-Rank Bandit Methods for High-Dimensional Dynamic Pricing NIPS 2019
Reducing the variance in online optimization by transporting past gradients NIPS 2019
No-regret algorithms for online $k$-submodular maximization AISTATS 2019
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018