Connections Between Determinantal Point Processes and Gramians in Control

TL;DR

This paper links determinantal point processes with control theory, showing that certain Gramians can be viewed as DPPs, offering a probabilistic perspective on sensor and actuator selection in dynamic systems.

Contribution

It introduces a novel connection between DPPs and control Gramians, providing new spectral, probabilistic, and optimization insights for sensor and actuator placement.

Findings

Gramian-based DPPs characterize sensor/actuator selection likelihoods.

Derived rank conditions and properties like negative dependence.

Revealed classical greedy guarantees and MAP interpretation.

Abstract

Determinantal point processes (DPPs) are probability models over subsets of a ground set that favor diverse selections while suppressing redundancy. That is, they tend to assign higher likelihood to collections whose elements complement one another instead of repeating the same information. For example, in recommendation systems, a DPP prefers showing users several relevant items that differ in content or style, rather than many near-duplicates of essentially the same item. Although DPPs have been studied extensively in machine learning, random matrix theory, and popularized through components of YouTube's search recommendation system, they have not been considered in the context of dynamic systems; time domain analysis is not a feature of DPPs. This paper establishes interesting connections between DPPs and control theory. By showing that the observability (controllability) Gramian parameterized by sensor (control) node subsets is a DPP, we provide a probabilistic and spectral perspective on sensor (actuator) selection for linear dynamic systems. This notion of probability here does not represent stochastic uncertainty in the system dynamics; it instead represents a likelihood measure over sensor (actuator) configurations induced by the Gramian. To that end, we derive an effective observable rank condition, characterize the balance between individual node contributions and diversity, and establish node inclusion monotonicity and negative dependence properties. Finally, we show that this formulation recovers classical greedy optimization guarantees and admits a maximum a posteriori interpretation of the sensor/actuator node selection problem. Numerical case studies on three network topologies corroborate the theoretical results.