Mon, 19 Jun 2023

14:00 - 15:00
Lecture Room 6

ScreeNOT: Optimal Singular Value Thresholding and Principal Component Selection in Correlated Noise

Elad Romanov
Abstract

Principal Component Analysis (PCA) is a fundamental and ubiquitous tool in statistics and data analysis.
The bare-bones idea is this. Given a data set of n points y_1, ..., y_n, form their sample covariance S. Eigenvectors corresponding to large eigenvalues--namely directions along which the variation within the data set is large--are usually thought of as "important"  or "signal-bearing"; in contrast, weak directions are often interpreted as "noise", and discarded along the proceeding steps of the data analysis pipeline. Principal component (PC) selection is an important methodological question: how large should an eigenvalue be so as to be considered "informative"?
Our main deliverable is ScreeNOT: a novel, mathematically-grounded procedure for PC selection. It is intended as a fully algorithmic replacement for the heuristic and somewhat vaguely-defined procedures that practitioners often use--for example the popular "scree test".
Towards tackling PC selection systematically, we model the data matrix as a low-rank signal plus noise matrix Y = X + Z; accordingly, PC selection is cast as an estimation problem for the unknown low-rank signal matrix X, with the class of permissible estimators being singular value thresholding rules. We consider a formulation of the problem under the spiked model. This asymptotic setting captures some important qualitative features observed across numerous real-world data sets: most of the singular values of Y are arranged neatly in a "bulk", with very few large outlying singular values exceeding the bulk edge. We propose an adaptive algorithm that, given a data matrix, finds the optimal truncation threshold in a data-driven manner under essentially arbitrary noise conditions: we only require that Z has a compactly supported limiting spectral distribution--which may be a priori unknown. Under the spiked model, our algorithm is shown to have rather strong oracle optimality properties: not only does it attain the best error asymptotically, but it also achieves (w.h.p.) the best error--compared to all alternative thresholds--at finite n.

This is joint work with Matan Gavish (Hebrew University of Jerusalem) and David Donoho (Stanford). 

Mon, 19 Jun 2023
13:00
L3

Evaluating one-loop string amplitudes

Sebastian Mizera
(IAS)
Abstract

Scattering amplitudes in string theory are written as formal integrals of correlations functions over the moduli space of punctured Riemann surfaces. It's well-known, albeit not often emphasized, that this prescription is only approximately correct because of the ambiguities in defining the integration domain. In this talk, we propose a resolution of this problem for one-loop open-string amplitudes and present their first evaluation at finite energy and scattering angle. Our method involves a deformation of the integration contour over the modular parameter to a fractal contour introduced by Rademacher in the context of analytic number theory. This procedure leads to explicit and practical formulas for the one-loop planar and non-planar type-I superstring four-point amplitudes, amenable to numerical evaluation. We plot the amplitudes as a function of the Mandelstam invariants and directly verify long-standing conjectures about their behavior at high energies.

Mon, 12 Jun 2023
17:15
L3

Evaluating one-loop string amplitudes

Sebastian Mizera
(IAS)
Abstract

Scattering amplitudes in string theory are written as formal integrals of correlations functions over the moduli space of punctured Riemann surfaces. It's well-known, albeit not often emphasized, that this prescription is only approximately correct because of the ambiguities in defining the integration domain. In this talk, we propose a resolution of this problem for one-loop open-string amplitudes and present their first evaluation at finite energy and scattering angle. Our method involves a deformation of the integration contour over the modular parameter to a fractal contour introduced by Rademacher in the context of analytic number theory. This procedure leads to explicit and practical formulas for the one-loop planar and non-planar type-I superstring four-point amplitudes, amenable to numerical evaluation. We plot the amplitudes as a function of the Mandelstam invariants and directly verify long-standing conjectures about their behavior at high energies.

Multilevel Monte Carlo Methods
Giles, M Monte Carlo and Quasi-Monte Carlo Methods 2012 volume 65 83-103 (08 Nov 2013)
On a class of nonlocal continuity equations on graphs
Esposito, A Patacchini, F Schlichting, A European Journal of Applied Mathematics volume 35 issue 1 109-126 (17 May 2023)
An Arithmetic Regularity Lemma, An Associated Counting Lemma, and Applications
Green, B Tao, T An Irregular Mind volume 21 261-334 (2010)
Inferring the Composition of a Trader Population in a Financial Market
Gupta, N Hauser, R Johnson, N Econophysics of Markets and Business Networks 99-113 (2007)
The development of deep-ocean anoxia in a comprehensive ocean phosphorus model.
Donohue, J Florio, B Fowler, A GEM : international journal on geomathematics volume 14 issue 1 12 (30 Jan 2023)
Graph-to-local limit for the nonlocal interaction equation
Esposito, A Heinze, G Schlichting, A (06 Jun 2023)
A multiscale framework for unsteady conjugate heat transfer with turbulence resolving methods - with application to rotating cavities
Hickling, T He, L International Journal of Heat and Fluid Flow volume 103 (28 Jun 2023)
Subscribe to