The Approximation of One Matrix by Another of Lower Rank
1936/09/01 by Carl Eckart, Gale Young · 206 citations
Computer Science · #Matrix Theory and Algorithms
paper · doi:10.1007/bf02288367
Abstract
The mathematical problem of approximating one matrix by another of lower rank is closely related to the fundamental postulate of factor-theory. When formulated as a least-squares problem, the normal equations cannot be immediately written down, since the elements of the approximate matrix are not independent of one another. The solution of the problem is simplified by first expressing the matrices in a canonic form. It is found that the problem always has a solution which is usually unique. Several conclusions can be drawn from the form of this solution. A hypothetical interpretation of the canonic components of a score matrix is discussed.
Cited by
- Analysis of Individual Differences in Multidimensional Scaling Via an N-way Generalization of “Eckart-Young” Decomposition
- Some Mathematical Notes on Three-Mode Factor Analysis
- Generalized Procrustes Analysis
- A Generalized Solution of the Orthogonal Procrustes Problem
- A Statistical Model which Combines Features of Factor Analytic and Analysis of Variance Techniques
- Direct Schmid–Leiman Transformations and Rank-Deficient Loadings Matrices
- A physics-informed transformer surrogate model for real-time structural response prediction of unbonded flexible pipes via POD-based dimensionality reduction
- Evolutionary Personality Psychology
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- NeuraLSP: A Neural Spectral Preconditioner for Accelerating PDE Solvers
- Intrinsic Low-Tucker-Rank Theory and Unified Tensor CUR Decomposition for High-Dimensional Hyperinterpolation
- Near-Field Sampling for Line Sources
- Hankel and Toeplitz Rank-1 Decomposition of Arbitrary Matrices with Applications to Signal Direction-of-Arrival Estimation
- Stability of Low-Rank Implicit Regularization in Perturbed Deep Matrix Factorization
- Robust high-order low-rank BUG integrators based on explicit Runge--Kutta methods
- Beyond Orbital Rotations: Correlation-Rank Limits and Clifford-Accessible Measurement, from Algebra and Global Optimization
- Contraction versus Recurrence: An Exponential Separation in Observation-Based Prediction of Deterministic Dynamics
- Programmable and nonvolatile computing with composition tuning in thin film lithium niobate
- A Correlation-Gap Bound for Nonlinear Gaussian PCA
- Procedural Knowledge Is Not Low-Rank: Why LoRA Fails to Internalize Multi-Step Procedures
- Frame-wise multi-echo distortion correction for superior functional MRI
- Hybrid neural interpolation of a sequence of wind flows
- Higher-order Count Sketch: Dimensionality Reduction That Retains Efficient Tensor Operations
- Understanding Traffic Density from Large-Scale Web Camera Data
- Tensor Learning-based Precoder Codebooks for FD-MIMO Systems
- Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure
- A Schatten-q Low-rank Matrix Perturbation Analysis via Perturbation Projection Error Bound
- Laplace Redux -- Effortless Bayesian Deep Learning
- A Very Fast Algorithm for Matrix Factorization
- Quantum Hamiltonian complexity and the detectability lemma
- Generalizable Learning for Massive MIMO CSI Feedback in Unseen Environments
- Provable Inductive Robust PCA via Iterative Hard Thresholding
- On the existence of Optimal Subspace Clustering Models
- Nonnegative approximations of nonnegative tensors
- Federated Principal Component Analysis
- State-Of-The-Art Algorithms For Low-Rank Dynamic Mode Decomposition
- Latent-LoRA: Compact Latent-Space Adapters with Gradient-Free Routing for Continual Learning
- The Entropic Bound for Transformers: Why Static Rank Fails and Attention-Native Rank Recovers
- LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decoding
- Low-Rank Matrix Recovery from Row-and-Column Affine Measurements
- Multipartite Quantum Correlation and Communication Complexities
- Principal Component Pursuit with Reduced Linear Measurements
- Fast Cross-Scenario Adaptation of CSI Models via Channel Conditional Parameter Generation
- Deep Eigenspace Network for Parametric Non-self-adjoint Eigenvalue Problems
- Quantum State Preparation via Schmidt Spectrum Optimisation
- Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds
- Tree tensor network states represent low-energy states faithfully
- Non-Hermitian Exceptional Topology on a Klein Bottle Photonic Circuit
- Toward Scalable and Valid Conditional Independence Testing with Spectral Representations
- A Reduced Basis Decomposition Approach to Efficient Data Collection in Pairwise Comparison Studies
- Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositions
- Line Cover and Related Problems
- FasterVAR: Plug-and-Play Acceleration for Visual Autoregressive Models
- Prospects for quantum advantage in machine learning from the representability of functions
- Semi-Blind Joint Channel and Symbol Estimation for Beyond Diagonal Reconfigurable Surfaces
- Determinant-Based Error Bounds for CUR Matrix Approximation: Oversampling and Volume Sampling
- Near-Zero-Overhead Freshness for Recommendation Systems via Inference-Side Model Updates
- RePack then Refine: Efficient Diffusion Transformer with Vision Foundation Model
- Learned SVD: solving inverse problems via hybrid autoencoding
- Stay Unique, Stay Efficient: Preserving Model Personality in Multi-Task Merging
- Cross-Geometry Transfer Learning in Fast Electromagnetic Shower Simulation
- Algorithmic Guarantees for Distilling Supervised and Offline RL Datasets
- Interference and Multipath Resilient ToA Estimation
- Optimal Shift Invariant Spaces and Their Parseval Generators
CRLS: Convolutional Regularized Least Squares Framework for Reduced Order Modeling of Transonic Flows- Low-Rank GEMM: Efficient Matrix Multiplication via Low-Rank Approximation with FP8 Acceleration
- Towards Efficient VLMs: Information-Theoretic Driven Compression via Adaptive Structural Pruning
- Linear Algebraic Approaches to Neuroimaging Data Compression: A Comparative Analysis of Matrix and Tensor Decomposition Methods for High-Dimensional Medical Images
- Unmasking Airborne Threats: Guided-Transformers for Portable Aerosol Mass Spectrometry
- Adafactor: Adaptive Learning Rates with Sublinear Memory Cost
- Data-driven Model Reduction for Parameter-Dependent Matrix Equations via Operator Inference
- CompTrack: Information Bottleneck-Guided Low-Rank Dynamic Token Compression for Point Cloud Tracking
- Dynamic mode decomposition with control
- N-GLARE: An Non-Generative Latent Representation-Efficient LLM Safety Evaluator
- Beyond One-Size-Fits-All: Neural Networks for Differentially Private Tabular Data Synthesis
- Intrinsic volumes of set of singular matrices
- A Sharp Blockwise Tensor Perturbation Bound for Orthogonal Iteration
- Tail-Net: Extracting Lowest Singular Triplets for Big Data Applications
- KVSwap: Disk-aware KV Cache Offloading for Long-Context On-device Inference
- New perturbation bounds for low rank approximation of matrices: Beyond Eckart-Young-Mirsky
- Global Optimization on Graph-Structured Data via Gaussian Processes with Spectral Representations
- Joint Access Point Selection and Beamforming Design for Bistatic Backscatter Communication
- Online Subspace Learning on Flag Manifolds for System Identification
- Single-pass randomized QLP decomposition for low-rank approximation
- Pose Graph Optimization in the Complex Domain: Lagrangian Duality, Conditions For Zero Duality Gap, and Optimal Solutions
- Faithful Contouring: Near-Lossless 3D Voxel Representation Free from Iso-surface
- Parametric Hierarchical Matrix Approximations to Kernel Matrices
- Semi-Supervised Affective Meaning Lexicon Expansion Using Semantic and Distributed Word Representations
- In Situ Training of Implicit Neural Compressors for Scientific Simulations via Sketch-Based Regularization
- Real-Time Learning of Predictive Dynamic Obstacle Models for Robotic Motion Planning
- Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy
- Perturbation Bounds for Low-Rank Inverse Approximations under Noise
- Joint Sparse Recovery Using Signal Space Matching Pursuit
- Weighted Low-Rank Matrix Approximation: Acceleration and Applications
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Least-squares registration of point sets over SE (d) using closed-form\n projections
- Conv-Linformer: Boosting Linformer's Performance with Convolution in Small-Scale Settings
- Tensor Q-Rank: New Data Dependent Definition of Tensor Rank
- Multi-channel Weighted Nuclear Norm Minimization for Real Color Image Denoising
- randPedPCA: rapid approximation of principal components from large pedigrees
- A hybrid penalty method for a class of optimization problems with multiple rank constraints
- The Inverse of a Nearly Banded Matrix
- Simpler is better: A comparative study of randomized algorithms for computing the CUR decomposition
- Mixed precision matrix interpolative decompositions for model reduction
- ASTROMLSKIT: A New Statistical Machine Learning Toolkit: A Platform for Data Analytics in Astronomy
- Intelligence, physics and information -- the tradeoff between accuracy and simplicity in machine learning
- Mapping Networks
- Gradient descent with nonconvex constraints: local concavity determines convergence
- Conditional neural field for spatial dimension reduction of turbulence data: a comparison study
- Eigenfunction Extraction for Ordered Representation Learning
- From Principal Subspaces to Principal Components with Linear Autoencoders
- ScaLoRA: Optimally Scaled Low-Rank Adaptation for Efficient High-Rank Fine-Tuning
- Revisiting Orbital Minimization Method for Neural Operator Decomposition
- CPSVD: Enhancing Large Language Model Compression via Column-Preserving Singular Value Decomposition
- Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit
- Binary Quadratic Quantization: Beyond First-Order Quantization for Real-Valued Matrix Compression
- Rethinking PCA Through Duality
- randPedPCA: Rapid approximation of principal components from large pedigrees
- A Review of Equation-Based and Data-Driven Reduced Order Models featuring a Hybrid cardiovascular application
- Improving Model Representation and Reducing KV Cache via Skip Connections with First Value Heads
- Decorrelation Speeds Up Vision Transformers
- Machine-learning media bias
- Variational Analysis in Spectral Decomposition Systems
- Joint Jammer Mitigation and Data Detection
- A PCA-based Data Prediction Method
- Approximating quantum states by states of low rank
- Likelihood-informed Model Reduction for Bayesian Inference of Static Structural Loads
- Randomized truncation of quantum states
- Don't Run with Scissors: Pruning Breaks VLA Models but They Can Be Recovered
- FlyLoRA: Boosting Task Decoupling and Parameter Efficiency via Implicit Rank-Wise Mixture-of-Experts
- Posthandling Spectral Information Enhancement for Single Cell Raman Molecular Mapping Analysis
- Empirical Bayes Matrix Factorization
- Gold-Switch: Training-Free Superposition of Slow- and Fast- Thinking LLMs
- Low-Rank-Based Approximate Computation with Memristors
- Exact Recovery in the General Hypergraph Stochastic Block Model
- An Efficient Approach to Informative Feature Extraction from Multimodal Data
- Beyond Regularization: Inherently Sparse Principal Component Analysis
- Ultra-Efficient Decoding for End-to-End Neural Compression and Reconstruction
- Reservoir computing based predictive reduced order model for steel grade intermixing in an industrial continuous casting tundish
- Real-Aware Residual Model Merging for Deepfake Detection
- Better Hessians Matter: Studying the Impact of Curvature Approximations in Influence Functions
- Memory-Efficient Fine-Tuning via Low-Rank Activation Compression
- F-Adapter: Frequency-Adaptive Parameter-Efficient Fine-Tuning in Scientific Machine Learning
- Nonlinear matrix recovery using optimization on the Grassmann manifold
- Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions
- Representing LLMs in Prompt Semantic Task Space
- Does Generative Retrieval Overcome the Limitations of Dense Retrieval?
- COSPADI: Compressing LLMs via Calibration-Guided Sparse Dictionary Learning
- Fast Rank Adaptive CUR via a Recycled Small Sketch
- Blockwise Hadamard high-Rank Adaptation for Parameter-Efficient LLM Fine-Tuning
- Efficient Multi-Objective Constrained Bayesian Optimization of Bridge Girder
- Canonical Correlation Analysis (CCA) Based Multi-View Learning: An Overview
- Co-clustering of Response and Covariate Variables by Tri-Factorizing Their Non-negative Regression Coefficient Matrix
- Mathematics for Machine Learning
- Modal Analysis of Fluid Flows: An Overview
- TIMERS: Error-Bounded SVD Restart on Dynamic Networks
- Farthest sampling segmentation of triangulated surfaces
- Data Efficient Adaptation in Large Language Models via Continuous Low-Rank Fine-Tuning
- Optimal Bias-variance Tradeoff in Matrix and Tensor Estimation
- Understanding Post-Training Structural Changes in Large Language Models
- LifeAlign: Lifelong Alignment for Large Language Models with Memory-Augmented Focalized Preference Optimization
- ReFACTor: Practical Low-Rank Matrix Estimation Under Column-Sparsity
- Low Rank Approximation of Tensors via Sparse Optimization
- The Singular Value Decomposition, Applications and Beyond
- The Filter Echo: A General Tool for Filter Visualisation
- HARP: Hallucination Detection via Reasoning Subspace Projection
- A Wind of Change: Detecting and Evaluating Lexical Semantic Change\n across Times and Domains
- PHLoRA: data-free Post-hoc Low-Rank Adapter extraction from full-rank checkpoint
- Bi-fidelity Interpolative Decomposition for Multimodal Data
- Single-Pass PCA of Large High-Dimensional Data
- Coupled tensor models for probability mass function estimation: Part II, Uniqueness of the model
- Reduced basis solvers for unfitted methods on parameterized domains
- Fluid dynamics meet network science: two cases of temporal network eigendecomposition
- Fast and Accurate SVD-Type Updating in Streaming Data
- Stable Principal Component Pursuit
- SSVD: Structured SVD for Parameter-Efficient Fine-Tuning and Benchmarking under Domain Shift in ASR
- A hybrid dynamical-stochastic model of maximum temperature time series of Imphal, Northeast India incorporating nonlinear feedback and noise diagnostics
- ER-LoRA: Effective-Rank Guided Adaptation for Weather-Generalized Depth Estimation
- A scaling method for priorities in hierarchical structures
- Estimation of large block structured covariance matrices: Application to "multi-omic" approaches to study seed quality
- Low-Rank Multi-Objective Linear Programming
- CALR: Corrective Adaptive Low-Rank Decomposition for Efficient Large Language Model Layer Compression
- Compressed Randomized UTV Decompositions for Low-Rank Approximations and Big Data Applications
- PaToPa: A Data-Driven Parameter and Topology Joint Estimation Framework in Distribution Grids
- A Generalized Least Squares Matrix Decomposition
- Generalized low rank approximation to the symmetric positive semidefinite matrix
- A Joint Sparse Self-Representation Learning Method for Multiview Clustering
- Nonlinear Matrix Approximation with Radial Basis Function Components
- A Minimal Perturbation Approach For The Rectangular Multiparameter Eigenvalue Problem
- Optimal Linear Baseline Models for Scientific Machine Learning
- A low-rank solver for the Stokes-Darcy model with random hydraulic conductivity and Beavers-Joseph condition
- Cross-LoRA: A Data-Free LoRA Transfer Framework across Heterogeneous LLMs
- Heterogeneity-Oblivious Robust Federated Learning
- Compressed Deep Networks: Goodbye SVD, Hello Robust Low-Rank Approximation
- Diverging conditional correlation lengths in the approach to high temperature
- FlashSVD: Memory-Efficient Inference with Streaming for Low-Rank Models
- Stacked SVD or SVD stacked? A Random Matrix Theory perspective on data integration
- Semi-orthogonal Non-negative Matrix Factorization with an Application in Text Mining
- Connectome Smoothing via Low-rank Approximations
- Robust Parameter Inversion using Adaptive Reduced Order Models
- MIMCA: Multiple imputation for categorical variables with multiple correspondence analysis
- High Order Singular Value Decomposition for Plant Biodiversity Estimation
- Fast and Robust Fixed-Rank Matrix Recovery
- On the uniform distribution of rational inputs with respect to condition numbers of Numerical Analysis
- Carl Eckart [wikipedia]
- Low-rank approximation [wikipedia]
Related