Simons Institute Courses

Sparsifying Generalized Linear Models

Explores sparsification of sums in generalized linear models, presenting algorithms for efficient computation and applications to optimization problems like regression.

• YouTube
• 56 minutes
• Self-Paced
• Free Video

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

Explores a near-linear time algorithm for approximating k-edge-connected spanning subgraphs, improving on existing methods in both speed and accuracy for network resilience optimization.

• YouTube
• 39 minutes
• Self-Paced
• Free Video

Network Unreliability in Sub-quadratic Time

Explore a groundbreaking algorithm for estimating network disconnection probability, improving runtime from n^2 to m+n^{1.5} and overcoming previous limitations in min-cut enumeration.

• YouTube
• 59 minutes
• Self-Paced
• Free Video

Short-Flat Decompositions and Faster Algorithms for Linear Inverse Problems

Explore algorithmic applications of short-flat decompositions in solving undercomplete linear inverse problems, with focus on sparse recovery and low-rank matrix completion techniques.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

Nash Social Welfare and A Tale of Mathematical Programs

Explore determinant maximization, its applications in machine learning and game theory, and techniques like matroid intersection methods for solving this abstract problem.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

IPM and Nested Dissection for Planar and Separable LPs

Exploring efficient LP solvers using nested dissection in IPM framework for planar min-cost flow, multicommodity flow, low treewidth LPs, and separable LPs. Focuses on optimization techniques and algorithm design.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Randomized Linear Algebra for Interior Point Methods

Explore randomized linear algebra techniques for efficient interior point methods in linear programming, focusing on applications in data science and scientific computing.

• YouTube
• 27 minutes
• Self-Paced
• Free Video

Robust Gradient Descent - Agnostically Estimating an Unknown Affine Transformation

Polynomial-time algorithm for robust learning of unknown affine transformations in ICA, achieving optimal TV-distance recovery guarantees using Robust Gradient Descent and a new geometric certificate.

• YouTube
• 51 minutes
• Self-Paced
• Free Video

Towards Interpretable Data Science

Explore holistic approaches to interpretable data science, focusing on counterfactual and attribution-based explanations for complex data processing and decision support systems.

• YouTube
• 33 minutes
• Self-Paced
• Free Video

Achieving Understandability and Privacy With Provenance-Based Explanations

Explore provenance-based explanations for query results, addressing challenges of complexity and privacy. Learn techniques for generating natural language explanations and ensuring query confidentiality.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

Towards Interpretable Data Science

Explore holistic approaches to interpretable data science, focusing on counterfactual and attribution-based explanations for complex data processing and decision support systems.

• YouTube
• 35 minutes
• Self-Paced
• Free Video

Complementarities and Externalities

Explore new approaches to overcome challenges in economic environments with indivisible goods, focusing on approximating resource constraints when preferences exhibit complementarities.

• YouTube
• 44 minutes
• Self-Paced
• Free Video

Stability in Trading Networks

Explores trail-stability in trading networks, proving existence under full substitutability and discussing NP-hardness of stable outcome existence and verification.

• YouTube
• 42 minutes
• Self-Paced
• Free Video

High Dimensional Calibration for Rational Decision Making

Explore statistical forecasts in high-dimensional settings, focusing on properties that incentivize rational decision-making and efficient algorithms for strategic environments.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

LP-Duality and the Cores of Games

Explore LP-duality's role in game theory, focusing on new matching-based games, extended core concepts, and approximate cores for general graph matching games. Gain insights into algorithmic fairness and game theory applications.

• YouTube
• 45 minutes
• Self-Paced
• Free Video