Mixtures of ensembles: System separation and identification via optimal transport

Crowd dynamics and many large biological systems can be described as populations of agents or particles, which can only be observed on aggregate population level. Identifying the dynamics of agents is crucial for understanding these large systems. However, the population of agents is typically not homogeneous, and thus the aggregate observations consist of the superposition of multiple ensembles each governed by individual dynamics. In this work, we propose an optimal transport framework to jointly separate the population into several ensembles and identify each ensemble's dynamical system, based on aggregate observations of the population. We propose a bi-convex optimization problem, which we solve using a block coordinate descent with convergence guarantees. In numerical experiments, we demonstrate that the proposed approach exhibits close-to-oracle performance also in noisy settings, yielding accurate estimates of both the ensembles and the parameters governing their dynamics.

Publication Details

Journal
ArXiv.org
Published
2025-03-17
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mixtures of ensembles: System separation and identification via optimal transport

ArXiv.org
Distributed Control Multi-Agent Systems
article

Mixtures of ensembles: System separation and identification via optimal transport

article en

Abstract

Crowd dynamics and many large biological systems can be described as populations of agents or particles, which can only be observed on aggregate population level. Identifying the dynamics of agents is crucial for understanding these large systems. However, the population of agents is typically not homogeneous, and thus the aggregate observations consist of the superposition of multiple ensembles each governed by individual dynamics. In this work, we propose an optimal transport framework to jointly separate the population into several ensembles and identify each ensemble's dynamical system, based on aggregate observations of the population. We propose a bi-convex optimization problem, which we solve using a block coordinate descent with convergence guarantees. In numerical experiments, we demonstrate that the proposed approach exhibits close-to-oracle performance also in noisy settings, yielding accurate estimates of both the ensembles and the parameters governing their dynamics.

ArXiv.org
Reduced inequalities
Openalex Percentile: Top 46%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.