Related papers: The Global Cohen-Lenstra Heuristic
This paper is about the surprising interaction of a foundational result from model theory, about stability of theories, with algorithmic stability in learning. First, in response to gaps in existing learning models, we introduce a new…
De Finetti theorems tell us that if we expect the likelihood of outcomes to be independent of their order, then these sequences of outcomes could be equivalently generated by drawing an experiment at random from a distribution, and…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…
We study uniform and non-uniform model sets in arbitrary locally compact second countable (lcsc) groups, which provide a natural generalization of uniform model sets in locally compact abelian groups as defined by Meyer and used as…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
A universal formulation of uncertainty relations for quantum measurements is presented with additional focus on the representability of quantum observables by classical observables over a given state. Owing to the simplicity and operational…
Heuristic functions are central to the performance of search algorithms such as A-star, where admissibility - the property of never overestimating the true shortest-path cost - guarantees solution optimality. Recent deep learning approaches…
We show that the popular k-means clustering algorithm (Lloyd's heuristic), used for a variety of scientific data, can result in outcomes that are unfavorable to subgroups of data (e.g., demographic groups). Such biased clusterings can have…
We consider the product of infinitely many copies of a spin-$1\over 2$ system. We construct projection operators on the corresponding nonseparable Hilbert space which measure whether the outcome of an infinite sequence of $\sigma^x$…
Hippocratic randomness is defined in a similar way to Martin-Lof randomness, however it does not assume computability of the probability and the existence of universal test is not assured. We introduce the notion of approximation of…
After a brief review of classical probability theory (measure theory), we present an observation (due to Sorkin) concerning an aspect of probability in quantum mechanics. Following Sorkin, we introduce a generalized measure theory based on…
Suppose we are given two probability measures on the set of one-way infinite finite-alphabet sequences and consider the question when one of the measures predicts the other, that is, when conditional probabilities converge (in a certain…
We introduce an abstract measure___theoretic framework that serves as a tool to rigorously study stochastic iterative global optimization algorithms as a unified class. The framework is formulated in terms of probability kernels, which, via…
One of the main concepts in quantum physics is a density matrix, which is a symmetric positive definite matrix of trace one. Finite probability distributions are a special case where the density matrix is restricted to be diagonal. Density…
Here we extend the algebro-geometric approach to free probability, started in~\cite{FMcK4,F14}, to general (non)-commutative probability theories. We show that any universal convolution product of moments of independent (non)-commutative…
It is often the case that a Selmer group of an abelian variety and a group related to an ideal class group can both be naturally embedded into the same cohomology group. One hopes to compute one from the other by finding how close each is…
TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target)…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
We consider how to define a natural probability distribution over worlds within a simple class of deterministic many-worlds theories. This can help us understand the typical properties of worlds within such states, and hence explain the…
We prove a characterization of the amenability of countable Borel equivalence relations in terms of the uniform Liouville property for group actions on their classes. Furthermore, inspired by a well-known amenability criterion for locally…