publications
publications by categories in reversed chronological order. generated by jekyll-scholar.
2025
- The Space Complexity of Learning-Unlearning Algorithms (extended abstract)In The Thirty Eighth Annual Conference on Learning Theory, 30-4 July 2025, Lyon, France, 2025
- Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed BenchmarksIn The Thirty Eighth Annual Conference on Learning Theory, 30-4 July 2025, Lyon, France, 2025
- Small Loss Bounds for Online Learning Separated Function Classes: A Gaussian Process PerspectiveCoRR, 2025
-
- Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed BenchmarksCoRR, 2025
-
-
2024
- Learning in a Changing World:}}Covariate Shift, Subset Selection and Optimal PAC BoundsUniversity of California Berkeley, USA, 2024
-
- On the Performance of Empirical Risk Minimization with Smoothed DataIn The Thirty Seventh Annual Conference on Learning Theory, June 30 - July 3, 2023, Edmonton, Canada, 2024
- Smooth Nash Equilibria: Algorithms and ComplexityIn 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA, 2024
- Oracle-Efficient Differentially Private Learning with Public DataIn Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, NeurIPS 2024, Vancouver, BC, Canada, December 10 - 15, 2024, 2024
- Tolerant Algorithms for Learning with Arbitrary Covariate ShiftIn Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, NeurIPS 2024, Vancouver, BC, Canada, December 10 - 15, 2024, 2024
-
-
-
-
2023
- The One-Inclusion Graph Algorithm is not Always OptimalIn The Thirty Sixth Annual Conference on Learning Theory, COLT 2023, 12-15 July 2023, Bangalore, India, 2023
- Optimal PAC Bounds without Uniform ConvergenceIn 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, 2023
- Smoothed Analysis of Sequential Probability AssignmentIn Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023
- Progressive Ensemble Distillation: Building Ensembles for Efficient InferenceIn Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023
- Adversarial Resilience in Sequential Prediction via AbstentionIn Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023
-
-
-
-
-
2022
- Distribution Compression in Near-Linear TimeIn The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022, 2022
- Oracle-Efficient Online Learning for Smoothed AdversariesIn Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022, 2022
- Matrix discrepancy from Quantum communicationIn STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, 2022
- Oracle-Efficient Online Learning for Beyond Worst-Case AdversariesCoRR, 2022
-
2021
- Fractional Pseudorandom Generators from Any Fourier LevelIn 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference), 2021
- Smoothed Analysis with Adaptive AdversariesIn 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, 2021
- Smoothed Analysis with Adaptive AdversariesCoRR, 2021
- Matrix Discrepancy from Quantum CommunicationCoRR, 2021
- Distribution Compression in Near-linear TimeCoRR, 2021
2020
- Effect of Activation Functions on the Training of Overparametrized Neural NetsIn 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020, 2020
- Smoothed Analysis of Online and Differentially Private LearningIn Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual, 2020
- Smoothed Analysis of Online and Differentially Private LearningCoRR, 2020
- Fractional Pseudorandom Generators from Any Fourier LevelCoRR, 2020
- Fractional Pseudorandom Generators from the \textdollark\textdollarth Fourier LevelElectron. Colloquium Comput. Complex., 2020
2019
- Exponential Weights on the Hypercube in Polynomial TimeIn The 22nd International Conference on Artificial Intelligence and Statistics, AISTATS 2019, 16-18 April 2019, Naha, Okinawa, Japan, 2019
- Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative CurvatureIn Conference on Learning Theory, COLT 2019, 25-28 June 2019, Phoenix, AZ, USA, 2019
- Non-Gaussian component analysis using entropy methodsIn Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, 2019
- Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative CurvatureCoRR, 2019
- Effect of Activation Functions on the Training of Overparametrized Neural NetsCoRR, 2019
2018
- Non-Gaussian Component Analysis using Entropy MethodsCoRR, 2018