Searcharxiv⌕ Search

arXiv subjects

Steven L. Brunton

Publications and source records attributed to Steven L. Brunton.

At least 37 records · Page 2Linked to original sources

Agentic Exploration of PDE Spaces using Latent Foundation Models for Parameterized Simulations

Flow physics and more broadly physical phenomena governed by partial differential equations (PDEs), are inherently continuous, high-dimensional and often chaotic in nature. Traditionally, researchers have explored these rich spatiotemporal PDE solution spaces using laboratory experiments and/or computationally expensive numerical simulations. This severely limits automated and large-scale exploration, unlike domains such as drug discovery or materials science, where discrete, tokenizable representations naturally interface with large language models. We address this by coupling multi-agent LLMs with latent foundation models (LFMs), a generative model over parametrised simulations, that learns explicit, compact and disentangled latent representations of flow fields, enabling continuous exploration across governing PDE parameters and boundary conditions. The LFM serves as an on-demand surrogate simulator, allowing agents to query arbitrary parameter configurations at negligible cost. A hierarchical agent architecture orchestrates exploration through a closed loop of hypothesis, experimentation, analysis and verification, with a tool-modular interface requiring no user support. Applied to flow past tandem cylinders at Re = 500, the framework autonomously evaluates over 1,600 parameter-location pairs and discovers divergent scaling laws: a regime-dependent two-mode structure for minimum displacement thickness and a robust linear scaling for maximum momentum thickness, with both landscapes exhibiting a dual-extrema structure that emerges at the near-wake to co-shedding regime transition. The coupling of the learned physical representations with agentic reasoning establishes a general paradigm for automated scientific discovery in PDE-governed systems.

cs.AI↗

Explainable AI: Learning from the Learners

Artificial intelligence now outperforms humans in several scientific and engineering tasks, yet its internal representations often remain opaque. In this Perspective, we argue that explainable artificial intelligence (XAI), combined with causal reasoning, enables {\it learning from the learners}. Focusing on discovery, optimization and certification, we show how the combination of foundation models and explainability methods allows the extraction of causal mechanisms, guides robust design and control, and supports trust and accountability in high-stakes applications. We discuss challenges in faithfulness, generalization and usability of explanations, and propose XAI as a unifying framework for human-AI collaboration in science and engineering.

cs.AI↗

Data-driven methods to discover stable linear models of the helicity injectors on HIT-SIU

Accurate and efficient circuit models are necessary to control the power electronic circuits found on plasma physics experiments. Tuning and controlling the behavior of these circuits is inextricably linked to plasma performance. Linear models are greatly preferred for control applications due to their well-established performance guarantees, but they typically fail to capture nonlinear dynamics and changes in experimental parameters. Data-driven system identification can help mitigate these shortcomings by learning interpretable and accurate reduced-order models of a complex system, in this case the injector circuits of the Helicity Injected Torus - Steady Inductive Upgrade (HIT-SIU) experiment. Specifically, the Bagging Optimized Dynamic Mode Decomposition (BOP-DMD), is leveraged to learn stable, reduced order models of the interaction between the spheromak plasma formed in the confinement volume, and the injector circuits of the device. BOP-DMD is trained and evaluated on an analytic model of the vacuum dynamics of the injector circuits of HIT-SIU, as well as an analytic linear reduced-order model for the injector dynamics when a plasma is present. BOP-DMD is then fit on experimental data, both on shots with and without a plasma in the confinement volume. In doing so, we demonstrate the capability of data-driven methods to produce stable, linear models for control and uncertainty quantification in plasma experiments.

physics.plasm-ph↗

From STLS to Projection-based Dictionary Selection in Sparse Regression for System Identification

In this work, we revisit dictionary-based sparse regression, in particular, Sequential Threshold Least Squares (STLS), and propose a score-guided library selection to provide practical guidance for data-driven modeling, with emphasis on SINDy-type algorithms. STLS is an algorithm to solve the $\ell_0$ sparse least-squares problem, which relies on splitting to efficiently solve the least-squares portion while handling the sparse term via proximal methods. It produces coefficient vectors whose components depend on both the projected reconstruction errors, here referred to as the scores, and the mutual coherence of dictionary terms. The first contribution of this work is a theoretical analysis of the score and dictionary-selection strategy. This could be understood in both the original and weak SINDy regime. Second, numerical experiments on ordinary and partial differential equations highlight the effectiveness of score-based screening, improving both accuracy and interpretability in dynamical system identification. These results suggest that integrating score-guided methods to refine the dictionary more accurately may help SINDy users in some cases to enhance their robustness for data-driven discovery of governing equations.

stat.ML↗

