Showing cs.LGShow all
3 papers · 1 filter
cs.LG2025
Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
Artin Tajdini, Jonathan Scarlett, Kevin Jamieson
We study stochastic linear bandits with heavy-tailed rewards, where the rewards have a finite -absolute central moment bounded by for some . We improv…
cs.LG2024
Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
Haolin Liu, Artin Tajdini, Andrew Wagenmaker +1
In linear bandits, how can a learner effectively learn when facing corrupted rewards? While significant work has explored this question, a holistic understanding across different a…
cs.LG2023
Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
Artin Tajdini, Lalit Jain, Kevin Jamieson
We consider maximizing an unknown monotonic, submodular set function with cardinality constraint under stochastic bandit feedback. At each time $t=1,…