Showing 2025Show all
2 papers · 1 filter
stat.ML2025
Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks
Omar Montasser, Abhishek Shetty, Nikita Zhivotovskiy
We revisit online binary classification by shifting the focus from competing with the best-in-class binary loss to competing against relaxed benchmarks that capture smoothed notion…
cs.LG2025
Small Loss Bounds for Online Learning Separated Function Classes: A Gaussian Process Perspective
Adam Block, Abhishek Shetty
In order to develop practical and efficient algorithms while circumventing overly pessimistic computational lower bounds, recent work has been interested in developing oracle-effic…