Start date cannot be after end date.
Speeding Up Real Root Counting for Most Circuit Systems via a Randomized Version of Baker's Theorem
Presenter
- Joseph Maurice Rojas
August 7, 2025
ICERM
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
Presenter
- Guy Blanc
May 12, 2025
IAS
On Approximability of Satisfiable Constraint Satisfaction Problems & Applications
Presenter
- Amey Bhangale
January 27, 2025
IAS
A Review of the Notion of Graph Rigidity and Some Recent Developments
Presenter
- Orit Raz
December 3, 2024
IAS
Montasir Abbas - On the Road to Collective Intelligence with the Green Light SONATA - IPAM at UCLA
Presenter
- Montasir Abbas
November 20, 2024
IPAM
Conor Heins - Collective behavior from surprise minimization - IPAM at UCLA
Presenter
- Conor Heins
November 19, 2024
IPAM
Rupak Majumdar - How to interact when you must - IPAM at UCLA
Presenter
- Rupak Majumdar
November 8, 2024
IPAM
Mehrnoosh Sadrzadeh - How can large language models learn from humans? - IPAM at UCLA
Presenter
- Mehrnoosh Sadrzadeh
November 5, 2024
IPAM
Fanny Yang - Surprising phenomena of max-lp-margin classifiers in high dimensions - IPAM at UCLA
Presenter
- Fanny Yang
October 17, 2024
IPAM
Linear cross-entropy certification of quantum computational advantage in Gaussian Boson Sampling
Presenter
- Javier Martinez-Cifuentes
September 17, 2024
IMSI