Research

Architectures and coordinates for reliable control, optimization, and learning

We study how dynamical systems and algorithms can improve from data, adapt throughout operation, and still admit rigorous analysis.

Distributed control and networked systems

Large-scale systems must often be controlled using local measurements and limited communication. One set of results identifies closed-loop variables in which information constraints can be represented and optimized without giving up stability. These include the input-output parametrization and sparsity-invariance methods for optimal distributed control.

We currently study how these ideas extend to data-driven and nonlinear settings: distributed reinforcement learning, graph neural network policies, multi-agent coordination, and performance criteria that reflect how disturbances propagate through a network.

Selected publications

Equations and diagrams for distributed controller design in closed-loop coordinates
Distributed control formulated through achievable closed-loop responses and information structure.
Ten-agent simulation of a learned distributed controller.

Multi-agent experiments

Distributed policies across network sizes

Every example uses the same trained graph neural network policy. Stability is guaranteed by construction, and no online optimization is used.

Six agents moving to randomly assigned targets
6 agents · random targets
Eight agents coordinating to reach randomly assigned targets
8 agents · random targets
Ten agents moving through a mixed target configuration
10 agents · mixed configuration
Twelve agents exchanging positions in paired formation
12 agents · paired exchange

System theory for learning and optimization

An iterative optimization method is itself a dynamical system. We use this observation to design trainable algorithms whose convergence follows from their structure, rather than from a posteriori tests on a finite training horizon.

The broader goal is to understand which algorithmic coordinates combine guarantees with enough expressivity to exploit recurring problem structure. This includes learning optimizers from data, accelerating classical iterations, and characterizing entire classes of convergent algorithms.

Selected publications

Performance of a learned optimizer compared with classical first-order methods
Learned optimization dynamics compared with classical first-order methods.
An unconstrained learned optimizer diverging beyond its training horizon
Why behaviour beyond the finite training horizon must be part of the design.

Slides

Recent presentations

SIAM Conference on Optimization 2026

Learning to Optimize: Guarantees from Convex to Non-Convex Landscapes

Invited presentation on trainable optimization algorithms designed through nonlinear system theory.