53:36

A Discrepancy-Based Theory of Adaptation

01:07:27

Intro to Quantum Gibbs Samplers: Algorithmic Ingredients

46:36

Understanding and Improving Efficient Language Models

01:09:38

Modern paradigms of generalization, the heliocentric model of Aristarchus,...

22:36

Irit Dinur | Polylogues

01:22:14

Space is a latent sequence: A theory of hippocampus and PFC

01:03:59

Illuminating protein space with generative models

48:07

Audio-visual self-supervised baby learning

55:52

The Complexity of Fermions in Quantum Information and Beyond | Richard M. Karp Distinguished Lecture

01:00:20

Tensor Network Toy Models of Holographic Dualities: Locality and Causality

01:53:20

An Efficient Quantum Factoring Algorithm | Quantum Colloquium

02:00:21

Logical Quantum Processor Based On Reconfigurable Atom Arrays | Quantum Colloquium

01:00:24

Algebraic Codes/Algorithms II

03:08

Data Structures and Optimization for Fast Algorithms

30:08

Achieving Understandability and Privacy With Provenance-Based Explanations

35:02

Towards Interpretable Data Science

28:20

Algorithmic Aspects of Semiring Provenance for Stratified Datalog

18:38

Market Algorithms for Autobidding

14:07

Introducing RelationalAI

16:18

Lemur: Integrating Large Language Models in Automated Program Verification

18:45

Unique Challenges and Opportunities in Working with Residential Real Estate Data

01:06:07

Semiring Semantics

58:18

Memory-Regret Tradeoff for Online Learning

27:02

Nikhil Srivastava and Venkatesan Guruswami | Polylogues

34:57

Generating Approximate Ground States of Molecules Using Quantum Machine Learning

31:13

Quantum-Classical Cross-Correlations and the Post-selection Problem

42:24

Industry Applications of Hamiltonian Simulation and Beyond

47:10

What Can I Do With a Noisy Quantum Computer?

44:49

Quantum Machine Learning in the NISQ Era

01:26:47

Noncommutativity and Rounding Schemes for Combinatorial Optimization Parts 1 & 2

01:01:17

Some Remarks About Quantum and Classical Local Hamiltonian Optimization and SDP Rounding

01:07:06

Multigroup Fairness | Polylogues

59:09

PCPs and Global Hyper-contractivity 1

42:52

Constant-Round Arguments from One-Way Functions

48:49

Alvy Ray Smith | Polylogues

01:39:30

Efficient Quantum Gibbs Samplers | Quantum Colloquium

01:26:06

What Do the Theory of Computing and the Movies Have in Common?

12:47

The Power of Randomness in Kolmogorov Complexity

45:14

Constant-depth sorting networks

20:47

Black-box Constructive Proofs are Unavoidable

16:20

On Oracles and Algorithmic Methods for Proving Lower Bounds

28:31

On disperser/lifting properties of the Index and Inner-Product functions

24:54

Bit Complexity of Jordan Normal Form and Spectral Factorization

16:15

Certification with an NP Oracle

23:13

Matrix multiplication via matrix groups

20:14

TFNP Characterizations of Proof Systems and Monotone Circuits

39:32

Resilience of 3-Majority Dynamics to Non-Uniform Schedulers

24:32

Exponential separations using guarded extension variables

20:02

Beyond Worst-Case Budget-Feasible Mechanism Design

19:20

HappyMap: A Generalized Multicalibration Method

22:42

Worst-Case to Expander-Case Reductions

17:20

Proofs of Quantumness from Trapdoor Permutations

25:19

On computing homological hitting sets

20:05

A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems

25:35

Generalized Private Selection and Testing with High Confidence

27:13

All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method

24:21

Is it easier to count communities than find them?

19:02

Secure Distributed Network Optimization Against Eavesdroppers

26:02

Algorithms with More Granular Differential Privacy Guarantees

18:36

Graph Searching with Predictions