Total Least Squares Regression in Input Sparsity Time
Huaian Diao, Zhao Song, David Woodruff, Xin Yang
–Neural Information Processing Systems
In the total least squares problem, one is given an m n matrix A, and an m d matrix B, and one seeks to "correct" both A and B, obtaining matrices  and B, so that there exists an X satisfying the equation ÂX = B. Typically the problem is overconstrained, meaning that m max(n, d).
Neural Information Processing Systems
Feb-12-2026, 05:03:27 GMT
- Country:
- Asia > Afghanistan
- Parwan Province > Charikar (0.04)
- Europe > Switzerland
- North America
- Canada > British Columbia
- United States
- California
- Alameda County > Berkeley (0.04)
- Santa Clara County > Palo Alto (0.04)
- Pennsylvania
- Allegheny County > Pittsburgh (0.04)
- Philadelphia County > Philadelphia (0.04)
- Virginia (0.04)
- California
- Asia > Afghanistan
- Technology: