Computing L1 Straight-Line Fits to Data (Part 1)
Ian Barrodale

TL;DR
This paper discusses methods for computing L1 straight-line fits to data, providing foundational insights for those new to L1 approximation and detailed analysis for experienced readers.
Contribution
It offers a comprehensive overview of L1 fitting algorithms, including new insights into their properties and computation methods.
Findings
Provides detailed properties of L1 approximation
Introduces algorithms for L1 straight-line fitting
Clarifies theoretical aspects of L1 algorithms
Abstract
The initial remarks in this technical report are primarily for those not familiar with the properties of L1 approximation, but the remainder of the report should also interest readers who are already acquainted with the inner workings of L1 algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Neural Networks and Applications
