← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Majorizing Measures, Sequential Complexities, and Online Learning COLT 2021
Black-Box Control for Linear Dynamical Systems COLT 2021
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games COLT 2021
Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium COLT 2021
Double Explore-then-Commit: Asymptotic Optimality and Beyond COLT 2021
The Sparse Vector Technique, Revisited COLT 2021
Traffic Shaping in E-Commercial Search Engine: Multi-Objective Online Welfare Maximization AAAI 2021
Online Search with Maximum Clearance AAAI 2021
Online Learning in Variable Feature Spaces under Incomplete Supervision AAAI 2021
Lenient Regret for Multi-Armed Bandits AAAI 2021
Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation AAAI 2021
ESCAPED: Efficient Secure and Private Dot Product Framework for Kernel-based Machine Learning Algorithms with Applications in Healthcare AAAI 2021
Projection-free Online Learning in Dynamic Environments AAAI 2021
Projection-free Online Learning over Strongly Convex Sets AAAI 2021
Adversarial Linear Contextual Bandits with Graph-Structured Side Observations AAAI 2021
Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback AAAI 2021
A Primal-Dual Online Algorithm for Online Matching Problem in Dynamic Environments AAAI 2021
Contract Scheduling With Predictions AAAI 2021
Relational Boosted Bandits AAAI 2021
Policy-Guided Heuristic Search with Guarantees AAAI 2021
Learning Augmented Methods for Matching: Improving Invasive Species Management and Urban Mobility AAAI 2021
AI for Social Good: Between My Research and the Real World AAAI 2021
Disposable Linear Bandits for Online Recommendations AAAI 2021
Online Optimal Control with Affine Constraints AAAI 2021
Quantum Exploration Algorithms for Multi-Armed Bandits AAAI 2021