conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

806 papers

Papers per year

6
24
87
21
'10
'15
'20
'25

Papers

How Does Variance Shape the Regret in Contextual Bandits? NIPS 2024
PRODuctive bandits: Importance Weighting No More NIPS 2024
On the Necessity of Collaboration for Online Model Selection with Decentralized Data NIPS 2024
Contextual Decision-Making with Knapsacks Beyond the Worst Case NIPS 2024
On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games NIPS 2024
Learning to Price Homogeneous Data NIPS 2024
Improved Guarantees for Fully Dynamic $k$-Center Clustering with Outliers in General Metric Spaces NIPS 2024
Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox NIPS 2024
When Is Inductive Inference Possible? NIPS 2024
Improved Regret of Linear Ensemble Sampling NIPS 2024
Accelerating Matroid Optimization through Fast Imprecise Oracles NIPS 2024
Bandits with Abstention under Expert Advice NIPS 2024
Improved Algorithms for Contextual Dynamic Pricing NIPS 2024
Improved learning rates in multi-unit uniform price auctions NIPS 2024
Online Conversion Rate Prediction via Multi-Interval Screening and Synthesizing under Delayed Feedback AAAI 2024
Low-Distortion Clustering with Ordinal and Limited Cardinal Information AAAI 2024
Efficient Learning in Polyhedral Games via Best-Response Oracles AAAI 2024
Dynamic Budget Throttling in Repeated Second-Price Auctions AAAI 2024
Regret Analysis of Repeated Delegated Choice AAAI 2024
Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees AAAI 2024
Efficient Online Crowdsourcing with Complex Annotations AAAI 2024
Contextual Pandora’s Box AAAI 2024
Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits AAAI 2024
Combinatorial Stochastic-Greedy Bandit AAAI 2024
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem AAAI 2024