mlsanityData to 7 Oct 2026

Inadequacy of Linear Methods for Minimal Sensor Placement and Feature Selection in Nonlinear Systems; a New Approach Using Secants

arXiv 2101.11162 ↗First posted 27 Jan 2021math.OC cs.LG cs.SYcited by 3

Not on the map. Why?

Abstract (arXiv)

Sensor placement and feature selection are critical steps in engineering, modeling, and data science that share a common mathematical theme: the selected measurements should enable solution of an inverse problem. Most real-world systems of interest are nonlinear, yet the majority of available techniques for feature selection and sensor placement rely on assumptions of linearity or simple statistical models. We show that when these assumptions are violated, standard techniques can lead to costly over-sensing without guaranteeing that the desired information can be recovered from the measurements. In order to remedy these problems, we introduce a novel data-driven approach for sensor placement and feature selection for a general type of nonlinear inverse problem based on the information contained in secant vectors between data points. Using the secant-based approach, we develop three efficient greedy algorithms that each provide different types of robust, near-minimal reconstruction guarantees. We demonstrate them on two problems where linear techniques consistently fail: sensor placement to reconstruct a fluid flow formed by a complicated shock-mixing layer interaction and selecting fundamental manifold learning coordinates on a torus.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 4 of its 74 references that are in the map. First posted on arXiv 27 Jan 2021.

Builds on

4 of 74 references.

References · 4

  1. 2016Structured Inference Networks for Nonlinear State Space Modelscited by 182
  2. 2017Data-Driven Sparse Sensor Placement for Reconstructioncited by 57
  3. 2014On Submodularity and Controllability in Complex Dynamical Networkscited by 10
  4. 2015Sensor Placement for Optimal Kalman Filtering: Fundamental Limits, Submodularity, and Algorithmscited by 6

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 0; 2025: 1.

3 papers.