119 citations · 244 across the 26 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.LG2024
Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
Quan Nguyen, Nishant A. Mehta, Cristóbal Guzmán
The minimax sample complexity of group distributionally robust optimization (GDRO) has been determined up to a factor, where is the number of groups. In this work, we…
cs.LG2024★ 1 cited
On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
Ali Mortazavi, Junhao Lin, Nishant A. Mehta
In one view of the classical game of prediction with expert advice with binary outcomes, in each round, each expert maintains an adversarially chosen belief and honestly reports th…
cs.LG2024
Near-optimal Per-Action Regret Bounds for Sleeping Bandits
Quan Nguyen, Nishant A. Mehta
We derive near-optimal per-action regret bounds for sleeping bandits, in which both the sets of available arms and their losses in every round are chosen by an adversary. In a sett…