conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

1
16
59
225
69
'05
'10
'15
'20
'25

Papers

Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination NIPS 2023
Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic Bandits NIPS 2023
Dynamic Pricing and Learning with Bayesian Persuasion NIPS 2023
Learning to Configure Separators in Branch-and-Cut NIPS 2023
Online List Labeling with Predictions NIPS 2023
Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards NIPS 2023
Regret Matching+: (In)Stability and Fast Convergence in Games NIPS 2023
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits NIPS 2023
Improving the Knowledge Gradient Algorithm NIPS 2023
Federated Linear Bandits with Finite Adversarial Actions NIPS 2023
Sensitivity in Translation Averaging NIPS 2023
Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness NIPS 2023
Bayesian Active Causal Discovery with Multi-Fidelity Experiments NIPS 2023
Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms NIPS 2023
Experimental Designs for Heteroskedastic Variance NIPS 2023
Near-Linear Time Algorithm for the Chamfer Distance NIPS 2023
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits NIPS 2023
Approximate Allocation Matching for Structural Causal Bandits with Unobserved Confounders NIPS 2023
Utilitarian Algorithm Configuration NIPS 2023
Non-Asymptotic Analysis of a UCB-based Top Two Algorithm NIPS 2023
Information-guided Planning: An Online Approach for Partially Observable Problems NIPS 2023
On the Generalization Error of Stochastic Mirror Descent for Quadratically-Bounded Losses: an Improved Analysis NIPS 2023
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards NIPS 2023
On the Complexity of Differentially Private Best-Arm Identification with Fixed Confidence NIPS 2023
An Exploration-by-Optimization Approach to Best of Both Worlds in Linear Bandits NIPS 2023