Hidden Markov Models - Parameter Estimation and Efficient Inference
Master parameter estimation and efficient inference techniques for Hidden Markov Models, exploring key algorithms and mathematical foundations for probabilistic sequence modeling and pattern recognition.
Space Complexity of Recursive Algorithms - nth Fibonacci Number
Analyze space complexity of recursive algorithms using the nth Fibonacci number as an example. Explore the Fibonacci sequence and its implementation.
Deep Learning Robustness Verification for Few-Pixel Attacks
Explore a novel L0 robustness verifier for neural networks, addressing few-pixel attacks through dynamic programming, sampling, and covering designs to enhance verification efficiency.
Model Based Reinforcement Learning - Policy Iteration, Value Iteration, and Dynamic Programming
Explore dynamic programming in model-based reinforcement learning, covering policy iteration, value iteration, and Q-learning for effective decision-making strategies.
Neural Nets for NLP 2017 - Neural Semantic Parsing
Comprehensive lecture on neural semantic parsing, covering graph-based parsing, structured training, and dynamic programming methods for phrase structure parsing. Explores advanced NLP concepts and techniques.
Neural Nets for NLP 2017 - Parsing With Dynamic Programs
Explore graph-based parsing, dynamic programming for phrase structure parsing, and neural network approaches in natural language processing. Covers algorithms, models, and practical implementations.
Neural Nets for NLP 2021 - Structured Prediction with Local Independence Assumptions
Explore structured prediction in NLP, focusing on local independence assumptions and Conditional Random Fields. Learn about sequence labeling, potential functions, and dynamic programming models.
CMU Multilingual NLP - Syntax and Parsing
Explore syntax, dependency parsing, and linguistic discovery with AutoLex. Learn about major word orders, parsing models, and tools for multilingual NLP research and applications.
Approximating Edit Distance in the Fully Dynamic Model
Explore recent advancements in dynamic algorithms for approximating edit distance, covering state-of-the-art results and open questions in this fundamental computer science problem.
Reinforcement Learning Series - Overview of Methods
Comprehensive overview of reinforcement learning methods, covering model-based and model-free approaches, from dynamic programming to deep RL and policy gradient optimization.
Solving Boggle Using AI - Dynamic Programming + Trie in Python
Learn to build an AI algorithm using dynamic programming and trie data structure to efficiently solve Boggle puzzles in Python, covering key concepts in graph theory and algorithm design.
Imputer - Sequence Modelling via Imputation and Dynamic Programming
Explore a novel sequence-to-sequence model that balances efficiency and performance using imputation and dynamic programming for faster inference in various applications.
Reinforcement Learning - Part I
Explore reinforcement learning fundamentals, including credit assignment, dynamic programming, and exploration algorithms. Gain insights into algorithm design and sample complexity in this comprehensive introduction.
Online Learning in Markov Decision Processes - Part 1
Explore online learning in Markov Decision Processes, covering theory, algorithms, and optimal strategies for reinforcement learning in dynamic environments.
Computing Gromov-Hausdorff Distances Between Ultrametric Spaces
Explore efficient algorithms for computing Gromov-Hausdorff distances between ultrametric spaces, including complexity analysis and dynamic programming approaches.
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
Explore a hybrid approach combining reinforcement learning and constraint programming for solving complex combinatorial optimization problems, with applications in various fields.
A 1.5-Approximation for Path TSP
Explores a 1.5-approximation algorithm for the Metric Path Traveling Salesman Problem, introducing novel techniques to handle larger s-t cuts and achieve a simplified approach matching Christofides' TSP algorithm.
Introduction to Parameterized Algorithms, Lecture I
Gentle introduction to parameterized complexity, focusing on basic techniques like branching, color coding, and kernelization. Explores connections to linear programming and discrete optimization.
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.
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.
A New Deterministic Algorithm for Dynamic Set Cover
Explore a novel deterministic algorithm for dynamic set cover, addressing computational challenges in real-time data processing and optimization.