Related papers: A Randomized Algorithm to Reduce the Support of Di…
This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a…
Improvement of statistical learning models in order to increase efficiency in solving classification or regression problems is still a goal pursued by the scientific community. In this way, the support vector machine model is one of the…
A formalism is presented for analytically obtaining the probability density function, (P_{n}(s)), for the random distance (s) between two random points in an (n)-dimensional spherical object of radius (R). Our formalism allows (P_{n}(s)) to…
A new method for measuring chance-coincidence backgrounds during the collection of coincidence data is presented. The method relies on acquiring data with near-zero dead time, which is now realistic due to the increasing deployment of flash…
In this paper we propose a method to construct probability measures on the space of convex bodies with a given pushforward distribution. Concretely we show that there is a measure on the metric space of centrally symmetric convex bodies,…
Given $n$ independent random marked $d$-vectors $X_i$ with a common density, define the measure $\nu_n = \sum_i \xi_i $, where $\xi_i$ is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near…
In Bayesian nonparametric inference, random discrete probability measures are commonly used as priors within hierarchical mixture models for density estimation and for inference on the clustering of the data. Recently, it has been shown…
We consider the problem of estimating the number of distinct elements in a large data set (or, equivalently, the support size of the distribution induced by the data set) from a random sample of its elements. The problem occurs in many…
We investigate moment sequences of probability measures on $E\subset\mathbb{R}$ under constraints of certain moments being fixed. This corresponds to studying sections of $n$-th moment spaces, i.e. the spaces of moment sequences of order…
This paper adopts a Bayesian nonparametric mixture model where the mixing distribution belongs to the wide class of normalized homogeneous completely random measures. We propose a truncation method for the mixing distribution by discarding…
Randomization is a powerful technique to create robust controllers, in particular in partially observable settings. The degrees of randomization have a significant impact on the system performance, yet they are intricate to get right. The…
In this paper we present a new error bound on sampling algorithms for frequent itemsets mining. We show that the new bound is asymptotically tighter than the state-of-art bounds, i.e., given the chosen samples, for small enough error…
We develop correlated random measures, random measures where the atom weights can exhibit a flexible pattern of dependence, and use them to develop powerful hierarchical Bayesian nonparametric models. Hierarchical Bayesian nonparametric…
We present a new approach to study measures on ensembles of contours, polymers or other objects interacting by some sort of exclusion condition. For concreteness we develop it here for the case of Peierls contours. Unlike existing methods,…
We propose a novel nonparametric online predictor for discrete labels conditioned on multivariate continuous features. The predictor is based on a feature space discretization induced by a full-fledged k-d tree with randomly picked…
This article introduces a subbagging (subsample aggregating) approach for variable selection in regression within the context of big data. The proposed subbagging approach not only ensures that variable selection is scalable given the…
We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these costs form a metric. We assume that these costs are unknown to…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…
The concentration of measure phenomena were discovered as the mathematical background of statistical mechanics at the end of the XIX - beginning of the XX century and were then explored in mathematics of the XX-XXI centuries. At the…
In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…