Related papers: Randomness and initial segment complexity for prob…

We consider a distributionally robust stochastic optimization problem and formulate it as a stochastic two-level composition optimization problem with the use of the mean--semideviation risk measure. In this setting, we consider a single…

We show that if a real $x$ is strongly Hausdorff $h$-random, where $h$ is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure $\mu$ such that the $\mu$-measure of the basic open…

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…

In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…

In this note, we develop some of the basic theory of s-finite (measures and) kernels, a little-studied class that Staton has recently argued convincingly to be precisely the semantic counterpart of (first-order) probabilistic programs. We…

This is a survey of constructive and computable measure theory with an emphasis on the close connections with algorithmic randomness. We give a brief history of constructive measure theory from Brouwer to the present, emphasizing how…

Van Lambalgen's theorem states that a pair $(\alpha,\beta)$ of bitsequences is Martin-L\"of random if and only if $\alpha$ is Martin-L\"of random and $\beta$ is Martin-L\"of random relative to $\alpha$. In [Information and Computation 209.2…

We initiate a study of the following problem: Given a continuous domain $\Omega$ along with its convex hull $\mathcal{K}$, a point $A \in \mathcal{K}$ and a prior measure $\mu$ on $\Omega$, find the probability density over $\Omega$ whose…

Let $E$ be a space of observables in a sequence of trials $\xi_n$ and define $m_n$ to be the empirical distributions of the outcomes. We discuss the almost sure convergence of the sequence $m_n$ in terms of the $\psi$-weak topology of…

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…

This paper reports, by way of introduction, on the advances made by our group and the broader signal processing community on the concept of sample abundance; a phenomenon that naturally arises in one-bit and few-bit signal processing…

We introduce a resource monotone, the completeness stability, to quantify the quality of quantum measurements within a resource-theoretic framework. By viewing a quantum measurement as a frame, the minimum eigenvalue of a frame operator…

We study the continuity equation on the metric measure space $(\mathcal{P}_p(X),W_p,Q)$, when $X$ is either the Euclidean space or a compact, oriented, and boundaryless Riemannian manifold, for some suitable reference measure $Q \in…

We study the set M(X) of full non-atomic Borel (finite or infinite) measures on a non-compact locally compact Cantor set X. For an infinite measure $\mu$ in M(X), the set $\mathfrak{M}_\mu = \{x \in X : {for any compact open set} U \ni x…

We introduce and discuss the notion of monotonicity for the complexity measures of general probability distributions, patterned after the resource theory of quantum entanglement. Then, we explore whether this property is satisfied by the…

We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…

In this paper we study the sequence of orthonormal polynomials $\{P_n(\mu; z)\}$ defined by a probability measure $\mu$ with non-polar compact support $S(\mu)\subset\mathbb C$. We show that the support of any weak* limit of the sequence of…

Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…

A marked metric measure space (mmm-space) is a triple (X,r,mu), where (X,r) is a complete and separable metric space and mu is a probability measure on XxI for some Polish space I of possible marks. We study the space of all (equivalence…

Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…