| 2025-08-05 | WhAM: Towards A Translative Model of Sperm Whale Vocalization | 0:00 | 143 | |
|
| 2025-08-05 | Overview and Marine Bioacoustics and Perch Model | 0:00 | 67 | |
|
| 2025-08-05 | Machine Translation of Human Languages in the Age of LLMs: Is it the End of the Language Barrier? | 0:00 | 304 | |
|
| 2025-08-05 | What Makes a Good Language? | 0:00 | 161 | |
|
| 2025-08-05 | Decoding Dolphin Speech | 0:00 | 191 | |
|
| 2025-08-05 | Long term work and Machine Learning Approaches to DolphinGemma | 0:00 | 81 | |
|
| 2025-08-05 | Self-Supervised Learning in Transformer Models for Birdsong | 0:00 | 65 | |
|
| 2025-08-05 | Restoring Coral Reefs at Scale: AI and the Next Generation of Conservation | 0:00 | 44 | |
|
| 2025-08-05 | Validation by Listening | 0:00 | 64 | |
|
| 2025-08-05 | Potential of Echolocation for Communication | 0:00 | 108 | |
|
| 2025-07-28 | Opening Remarks | 0:00 | 297 | |
|
| 2025-07-28 | Oscillating networks from a biological point of view | 0:00 | 226 | |
|
| 2025-07-28 | Asymptotic Dynamics and Topology | 0:00 | 258 | |
|
| 2025-07-28 | Hodgkin-Huxley, Memristors, and Edge of Chaos | 0:00 | 290 | |
|
| 2025-07-28 | Topological and Algebraic Invariants to Classify Types of Singularities of Maps relevant to... | 0:00 | 331 | |
|
| 2025-07-28 | Emergent Behavior on Flocks | 0:00 | 61 | |
|
| 2025-07-28 | On Professor Smale's legacy for asymptotic stability theory | 0:00 | 155 | |
|
| 2025-07-28 | A Metacommunity Model of Interacting Hosts with Microbe Exchange | 0:00 | 35 | |
|
| 2025-07-28 | What is Consciousness and Can Machines have it? Part 1 | 0:00 | 200 | |
|
| 2025-07-28 | What is Consciousness and Can Machines have it? Part 2 | 0:00 | 89 | |
|
| 2025-07-28 | Dynamical Systems, Linear Programming and the Monge-Kantorovich Problem | 0:00 | 70 | |
|
| 2025-07-28 | Compositional sparsity and learnability | 0:00 | 52 | |
|
| 2025-07-28 | Smale’s 18th Problem and Intelligence Science | 0:00 | 76 | |
|
| 2025-07-28 | The Singularity is the Observer | 0:00 | 86 | |
|
| 2025-07-28 | Towards Trustworthy AI: Reflections on Learning and Smale's Legacy | 0:00 | 61 | |
|
| 2025-07-22 | Smale’s 18th Problem and Intelligence Science 2 | 0:00 | 38 | |
|
| 2025-07-22 | Measures of Perfection | 0:00 | 103 | |
|
| 2025-07-22 | The Enabling of McCarthyism by the University of Michigan | 0:00 | 79 | |
|
| 2025-07-22 | Kuramoto Problem and Smale Institute | 0:00 | 103 | |
|
| 2025-07-22 | Linear representations of concepts in modern AI models | 0:00 | 88 | |
|
| 2025-07-22 | Family Tribute | 0:00 | 73 | |
|
| 2025-07-18 | VerITAS: Verifying Image Transformations at Scale | 0:00 | 97 | |
|
| 2025-07-18 | Twist and Shout: Fast, Simple Memory Arguments | 0:00 | 79 | |
|
| 2025-07-18 | Accountable AI with ZKPs: Certifying Fairness and Explanations under model Confidentiality | 0:00 | 108 | |
|
| 2025-07-18 | Collaborative zk-SNARKs: Proving as One over Distributed Secrets | 0:00 | 77 | |
|
| 2025-07-17 | Tree PCPs | 0:00 | 37 | |
|
| 2025-07-17 | An introduction to lattice-based folding schemes | 0:00 | 94 | |
|
| 2025-07-17 | Hash-based Folding Schemes | 0:00 | 92 | |
|
| 2025-07-17 | Incrementally Verifiable Computation for NP from Standard Assumptions | 0:00 | 129 | |
|
| 2025-07-16 | Batch Arguments and Their Applications | 0:00 | 89 | |
|
| 2025-07-16 | Towards SNARGs for NP from Standard Assumptions | 0:00 | 73 | |
|
| 2025-07-16 | Succinct Non-interactive Arguments of Proximity | 0:00 | 84 | |
|
| 2025-07-16 | Towards a White-Box Secure Fiat-Shamir Transformation | 0:00 | 84 | |
|
| 2025-07-16 | Verifiable quantum advantage: old and new ideas | 0:00 | 474 | |
|
| 2025-07-15 | A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors | 0:00 | 62 | |
|
| 2025-07-15 | A Zero-Knowledge PCP Theorem | 0:00 | 57 | |
|
| 2025-07-15 | SP1 Hypercube and the Jagged PCS | 0:00 | 120 | |
|
| 2025-07-15 | Error-Correcting Codes That Enable Efficient SNARKs | 0:00 | 133 | |
|
| 2025-07-15 | SNARGs for P/poly from SIS | 0:00 | 101 | |
|
| 2025-07-14 | Functional Commitments | 0:00 | 115 | |
|
| 2025-07-14 | Talk by Alex Lombardi (Princeton University) | 0:00 | 152 | |
|
| 2025-07-14 | Incremental proof systems | 0:00 | 123 | |
|
| 2025-07-14 | An Introduction to Commitment-Based Succinct Arguments | 0:00 | 245 | |
|
| 2025-07-11 | Lightning Talks | 0:00 | 432 | |
|
| 2025-07-11 | Few Single-Qubit Measurements Suffice to Certify Any Quantum State | 0:00 | 163 | |
|
| 2025-07-11 | Thermal metastability and area laws | 0:00 | 464 | |
|
| 2025-07-11 | Rapid quantum ground state preparation via dissipative dynamics | 0:00 | 148 | |
|
| 2025-07-10 | Sum of squares spectral amplification (SOSSA) | 0:00 | 181 | |
|
| 2025-07-10 | Computational quantum chemistry: Classical gaps, quantum opportunities, open questions | 0:00 | 163 | |
|
| 2025-07-10 | Panel Discussion | 0:00 | 266 | |
|
| 2025-07-10 | How Hamiltonian complexity differs from quantum chemistry | 0:00 | 134 | |
|
| 2025-07-10 | Computational quantum chemistry: Classical gaps, quantum opportunities, open questions Part 2 | 0:00 | 170 | |
|
| 2025-07-09 | Quantum cryptography and quantum complexity | 0:00 | 168 | |
|
| 2025-07-09 | How to model unitary oracles | 0:00 | 165 | |
|
| 2025-07-09 | Informational and computational aspects of holography | 0:00 | 107 | |
|
| 2025-07-09 | Quantum LDPC Codes with Transversal CCZ Gates | 0:00 | 124 | |
|
| 2025-07-09 | When do you need an inverse or controlled unitary oracle? | 0:00 | 329 | |
|
| 2025-07-08 | Panel Discussion | 0:00 | 298 | |
|
| 2025-07-08 | Exponential improvements to the average-case hardness of random circuits | 0:00 | 254 | |
|
| 2025-07-08 | Are Random Quantum Circuits PRUs? | 0:00 | 204 | |
|
| 2025-07-08 | Reducing the number of qubits in quantum factoring | 0:00 | 223 | |
|
| 2025-07-07 | An Overview of QEC at Google | 0:00 | 402 | |
|
| 2025-07-07 | Tour de gross: A modular quantum computer based on bivariate bicycle codes | 0:00 | 450 | |
|
| 2025-07-07 | Panel Discussion | 0:00 | 360 | |
|
| 2025-07-07 | Architectural mechanisms of a universal fault-tolerant quantum computer | 0:00 | 452 | |
|
| 2025-06-27 | Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from... | 0:00 | 233 | |
|
| 2025-06-26 | Expedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New... | 0:00 | 189 | |
|
| 2025-06-25 | To interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic | 0:00 | 210 | |
|
| 2025-06-18 | Succinct arguments for QMA from standard assumptions, without quantum PCPs | 0:00 | 174 | |
|
| 2025-05-30 | Crypto + Meta-complexity 2 | 0:00 | 167 | |
|
| 2025-05-30 | Crypto + Meta-complexity 1 | 0:00 | 152 | |
|
| 2025-05-30 | Crypto + ML 2 | 0:00 | 432 | |
|
| 2025-05-30 | Crypto + ML 1 | 0:00 | 535 | |
|
| 2025-05-30 | Private Information Retrieval and Oblivious RAM | 0:00 | 148 | |
|
| 2025-05-30 | Secure Computation 3 | 0:00 | 64 | |
|
| 2025-05-30 | Secure Computation 2 | 0:00 | 70 | |
|
| 2025-05-30 | Secure Computation 1 | 0:00 | 113 | |
|
| 2025-05-30 | Proofs - Practice 2 | 0:00 | 98 | |
|
| 2025-05-30 | Proofs - Practice 1 | 0:00 | 101 | |
|
| 2025-05-30 | Proofs - Theory | 0:00 | 150 | |
|
| 2025-05-30 | Quantum 4 | 0:00 | 99 | |
|
| 2025-05-30 | Quantum 3 | 0:00 | 89 | |
|
| 2025-05-30 | Quantum 2 | 0:00 | 151 | |
|
| 2025-05-30 | Foundations 2 | 0:00 | 197 | |
|
| 2025-05-19 | Foundations 1 | 0:00 | 387 | |
|
| 2025-05-01 | Future Directions In AI Safety Research | 0:00 | 400 | |
|
| 2025-04-28 | Introduction (Sanjit Seshia) | 0:00 | 371 | |
|
| 2025-04-23 | How to Locate Unentanglement | Quantum Colloquium | 0:00 | 586 | |
|
| 2025-04-16 | Talk by Sophie Morel (ENS de Lyon) | 0:00 | 102 | |
|
| 2025-04-16 | Challenges in State-of-the-Art Bit-Precise Reasoning | 0:00 | 60 | |
|