Accelerating scientific discovery with the common task framework

Machine learning (ML) and artificial intelligence (AI) algorithms are transforming and empowering the characterization and control of dynamic systems in the engineering, physical, and biological sciences. These emerging modeling paradigms require comparative metrics to evaluate a diverse set of scientific objectives, including forecasting, state reconstruction, generalization, and control, while also considering limited data scenarios and noisy measurements. We introduce a common task framework (CTF) for science and engineering, which features a growing collection of challenge data sets with a diverse set of practical and common objectives. The CTF is a critically enabling technology that has contributed to the rapid advance of ML/AI algorithms in traditional applications such as speech recognition, language processing, and computer vision. There is a critical need for the objective metrics of a CTF to compare the diverse algorithms being rapidly developed and deployed in practice today across science and engineering.

cs.LG↗

Meshless projection model-order reduction via reference spaces for smoothed-particle hydrodynamics

A model-order reduction framework for the meshless smoothed-particle hydrodynamics (SPH) method is presented. The proposed framework introduces the concept of modal reference spaces to overcome the challenges of discovering low-dimensional subspaces from unstructured, dynamic, and mixing numerical topology that occurs in SPH simulations. These reference spaces enable a low-dimensional representation of the field equations while maintaining the inherent meshless qualities of SPH. Modal reference spaces are constructed by projecting snapshot data onto a reference space where low-dimensionality of field quantities can be discovered via traditional modal decomposition techniques (e.g., the proper orthogonal decomposition (POD)). Modal quantities are mapped back to the meshless SPH space via scattered data interpolation during the online predictive stage. The proposed model-order reduction framework is cast into the meshless Galerkin POD and the Adjoint Petrov-Galerkin projection model-order reduction (PMOR) formulation. The PMORs are tested on three numerical experiments: 1) the Taylor--Green vortex; 2) the lid-driven cavity; and 3) the flow past an open cavity. Results show good agreement in reconstructed and predictive velocity fields, which showcase the ability of this framework to evolve the field equations in a low-dimensional subspace on an unstructured, dynamic, and mixing numerical topology. Results also show that the pressure field is sensitive to the projection error due to the stiff weakly-compressible assumption made in the current SPH framework, but this sensitivity can be alleviated through nonlinear approximations, such as the APG approach. The proposed meshless model-order reduction framework reports up to 90,000x dimensional compression within 10% error in quantities of interest, marking a step toward drastic cost reduction in SPH simulations.

cs.CE↗

VENI, VINDy, VICI: a generative reduced-order modeling framework with uncertainty quantification

The simulation of many complex phenomena in engineering and science requires solving expensive, high-dimensional systems of partial differential equations (PDEs). To circumvent this, reduced-order models (ROMs) have been developed to speed up computations. However, when governing equations are unknown or partially known, typically ROMs lack interpretability and reliability of the predicted solutions. In this work we present a data-driven, non-intrusive framework for building ROMs where the latent variables and dynamics are identified in an interpretable manner and uncertainty is quantified. Starting from a limited amount of high-dimensional, noisy data the proposed framework constructs an efficient ROM by leveraging variational autoencoders for dimensionality reduction along with a newly introduced, variational version of sparse identification of nonlinear dynamics (SINDy), which we refer to as Variational Identification of Nonlinear Dynamics (VINDy). In detail, the method consists of Variational Encoding of Noisy Inputs (VENI) to identify the distribution of reduced coordinates. Simultaneously, we learn the distribution of the coefficients of a pre-determined set of candidate functions by VINDy. Once trained offline, the identified model can be queried for new parameter instances and new initial conditions to compute the corresponding full-time solutions. The probabilistic setup enables uncertainty quantification as the online testing consists of Variational Inference naturally providing Certainty Intervals (VICI). In this work we showcase the effectiveness of the newly proposed VINDy method in identifying interpretable and accurate dynamical system for the Roessler system with different noise intensities and sources. Then the performance of the overall method - named VENI, VINDy, VICI - is tested on PDE benchmarks including structural mechanics and fluid dynamics.

cs.LG↗

Extending the trapping theorem to provide local stability guarantees for quadratically nonlinear models

