Yes, Generative Models Are The New Sparsity

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=g6Pemrz8hGo


Duration: 46:45
5,109 views
124

Alex Dimakis (UT Austin)
https://simons.berkeley.edu/talks/yes-generative-models-are-new-sparsity
Joint IFML/CCSI Symposium



Other Videos By Simons Institute for the Theory of Computing


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


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Joint IFML/CCSI Symposium
Alex Dimakis