Tight Bound
"Tight bound" research focuses on determining the precise limits of performance for various algorithms and models across diverse fields, from machine learning to quantum computing. Current efforts concentrate on establishing these bounds for specific problems, including those involving neural networks, reinforcement learning, and differentially private algorithms, often employing techniques like Rademacher averages and Lyapunov optimization. Achieving tight bounds is crucial for understanding fundamental limitations, optimizing algorithm design, and providing guarantees on performance in applications ranging from robust classification to privacy-preserving data analysis.
Papers
October 12, 2024
September 25, 2024
July 18, 2024
July 8, 2024
June 4, 2024
May 15, 2024
April 3, 2024
February 29, 2024
September 29, 2023
September 23, 2023
September 2, 2023
July 18, 2023
March 6, 2023
December 21, 2022
December 7, 2022
November 22, 2022
October 24, 2022
October 12, 2022
April 14, 2022