Building Flexible, but Not Too Flexible, Models of Gravitational Wave Data
Explore gravitational wave data analysis techniques, focusing on flexible modeling approaches to reduce biases in LIGO-Virgo observations while preventing overfitting.
Simple and Fast Rounding Algorithms for Directed and Node Weighted Multiway Cut
Explore efficient algorithms for directed and node-weighted multiway cut problems, focusing on simple rounding techniques and integrality gap analysis in graph theory and combinatorial optimization.
On the Computational Hardness Needed for Quantum Cryptography
Explores EFI pairs as essential for quantum cryptography, comparing their role to one-way functions in classical cryptography and demonstrating their necessity for various applications.
Braids and Machine Learning
Explore the fascinating intersection of braids and machine learning, uncovering innovative applications and insights in mathematics and data science.
Max-Flow and Friends, In Almost Linear Time
Explore cutting-edge algorithms for max-flow problems and related graph theory concepts, focusing on recent breakthroughs in achieving near-linear time complexity.
Verifiable Quantum Advantage Without Structure - Quantum Colloquium
Explore groundbreaking research on verifiable quantum advantage without relying on structured problems, challenging traditional approaches in quantum computing.
An Efficient Quantum Algorithm for Lattice Problems Achieving Subexponential Approximation Factor
Explore a groundbreaking quantum algorithm for lattice problems, offering subexponential approximation and exponential speedup over classical methods in polynomial time.
Hidden Symmetries of Computational Problems
Explore hidden symmetries in computational problems, uncovering geometric methods for optimization and sampling with insights from experts in mathematics and quantum computing.
Lattice Trapdoors
Explore lattice trapdoors in cryptography, their algorithms, complexity, and applications in program obfuscation with expert Shweta Agrawal from IIT Madras.
The Short Integer Solutions Problem and Cryptographic Applications
Explore the Short Integer Solutions Problem, its cryptographic applications, and connections to lattice-based algorithms, complexity, and security in this advanced mathematical lecture.
Mathematics of Lattices
Explore fundamental concepts and applications of lattice theory in algorithms, complexity, and cryptography with expert insights from UC San Diego researcher Daniele Micciancio.
Efficient Zero-Knowledge Proofs: A Modular Approach
Explore modular techniques for creating efficient zero-knowledge proofs, focusing on probabilistically checkable and interactive proof systems in cryptography.
Algorithmic Opportunities in Matching Markets
Explore algorithmic opportunities in matching markets, focusing on innovative approaches and their potential impact on economic efficiency and social welfare.
Meta-Learning of Optimizers and Update Rules
Explore cutting-edge techniques in meta-learning for optimizers and update rules, focusing on advancements in deep learning and their applications in AI research.
Algorithms and the Law
Explore the intersection of algorithms and law with experts discussing implications, challenges, and potential solutions in this thought-provoking panel discussion.
Learning-Augmented Sketches for Frequency Estimation
Explore advanced techniques for frequency estimation using learning-augmented sketches, enhancing sublinear algorithms and nearest-neighbor search methodologies.
Recent Structure Lemmas for Depth-Two Threshold Circuits
Explore recent advancements in structure lemmas for depth-two threshold circuits, focusing on Boolean devices and their implications in computational complexity theory.
Impossibility Results for Distributed Computing I
Explore key impossibility results in distributed computing, focusing on fundamental limitations and theoretical challenges in the field.
Optimal Iterative Algorithms for Problems With Random Data
Explore advanced iterative algorithms for solving problems with random data, focusing on computational complexity in statistical inference.
Optimal Iterative Algorithms for Problems With Random Data
Explore optimal iterative algorithms for statistical problems with random data, focusing on computational complexity and efficient solutions in statistical inference.
In Search of New Algorithms Part I - Neural Networks
Explore neural networks and their role in developing new algorithms, focusing on computational complexity and statistical inference challenges.