Session 6
Date and Time:
Tuesday, February 24, 2026 - 3:30pm to 4:45pm
Location:
Fields Institute, Room 230
Abstract:
- On the Hardness of Learning Regular Expressions
Idan Attias, Lev Reyzin, Nathan Srebro, Gal Vardi - Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
Abhishek Hegade K. R., Eren C. Kizildag - The Planted Number Partitioning Problem
Eren C. Kizildag - Uniform Convergence Beyond Glivenko-Cantelli
Tanmay Devale, Pramith Devulapalli, Steve Hanneke - Optimal Bounds for Tyler’s M-Estimator for Elliptical Distributions
Akshay Ramachandran, Lap Lau - Talagrand Meets Talagrand: Upper and Lower Bounds on Expected Soft Maxima of Gaussian Processes with Finite Index Sets
Yifeng Chu, Maxim Raginsky