The Navier Stokes equations (NSEs) are partial differential equations (PDEs) to describe the nonlinear convective motion of fluids and they are computationally expensive to simulate because of their high nonlinearity and variables being fully coupled. Reduced-order models (ROMs) are simpler models for evolving the flows by capturing only the dominant behaviors of a system and can be used to design controllers for high-dimensional systems. However it is challenging to guarantee the stability of these models either globally or locally. Ensuring the stability of ROMs can improve the interpretability of the behavior of the dynamics and help develop effective system control strategies. For quadratically nonlinear systems that represent many fluid flows, the Schlegel and Noack trapping theorem (JFM, 2015) can be used to check if ROMs are globally stable (long-term bounded). This theorem was subsequently incorporated into system identification techniques that determine models directly from data. In this work, we relax the quadratically energy-preserving constraints in this theorem, and then promote local stability in data-driven models of quadratically nonlinear dynamics. First, we prove a theorem outlining sufficient conditions to ensure local stability in linear-quadratic systems and provide an estimate of the stability radius. Second, we incorporate this theorem into system identification methods and produce a-priori locally stable data-driven models. Several examples are presented to demonstrate the effectiveness and accuracy of the proposed algorithm.

physics.comp-ph↗

PySensors 2.0: A Python Package for Sparse Sensor Placement

PySensors is a Python package for selecting and placing a sparse set of sensors for reconstruction and classification tasks. In this major update to PySensors, we introduce spatially constrained sensor placement capabilities, allowing users to enforce constraints such as maximum or exact sensor counts in specific regions, incorporate predetermined sensor locations, and maintain minimum distances between sensors. We extend functionality to support custom basis inputs, enabling integration of any data-driven or spectral basis. We also propose a thermodynamic approach that goes beyond a single "optimal" sensor configuration and maps the complete landscape of sensor interactions induced by the training data. This comprehensive view facilitates integration with external selection criteria and enables assessment of sensor replacement impacts. The new optimization technique also accounts for over- and under-sampling of sensors, utilizing a regularized least squares approach for robust reconstruction. Additionally, we incorporate noise-induced uncertainty quantification of the estimation error and provide visual uncertainty heat maps to guide deployment decisions. To highlight these additions, we provide a brief description of the mathematical algorithms and theory underlying these new capabilities. We demonstrate the usage of new features with illustrative code examples and include practical advice for implementation across various application domains. Finally, we outline a roadmap of potential extensions to further enhance the package's functionality and applicability to emerging sensing challenges.

cs.RO↗

Preferential sampling enabled by particle finite size and anisotropic shape

Anisotropic, finite-sized particles, common in environmental and industrial flows, exhibit complex dynamics distinct from those of small, spherical particles. Their shape introduces orientation-dependent forces, and their finite size affects how they experience the flow field. While the effects of particle inertia are known to cause preferential sampling, in this study we consider whether preferential sampling can arise due to finite size and shape alone by considering inertialess rods using slender-body theory. First, we show analytically that preferential sampling can only occur in this limit given the presence of three ingredients: finite particle size, anisotropic particle shape, and a nonlinear flow field. Next, to demonstrate this effect, we simulate rods in a steady 2D cellular flow: the Taylor-Green vortex flow. By analyzing the rod trajectories, we find that rods do indeed preferentially sample areas of both high and low vorticity, corresponding to the fixed points of the flow: the high vorticity cell centers and the low vorticity saddle points in the corners of each cell. This preferential sampling increases with increasing rod length. We also analyze the same data with respect to the flow's nonlinearity (i.e. curvature) to find that the rods preferentially sample the linear regions of the flow and undersample the nonlinear regions. Finally, we analyze the nonlinear dynamics of this system, showing that chaotic trajectories appear as the rod length increases, and that these chaotic regions in the flow also tend to overlap with higher flow nonlinearity. Overall, we show how finite size and anisotropic shape alone can cause particles to preferentially sample a flow field, and that this preferential sampling is highly linked to the flow's nonlinearity.

physics.flu-dyn↗

Spectral proper orthogonal decomposition of rapid snapshot pairs sampled at sub-Nyquist intervals

Modal decomposition methods are important for characterizing the low-dimensional dynamics of complex systems, including turbulent flows. Different methods have varying data requirements and produce modes with different properties. Spectral proper orthogonal decomposition (SPOD) produces orthogonal, energy-ranked spatial modes at discrete temporal frequencies for statistically stationary flows. However, SPOD requires long stretches of sequential, uniformly sampled, time-resolved data. These data requirements limit SPOD's use in experimental settings where the maximum capture rate of a camera is often slower than the Nyquist sampling rate required to resolve the highest turbulent frequencies. However, if two PIV systems operate in tandem, pairs of data can be acquired that are arbitrarily close in time. The dynamic mode decomposition (DMD) uses this pairwise data to resolve frequencies up to the Nyquist frequency associated with the small time step within a pair. However, these modes do not form a basis and have no set ranking. The present work attempts to compute SPOD modes from pairwise data with a small time step but with large gaps between pairs. We use DMD on pairwise data to estimate segment-wise, uniformly sampled series that can then be used to estimate the SPOD modes, intending to resolve frequencies between the gap and pair Nyquist limits. The method is tested on numerically obtained data of the linearized complex Ginzburg-Landau equation, as well as a Mach 0.4 isothermal turbulent jet. For the jet, pairwise SPOD can accurately de-alias the SPOD spectrum and estimate mode shapes at frequencies up to St = 1.0, while using over 90% less data.

