Videos

Start date cannot be after end date.
Is optimization computationally equivalent to online learning? Thumbnail

Is optimization computationally equivalent to online learning?

Presenter
  • Elad Hazan
October 5, 2015
IAS
Hardness Escalation and the Rank of Polynomial Threshold Proofs Thumbnail

Hardness Escalation and the Rank of Polynomial Threshold Proofs

Presenter
  • Paul Beame
November 30, 2010
IAS

Topology-Driven Learning for Biomedical Images – Uncertainty, Synthesis, and Prediction

Presenter
  • Chao Chen
May 20, 2026
ICERM
Sparsifying and Derandomizing the Johnson-Lindenstrauss Transform Thumbnail

Sparsifying and Derandomizing the Johnson-Lindenstrauss Transform

Presenter
  • Jelani Nelson
January 31, 2011
IAS
Invariants of random knots Thumbnail

Invariants of random knots

Presenter
  • Chaim Even
October 6, 2015
IAS
The Permanents of Gaussian Matrices Thumbnail

The Permanents of Gaussian Matrices

Presenter
  • Scott Aaronson
November 29, 2010
IAS
A Completeness Theorem for Pseudo-Linear Functions with Applications to UC Security Thumbnail

A Completeness Theorem for Pseudo-Linear Functions with Applications to UC Security

Presenter
  • Charanjit Jutla
February 28, 2010
IAS
CSDM - Span Programs and Quantum Query Algorithms Thumbnail

CSDM - Span Programs and Quantum Query Algorithms

Presenter
  • Ben Reichardt
September 29, 2009
IAS

Set-Based Computations for Global Dynamics

Presenter
  • William Kalies
November 1, 2016
MBI
Bohua Zhan - Verifying symbolic computation in the HolPy theorem prover - IPAM at UCLA Thumbnail

Bohua Zhan - Verifying symbolic computation in the HolPy theorem prover - IPAM at UCLA

Presenter
  • Bohua Zhan
February 16, 2023
IPAM
Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization Thumbnail

Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization

Presenter
  • Yi Ma
October 6, 2009
IMA
Algorithms, Approximation, and Learning in Market and Mechanism Design: "Walrasian Mechanisms for Non-Convex Economies and the Bound-Form First Welfare Theorem" Thumbnail

Algorithms, Approximation, and Learning in Market and Mechanism Design: "Walrasian Mechanisms for Non-Convex Economies and the Bound-Form First Welfare Theorem"

Presenter
  • Paul Milgrom
November 7, 2023
SLMath