English
Related papers

Related papers: Sparsistent Model Discovery

200 papers

We study a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input…

Information Theory · Computer Science 2019-05-27 Aleksandr Aravkin , James Burke , Daiwei He

The growing demand for robots to operate effectively in diverse environments necessitates the need for robust real-time anomaly detection techniques during robotic operations. However, deep learning-based models in robotics face significant…

Robotics · Computer Science 2025-06-24 Taewook Kang , Bum-Jae You , Juyoun Park , Yisoo Lee

The automated discovery of constitutive models from data has recently emerged as a promising alternative to the traditional model calibration paradigm. In this work, we present a fully automated framework for constitutive model discovery…

Machine Learning · Computer Science 2025-12-01 Jorge-Humberto Urrea-Quintero , David Anton , Laura De Lorenzis , Henning Wessels

Sparse regression and feature extraction are the cornerstones of knowledge discovery from massive data. Their goal is to discover interpretable and predictive models that provide simple relationships among scientific variables. While the…

Machine Learning · Computer Science 2024-01-17 Jeremy A. McCulloch , Skyler R. St. Pierre , Kevin Linka , Ellen Kuhl

The problem of recovering the sparsity pattern of a fixed but unknown vector $\beta^* \in \real^p based on a set of $n$ noisy observations arises in a variety of settings, including subset selection in regression, graphical model selection,…

Statistics Theory · Mathematics 2007-07-13 Martin J. Wainwright

Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and…

Information Theory · Computer Science 2015-06-09 Felix Krahmer , Deanna Needell , Rachel Ward

Sparse Identification of Nonlinear Dynamics (SINDy) is a method of system discovery that has been shown to successfully recover governing dynamical systems from data (Brunton et al., PNAS, '16; Rudy et al., Sci. Adv. '17). Recently, several…

Numerical Analysis · Mathematics 2021-07-28 Daniel A. Messenger , David M. Bortz

This paper is concerned with high-dimensional panel data models where the number of regressors can be much larger than the sample size. Under the assumption that the true parameter vector is sparse we propose a panel-Lasso estimator and…

Statistics Theory · Mathematics 2014-02-14 Anders Bredahl Kock

The ability to discover physical laws and governing equations from data is one of humankind's greatest intellectual achievements. A quantitative understanding of dynamic constraints and balances in nature has facilitated rapid development…

Dynamical Systems · Mathematics 2016-04-27 Steven L. Brunton , Joshua L. Proctor , J. Nathan Kutz

In this work, we study the problem of learning a nonlinear dynamical system by parameterizing its dynamics using basis functions. We assume that disturbances occur at each time step with an arbitrary probability $p$, which models the…

Optimization and Control · Mathematics 2025-03-24 Haixiang Zhang , Baturalp Yalcin , Javad Lavaei , Eduardo D. Sontag

Real-world processes often contain intermediate state that can be modeled as an extremely sparse activation tensor. In this work, we analyze the identifiability of such sparse and local latent intermediate variables, which we call motifs.…

Machine Learning · Computer Science 2026-03-04 Kavi Gupta , Osbert Bastani , Armando Solar-Lezama

Robust physics discovery is of great interest for many scientific and engineering fields. Inspired by the principle that a representative model is the one simplest possible, a new model selection criteria considering both model's Parsimony…

Machine Learning · Computer Science 2022-03-02 Zhiming Zhang , Yongming Liu

This article considers recovery of signals that are sparse or approximately sparse in terms of a (possibly) highly overcomplete and coherent tight frame from undersampled data corrupted with additive noise. We show that the properly…

Information Theory · Computer Science 2013-09-10 Junhong Lin , Song Li

Standard high-dimensional regression methods assume that the underlying coefficient vector is sparse. This might not be true in some cases, in particular in presence of hidden, confounding variables. Such hidden confounding can be…

Methodology · Statistics 2020-08-19 Domagoj Ćevid , Peter Bühlmann , Nicolai Meinshausen

The discovery of partial differential equations (PDEs) from experimental data holds great promise for uncovering predictive models of complex physical systems. In this study, we introduce an efficient automatic model discovery framework,…

Numerical Analysis · Mathematics 2025-06-24 Shilin Zhang , Yunqing Huang , Nianyu Yi , shihan Zhang

In this paper, we consider a compressed sensing problem of reconstructing a sparse signal from an undersampled set of noisy linear measurements. The regularized least squares or least absolute shrinkage and selection operator (LASSO)…

Information Theory · Computer Science 2014-10-30 Chao-Kai Wen , Jun Zhang , Kai-Kit Wong , Jung-Chieh Chen , Chau Yuen

Recovering dynamical equations from observed noisy data is the central challenge of system identification. We develop a statistical mechanics approach to analyze sparse equation discovery algorithms, which typically balance data fit and…

Statistical Mechanics · Physics 2025-09-16 Andrei A. Klishin , Joseph Bakarji , J. Nathan Kutz , Krithika Manohar

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li

Dynamical systems modeling is a core pillar of scientific inquiry across natural and life sciences. Increasingly, dynamical system models are learned from data, rendering identifiability a paramount concept. For systems that are not…

Machine Learning · Computer Science 2026-05-11 Cecilia Casolo , Sören Becker , Niki Kilbertus

Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of…

Information Theory · Computer Science 2016-04-05 Anastasios Kyrillidis , Bubacarr Bah , Rouzbeh Hasheminezhad , Quoc Tran-Dinh , Luca Baldassarre , Volkan Cevher
‹ Prev 1 3 4 5 6 7 10 Next ›