Lecture

Variance Reduction: Strategies and Applications

Related lectures (97)
Optimization algorithms
Covers optimization algorithms, focusing on Proximal Gradient Descent and its variations.
Multi-arm Bandits
Discusses algorithms for balancing exploration and exploitation in decision-making processes.
Quasi-newton optimization
Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.
Simulation & Optimization: Poisson Process & Random Numbers
Explores simulation pitfalls, random numbers, discrete & continuous distributions, and Monte-Carlo integration.
Introduction to Algorithms
Explores the ingredients and selection of algorithms for different goals.
Energy optimization strategies
Covers brainstorming options for smart operation changes, heat recovery, and PV panel performance.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Optimization with Constraints: KKT Conditions
Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.
Computer Architecture: Algorithms to Programs (Compilation)
Explores the transition from algorithms to programs through compilation, emphasizing constraints and machine-understandable coding practices.
Set Cover: Integrality Gap
Explores the integrality gap concept in set cover and multiplicative weights algorithms.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.