Lectures related to Coin Change Problem

Explores the integrality gap concept in set cover and multiplicative weights algorithms.

Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.

Multi-arm Bandits

Discusses algorithms for balancing exploration and exploitation in decision-making processes.

Algorithms: Summary of the week

Covers algorithms for searching, sorting, optimization, and the Halting Problem.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Coin Rendering: Part 1 MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Search Algorithms: Abductive Reasoning

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.

Computer Architecture: Algorithms to Programs (Compilation)

Explores the transition from algorithms to programs through compilation, emphasizing constraints and machine-understandable coding practices.

Introduction to Algorithms

Explores the ingredients and selection of algorithms for different goals.

Introduction to Algorithms: Course Overview and Basics

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

Markov Decision Processes: Foundations of Reinforcement Learning

Covers Markov Decision Processes, their structure, and their role in reinforcement learning.

Dynamic Programming: Introduction and Fibonacci Numbers

Introduces Dynamic Programming, focusing on saving computation by remembering previous calculations and applying it to solve optimization problems efficiently.

Greedy Algorithms & Matroids

Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.

Optimization: Mathematical Principles and Algorithms MOOC: Optimization: principles and algorithms - Network and discrete optimization MOOC: Optimization: principles and algorithms - Unconstrained nonlinear optimization MOOC: Optimization: principles and algorithms - Linear optimization

Covers mathematical principles and algorithms of optimization, using real-world examples and Python implementation.

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Dynamic Programming: Rod Cutting and Change Making

Explores dynamic programming through rod cutting and change making optimization problems.

Transporters: a proxy for parallel transport

Explores transporters as a practical alternative to parallel transport, discussing minimal requirements, examples with matrices, pragmatic choices, and optimization algorithms.

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Optimization Duality: Theory and Algorithms

Explores optimization duality, weak and strong duality, practical optimization algorithms, and challenges in nonconvex-concave problems.