Schedule Subject to Change; all times in PT

Eric Allender's Day
–
Coffee and Check In
–
Opening Remarks
–
A Commentary on the Collision of Worlds
Rahul Santhanam (Oxford)
–
Break
–
Allender's Conjecture and its Impacts on Meta-Complexity
Shuichi Hirahara (National Institute of Informatics)
–
Break
–
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
Rahul Ilango (MIT)
–
Lunch
–
Improved Learning from Time-bounded Kolmogorov Complexity
Halley Goldberg (Simon Fraser University)
–
Break
–
Journey with Eric Allender: From Turing Machines to Circuits, and Back
Michal Koucky (Charles University)
–
How to Cheat at “Who Wants to Be a Millionaire?” (and Show Non-Hardness of GapMCSP)
Neekon Vafa (MIT)
–
Reception
–
Coffee and Check In
–
The Mystery of the Missing String
Ryan Williams (MIT)
–
Break
–
A Combinatorial Characterization of Minimax in 0/1 Games
Shay Moran (Technion)
–
Break
–
Replicability in Learning
Jessica Sorrell (UCSD)
–
Lunch
–
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms
Hanlin Ren (University of Oxford)
–
Break
–
Quantum Learning Algorithms Imply Circuit Lower Bounds
Alex Grilo (CNRS/Sorbonne Université)
–
Coffee and Check In
–
Learning Versus Pseudorandom Generators in Constant Parallel Time
Mikito Nanashima (Tokyo Institute of Technology)
–
Break
–
A Duality Between One-Way Functions and Average-Case Symmetry of Information
Zhenjian Lu (University of Oxford)
–
Break
–
Quantum Meets Minimum Circuit Size Problem
Nai-Hui Chia (Rice University)
–
Lunch
–
Learning Safe Action Models
Brendan Juba (Washington University in St. Louis)
–
Break
–
New Lower Bounds and Derandomization for ACC, and a Derandomization-centric View on the Algorithmic Method
Lijie Chen (MIT)
–
Coffee and Check In
–
Succinct Neural Networks
Adam Kalai (Microsoft Research)
–
Break
–
New Approaches to Heuristic Pac-learning vs. PRFs
Ari Karchmer (Boston University)
–
Break
–
On the Average-case Complexity of the Nearest Boolean Vector to a Subspace
Andrej Bogdanov (University of Ottawa)
–
Lunch
–
Average-case Complexity for Polynomials, and All That
Emanuele Viola (Northeastern University)
–
Break
–
On Low End Obfuscation and Learning
Gal Yehuda (Technion)
–
Coffee and Check In
–
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity
Yanyi Liu (Cornell)
–
Break
–
What (Doesn't) Make Learning Algorithms Generalize?
Roi Livni (Tel Aviv University)
–
Break
–
Learning with Distributional Inverters
Marco Carmosino (IBM Research)
–
Lunch
–
Unstructured Hardness to Average-Case Randomness
Roei Tell (Institute for Advanced Study)