The Sample Complexity of Approximate Rejection Sampling with Applications to Smoothed Online Learning

9 February 2023

Papers citing "The Sample Complexity of Approximate Rejection Sampling with Applications to Smoothed Online Learning"

8 / 8 papers shown

Title
Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks Omar Montasser Abhishek Shetty Nikita Zhivotovskiy 24 0 0 14 Apr 2025
Some Notes on the Sample Complexity of Approximate Channel Simulation Gergely Flamich Lennie Wells 26 3 0 07 May 2024
On the Performance of Empirical Risk Minimization with Smoothed Data Adam Block Alexander Rakhlin Abhishek Shetty 28 3 0 22 Feb 2024
Oracle-Efficient Differentially Private Learning with Public Data Adam Block Mark Bun Rathin Desai Abhishek Shetty Steven Wu FedML 11 2 0 13 Feb 2024
Smooth Nash Equilibria: Algorithms and Complexity C. Daskalakis Noah Golowich Nika Haghtalab Abhishek Shetty 8 4 0 21 Sep 2023
Smoothed Online Learning for Prediction in Piecewise Affine Systems Adam Block Max Simchowitz Russ Tedrake 19 12 0 26 Jan 2023
Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions Adam Block Max Simchowitz 44 11 0 25 May 2022
Smoothed Analysis with Adaptive Adversaries Nika Haghtalab Tim Roughgarden Abhishek Shetty AAML 46 49 0 16 Feb 2021