Complete university courses recorded at UC Berkeley / Simons Institute.
Interdisciplinary research sequence at the interface of economics, causal inference, and algorithmic decision-making, studying performative prediction, strategic classification, and mechanism design.
Simons Institute research symposium investigating the algorithmic and complexity-theoretic foundations of non-convex optimization, overparameterized generalization, and statistical-computational gaps.
Self-contained seminars, public lectures, and invited talks.
Sebastian Cioaba presents a proof of Kolokolnikov's conjecture on maximizing algebraic connectivity for graphs of given order and size, detailing the result f(n,2n-4)=2 for n>3. The talk also examines the failure of a similar conjecture for f(n,3(n-3)) and related work on regular graphs.
This lecture surveys recent advances in high-dimensional convex geometry and probability, focusing on how convexity assumptions yield concentration of measure phenomena. Key results discussed include the resolution of Bourgain’s slicing problem and the Variance Conjecture, alongside progress on the isoperimetric problem for high-dimensional convex bodies.
This talk explores the relationship between extremal Steklov eigenvalues of compact surfaces and the construction of free boundary minimal immersions into the unit ball. It details computational methods for deriving genus zero and genus one surfaces, connecting these concepts to analogous problems in graph theory.
Yuval Ishai explores the fundamental efficiency limits of secure computation, examining methods for cost minimization and their implications for the design of low-complexity cryptographic primitives. The discussion includes practical applications in cloud computing environments.
This research seminar investigates the application of the Bethe-Hessian matrix for community detection in sparse networks. It presents a rigorous analysis of the Bethe-Hessian spectral method within the stochastic block model, contrasting it with the non-backtracking operator.
This talk investigates the spectra of Sturmian Schrödinger operators on aperiodic discrete and metric graphs. It explores the integrated density of states (IDS) and applies gap labeling theory to explicitly determine the appearance and absence of spectral gaps.
Browse every recorded lecture from UC Berkeley / Simons Institute.
