Learning From Passive Data Explained
Explore reinforcement learning algorithm using passive data to learn without direct interaction, based on successor features. Covers offline RL, algorithm details, results, and critical analysis.
PCPs and Global Hyper-contractivity - Lecture 3
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
Separating Quantum from Classical with K-Fold Forrelation and Friends
Explore quantum-classical separations through k-fold Forrelation, examining l1-Fourier growth and pathwise analysis to understand algorithmic differences and their broader implications in computing.
Linearity Testing Over the Biased Cube
Explores linearity testing in p-biased settings, presenting a 4-query test with optimal soundness. Discusses structural results and direct product tests for functions correlated to linear functions under random restrictions.
Coding Adventure - Making a Stronger Chess Engine
Explore techniques to enhance a chess engine, including move selection, search extensions, bitboards, and optimization, culminating in the creation of a Lichess bot and performance analysis.
Parallel Discrete Sampling via Continuous Walks
Explore innovative techniques for sampling discrete distributions using continuous walks, with applications in determinantal point processes and directed Eulerian tours.
Unique Games and Expansion
Explore algorithms for Unique Games on certifiable small-set expanders and graphs with certifiable global hypercontractivity, providing insights into the 2-2 Games hardness result.
Explicit SoS Lower Bounds from Small-Set High Dimensional Expanders
Explores explicit CSPs hard for Sum-of-Squares hierarchy using small-set high dimensional expanders, introducing new isoperimetric inequality for Square Cayley Complexes to construct optimally hard XOR-families.
Are These the Only Square Fibonacci Numbers?
Explore the intriguing connection between Fibonacci numbers and perfect squares, examining which Fibonacci numbers are also square numbers and the mathematical reasoning behind this phenomenon.
PCPs and Global Hyper-contractivity - Lecture 2
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
PCPs and Global Hyper-contractivity - Lecture 1
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
Binary Trees Tutorial - Introduction, Traversals, Implementation
Comprehensive tutorial on binary trees covering fundamentals, implementation, and traversals. Ideal for DSA interview preparation, with hands-on coding examples and in-depth explanations.
RWKV- Reinventing RNNs for the Transformer Era
Explore RWKV, a novel architecture combining Transformer and RNN strengths. Learn about its linear attention mechanism, scalability, and performance in NLP tasks.
Fine-Grained Complexity 2 - Advanced Concepts and Applications
Explore advanced concepts in fine-grained complexity theory, focusing on algorithmic challenges and computational limits in database theory and AI applications.
Fine-Grained Complexity - Lecture 1
Explore cutting-edge research in fine-grained complexity theory with MIT expert Virginia Vassilevska Williams, delving into advanced algorithmic concepts and their applications.
Logic and Probabilistic Circuits - Lecture 4
Explore advanced concepts in logic and probabilistic circuits, focusing on their applications in database theory and artificial intelligence.
Logic and Probabilistic Circuits - Part 3
Explore advanced concepts in logic and probabilistic circuits, focusing on their applications in database theory and AI algorithms.
Graph Data Structures - Part 2
Explore advanced graph data structures and optimization techniques for designing efficient algorithms in this in-depth lecture by Thatchaphol Saranurak.
Conditional Hardness and Fine-grained Complexity
Explore advanced concepts in computational complexity, focusing on conditional hardness and fine-grained analysis of algorithms for deeper understanding of efficiency limits.
Graph Data Structures Part 3
Explore advanced graph data structures and optimization techniques for designing efficient algorithms, presented by Thatchaphol Saranurak from the University of Michigan.
Fine-Grained Complexity - Lecture 4
Explore advanced concepts in fine-grained complexity theory, focusing on algorithmic challenges and their implications for database theory and AI applications.