Boaz Barak | Polylogues

Testing Noise Assumptions of Learning Algorithms

Talk by Ali Kavis (UT Austin)

A Discrepancy-Based Theory of Adaptation

Intro to Quantum Gibbs Samplers: Algorithmic Ingredients

Understanding and Improving Efficient Language Models

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

Irit Dinur | Polylogues

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

Illuminating protein space with generative models

Audio-visual self-supervised baby learning

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

Tensor Network Toy Models of Holographic Dualities: Locality and Causality

An Efficient Quantum Factoring Algorithm | Quantum Colloquium

Logical Quantum Processor Based On Reconfigurable Atom Arrays | Quantum Colloquium

Algebraic Codes/Algorithms II

Data Structures and Optimization for Fast Algorithms

Achieving Understandability and Privacy With Provenance-Based Explanations

Towards Interpretable Data Science

Algorithmic Aspects of Semiring Provenance for Stratified Datalog

Market Algorithms for Autobidding

Introducing RelationalAI

Lemur: Integrating Large Language Models in Automated Program Verification

Unique Challenges and Opportunities in Working with Residential Real Estate Data

Semiring Semantics

Memory-Regret Tradeoff for Online Learning

Nikhil Srivastava and Venkatesan Guruswami | Polylogues

Generating Approximate Ground States of Molecules Using Quantum Machine Learning

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

Industry Applications of Hamiltonian Simulation and Beyond

What Can I Do With a Noisy Quantum Computer?

Quantum Machine Learning in the NISQ Era

Noncommutativity and Rounding Schemes for Combinatorial Optimization Parts 1 & 2

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

Multigroup Fairness | Polylogues

PCPs and Global Hyper-contractivity 1

Constant-Round Arguments from One-Way Functions

Alvy Ray Smith | Polylogues

Efficient Quantum Gibbs Samplers | Quantum Colloquium

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

The Power of Randomness in Kolmogorov Complexity

Constant-depth sorting networks

Black-box Constructive Proofs are Unavoidable

On Oracles and Algorithmic Methods for Proving Lower Bounds

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

Bit Complexity of Jordan Normal Form and Spectral Factorization

Certification with an NP Oracle

Matrix multiplication via matrix groups

TFNP Characterizations of Proof Systems and Monotone Circuits

Resilience of 3-Majority Dynamics to Non-Uniform Schedulers

Exponential separations using guarded extension variables

Beyond Worst-Case Budget-Feasible Mechanism Design

HappyMap: A Generalized Multicalibration Method

Worst-Case to Expander-Case Reductions

Proofs of Quantumness from Trapdoor Permutations

On computing homological hitting sets

A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems

Generalized Private Selection and Testing with High Confidence

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

Is it easier to count communities than find them?