Related papers: Optimal Sparsity in Nonlinear Non-Parametric Reduc…
Nonintrusive projection-based reduced order models (ROMs) are essential for dynamics prediction in multi-query applications where access to the source of the underlying full order model (FOM) is unavailable; that is, FOM is a black-box.…
We present a new class of methods for high-dimensional nonparametric regression and classification called sparse additive models (SpAM). Our methods combine ideas from sparse linear modeling and additive nonparametric regression. We derive…
Reduced order modeling (ROM) is a field of techniques that approximates complex physics-based models of real-world processes by inexpensive surrogates that capture important dynamical characteristics with a smaller number of degrees of…
Reduced order modeling (ROM) techniques are numerical methods that approximate the solution of parametric partial differential equation (PDE) by properly combining the high-fidelity solutions of the problem obtained for several…
When adapting Simultaneous Mapping and Localization (SLAM) to real-world applications, such as autonomous vehicles, drones, and augmented reality devices, its memory footprint and computing cost are the two main factors limiting the…
This work presents a non-intrusive reduced-order modeling framework for dynamical systems with spatially localized features characterized by slow singular value decay. The proposed approach builds upon two existing methodologies for reduced…
The accuracy of the reduced-order model (ROM) mainly depends on the selected basis. Therefore, it is essential to compute an appropriate basis with an efficient numerical procedure when applying ROM to nonlinear problems. In this paper, we…
We study a generalized framework for structured sparsity. It extends the well-known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as part of a convex optimization problem. This framework provides…
Reduced-order models (ROMs) have become an essential tool for reducing the computational cost of fluid flow simulations. While standard ROMs can efficiently approximate laminar flows, their accuracy often suffers in convection-dominated…
Deep neural networks often suffer from poor generalization due to complex and non-convex loss landscapes. Sharpness-Aware Minimization (SAM) is a popular solution that smooths the loss landscape by minimizing the maximized change of…
This work introduces a reduced order modeling (ROM) framework for the solution of parameterized second-order linear elliptic partial differential equations formulated on unfitted geometries. The goal is to construct efficient…
In applications of nonlinear and complex dynamical systems, a common situation is that the system can be measured but its structure and the detailed rules of dynamical evolution are unknown. The inverse problem is to determine the system…
This paper presents a novel projection-based adaptive algorithm for sparse signal and system identification. The sequentially observed data are used to generate an equivalent sequence of closed convex sets, namely hyperslabs. Each hyperslab…
Several sparsity-constrained algorithms such as Orthogonal Matching Pursuit or the Frank-Wolfe algorithm with sparsity constraints work by iteratively selecting a novel atom to add to the current non-zero set of variables. This selection…
This work introduces a data-driven, non-intrusive reduced-order modeling (ROM) framework that leverages Optimal Transport (OT) for multi-fidelity and parametric problems in two-phase flows modelling. Building upon the success of…
In solving multi-modal, multi-objective optimization problems (MMOPs), the objective is not only to find a good representation of the Pareto-optimal front (PF) in the objective space but also to find all equivalent Pareto-optimal subsets…
Orthogonal Matching Pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used for a very straightforward analysis of OMP. Our main…
Robust motion planning is a well-studied problem in the robotics literature, yet current algorithms struggle to operate scalably and safely in the presence of other moving agents, such as humans. This paper introduces a novel framework for…
In this paper, we develop a dynamical system counterpart to the term sparsity sum-of-squares (TSSOS) algorithm proposed for static polynomial optimization. This allows for computational savings and improved scalability while preserving…
ASR systems are deployed across diverse environments, each with specific hardware constraints. We use supernet training to jointly train multiple encoders of varying sizes, enabling dynamic model size adjustment to fit hardware constraints…