Michal Pilipczuk: Introduction to Parameterized Algorithms, Lecture II
Explore parameterized complexity, focusing on LP-related methods. Learn branching, color coding, kernelization, and dynamic programming techniques for algorithm design and optimization.
Approximation Algorithms for Hard Augmentation Problems
Explore advanced network design techniques for increasing graph connectivity, focusing on augmentation problems and recent developments in combinatorial optimization.
Computational Complexity in Theory and in Practice by Richard M. Karp
Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.
Standard and Less Standard Asymptotic Methods - Lecture 4
Explore advanced techniques for evaluating infinite sums and recognizing asymptotic patterns in numerical sequences, with practical examples and applications in various mathematical fields.
Dual Principal Component Pursuit
Explore a novel approach to learning subspaces from corrupted data, tolerating high outlier ratios and dimensions. Discover algorithms and theoretical guarantees for this non-convex optimization problem.
Polynomial Time Guarantees for the Burer-Monteiro Method
Explore polynomial time guarantees for the Burer-Monteiro method in solving large-scale semidefinite programs, focusing on smoothed analysis and its implications for optimization algorithms.
Frequently Bought Together Recommendations Using Embeddings - Challenges and Solutions
Explore embedding-based "frequently bought together" recommendations for e-commerce, covering model training, productionization, metrics, and serving strategies. Learn practical tips for large-scale implementation.
Gradient Descent and Stochastic Gradient Descent
Explore gradient descent and stochastic gradient descent in deep neural networks, covering convergence rates, learning rate effects, and challenges in optimization algorithms.
Diffusion Models - Paper Explanation - Math Explained
Comprehensive explanation of diffusion models, covering theory, architecture, math derivation, algorithms, improvements, and results. Includes comparisons to other methods and references to state-of-the-art applications.
Statistical Learning Theory and Applications - Class 16
Explore statistical learning theory, focusing on complexity, dual norm equality, and calligraphic G. Gain insights into advanced concepts and their applications in machine learning.
2019 ADSI Summer Workshop- Algorithmic Foundations of Learning and Control
Explore advanced techniques in reinforcement learning, focusing on randomized value functions and their applications in exploration strategies for complex decision-making problems.
Deep Learning I - Joan Bruna NYU
Explore supervised learning, empirical risk, and fundamental theorems in deep learning with NYU professor Joan Bruna's comprehensive lecture on neural network foundations.
Money, Circuits, Mythic Figures, and More - Theory in the Allen School
Diverse theoretical computer science research: algorithms, data structures, complexity, combinatorics, and economics. Insights from UW Allen School's theory group on cutting-edge topics.
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Explore parallel algorithms for approximating undirected shortest paths using low hop emulators. Learn about innovative techniques and their applications in graph theory.
Theory Seminar - Spectral Independence in High-Dimensional Expanders, Kuikui Liu
Explore spectral independence in high-dimensional expanders and its application to the hardcore model, including rapid mixing of Glauber dynamics for generating random independent sets.
Theory Seminar - Algorithms and Hardness for Linear Algebra on Geometric Graphs, Aaron Schild
Explore algorithms and hardness for linear algebra on geometric graphs, focusing on efficient spectral graph theory and its limitations in high-dimensional spaces.
The Traveling Salesman Problem - When Good Enough Beats Perfect
Explore heuristic approaches and optimization techniques for the Traveling Salesman Problem, including nearest neighbor, greedy, Christofides, local search, simulated annealing, and ant colony optimization.
Simple Steps for Solving Dynamic Programming Problems
Learn a systematic approach to tackle dynamic programming problems, illustrated with examples like longest increasing subsequence and optimal box stacking.
Depth First Search Explained - Algorithm, Examples, and Code
Comprehensive exploration of Depth First Search algorithm, covering implementation methods, traversal types, and practical applications in graph theory.
Quad Trees for Static Spatial Acceleration - Part 1
Explore quad trees for efficient spatial partitioning and object searching, with practical implementation techniques and insights into static spatial acceleration.
Integral Images: Concept and Application in Spatial Algorithms
Learn about integral images for faster spatial partitioning and search algorithms, with a demonstration of object tracking implementation and practical coding examples.