
Explore efficient techniques for constructing reduced models of parametric/random PDEs, focusing on error estimation, library construction, and practical applications in thermal systems and state estimation.

Explore eigenvalue gaps, continuous walks, and perfect state transfer in algebraic graph theory, with applications to quantum information and oriented graphs.

Explore the theory, software, and impact of HiGHS optimization solver, covering simplex methods, hyper-sparsity, parallel solutions, and performance across various problem types.

Explore reconfiguration of Hamiltonian paths in grid graphs, focusing on algorithms, mechanisms, and structures for path transformation using switch pairs and zipping techniques.

Innovative approaches to scale human intelligence and education in the era of AI, drawing from game theory and real-world problem-solving experiences across mathematics, pandemic control, and live math education.

Explore recent progress on the sunflower conjecture, examining structure vs pseudo-randomness and connections to DNF simplification under random restrictions.

Explore high-dimensional expanders, their applications in error-correcting codes, and the motivations behind this emerging field of mathematics and computer science.

Explore last-iterate convergence in constrained min-max optimization using Sum of Squares (SOS) techniques, with insights from Yale's Yang Cai on adversarial approaches in machine learning.

Explore advanced techniques in matrix multiplication, including the refined Laser method, to enhance computational efficiency and speed in mathematical operations.

Explore advanced techniques for approximating the Ising partition function, focusing on deterministic methods and their applications in statistical physics and computational complexity.

Explore X-Ramanujan graphs and their applications in computer science, focusing on advanced concepts beyond randomized rounding and the probabilistic method in graph theory.

Explore advanced concepts in arithmetic geometry, focusing on effective methods and their applications in number theory and algebraic geometry.

Explore advanced techniques for robust sparse regression in high-dimensional data, focusing on sublinear algorithms and nearest-neighbor search methods.

Explore advanced techniques for outlier-robust regression, focusing on efficient algorithms and their applications in high-dimensional statistics and machine learning.

Explore approximate message passing techniques for statistical inference and estimation, focusing on applications in machine learning and data analysis.

Explore stochastic differential mean-field games in this advanced lecture, delving into mathematical models for large-scale strategic interactions and their applications in various complex systems.

Explore modified logarithmic Sobolev inequalities in this theoretical lecture by Prasad Tetali, part of a program on advances in applied probability covering high-dimensional computation and limit theorems.

Exploring cohomological methods to quantify statistical interactions in datasets, linking information theory, statistical physics, and machine learning for improved data analysis and interpretation.

Explore data-driven torsion coordinates in finite Lens spaces, LPCA dimensionality reduction, and Wasserstein stability for topological data analysis and nonlinear dimensionality reduction.

Explores algorithms for splitting images into convex polygons using topological persistence, including Convex Constrained Mesh and Persistent Resolution-Independent Mesh for edge detection.

Explore two models of random simplicial complexes extending the Erdos-Renyi model, examining their Alexander duality relation and the unique infinite Rado simplicial complex.