conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Multi-slots Online Matching with High Entropy ICML 2022
Nested Bandits ICML 2022
Stochastic Rising Bandits ICML 2022
Universal and data-adaptive algorithms for model selection in linear contextual bandits ICML 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022
One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes ICML 2022
Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative Preferences ICML 2022
Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits ICML 2022
Instance Dependent Regret Analysis of Kernelized Bandits ICML 2022
Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022
Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms ICML 2022
Delay-Adaptive Step-sizes for Asynchronous Learning ICML 2022
A Difference Standardization Method for Mutual Transfer Learning ICML 2022
Linear Bandit Algorithms with Sublinear Time Complexity ICML 2022
Fourier Learning with Cyclical Data ICML 2022
Learning from a Learning User for Optimal Recommendations ICML 2022
PDE-Based Optimal Strategy for Unconstrained Online Learning ICML 2022
A Simple yet Universal Strategy for Online Convex Optimization ICML 2022
Contextual Bandits with Large Action Spaces: Made Practical ICML 2022
Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces ICML 2022
Residual-Based Sampling for Online Outlier-Robust PCA ICML 2022
Envy-Free and Pareto-Optimal Allocations for Agents with Asymmetric Random Valuations IJCAI 2022
Time-Constrained Participatory Budgeting Under Uncertain Project Costs IJCAI 2022
Single-Peaked Opinion Updates IJCAI 2022
Efficient Resource Allocation with Secretive Agents IJCAI 2022