ResearchTrend.AI
Minimax Regret for Bandit Convex Optimisation of Ridge Functions
v1v2 (latest)

Minimax Regret for Bandit Convex Optimisation of Ridge Functions

Tor Lattimore
ArXiv (abs)PDFHTML

Papers citing "Minimax Regret for Bandit Convex Optimisation of Ridge Functions"

2 / 2 papers shown
Title
Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
Nived Rajaraman
Yanjun Han
Jiantao Jiao
Kannan Ramchandran
94
2
0
12 Feb 2023
On the Complexity of Adversarial Decision Making
On the Complexity of Adversarial Decision Making
Dylan J. Foster
Alexander Rakhlin
Ayush Sekhari
Karthik Sridharan
AAML
79
29
0
27 Jun 2022