physics.flu-dyn↗

SINDy-RL: Interpretable and Efficient Model-Based Reinforcement Learning

Deep reinforcement learning (DRL) has shown significant promise for uncovering sophisticated control policies that interact in complex environments, such as stabilizing a tokamak fusion reactor or minimizing the drag force on an object in a fluid flow. However, DRL requires an abundance of training examples and may become prohibitively expensive for many applications. In addition, the reliance on deep neural networks often results in an uninterpretable, black-box policy that may be too computationally expensive to use with certain embedded systems. Recent advances in sparse dictionary learning, such as the sparse identification of nonlinear dynamics (SINDy), have shown promise for creating efficient and interpretable data-driven models in the low-data regime. In this work we introduce SINDy-RL, a unifying framework for combining SINDy and DRL to create efficient, interpretable, and trustworthy representations of the dynamics model, reward function, and control policy. We demonstrate the effectiveness of our approaches on benchmark control environments and flow control problems, including gust mitigation on a 3D NACA 0012 airfoil at $Re=1000$. SINDy-RL achieves comparable performance to modern DRL algorithms using significantly fewer interactions in the environment and results in an interpretable control policy orders of magnitude smaller than a DRL policy.

cs.LG↗

Dynamics of tidal spiral arms: Machine learning-assisted identification of equations and application to the Milky Way

Understanding the spiral arms of the Milky Way (MW) remains a key open question in galactic dynamics. Tidal perturbations, such as the recent passage of the Sagittarius dwarf galaxy (Sgr), could play a significant role in exciting them. We aim to analytically characterize the dynamics of tidally induced spiral arms, including their phase-space signatures. We ran idealized test-particle simulations resembling impulsive satellite impacts, and used the Sparse Identification of Non-linear Dynamics (SINDy) method to infer their governing Partial Differential Equations (PDEs). We validated the method with analytical derivations and a realistic $N$-body simulation of a MW-Sgr encounter analogue. For small perturbations, a linear system of equations was recovered with SINDy, consistent with predictions from linearised collisionless dynamics. In this case, two distinct waves wrapping at pattern speeds $Ω\pm κ/m$ emerge. For large impacts, we empirically discovered a non-linear system of equations, representing a novel formulation for the dynamics of tidally induced spiral arms. For both cases, these equations describe wave properties like amplitude and pattern speed, and their shape and temporal evolution in different phase-space projections. We fit the Gaia $L_Z-V_R$ waves with the linear model, providing a reasonable fit and plausible parameters for the Sgr passage. However, the predicted amplitude ratio of the two waves is inconsistent with observations, supporting a more complex origin for this feature (e.g. multiple passages, bar, spiral arms). We merge data-driven discovery with theory to create simple, accurate models of tidal spiral arms that match simulations and provide a simple tool to fit Gaia and external galaxy data. This methodology could be extended to model complex phenomena like self-gravity and dynamical friction. (ABR)

astro-ph.GA↗

Sparse-mode Dynamic Mode Decomposition for Disambiguating Local and Global Structures

The dynamic mode decomposition (DMD) is a data-driven approach that extracts the dominant features from spatiotemporal data. In this work, we introduce sparse-mode DMD, a new variant of the optimized DMD framework that specifically leverages sparsity-promoting regularization in order to approximate DMD modes which have localized spatial structure. The algorithm maintains the noise-robust properties of optimized DMD while disambiguating between modes which are spatially local versus global in nature. In many applications, such modes are associated with discrete and continuous spectra respectively, thus allowing the algorithm to explicitly construct, in an unsupervised manner, the distinct portions of the spectrum. We demonstrate this by analyzing synthetic and real-world systems, including examples from optical waveguides, quantum mechanics, and sea surface temperature data.

stat.ML↗

Safe Physics-Informed Machine Learning for Dynamics and Control

