Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization

Abstract

The selection problem of an optimal set of sensors estimating the snapshot of high-dimensional data is considered. The objective functions based on various criteria of optimal design are adopted to the greedy method: D-optimality, A-optimality, and E-optimality, which maximizes the determinant, minimize the trace of inverse, and maximize the minimum eigenvalue of the Fisher information matrix, respectively. First, the Fisher information matrix is derived depending on the numbers of latent state variables and sensors. Then, the unified formulation of the objective function based on A-optimality is introduced and proved to be submodular, which provides the lower bound on the performance of the greedy method. Next, the greedy methods based on D-, A-, and E-optimality are applied to randomly generated systems and a practical data set of global climates. The sensors selected by the D-optimality objective function works better than those by A- and E-optimality with regard to the determinant, trace of the inverse, and reconstruction error, while those by A-optimality works the best with regard to the minimum eigenvalue. On the other hand, the performance of sensors selected by the E-optimality objective function is worse for all indices and reconstruction error. This might be because of the lack of submodularity as proved in the paper. The results indicate that the greedy method based on D-optimality is the most suitable for high accurate reconstruction with low computational cost.

References in corpus (9)

• Data-Driven Sparse Sensor Placement for Reconstruction
• On Submodularity and Controllability in Complex Dynamical Networks
• A New Selection Operator for the Discrete Empirical Interpolation Method -- improved a priori error bound and extensions
• Determinant-based Fast Greedy Sensor Selection Algorithm
• Fast Greedy Optimization of Sensor Selection in Measurement with Correlated Noise
• Optimized Sampling for Multiscale Dynamics
• Data-driven sparse sensor placement based on A-optimal design of experiment with ADMM
• Data-driven Vector-measurement-sensor Selection based on Greedy Algorithm
• Randomized Subspace Newton Convex Method Applied to Data-Driven Sensor Selection Problem

Cited by in corpus (15)

• Generalization techniques of neural networks for fluid flow estimation
• Determinant-based Fast Greedy Sensor Selection Algorithm
• Fast Greedy Optimization of Sensor Selection in Measurement with Correlated Noise
• Data-driven sparse sensor placement based on A-optimal design of experiment with ADMM
• Randomized Subspace Newton Convex Method Applied to Data-Driven Sensor Selection Problem
• Data-Driven Sensor Selection Method Based on Proximal Optimization for High-Dimensional Data With Correlated Measurement Noise
• Nondominated-Solution-based Multi-objective Greedy Sensor Selection for Optimal Design of Experiments
• Optimization of Sparse Sensor Placement for Estimation of Wind Direction and Surface Pressure Distribution Using Time-Averaged Pressure-Sensitive Paint Data on Automobile Model
• Seismic Wavefield Reconstruction based on Compressed Sensing using Data-Driven Reduced-Order Model
• Proof-of-concept Study of Sparse Processing Particle Image Velocimetry for Real Time Flow Observation
• Robust training approach of neural networks for fluid flow state estimations
• Randomized Group-Greedy Method for Large-Scale Sensor Selection Problems
• Observation Site Selection for Physical Model Parameter Estimation toward Process-Driven Seismic Wavefield Reconstruction
• Fast Data-driven Greedy Sensor Selection for Ridge Regression
• An efficient offline sensor placement method for flow estimation