The Surprising Power Of The Lenstra-Lenstra-Lovasz Algorithm For Noiseless Inference

Channel:

Subscribers:

68,700

Published on November 4, 2021 6:57:47 AM ● Video Link: https://www.youtube.com/watch?v=QGUEaXII4Kw

Duration: 44:15

921 views

Other Videos By Simons Institute for the Theory of Computing

2021-11-10	Panel on Achieving Quantum Advantage in the NISQ Era \| Quantum Colloquium
2021-11-09	On The Hardness Of Average-Case k-SUM
2021-11-09	Low-Complexity Cryptography and Simple Hard-to-Learn Functions
2021-11-09	Indistinguishability Obfuscation and Learning Problems
2021-11-09	Average-Case Hardness Of CSPs
2021-11-08	On Breaking Encryption With A Statistical Zero-Knowledge Oracle
2021-11-06	Function Space View Of Bounded Weight Norm Networks
2021-11-05	The Planted Matching Problem: Sharp Threshold And Infinite-Order Phase Transition
2021-11-05	Scalable And Reliable Inference For Probabilistic Modeling
2021-11-04	Learning and Optimization with Adaptive Smoothed Adversaries
2021-11-04	The Surprising Power Of The Lenstra-Lenstra-Lovasz Algorithm For Noiseless Inference
2021-11-03	Yes, Generative Models Are The New Sparsity
2021-11-03	Panel on Novel Fault-Tolerant Qubits \| Quantum Colloquium
2021-11-03	On the Power of Differentiable Learning
2021-11-03	Simple Architecture for a Fault-Tolerant Qubit \| Quantum Colloquium
2021-11-02	A Data-Centric View On Robustness
2021-11-02	Finding Large Cliques in Random and Semi-Random Graphs
2021-10-30	Density Control of Interacting Agent Systems
2021-10-30	Discrete-To-Continuum Limits of Dynamical Optimal Transport Problems
2021-10-30	Learning Interaction Kernels in Stochastic Systems of...
2021-10-30	Mirror Descent Algorithms for Minimizing Interacting Free Energy

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Joint IFML/CCSI Symposium

Ilias Zadik