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)
Video
–
Break
–
Allender's Conjecture and its Impacts on Meta-Complexity

Shuichi Hirahara (National Institute of Informatics, Tokyo)
Video
–
Break
–
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach

Rahul Ilango (MIT)
Video
–
Lunch
–
Improved Learning from Time-bounded Kolmogorov Complexity

Halley Goldberg (Simon Fraser University)
Video
–
Break
–
Journey with Eric Allender: From Turing Machines to Circuits, and Back

Michal Koucky (Charles University)
Video
–
How to Cheat at “Who Wants to Be a Millionaire?” (and Show Non-Hardness of GapMCSP)

Neekon Vafa (MIT)
Video
–
Reception
–
Coffee and Check In
–
The Mystery of the Missing String

Ryan Williams (MIT)
Video
–
Break
–
A Combinatorial Characterization of Minimax in 0/1 Games

Shay Moran (Technion)
Video
–
Break
–
Replicability in Learning

Jessica Sorrell (UCSD)
Video
–
Lunch
–
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms

Hanlin Ren (University of Oxford)
Video
–
Break
–
Quantum Learning Algorithms Imply Circuit Lower Bounds

Alex Grilo (CNRS/Sorbonne Université)
Video
–
Coffee and Check In
–
Learning Versus Pseudorandom Generators in Constant Parallel Time

Mikito Nanashima (Tokyo Institute of Technology)
Video
–
Break
–
A Duality Between One-Way Functions and Average-Case Symmetry of Information

Zhenjian Lu (University of Oxford)
Video
–
Break
–
Quantum Meets Minimum Circuit Size Problem

Nai-Hui Chia (Rice University)
Video
–
Lunch
–
Learning Safe Action Models

Brendan Juba (Washington University in St. Louis)
Video
–
Break
–
New Lower Bounds and Derandomization for ACC, and a Derandomization-centric View on the Algorithmic Method

Lijie Chen (MIT)
Video
–
Coffee and Check In
–
Succinct Neural Networks

Adam Kalai (Microsoft Research)
Video
–
Break
–
New Approaches to Heuristic Pac-learning vs. PRFs

Ari Karchmer (Boston University)
Video
–
Break
–
On the Average-case Complexity of the Nearest Boolean Vector to a Subspace

Andrej Bogdanov (University of Ottawa)
Video
–
Lunch
–
Average-case Complexity for Polynomials, and All That

Emanuele Viola (Northeastern University)
Video
–
Break
–
On Low End Obfuscation and Learning

Gal Yehuda (Technion)
Video
–
Coffee and Check In
–
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity

Yanyi Liu (Cornell)
Video
–
Break
–
What (Doesn't) Make Learning Algorithms Generalize?

Roi Livni (Tel Aviv University)
Video
–
Break
–
Learning with Distributional Inverters

Marco Carmosino (IBM Research)
Video
–
Lunch
–
Unstructured Hardness to Average-Case Randomness

Roei Tell (Institute for Advanced Study)
Video