← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online Elicitation of Necessarily Optimal Matchings AAAI 2022
Online Allocation and Learning in the Presence of Strategic Agents NIPS 2022
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits COLT 2022
NaturalInversion: Data-Free Image Synthesis Improving Real-World Consistency AAAI 2022
Jointly Efficient and Optimal Algorithms for Logistic Bandits AISTATS 2022
Online Frank-Wolfe with Arbitrary Delays NIPS 2022
Better Best of Both Worlds Bounds for Bandits with Switching Costs NIPS 2022
Online Search with Best-Price and Query-Based Predictions AAAI 2022
Learning to Identify Top Elo Ratings: A Dueling Bandits Approach AAAI 2022
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits AISTATS 2022
Equilibrium Finding in Normal-Form Games via Greedy Regret Minimization AAAI 2022
The Metric Distortion of Multiwinner Voting AAAI 2022
Sequential Blocked Matching AAAI 2022
An Experimental Design Approach for Regret Minimization in Logistic Bandits AAAI 2022
Norm-Agnostic Linear Bandits AISTATS 2022
Universal and Tight Online Algorithms for Generalized-Mean Welfare AAAI 2022
Decision-Dependent Risk Minimization in Geometrically Decaying Dynamic Environments AAAI 2022
Bandit Data-Driven Optimization for Crowdsourcing Food Rescue Platforms AAAI 2022
Stochastic Rising Bandits ICML 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022
Active Learning Polynomial Threshold Functions NIPS 2022
No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation NIPS 2022
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NIPS 2022
Efficient Encoding of Cost Optimal Delete-Free Planning as SAT AAAI 2022
Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems NIPS 2022