Theoretically Speaking — Deep Nets and the Primate Visual System

Theoretically Speaking — Deep Nets and the Primate Visual System

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


Duration: 1:29:46
1,320 views
25

Anil Ananthaswamy (Simons Institute, moderator)
Panelists: James DiCarlo (MIT), Grace Lindsay (University College London), Jitendra Malik (UC Berkeley), and Santosh Vempala (Georgia Tech)
https://simons.berkeley.edu/events/deepnets
Theoretically Speaking



Other Videos By Simons Institute for the Theory of Computing


2021-10-26A Duality Approach for Entropic-Regularized Optimal Transport: ...
2021-10-26Training Wasserstein Generative Adversarial Networks Without Gradient Penalties
2021-10-26The Most Likely Evolution of Diffusing and Vanishing Particles in the Spirit of E. Schroedinger:..
2021-10-26Nonlocal Wasserstein Distance and the Associated Gradient Flows
2021-10-26Nonlocal Interaction Equation on Graphs: Gradient Flow Structure and Continuum Limit
2021-10-25The (Non-Convex) Optimal Uniform Quantization Problem
2021-10-25Singular Limits for Vlasov Equations via Kinetic-Type Wasserstein Distances
2021-10-22Mathematical Imaging: From Geometric PDEs and Variational Modeling to Deep Learning for Images
2021-10-20Panel on Quantum Machine Learning and Barren Plateaus | Quantum Colloquium
2021-10-20Barren Plateaus and Quantum Generative Training Using Rényi Divergences | Quantum Colloquium
2021-10-19Theoretically Speaking — Deep Nets and the Primate Visual System
2021-10-16Estimation Beyond the IID Setting (Two Vignettes)
2021-10-16Exact Matching Of Random Graphs With Constant Correlation
2021-10-16Deep Generative Models And Unsupervised Methods For Inverse Problems
2021-10-15Uncertainty Quantification In The Bradley-Terry-Luce Model
2021-10-15Tensor Graphical Models For Complex And High Dimensional Data
2021-10-15Structures Of Local Minima In K-Means And Mixture Models
2021-10-14New Algorithms For The Graph Alignment Problem
2021-10-14Learning Minimax Estimators Via Online Learning
2021-10-14Approximate Message Passing Algorithms For Orthogonally Invariant Models
2021-10-14Metric Representations: Algorithms and Geometry


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Anil Ananthaswamy
Theoretically Speaking
James DiCarlo
Grace Lindsay
Jitendra Malik
Santosh Vempala