Linear models based on noisy data and the Frisch scheme
From MaRDI portal
Publication:2808247
Abstract: We address the problem of identifying linear relations among variables based on noisy measurements. This is, of course, a central question in problems involving "Big Data." Often a key assumption is that measurement errors in each variable are independent. This precise formulation has its roots in the work of Charles Spearman in 1904 and of Ragnar Frisch in the 1930's. Various topics such as errors-in-variables, factor analysis, and instrumental variables, all refer to alternative formulations of the problem of how to account for the anticipated way that noise enters in the data. In the present paper we begin by describing the basic theory and provide alternative modern proofs to some key results. We then go on to consider certain generalizations of the theory as well applying certain novel numerical techniques to the problem. A central role is played by the Frisch-Kalman dictum which aims at a noise contribution that allows a maximal set of simultaneous linear relations among the noise-free variables --a rank minimization problem. In the years since Frisch's original formulation, there have been several insights including trace minimization as a convenient heuristic to replace rank minimization. We discuss convex relaxations and certificates guaranteeing global optimality. A complementary point of view to the Frisch-Kalman dictum is introduced in which models lead to a min-max quadratic estimation error for the error-free variables. Points of contact between the two formalisms are discussed and various alternative regularization schemes are indicated.
Recommendations
- Identification of the maximal number of linear relations from noisy data
- Certain models from uncertain data: The algebraic case
- scientific article; zbMATH DE number 37094
- An upper bound on the number of linear relations identified from noisy data by the Frisch scheme
- scientific article; zbMATH DE number 5620939
Cites work
- scientific article; zbMATH DE number 3117083 (Why is no real title available?)
- scientific article; zbMATH DE number 3942782 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1521457 (Why is no real title available?)
- scientific article; zbMATH DE number 218675 (Why is no real title available?)
- scientific article; zbMATH DE number 3017040 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2120941 (Why is no real title available?)
- scientific article; zbMATH DE number 3258737 (Why is no real title available?)
- A Competitive Minimax Approach to Robust Estimation of Random Parameters
- A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
- A Riemannian framework for tensor computing
- A Structure Theory for Linear Dynamic Errors-in-Variables Models
- A penalized maximum likelihood approach to sparse factor analysis
- An upper bound on the number of linear relations identified from noisy data by the Frisch scheme
- Confluence Analysis by Means of Lag Moments and Other Methods of Confluence Analysis
- Consistent Sets of Estimates for Regressions with Errors in All Variables
- Diagonal and low-rank matrix decompositions, correlation matrices, and ellipsoid fitting
- Differential-geometrical methods in statistics
- Dynamic errors-in-variables systems with three variables
- Dynamic factor models with infinite-dimensional factor spaces: one-sided representations
- Errors in Variables
- Errors-in-variables methods in system identification
- Estimating linear statistical relationships
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Estimation of high-dimensional low-rank matrices
- Exact matrix completion via convex optimization
- Factor modeling for high-dimensional time series: inference for the number of factors
- Generalized linear dynamic factor models: an approach via singular autoregressions
- Generic global identification in factor analysis
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Identifiability of factor analysis: Some results and open problems
- Identification of a linear system from inexact data: A three-variable example
- Identification of noisy systems
- Identification of the maximal number of linear relations from noisy data
- Information geometry of covariance matrix: Cartan-Siegel homogeneous bounded domains, Mostow/Berger fibration and Fréchet median
- Latent variable models and factor analysis. A unified approach
- Least-Squares Approximation of Structured Covariances
- Linear dynamic errors-in-variables models. Some structure theory
- Matrices with prescribed off-diagonal elements
- Matrix Completion From a Few Entries
- Matrix completion from noisy entries
- Minimum rank and minimum trace of covariance matrices
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- On Majorization, Factorization, and Range Inclusion of Operators on Hilbert Space
- On minimax robustness: A general approach and applications
- Positive definite matrices
- Principal component analysis.
- Rank-Sparsity Incoherence for Matrix Decomposition
- Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
- Robust techniques for signal processing: A survey
- Some contributions to maximum likelihood factor analysis
- Some necessary conditions for common-factor analysis
- System Identification by Dynamic Factor Models
- The Generalized Dynamic Factor Model
- The distance between two random vectors wigh given dispersion matrices
- The foundations of factor analysis
- The general dynamic factor model: one-sided representation results
- Weighted minimum trace factor analysis
Cited in
(9)- Bayesian Factor Model Shrinkage for Linear IV Regression With Many Instruments
- scientific article; zbMATH DE number 37094 (Why is no real title available?)
- A general system for heuristic minimization of convex functions over non-convex sets
- Identification of a linear system from inexact data: A three-variable example
- Identification of linear relations from noisy data: Geometrical aspects
- The prejudices of least squares, principal components and common factors schemes
- Certain models from uncertain data: The algebraic case
- An alternating minimization algorithm for factor analysis.
- scientific article; zbMATH DE number 16939 (Why is no real title available?)
This page was built for publication: Linear models based on noisy data and the Frisch scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808247)
