Probability Seminar: Difference between revisions

From DEV UW-Math Wiki
Jump to navigation Jump to search
Hshen3 (talk | contribs)
 
(282 intermediate revisions by 13 users not shown)
Line 1: Line 1:
__NOTOC__
__NOTOC__
[[Probability | Back to Probability Group]]


= Fall 2020 =
* '''When''': Thursdays at 2:30 pm
* '''Where''': 901 Van Vleck Hall
* '''Organizers''': Hongchang Ji, Ander Aguirre, Hai-Xiao Wang
* '''To join the probability seminar mailing list:''' email probsem+subscribe@g-groups.wisc.edu.
* '''To subscribe seminar lunch announcements:''' email lunchwithprobsemspeaker+subscribe@g-groups.wisc.edu


<b>Thursdays in 901 Van Vleck Hall at 2:30 PM</b>, unless otherwise noted.
[[Past Seminars]]
<b>We  usually end for questions at 3:20 PM.</b>


<b> IMPORTANT: </b> In Fall 2020 the seminar is being run online.
== Fall 2025 ==


If you would like to sign up for the email list to receive seminar announcements then please join [https://groups.google.com/a/g-groups.wisc.edu/forum/#!forum/probsem our group].
<b>Thursdays at 2:30 PM either in 901 Van Vleck Hall or on Zoom</b>
== September 17, 2020, [https://www.math.tamu.edu/~bhanin/ Boris Hanin] (Princeton and Texas A&M) ==


'''Pre-Talk:'''
We usually end for questions at 3:20 PM.


Title: '''Neural Networks for Probabilists''' 
== September 4, 2025: No seminar ==


Abstract: Deep neural networks are a centerpiece in modern machine learning. They are also fascinating probabilistic models, about which much remains unclear. In this pre-talk I will define neural networks, explain how they are used in practice, and give a survey of the big theoretical questions they have raised. If time permits, I will also explain how neural networks are related to a variety of classical areas in probability and mathematical physics, including random matrix theory, optimal transport, and combinatorics of hyperplane arrangements.
== September 11, 2025: David Renfrew (Binghamton U.) ==


'''Talk:'''


Title: '''Effective Theory of Deep Neural Networks'''  
'''Singularities in the spectrum of random block matrices'''


Abstract: Deep neural networks are often considered to be complicated "black boxes," for which a full systematic analysis is not only out of reach but also impossible. In this talk, which is based on ongoing joint work with Sho Yaida and Daniel Adam Roberts, I will make the opposite claim. Namely, that deep neural networks with random weights and biases are exactly solvable models. Our approach applies to networks at finite width n and large depth L, the regime in which they are used in practice. A key point will be the emergence of a notion of "criticality," which involves a finetuning of model parameters (weight and bias variances). At criticality, neural networks are particularly well-behaved but still exhibit a tension between large values for n and L, with large values of n tending to make neural networks more like Gaussian processes and large values of L amplifying higher cumulants. Our analysis at initialization has many consequences also for networks during after training, which I will discuss if time permits.
We consider the density of states of structured Hermitian and non-Hermitian random matrices with a variance profile. As the dimension tends to infinity the associated eigenvalue density can develop a singularity at the origin. The severity of this singularity depends on the relative positions of the zero submatrices. We provide a classification of all possible singularities and determine the exponent in the density blow-up.


== September 23, 2020, [https://people.ucd.ie/neil.oconnell Neil O'Connell] (Dublin) ==
== September 18, 2025: JE Paguyo (McMaster U.) ==
'''Asymptotic behavior of the hierarchical Pitman-Yor and Dirichlet processes'''


The Pitman-Yor process is a discrete random measure specified by a concentration parameter, discount parameter, and base distribution, and is used as a fundamental prior in Bayesian nonparametrics. The hierarchical Pitman-Yor process (HPYP) is a generalization obtained by randomizing the base distribution through a draw from another Pitman-Yor process. It is motivated by the study of groups of clustered data, where the group specific Pitman-Yor processes are linked through an intergroup Pitman-Yor process. Setting both discount parameters to zero recovers the celebrated hierarchical Dirichlet process (HDP), first introduced by Teh et al.
In this talk, we discuss our recent work on the asymptotic behavior of the HPYP and HDP. First, we establish limit theorems associated with the power sum symmetric polynomials for the vector of weights of the HDP as the concentration parameters tend to infinity. These objects are related to the homozygosity in population genetics, the Simpson diversity index in ecology, and the Herfindahl-Hirschman index in economics. Second, we consider a random sample of size $N$ from a population whose type distribution is given by the vector of weights of the HPYP and study the large $N$ asymptotic behavior of the number of clusters in the sample. Our approach relies on a random sample size representation of the number of clusters through the corresponding non-hierarchical process. This talk is based on joint work with Stefano Favaro and Shui Feng.


== October 1, 2020, [https://marcusmichelen.org/ Marcus Michelen], [https://mscs.uic.edu/ UIC] ==
== September 25, 2025: Chris Janjigian (Purdue U.) ==


Title: '''Roots of random polynomials near the unit circle'''
== October 2, 2025: Elliot Paquette (McGill U.) ==


Abstract: It is a well-known (but perhaps surprising) fact that a polynomial with independent random coefficients has most of its roots very close to the unit circle.  Using a probabilistic perspective, we understand the behavior of roots of random polynomials exceptionally close to the unit circle and prove several limit theorems; these results resolve several conjectures of Shepp and Vanderbei.  We will also discuss how our techniques provide a heuristic, probabilistic explanation for why random polynomials tend to have most roots near the unit circle.  Based on joint work with Julian Sahasrabudhe.
== October 9, 2025: No seminar (Midwest Probability Colloquium) ==


== October 8, 2020, [http://sites.harvard.edu/~sus977/index.html Subhabrata Sen], [https://statistics.fas.harvard.edu/ Harvard] ==
== October 16, 2025: Zachary Selk (Florida State U.) ==


Title: '''TBA'''
'''<br />On the Onsager-Machlup Function for the \Phi^4 Measure'''


Abstract: TBA
The \Phi^4 measure is a measure arising in effective quantum field theory as arguably the simplest example of a nontrivial QFT, modelling the self-interaction of a single scalar quantum field. This measure can be constructed through a procedure known as stochastic quantization. Stochastic quantization seeks to construct a measure on an infinite dimensional space with a given Gibbs-type ``density function" as the invariant measure of a stochastic PDE, in analogy with Langevin dynamics of stochastic ODEs. Both the \Phi^4 measure and its associated stochastic quantization PDE involve nonlinearities of distributions, necessitating renormalization procedures via tools like Wick calculus, regularity structures or paracontrolled calculus. Although the \Phi^4 measure has been constructed in dimensions 1,2 and 3, the question of whether these measures have the desired ``density function" remains open. Although in infinite dimensions, density functions are typically thought to not exist as there is no reference Lebesgue measure, there is a notion of a probability density function that extends to infinite dimensions called the Onsager-Machlup (OM) functional. One pathology of OM theory is that different metrics can lead to different OM functionals, or OM functionals can fail to exist under reasonable metrics. In a joint work with Ioannis Gasteratos (TU Berlin), we study the OM functional for the \Phi^4 measure. In dimension 1, the OM functional is what is desired under naive choices of metrics. In dimension 2, the OM functional is what is desired if we choose a metric analogous to the rough paths metric. In dimension 3, naive approaches don't work and the situation is complicated.


== November 12, 2020, [http://stanford.edu/~ajdunl2/ Alexander Dunlap], [https://cims.nyu.edu/ NYU Courant Institute] ==


Title: '''TBA'''
==October 23, 2025: Alex Dunlap (Duke U.)==


Abstract: TBA
==October 30, 2025: Ander Aguirre (UW-Madison)==


'''Edgeworth expansion and random polynomials'''


[[Past Seminars]]
==November 6, 2025: Sudeshna Bhattacharjee (Indian Institute of Science)==
 
== November 13, 2025: Jiaoyang Huang (U. Penn) ==

Latest revision as of 01:17, 2 September 2025

Back to Probability Group

  • When: Thursdays at 2:30 pm
  • Where: 901 Van Vleck Hall
  • Organizers: Hongchang Ji, Ander Aguirre, Hai-Xiao Wang
  • To join the probability seminar mailing list: email probsem+subscribe@g-groups.wisc.edu.
  • To subscribe seminar lunch announcements: email lunchwithprobsemspeaker+subscribe@g-groups.wisc.edu

Past Seminars

Fall 2025

Thursdays at 2:30 PM either in 901 Van Vleck Hall or on Zoom

We usually end for questions at 3:20 PM.

September 4, 2025: No seminar

September 11, 2025: David Renfrew (Binghamton U.)

Singularities in the spectrum of random block matrices

We consider the density of states of structured Hermitian and non-Hermitian random matrices with a variance profile. As the dimension tends to infinity the associated eigenvalue density can develop a singularity at the origin. The severity of this singularity depends on the relative positions of the zero submatrices. We provide a classification of all possible singularities and determine the exponent in the density blow-up.

September 18, 2025: JE Paguyo (McMaster U.)

Asymptotic behavior of the hierarchical Pitman-Yor and Dirichlet processes

The Pitman-Yor process is a discrete random measure specified by a concentration parameter, discount parameter, and base distribution, and is used as a fundamental prior in Bayesian nonparametrics. The hierarchical Pitman-Yor process (HPYP) is a generalization obtained by randomizing the base distribution through a draw from another Pitman-Yor process. It is motivated by the study of groups of clustered data, where the group specific Pitman-Yor processes are linked through an intergroup Pitman-Yor process. Setting both discount parameters to zero recovers the celebrated hierarchical Dirichlet process (HDP), first introduced by Teh et al. In this talk, we discuss our recent work on the asymptotic behavior of the HPYP and HDP. First, we establish limit theorems associated with the power sum symmetric polynomials for the vector of weights of the HDP as the concentration parameters tend to infinity. These objects are related to the homozygosity in population genetics, the Simpson diversity index in ecology, and the Herfindahl-Hirschman index in economics. Second, we consider a random sample of size $N$ from a population whose type distribution is given by the vector of weights of the HPYP and study the large $N$ asymptotic behavior of the number of clusters in the sample. Our approach relies on a random sample size representation of the number of clusters through the corresponding non-hierarchical process. This talk is based on joint work with Stefano Favaro and Shui Feng.

September 25, 2025: Chris Janjigian (Purdue U.)

October 2, 2025: Elliot Paquette (McGill U.)

October 9, 2025: No seminar (Midwest Probability Colloquium)

October 16, 2025: Zachary Selk (Florida State U.)


On the Onsager-Machlup Function for the \Phi^4 Measure

The \Phi^4 measure is a measure arising in effective quantum field theory as arguably the simplest example of a nontrivial QFT, modelling the self-interaction of a single scalar quantum field. This measure can be constructed through a procedure known as stochastic quantization. Stochastic quantization seeks to construct a measure on an infinite dimensional space with a given Gibbs-type ``density function" as the invariant measure of a stochastic PDE, in analogy with Langevin dynamics of stochastic ODEs. Both the \Phi^4 measure and its associated stochastic quantization PDE involve nonlinearities of distributions, necessitating renormalization procedures via tools like Wick calculus, regularity structures or paracontrolled calculus. Although the \Phi^4 measure has been constructed in dimensions 1,2 and 3, the question of whether these measures have the desired ``density function" remains open. Although in infinite dimensions, density functions are typically thought to not exist as there is no reference Lebesgue measure, there is a notion of a probability density function that extends to infinite dimensions called the Onsager-Machlup (OM) functional. One pathology of OM theory is that different metrics can lead to different OM functionals, or OM functionals can fail to exist under reasonable metrics. In a joint work with Ioannis Gasteratos (TU Berlin), we study the OM functional for the \Phi^4 measure. In dimension 1, the OM functional is what is desired under naive choices of metrics. In dimension 2, the OM functional is what is desired if we choose a metric analogous to the rough paths metric. In dimension 3, naive approaches don't work and the situation is complicated.


October 23, 2025: Alex Dunlap (Duke U.)

October 30, 2025: Ander Aguirre (UW-Madison)

Edgeworth expansion and random polynomials

November 6, 2025: Sudeshna Bhattacharjee (Indian Institute of Science)

November 13, 2025: Jiaoyang Huang (U. Penn)