LIVEJoin the current RTAI Connect sessionJoin now

ResearchTrend.AI
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints

Martino Bernasconi
Matteo Castiglioni
A. Celli
Federico Fusco
ArXivPDFHTML

Papers citing "Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints"

7 / 7 papers shown
Title
Bandits with Anytime Knapsacks
Bandits with Anytime Knapsacks
Eray Can Elumar
Cem Tekin
Osman Yagan
134
0
0
30 Jan 2025
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
Gagan Aggarwal
Giannis Fikioris
Mingfei Zhao
52
5
0
15 Apr 2024
Non-stationary Bandits with Knapsacks
Non-stationary Bandits with Knapsacks
Shang Liu
Jiashuo Jiang
Xiaocheng Li
73
22
0
25 May 2022
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
S. Balseiro
Haihao Lu
Vahab Mirrokni
66
108
0
18 Nov 2020
Adversarial Bandits with Knapsacks
Adversarial Bandits with Knapsacks
Nicole Immorlica
Karthik Abinav Sankararaman
Robert Schapire
Aleksandrs Slivkins
144
114
0
28 Nov 2018
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
Gergely Neu
381
183
0
10 Jun 2015
Bandits with concave rewards and convex knapsacks
Bandits with concave rewards and convex knapsacks
Shipra Agrawal
Nikhil R. Devanur
133
200
0
24 Feb 2014

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.