This tutorial paper focuses on safe physics-informed machine learning in the context of dynamics and control, providing a comprehensive overview of how to integrate physical models and safety guarantees. As machine learning techniques enhance the modeling and control of complex dynamical systems, ensuring safety and stability remains a critical challenge, especially in safety-critical applications like autonomous vehicles, robotics, medical decision-making, and energy systems. We explore various approaches for embedding and ensuring safety constraints, including structural priors, Lyapunov and Control Barrier Functions, predictive control, projections, and robust optimization techniques. Additionally, we delve into methods for uncertainty quantification and safety verification, including reachability analysis and neural network verification tools, which help validate that control policies remain within safe operating bounds even in uncertain environments. The paper includes illustrative examples demonstrating the implementation aspects of safe learning frameworks that combine the strengths of data-driven approaches with the rigor of physical principles, offering a path toward the safe control of complex dynamical systems.

eess.SY↗

A Unified Framework to Enforce, Discover, and Promote Symmetry in Machine Learning

Symmetry is present throughout nature and continues to play an increasingly central role in physics and machine learning. Fundamental symmetries, such as Poincaré invariance, allow physical laws discovered in laboratories on Earth to be extrapolated to the farthest reaches of the universe. Symmetry is essential to achieving this extrapolatory power in machine learning applications. For example, translation invariance in image classification allows models with fewer parameters, such as convolutional neural networks, to be trained on smaller data sets and achieve state-of-the-art performance. In this paper, we provide a unifying theoretical and methodological framework for incorporating symmetry into machine learning models in three ways: 1. enforcing known symmetry when training a model; 2. discovering unknown symmetries of a given model or data set; and 3. promoting symmetry during training by learning a model that breaks symmetries within a user-specified group of candidates when there is sufficient evidence in the data. We show that these tasks can be cast within a common mathematical framework whose central object is the Lie derivative associated with fiber-linear Lie group actions on vector bundles. We extend and unify several existing results by showing that enforcing and discovering symmetry are linear-algebraic tasks that are dual with respect to the bilinear structure of the Lie derivative. We also propose a novel way to promote symmetry by introducing a class of convex regularization functions based on the Lie derivative and nuclear norm relaxation to penalize symmetry breaking during training of machine learning models. We explain how these ideas can be applied to a wide range of machine learning models including basis function regression, dynamical systems discovery, neural networks, and neural operators acting on fields.

cs.LG↗

Decoding complexity: how machine learning is redefining scientific discovery

As modern scientific instruments generate vast amounts of data and the volume of information in the scientific literature continues to grow, machine learning (ML) has become an essential tool for organising, analysing, and interpreting these complex datasets. This paper explores the transformative role of ML in accelerating breakthroughs across a range of scientific disciplines. By presenting key examples -- such as brain mapping and exoplanet detection -- we demonstrate how ML is reshaping scientific research. We also explore different scenarios where different levels of knowledge of the underlying phenomenon are available, identifying strategies to overcome limitations and unlock the full potential of ML. Despite its advances, the growing reliance on ML poses challenges for research applications and rigorous validation of discoveries. We argue that even with these challenges, ML is poised to disrupt traditional methodologies and advance the boundaries of knowledge by enabling researchers to tackle increasingly complex problems. Thus, the scientific community can move beyond the necessary traditional oversimplifications to embrace the full complexity of natural systems, ultimately paving the way for interdisciplinary breakthroughs and innovative solutions to humanity's most pressing challenges.

cs.LG↗

Reduced-order modeling and classification of hydrodynamic pattern formation in gravure printing

Hydrodynamic pattern formation phenomena in printing and coating processes are still not fully understood. However, fundamental understanding is essential to achieve high-quality printed products and to tune printed patterns according to the needs of a specific application like printed electronics, graphical printing, or biomedical printing. The aim of the paper is to develop an automated pattern classification algorithm based on methods from supervised machine learning and reduced-order modeling. We use the HYPA-p dataset, a large image dataset of gravure-printed images, which shows various types of hydrodynamic pattern formation phenomena. It enables the correlation of printing process parameters and resulting printed patterns for the first time. 26880 images of the HYPA-p dataset have been labeled by a human observer as dot patterns, mixed patterns, or finger patterns; 864000 images (97%) are unlabeled. A singular value decomposition (SVD) is used to find the modes of the labeled images and to reduce the dimensionality of the full dataset by truncation and projection. Selected machine learning classification techniques are trained on the reduced-order data. We investigate the effect of several factors, including classifier choice, whether or not fast Fourier transform (FFT) is used to preprocess the labeled images, data balancing, and data normalization. The best performing model is a k-nearest neighbor (kNN) classifier trained on unbalanced, FFT-transformed data with a test error of 3%, which outperforms a human observer by 7%. Data balancing slightly increases the test error of the kNN-model to 5%, but also increases the recall of the mixed class from 90% to 94%. Finally, we demonstrate how the trained models can be used to predict the pattern class of unlabeled images and how the predictions can be correlated to the printing process parameters, in the form of regime maps.

cs.LG↗