101. | The Short Integer Solutions Problem and Cryptographic Applications | 1:31:41 | |
|
102. | Networks and Economics 3 | 1:31:40 | |
|
103. | Inapproximability of Constraint Satisfaction Problems I | 1:31:39 | |
|
104. | Operating Bike-Sharing Systems – A Case Study in Real-Time Decision Making | 1:31:38 | |
|
105. | 20 years of PIR | 1:31:37 | |
|
106. | Past, Present and Future of Randomized Numerical Linear Algebra II | 1:31:28 | |
|
107. | Introduction to Cancer Bioinformatics I: Inferring Genomic Variation from Tumor Sequencing Data | 1:31:25 | |
|
108. | The Brain and Body Compute Together: Neuromechanics and Sensorimotor Control | 1:31:22 | |
|
109. | Circuits and communication | 1:31:16 | |
|
110. | Big Data: The Computation/Statistics Interface | 1:31:11 | |
|
111. | Circuits of Bounded Depth | 1:31:09 | |
|
112. | Unsupervised Learning | 1:31:08 | |
|
113. | Natural Language Understanding: Foundations and State-of-the-Art | 1:31:01 | |
|
114. | Graphons and Graph Limits 2 | 1:30:52 | |
|
115. | Building Human Intelligence at Scale, to Save the Next Generation from ChatGPT | 1:30:46 | |
|
116. | Incremental Approximate Message Passing | 1:30:44 | |
|
117. | Physics at the Large Hadron Collider: A New Window on Matter, Spacetime and the Universe I | 1:30:39 | |
|
118. | Interactive Learning of Classifiers and Other Structures | 1:30:33 | |
|
119. | Tutorial 1: The GCT Chasm I | 1:30:31 | |
|
120. | Hash Proof Systems, Old and New | 1:30:26 | |
|
121. | The Flow of Information | 1:30:23 | |
|
122. | High-Dimensional Statistics I | 1:30:15 | |
|
123. | Inapproximability of Constraint Satisfaction Problems II | 1:30:13 | |
|
124. | Answer Set Programming in a Nutshell | 1:30:10 | |
|
125. | High-Dimensional Statistics II | 1:30:10 | |
|
126. | Sparse Random Graphs 1 | 1:30:05 | |
|
127. | Networks and Economics 1 | 1:29:58 | |
|
128. | Analytic Methods for Supervised Learning IV | 1:29:57 | |
|
129. | Analytic Methods for Supervised Learning II | 1:29:57 | |
|
130. | Introduction to Analysis on the Discrete Cube III | 1:29:51 | |
|
131. | Pairings in Cryptography | 1:29:49 | |
|
132. | Theoretically Speaking — Deep Nets and the Primate Visual System | 1:29:46 | |
|
133. | Fundamental Algorithms in Deep Sequencing III: Genomic Compression: Storage, Transmission, and ... | 1:29:23 | |
|
134. | The Predictive Brain: Michael Pollan, Celeste Kidd, Christos Papadimitriou, and Bruno Olshausen | 1:28:56 | |
|
135. | The Ethical Algorithm | 1:28:38 | |
|
136. | Lattices, Multilinear Maps and Program Obfuscation | 1:28:36 | |
|
137. | Designing Agents' Preferences, Beliefs, and Identities | 1:28:36 | |
|
138. | Introduction to Analysis on the Discrete Cube II | 1:28:24 | |
|
139. | Short Talks | 1:28:17 | |
|
140. | Sparse Random Graphs 2 | 1:28:10 | |
|
141. | Artificial Stupidity: The New AI and the Future of Fintech | 1:27:56 | |
|
142. | Thresholds | 1:27:56 | |
|
143. | How Simulating Balls and Springs Captures the Power of Quantum Computing | 1:27:56 | |
|
144. | AI Aspirations and Advances | 1:27:50 | |
|
145. | Tutorial 4: GCT and Matrix Multiplication | 1:27:49 | |
|
146. | Multi-Distribution Learning, for Robustness, Fairness, and Collaboration | 1:27:45 | |
|
147. | Opportunities for the Application of Quantitative Models in a Fully Integrated Healthcare System | 1:27:36 | |
|
148. | The Learning With Errors Problem and Cryptographic Applications | 1:27:35 | |
|
149. | The Flow of Money | 1:27:33 | |
|
150. | Laconic Function Evaluation | 1:27:23 | |
|
151. | Rethinking Consensus in the Blockchain Setting (Part II) | 1:27:19 | |
|
152. | Warning When You Need It: Earthquakes and Smartphones | 1:27:16 | |
|
153. | Epidemics 2 | 1:27:16 | |
|
154. | Computational and Statistical Tools to Control a Pandemic | Theoretically Speaking Series | 1:27:02 | |
|
155. | Differentially Private Empirical Risk Minimization | 1:27:01 | |
|
156. | Foundations for a Democratic Metaverse | 1:26:55 | |
|
157. | Watermarking and Traitor Tracing for PRFs | 1:26:52 | |
|
158. | Logic in Computer Science with a Strong Bias Towards Automata 1 | 1:26:49 | Vlog |
|
159. | Noncommutativity and Rounding Schemes for Combinatorial Optimization Parts 1 & 2 | 1:26:47 | |
|
160. | Past, Present and Future of Randomized Numerical Linear Algebra I | 1:26:44 | |
|
161. | Streaming, Sketching and Sufficient Statistics II | 1:26:22 | |
|
162. | Theoretically Speaking — Market Design through the Lens of Approximation | 1:26:11 | |
|
163. | What Do the Theory of Computing and the Movies Have in Common? | 1:26:06 | |
|
164. | Quantum Gibbs Sampling | 1:25:54 | |
|
165. | Quantum FHE | 1:25:53 | |
|
166. | The Mathematical Essence of Aging | Theoretically Speaking | 1:25:40 | |
|
167. | Some Geometric Perspectives on Combinatorics: High-Dimensional, Local and Local-to-Global II | 1:25:38 | |
|
168. | Online Learning in MDPs (Part 1) | 1:25:37 | |
|
169. | Machine-Checked Proofs and the Rise of Formal Methods in Mathematics | Theoretically Speaking | 1:25:21 | |
|
170. | Inapproximability of Constraint Satisfaction Problems IV | 1:25:16 | |
|
171. | Quantum and Post-Quantum Cryptography | 1:25:01 | |
|
172. | Indistinguishability Obfuscation from Simple-to-State Hard Problems | 1:24:58 | |
|
173. | Some Geometric Perspectives on Combinatorics: High-Dimensional, Local and Local-to-Global I | 1:24:41 | |
|
174. | Simulation Methodology: An Overview (Part 2) | 1:24:28 | Vlog |
|
175. | Formal Languages and Automata for Reward Function Specification and Efficient Reinforcement Learning | 1:24:11 | |
|
176. | Berkeley in the 80s, Episode 5: Richard Karp | 1:24:11 | Show |
|
177. | Theoretically Speaking - Eli Ben-Sasson (StarkWare) | 1:24:04 | |
|
178. | Inference on Random Factor Graphs | 1:24:02 | |
|
179. | Black Holes, Firewalls, and the Limits of Quantum Computers | 1:24:02 | |
|
180. | What We Can Learn from AdNauseam about the Threat and Power of Data Obfuscation | 1:24:01 | |
|
181. | Panel Discussion | 1:24:00 | Discussion |
|
182. | Oral History: Russell Impagliazzo in Conversation with Dick Karp | 1:23:52 | |
|
183. | Streaming, Sketching and Sufficient Statistics I | 1:23:38 | |
|
184. | Adversarial Examples | 1:23:31 | |
|
185. | Data Structures and Cryptography: from UOWHFs to PSRs | 1:23:30 | |
|
186. | The Area-Law Conjecture in Many-Body Quantum Physics | Quantum Colloquium | 1:23:26 | |
|
187. | Mapping the Online World: Social Connectedness in the Digital Age | 1:23:20 | |
|
188. | Analytic Methods for Supervised Learning I | 1:23:13 | |
|
189. | Generalization II | 1:23:07 | |
|
190. | Hypotheses about Satisfiability and their Consequences | 1:23:05 | |
|
191. | Implicit Regularization II | 1:22:54 | |
|
192. | Analytic methods | 1:22:51 | |
|
193. | Position-based Quantum Cryptography | 1:22:35 | |
|
194. | Property Testing for Graphs | 1:22:35 | |
|
195. | Optimal No-Regret Learning in General Games via Clairvoyant MWU | 1:22:20 | |
|
196. | Learning and DP | 1:22:17 | |
|
197. | Tensors vs Entanglement | 1:22:16 | |
|
198. | Generalization IV | 1:22:14 | |
|
199. | Space is a latent sequence: A theory of hippocampus and PFC | 1:22:13 | |
|
200. | Tutorial 3: Geometric Invariant Theory | 1:22:11 | |
|