arXiv research

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 models are usually built from completely random measures, a Poisson-process based c…

Normalized compound random measures are flexible nonparametric priors for related distributions. We consider building general nonparametric regression models using normalized compound random measure mixture models. Posterior inference is made using a novel pseudo-marginal Metropolis-Hastings sampler for normalized comp…

The completeness problem of the bond market model with the random factors determined by a Wiener process and Poisson random measure is studied. Hedging portfolios use bonds with maturities in a countable, dense subset of a finite time interval. It is shown that under natural assumptions the market is not complete unles…

We introduce an universum of the Polish (=complete separable metric) space - the convex cone of distance matrices and study its geometry. It happened that the generic Polish spaces in this sense of this universum is so called Urysohn spaces defined by P.S.Urysohn in 20-th, and generic metric triple (= metric space with…

New algorithm improves inference for flexible models with infinite latent features.

We present a general construction for dependent random measures based on thinning Poisson processes on an augmented space. The framework is not restricted to dependent versions of a specific nonparametric model, but can be applied to all models that can be represented using completely random measures. Several existing …

One of the current issues in Brain-Computer Interface is how to deal with noisy Electroencephalography measurements organized as multidimensional datasets. On the other hand, recently, significant advances have been made in multidimensional signal completion algorithms that exploit tensor decomposition models to captur…

Tensors play a central role in many modern machine learning and signal processing applications. In such applications, the target tensor is usually of low rank, i.e., can be expressed as a sum of a small number of rank one tensors. This motivates us to consider the problem of low rank tensor recovery from a class of lin…

We propose three measures of mutual dependence between multiple random vectors. All the measures are zero if and only if the random vectors are mutually independent. The first measure generalizes distance covariance from pairwise dependence to mutual dependence, while the other two measures are sums of squared distance…

When observations are organized into groups where commonalties exist amongst them, the dependent random measures can be an ideal choice for modeling. One of the propositions of the dependent random measures is that the atoms of the posterior distribution are shared amongst groups, and hence groups can borrow informatio…

The purpose of this paper is to give a selective survey on recent progress in random metric theory and its applications to conditional risk measures. This paper includes eight sections. Section 1 is a longer introduction, which gives a brief introduction to random metric theory, risk measures and conditional risk measu…

In this paper we study the matrix completion problem: Suppose $X \in {\mathbb R}^{n_r \times n_c}$ is unknown except for a known upper bound $r$ on its rank. By measuring a small number $m \ll n_r n_c$ of elements of $X$, is it possible to recover $X$ exactly with noise-free measurements, or to construct a good approxi…

The study predicts pass completion probability in NFL games.

Bayesian nonparametric approaches, in particular the Pitman-Yor process and the associated two-parameter Chinese Restaurant process, have been successfully used in applications where the data exhibit a power-law behavior. Examples include natural language processing, natural images or networks. There is also growing em…

This paper presents theory for Normalized Random Measures (NRMs), Normalized Generalized Gammas (NGGs), a particular kind of NRM, and Dependent Hierarchical NRMs which allow networks of dependent NRMs to be analysed. These have been used, for instance, for time-dependent topic modelling. In this paper, we first introdu…

New MBQC algorithm uses randomness for generative modeling.

In this article, a large data set containing every course taken by every undergraduate student in a major university in Canada over 10 years is analysed. Modern machine learning algorithms can use large data sets to build useful tools for the data provider, in this case, the university. In this article, two classifiers…

We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Mark…

Optimal coupling among random vectors with known statistics and correlation structure found using minimum spanning tree over measure-valued vertices.

Method learns topological states from randomized measurements.

We propose a novel statistical model for sparse networks with overlapping community structure. The model is based on representing the graph as an exchangeable point process, and naturally generalizes existing probabilistic models with overlapping block-structure to the sparse regime. Our construction builds on vectors …

New algorithm speeds Bayesian nonparametric model inference.

To provide a solid analytic foundation for the module approach to conditional risk measures, this paper establishes a complete random convex analysis over random locally convex modules by simultaneously considering the two kinds of topologies (namely the $(\varepsilon,λ)$--topology and the locally $L^0$-- convex topolo…

Network data appear in a number of applications, such as online social networks and biological networks, and there is growing interest in both developing models for networks as well as studying the properties of such data. Since individual network datasets continue to grow in size, it is necessary to develop models tha…

We derive generalized estimators for a number of spatial statistics that have been used in the analysis of spatially resolved omics data, such as Ripley's K, H and L functions, clustering index, and degree of clustering, which allow these statistics to be calculated on data modelled by arbitrary random measures (RMs). …

APGD algorithm reconstructs point set from partial distance measurements.

Infinite-activity completely random measures (CRMs) have become important building blocks of complex Bayesian nonparametric models. They have been successfully used in various applications such as clustering, density estimation, latent feature models, survival analysis or network science. Popular infinite-activity CRMs…

New method calculates Ricci curvature from distances between weighted volumes.

New study shows non-adaptive trials can be outperformed by adaptive designs in treatment selection.

Stationary measures on hyperbolic surfaces with cusps are singular and stable under quasi-symmetries.

We consider non-concave and non-smooth random utility functions with do- main of definition equal to the non-negative half-line. We use a dynamic pro- gramming framework together with measurable selection arguments to establish both the no-arbitrage condition characterization and the existence of an optimal portfolio i…

The fields of compressed sensing (CS) and matrix completion have shown that high-dimensional signals with sparse or low-rank structure can be effectively projected into a low-dimensional space (for efficient acquisition or processing) when the projection operator achieves a stable embedding of the data by satisfying th…

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance matrix is defined and we proved that the set of such matrices is everywhere dense …

New CRM models for sparse networks with linear edge growth.

Completely random measures (CRM) represent the key building block of a wide variety of popular stochastic models and play a pivotal role in modern Bayesian Nonparametrics. A popular representation of CRMs as a random series with decreasing jumps is due to Ferguson and Klass (1972). This can immediately be turned into a…

In the paper, the martingales and super-martingales relative to a regular set of measures are systematically studied. The notion of local regular super-martingale relative to a set of equivalent measures is introduced and the necessary and sufficient conditions of the local regularity of it in the discrete case are fou…

Given a probability measure on a finitely generated group, its Martin boundary is a way to compactify the group using the Green's function of the corresponding random walk. We give a complete topological characterization of the Martin boundary of finitely supported random walks on relatively hyperbolic groups with virt…

In this work we study the Lebesgue property for convex risk measures on the space of bounded càdlàg random processes ($\mathcal{R}^\infty$). Lebesgue property has been defined for one period convex risk measures in \cite{Jo} and earlier had been studied in \cite{De} for coherent risk measures. We introduce and study th…

In this paper we propose a Bayesian nonparametric model for clustering partial ranking data. We start by developing a Bayesian nonparametric extension of the popular Plackett-Luce choice model that can handle an infinite number of choice items. Our framework is based on the theory of random atomic measures, with the pr…

This work establishes always-valid risk bounds for online matrix completion.

Recent works have cast some light on the mystery of why deep nets fit any data and generalize despite being very overparametrized. This paper analyzes training and generalization for a simple 2-layer ReLU net with random initialization, and provides the following improvements over recent works: (i) Using a tighter char…

A new approach models exploration in continuous-time RL using random measures.

A new perfectly truthful calibration measure improves prediction reliability.

Statistical network modeling has focused on representing the graph as a discrete structure, namely the adjacency matrix, and considering the exchangeability of this array. In such cases, the Aldous-Hoover representation theorem (Aldous, 1981;Hoover, 1979} applies and informs us that the graph is necessarily either dens…

Global sensitivity analysis with variance-based measures suffers from several theoretical and practical limitations, since they focus only on the variance of the output and handle multivariate variables in a limited way. In this paper, we introduce a new class of sensitivity indices based on dependence measures which o…

Developed a random walk analog of geodesic flow on hyperbolic groups.

The paper proposes a class of financial market models which are based on inhomogeneous telegraph processes and jump diffusions with alternating volatilities. It is assumed that the jumps occur when the tendencies and volatilities are switching. We argue that such a model captures well the stock price dynamics under per…

Paper develops new patterns for unique matrix completions.