Related papers: Computability of Probability Distributions and Cha…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
In this chapter, we explore how (Type-2) computable distributions can be used to give both (algorithmic) sampling and distributional semantics to probabilistic programs with continuous distributions. Towards this end, we sketch an encoding…
In the probability theory \emph{selfdecomposable, or class $L_0$ distributions} play an important role as they are limiting distributions of normalized partial sums of sequences of independent, not necessarily identically distributed,…
We study discrete probabilistic programs with potentially unbounded looping behaviors over an infinite state space. We present, to the best of our knowledge, the first decidability result for the problem of determining whether such a…
The Glivenko-Cantelli theorem states that the empirical distribution function converges uniformly almost surely to the theoretical distribution for a random variable $X \in \mathbb{R}$. This is an important result because it establishes the…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
We show that $z\in\R^n$ is computably random if and only if every computable monotone function on $\R^n$ is differentiable at $z$.
Probabilistic graphical models are a powerful concept for modeling high-dimensional distributions. Besides modeling distributions, probabilistic graphical models also provide an elegant framework for performing statistical inference;…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…
This paper studies the probabilistic function approximation problem over reproducing kernel Hilbert spaces. We show the existence and uniqueness of the optimizer under mild assumptions. Furthermore, we generalize the celebrated representer…
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)…
A space is functionally countable if every real-valued continuous function has countable image. A stronger property recently defined by Tkachuk is exponentially separability. We start by studying these properties in GO spaces, where we…
We describe a method to perform functional operations on probability distributions of random variables. The method uses reproducing kernel Hilbert space representations of probability distributions, and it is applicable to all operations…
In many real-world scenarios, it is crucial to be able to reliably and efficiently reason under uncertainty while capturing complex relationships in data. Probabilistic circuits (PCs), a prominent family of tractable probabilistic models,…
We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…
The aim of this note is to prove the inversion formula, which can be used to compute the Levi measure of an infinitely divisible distribution from its characteristic function. Obtained formula is similar to the well-known inversion formula…