### TBA by Bhaswar Bhattacharya

- Series
- Stochastics Seminar
- Time
- Thursday, September 12, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Bhaswar Bhattacharya – University of Pennsylvania

- You are here:
- Home
- News & Events

- Series
- Stochastics Seminar
- Time
- Thursday, September 12, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Bhaswar Bhattacharya – University of Pennsylvania

- Series
- Stochastics Seminar
- Time
- Thursday, April 25, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- March Boedihardjo – Michigan State University – boedihar@msu.edu

I will give essentially matching upper and lower bounds for the expected max-sliced 1-Wasserstein distance between a probability measure on a separable Hilbert space and its empirical distribution from n samples. A version of this result for Banach spaces will also be presented. From this, we will derive an upper bound for the expected max-sliced 2-Wasserstein distance between a symmetric probability measure on a Euclidean space and its symmetrized empirical distribution.

- Series
- Stochastics Seminar
- Time
- Thursday, April 18, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Nick Cook – Duke University – nickcook@math.duke.edu

The Fisher-KPP equation was introduced in 1937 to model the spread of an advantageous gene through a spatially distributed population. Remarkably precise information on the traveling front has been obtained via a connection with branching Brownian motion, beginning with works of McKean and Bramson in the 70s. I will discuss an extension of this probabilistic approach to the Road-Field Model: a reaction-diffusion PDE system introduced by H. Berestycki et al. to describe enhancement of biological invasions by a line of fast diffusion, such as a river or a road. Based on joint work with Amir Dembo.

- Series
- Stochastics Seminar
- Time
- Thursday, April 11, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Galyna Livshyts – Georgia Tech – glivshyts6@gatech.edu

We discuss a general scheme that allows to realize certain geometric functional inequalities as statements about convexity of some functionals, and, inspired by the work of Bobkov and Ledoux, we obtain various interesting inequalities as their realizations. For example, we draw a link between Ehrhard’s inequality and an interesting extension of Bobkov’s inequality, and several new and more general inequalities are discussed as well. In this talk we discuss a joint project with Barthe, Cordero-Erausquin and Ivanisvili, and also mention briefly some results from a joint project with Cordero-Erausquin and Rotem.

- Series
- Stochastics Seminar
- Time
- Thursday, April 4, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Christian Houdré – Georgia Institute of Technology

Weighted Poincar\'e inequalities known for various laws such as the exponential or Cauchy ones are shown to follow from the "usual" Poincar\'e inequality involving the non-local gradient. A key ingredient in showing so is a covariance representation and Hardy's inequality.

The framework under study is quite general and comprises infinitely divisible laws as well as some log-concave ones. This same covariance representation is then used to obtain quantitative concentration inequalities of exponential type, recovering in particular the Gaussian results.

Joint Work with Benjamin Arras.

- Series
- Stochastics Seminar
- Time
- Thursday, March 28, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Jason Klusowski – Princeton University

When performing regression analysis, researchers often face the challenge of selecting the best single model from a range of possibilities. Traditionally, this selection is based on criteria evaluating model goodness-of-fit and complexity, such as Akaike's AIC and Schwartz's BIC, or on the model's performance in predicting new data, assessed through cross-validation techniques. In this talk, I will show that a linear combination of a large number of these possible models can have better predictive accuracy than the best single model among them. Algorithms and theoretical guarantees will be discussed, which involve interesting connections to constrained optimization and shrinkage in statistics.

- Series
- Stochastics Seminar
- Time
- Thursday, March 14, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Jonathan Niles-Weed – New York University

We present a unified methodology for obtaining rates of estimation of optimal transport maps in general function spaces. Our assumptions are significantly weaker than those appearing in the literature: we require only that the source measure P satisfy a Poincare inequality and that the optimal map be the gradient of a smooth convex function that lies in a space whose metric entropy can be controlled. As a special case, we recover known estimation rates for Holder transport maps, but also obtain nearly sharp results in many settings not covered by prior work. For example, we provide the first statistical rates of estimation when P is the normal distribution, between log-smooth and strongly log-concave distributions, and when the transport map is given by an infinite-width shallow neural network. (joint with Vincent Divol and Aram-Alexandre Pooladian.)

- Series
- Stochastics Seminar
- Time
- Wednesday, March 6, 2024 - 13:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Benjamin McKenna – Harvard University

In recent years, the few classical results in large deviations for random matrices have been complemented by a variety of new ones, in both the math and physics literatures, whose proofs leverage connections with Harish-Chandra/Itzykson/Zuber integrals. We present one such result, focusing on extreme eigenvalues of deformed sample-covariance and Wigner random matrices. This confirms recent formulas of Maillard (2020) in the physics literature, precisely locating a transition point whose analogue in non-deformed models is not yet fully understood. Joint work with Jonathan Husson.

- Series
- Stochastics Seminar
- Time
- Thursday, February 29, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Debankur Mukherjee – Georgia Tech

Large-scale parallel-processing infrastructures such as data centers and cloud networks form the cornerstone of the modern digital environment. Central to their efficiency are resource management policies, especially load balancing algorithms (LBAs), which are crucial for meeting stringent delay requirements of tasks. A contemporary challenge in designing LBAs for today's data centers is navigating data locality constraints that dictate which tasks are assigned to which servers. These constraints can be naturally modeled as a bipartite graph between servers and various task types. Most LBA heuristics lean on the mean-field approximation's accuracy. However, the non-exchangeability among servers induced by the data locality invalidates this mean-field framework, causing real-world system behaviors to significantly diverge from theoretical predictions. From a foundational standpoint, advancing our understanding in this domain demands the study of stochastic processes on large graphs, thus needing fundamental advancements in classical analytical tools.

In this presentation, we will delve into recent advancements made in extending the accuracy of mean-field approximation for a broad class of graphs. In particular, we will talk about how to design resource-efficient, asymptotically optimal data locality constraints and how the system behavior changes fundamentally, depending on whether the above bipartite graph is an expander, a spatial graph, or is inhomogeneous in nature.

- Series
- Stochastics Seminar
- Time
- Thursday, February 15, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Zhou Fan – Yale University

Empirical Bayes provides a powerful approach to learning and adapting to latent structure in data. Theory and algorithms for empirical Bayes have a rich literature for sequence models, but are less understood in settings where latent variables and data interact through more complex designs.

In this work, we study empirical Bayes estimation of an i.i.d. prior in Bayesian linear models, via the nonparametric maximum likelihood estimator (NPMLE). We introduce and study a system of gradient flow equations for optimizing the marginal log-likelihood, jointly over the prior and posterior measures in its Gibbs variational representation using a smoothed reparametrization of the regression coefficients. A diffusion-based implementation yields a Langevin dynamics MCEM algorithm, where the prior law evolves continuously over time to optimize a sequence-model log-likelihood defined by the coordinates of the current Langevin iterate.

We show consistency of the NPMLE under mild conditions, including settings of random sub-Gaussian designs under high-dimensional asymptotics. In high noise, we prove a uniform log-Sobolev inequality for the mixing of Langevin dynamics, for possibly misspecified priors and non-log-concave posteriors. We then establish polynomial-time convergence of the joint gradient flow to a near-NPMLE if the marginal negative log-likelihood is convex in a sub-level set of the initialization.

This is joint work with Leying Guan, Yandi Shen, and Yihong Wu.