Related papers: A Conversation with Ulf Grenander
These are lecture notes that are based on the lectures from a class I taught on the topic of Randomized Linear Algebra (RLA) at UC Berkeley during the Fall 2013 semester.
In a series of lectures given in 2003 soon after receiving the Fields Medal for his results in the Algebraic Geometry Vladimir Voevodsky (1966-2017) identifies two strategic goals for mathematics, which he plans to pursue in his further…
The approximate uniform sampling of graphs with a given degree sequence is a well-known, extensively studied problem in theoretical computer science and has significant applications, e.g., in the analysis of social networks. In this work we…
Probabilistic circuits (PCs) represent a probability distribution as a computational graph. Enforcing structural properties on these graphs guarantees that several inference scenarios become tractable. Among these properties, structured…
This in an introduction to free probability theory, covering the basic combinatorial and analytic theory, as well as the relations to random matrices and operator algebras. The material is mainly based on the two books of the lecturer, one…
This graduate textbook on machine learning tells a story of how patterns in data support predictions and consequential actions. Starting with the foundations of decision making, we cover representation, optimization, and generalization as…
This study examines long-term trends and shifting behavior in the collaboration network of mathematics literature, using a subset of data from Mathematical Reviews spanning 1985-2009. Rather than modeling the network cumulatively, this…
We transform large-scale Swedish register data into textual life trajectories to address two long-standing challenges in data analysis: high cardinality of categorical variables and inconsistencies in coding schemes over time. Leveraging…
The article is dedicated to recalling the life and mathematics of Louis Nirenberg, a distinguished Canadian mathematician who recently died in New York, where he lived. An emblematic figure of Analysis and Partial Differential Equations in…
These lecture notes are based on a set of six lectures that I gave in Edinburgh in 2008/2009 and they cover some topics in the interface between Geometry and Physics. They involve some unsolved problems and conjectures and I hope they may…
In some of his final papers, V.I. Arnold studied pseudorandomness properties of finite deterministic sequences, which he measured in terms of their "stochasticity parameter". In the present paper we illustrate the background in probability…
Scargle (2000) has discussed Rosenthal and Rubin's (1978) "fail-safe number" (FSN) method for estimating the number of unpublished studies in meta-analysis. He concluded that this FSN cannot possibly be correct because a central assumption…
Introducing and studying the pattern frequency algebra, we prove the analogue of L\"uck's approximation theorems on $L^2$-spectral invariants in the case of aperiodic order. These results imply a uniform convergence theorem for the…
This article is a review of theoretical advances in the research field of algebraic geometry and Bayesian statistics in the last two decades. Many statistical models and learning machines which contain hierarchical structures or latent…
These lecture notes aim at a post-Bachelor audience with a background at an introductory level in Applied Mathematics and Applied Statistics. They discuss the logic and methodology of the Bayes-Laplace approach to inductive statistical…
We study positional statistics for four families of pattern-avoiding permutations counted by the large Schr\"oder numbers. Specifically, we focus on the pairs of patterns {2413,3142} (separable permutations), {1324,1423}, {1423,2413}, and…
Stochastic Gradient Descent (SGD) is an important algorithm in machine learning. With constant learning rates, it is a stochastic process that, after an initial phase of convergence, generates samples from a stationary distribution. We show…
Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…
With recent advances in sensing technologies, a myriad of spatio-temporal data has been generated and recorded in smart cities. Forecasting the evolution patterns of spatio-temporal data is an important yet demanding aspect of urban…
This paper investigates the use of probabilistic neural networks (PNNs) to model aleatoric uncertainty, which refers to the inherent variability in the input-output relationships of a system, often characterized by unequal variance or…