Related papers: Determinantal Point Processes in the Flat Limit: E…
Markov Decision Processes (Mdps) form a versatile framework used to model a wide range of optimization problems. The Mdp model consists of sets of states, actions, time steps, rewards, and probability transitions. When in a given state and…
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 $\alpha$-determinant is a one-parameter generalisation of the standard determinant, with $\alpha=-1$ corresponding to the determinant, and $\alpha=1$ corresponding to the permanent. In this paper a simple limit procedure to construct…
Determinantal point processes are models for regular spatial point patterns, with appealing probabilistic properties. We present their spatio-temporal counterparts and give examples of these models, based on spatio-temporal covariance…
In this paper we consider the filtering of a class of partially observed piecewise deterministic Markov processes (PDMPs). In particular, we assume that an ordinary differential equation (ODE) drives the deterministic element and can only…
This paper concerns the use of a particular class of determinantal point processes (DPP), a class of repulsive spatial point processes, for Monte Carlo integration. Let $d\ge 1$, $I\subseteq \overline d=\{1,\dots,d\}$ with $\iota=|I|$.…
Negative dependence is becoming a key driver in advancing learning capabilities beyond the limits of traditional independence. Recent developments have evidenced support towards negatively dependent systems as a learning paradigm in a broad…
In this paper, we introduce the online and streaming MAP inference and learning problems for Non-symmetric Determinantal Point Processes (NDPPs) where data points arrive in an arbitrary order and the algorithms are constrained to use a…
In certain point processes, the configuration of points outside a bounded domain determines, with probability 1, certain statistical features of the points within the domain. This notion, called rigidity, was introduced in a work of Ghosh…
We study stochastic motion planning problems which involve a controlled process, with possibly discontinuous sample paths, visiting certain subsets of the state-space while avoiding others in a sequential fashion. For this purpose, we first…
Determinantal point processes are point processes whose correlation functions are given by determinants of matrices. The entries of these matrices are given by one fixed function of two variables, which is called the kernel of the point…
We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling…
We introduce a family of discrete determinantal point processes related to orthogonal polynomials on the real line, with correlation kernels defined via spectral projections for the associated Jacobi matrices. For classical weights, we show…
We consider determinantal point processes on a compact complex manifold X in the limit of many particles. The correlation kernels of the processes are the Bergman kernels associated to a a high power of a given Hermitian holomorphic line…
We introduce seven families of stochastic systems of interacting particles in one-dimension corresponding to the seven families of irreducible reduced affine root systems. We prove that they are determinantal in the sense that all…
As recently proved in generality by Hedenmalm and Wennman, it is a universal behavior of complex random normal matrix models that one finds a complementary error function behavior at the boundary (also called edge) of the droplet as the…
We study a subclass of POMDPs, called Deterministic POMDPs, that is characterized by deterministic actions and observations. These models do not provide the same generality of POMDPs yet they capture a number of interesting and challenging…
In this note we present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2,...} or on the open half-line (0,+\infty). The main result is the computation of the…
The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point…
The main result of this paper is that determinantal point processes on the real line corresponding to projection operators with integrable kernels are quasi-invariant, in the continuous case, under the group of diffeomorphisms with compact…