Lectures related to Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search

Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search

Explores solving Connect Four using game theory algorithms and compares Alpha-Beta pruning with Monte-Carlo tree search.

Solving Connect Four: A-B Pruning and Monte-Carlo Tree Search

Explores solving Connect Four using game theory algorithms and compares their efficiency.

Dataflow Analysis: Optimization

Explores dataflow analysis for optimization, including equations solving, live variables, reaching definitions, and very busy expressions.

Connect Four: Game Theory Approach

Explores solving Connect Four using game theory algorithms to find optimal strategies efficiently.

Optimization algorithms

Covers optimization algorithms, focusing on Proximal Gradient Descent and its variations.

Solving Parity Games in Practice

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

Variance Reduction: Strategies and Applications

Discusses variance reduction techniques in stochastic simulation, focusing on allocation strategies and replica generation algorithms.

Multi-arm Bandits

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

Optimization Methods: Theory Discussion

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

Quasi-newton optimization

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

Building Robust Ensembles via Margin Boosting

Delves into building robust ensembles through margin boosting for improved adversarial defense in machine learning models.

Set Cover: Integrality Gap

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

Deliberative Agents: Planning and Strategies

Covers planning with adversaries, heuristic search algorithms, and strategies for games with chance, emphasizing the significance of deliberative agents.

Algorithms: Summary of the week

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

Linear Programming: Solving LPs

Covers the process of solving Linear Programs (LPs) using the simplex method.

Solving Connect Four: A-B Pruning and Monte-Carlo Tree Search

Explores solving Connect Four using game theory and algorithms optimization, comparing minimax, alpha-beta pruning, and Monte-Carlo tree search.

Optimization with Constraints: KKT Conditions

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

Code Optimization: Speeding-up Analyses

Explores techniques to speed up dataflow analyses and discusses the importance of node ordering and post-order traversal.

Optimization in Large Search Spaces: GPU-Accelerated Join Order

Explores GPU-accelerated join order optimization in large search spaces, leveraging graph topology to reduce computational overheads.

Computer Architecture: Algorithms to Programs (Compilation)

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