Related papers: Extended L-ensembles: a new representation for Det…
Determinantal Point Processes (DPPs) are a widely used probabilistic model for negatively correlated sets. DPPs have been successfully employed in Machine Learning applications to select a diverse, yet representative subset of data. In…
The Ginibre point process is given by the eigenvalue distribution of a non-hermitian complex Gaussian matrix in the infinite matrix-size limit. This is a determinantal point process (DPP) on the complex plane ${\mathbb{C}}$ in the sense…
Unstructured neural network pruning algorithms have achieved impressive compression rates. However, the resulting - typically irregular - sparse matrices hamper efficient hardware implementations, leading to additional memory usage and…
Online feature selection has been an active research area in recent years. We propose a novel diverse online feature selection method based on Determinantal Point Processes (DPP). Our model aims to provide diverse features which can be…
Aulbach et al. (2012) introduced the concept of D-norms in the framework of functional extreme value theory (EVT) extending the multivariate case in a natural manner. In particular, the distribution of a standard max-stable process (MSP)…
We study quadrature rules for functions from an RKHS, using nodes sampled from a determinantal point process (DPP). DPPs are parametrized by a kernel, and we use a truncated and saturated version of the RKHS kernel. This link between the…
Subset selection problems ask for a small, diverse yet representative subset of the given data. When pairwise similarities are captured by a kernel, the determinants of submatrices provide a measure of diversity or independence of items…
Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our main results concern relationships with…
We develop a coordinate-free probabilistic framework for determinantal point processes associated with Bergman kernels on compact complex manifolds. The basic issue is that Bergman kernels are naturally line-bundle-valued:…
Basic Parallel Processes (BPPs) are a well-known subclass of Petri Nets. They are the simplest common model of concurrent programs that allows unbounded spawning of processes. In the probabilistic version of BPPs, every process generates…
We consider the problem of approximating a function from $L^2$ by an element of a given $m$-dimensional space $V_m$, associated with some feature map $\boldsymbol{\varphi}$, using evaluations of the function at random points $x_1,…
A new type of dependent thinning for point processes in continuous space is proposed, which leverages the advantages of determinantal point processes defined on finite spaces and, as such, is particularly amenable to statistical, numerical,…
We define a determinantal point process on the complex projective space that reduces to the so-called spherical ensemble for complex dimension 1 under identification of the 2-sphere with the Riemann sphere. Through this determinantal point…
Goldman [7] proved that the distribution of a stationary determinantal point process (DPP) $\Phi$ can be coupled with its reduced Palm version $\Phi^{0,!}$ such that there exists a point process $\eta$ where $\Phi = \Phi^{0,!} \cup \eta$ in…
$L$-ensembles are a class of determinantal point processes which can be viewed as a statistical mechanical systems in the grand canonical ensemble. Circulant $L$-ensembles are the subclass which are locally translationally invariant and…
We consider determinantal point processes (DPPs) constrained by spanning trees. Given a graph $G=(V,E)$ and a positive semi-definite matrix $\mathbf{A}$ indexed by $E$, a spanning-tree DPP defines a distribution such that we draw…
The Probability Hypothesis Density (PHD) filter, which is used for multi-target tracking based on sensor measurements, relies on the propagation of the first-order moment, or intensity function, of a point process. This algorithm assumes…
We study point processes on $\mathbb S^d$, the $d$-dimensional unit sphere $\mathbb S^d$, considering both the isotropic and the anisotropic case, and focusing mostly on the spherical case $d=2$. The first part studies reduced Palm…
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows for expressing every property of finite structures that is decidable in the complexity class SigmaP2 (= NP^NP). Despite this high expressiveness, there are some…
We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…