Algorithmic Information Theory and Machine Learning in Dynamical Systems
Explore the intersection of Algorithmic Information Theory and Machine Learning for Dynamical Systems in this symposium talk by Boumediene Hamzi from Caltech.
Group-based Cryptography - Advances and Applications
Explore cutting-edge developments in group-based cryptography at this TCC 2023 session, featuring expert insights and discussions on advanced cryptographic techniques.
Lattices and Codes in Cryptography - TCC 2023 Session
Explore cutting-edge research on lattices and codes in cryptography, featuring presentations from leading experts at the Theory of Cryptography Conference 2023.
The Future of Generative AI
Explore the potential of generative AI to revolutionize communication, learning, and work. Discuss possibilities, challenges, and societal impacts with AI expert Professor Michael Wooldridge.
On the Complexity of Collision Resistant Hash Functions
Explore the intricacies and challenges of collision-resistant hash functions in cryptography, examining their complexity and implications for security systems.
Quantum Computing and Cryptography - IACR Distinguished Lecture
Explore quantum computing's impact on cryptography with Andrew Yao's insightful lecture, offering expert perspectives on future challenges and opportunities in the field.
Traveling Salesman Problem Using Dynamic Programming - Directed Graph Example
Explore the Traveling Salesman Problem using dynamic programming for directed graphs. Learn efficient solution techniques and practical applications in algorithm design and analysis.
Arbitrary Tensor Network Algorithm: Theory, Methods and Applications
Explore arbitrary tensor network algorithms for complex systems modeling, covering theory, methods, and applications in probabilistic graphical models and quantum circuit simulations.
Tensor Networks and the Negative Sign Problem
Explore tensor networks and the negative sign problem in quantum systems, examining simulation challenges and correlation implications for systems with negative Hamiltonian entries.
Algorithms Approaching the Threshold for Semirandom Planted Clique
Explore advanced algorithms for semirandom planted clique problems with Princeton researcher Pravesh Kothari, discussing computational and statistical challenges in learning and optimization.
On the Hardness of Learning Under Symmetries
Explore the challenges of machine learning with symmetries in this talk by MIT's Thien Le, examining computational and statistical gaps in learning and optimization.
Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise
Explore computational complexity of robust halfspace learning with agnostic noise, focusing on L_p perturbations. Discover efficient algorithms and hardness results for distribution-independent PAC models.
Robust Learning of a Single Neuron - Bridging Computational Gaps Using Optimization
Explore robust learning of a single neuron with ReLU activation, focusing on optimization techniques to achieve near-optimal mean square loss in adversarial settings. Discover novel approaches for various activation functions.
Locality in Codes and Computation
Exploring local algorithms in error-correcting codes and their impact on computational theory, from error detection to cryptocurrency applications. Challenges and future directions discussed.
Sublinear Time Algorithms for Estimating Edit Distance
Explore efficient methods for approximating edit distance between strings, focusing on sublinear time algorithms and their applications in computational biology and text processing.
Conditional Hardness for Massively Parallel Computing Via Distributed Lower Bounds
Explore conditional hardness in massively parallel computing through distributed lower bounds, examining theoretical challenges and algorithmic implications for sublinear algorithms.
Beyond Moments - Robust Certificates for Affine Transformations
Explores algorithm for recovering affine transformations from corrupted samples, presenting robust certificates and highlighting limitations of moment-based methods in robust statistics.
Parameterized Inapproximability of the Minimum Distance Problem over All Fields
Explores inapproximability of Minimum Distance Problem for linear codes over finite fields, proving W[1]-hardness. Extends results to Shortest Vector Problem on integer lattices.
Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries
Explore asymptotically good relaxed locally correctable codes with improved query complexity, advancing error-correcting code theory through novel techniques and insights.
Constant Query Local Decoding Against Deletions Is Impossible
Explores impossibility of constant query locally decodable codes in deletion settings, contrasting with substitution errors. Proves non-existence, impacting error-correcting code theory.
SNARKs - Advances in Zero-Knowledge Proofs
Explore cutting-edge developments in SNARKs (Succinct Non-Interactive Arguments of Knowledge) at this Eurocrypt 2024 session, chaired by Aggelos Kiayias.