Large-scale linear regression: Development of high-performance routines
Alvaro Frank, Diego Fabregat-Traver, Paolo Bientinesi

TL;DR
This paper presents a high-performance routine, { extsc{ols-grid}}, designed for large-scale linear regression problems involving billions of OLS computations on terabyte-scale datasets, optimizing efficiency and scalability.
Contribution
The paper introduces { extsc{ols-grid}}, a novel, efficient algorithm tailored for large-scale OLS problems, with strategies for memory management and parallel scalability.
Findings
Solves $10^{11}$ OLS problems in hours
Efficient algorithms exploit problem structure
Effective handling of datasets exceeding main memory
Abstract
In statistics, series of ordinary least squares problems (OLS) are used to study the linear correlation among sets of variables of interest; in many studies, the number of such variables is at least in the millions, and the corresponding datasets occupy terabytes of disk space. As the availability of large-scale datasets increases regularly, so does the challenge in dealing with them. Indeed, traditional solvers---which rely on the use of black-box" routines optimized for one single OLS---are highly inefficient and fail to provide a viable solution for big-data analyses. As a case study, in this paper we consider a linear regression consisting of two-dimensional grids of related OLS problems that arise in the context of genome-wide association analyses, and give a careful walkthrough for the development of {\sc ols-grid}, a high-performance routine for shared-memory architectures;…
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
TopicsGenetic Associations and Epidemiology · Gene expression and cancer classification · Algorithms and Data Compression
