Optimal selection of sample-size dependent common subsets of covariates for multi-task regression prediction
David Azriel, Yosef Rinott

TL;DR
This paper proposes a method for selecting sample-size dependent common covariate subsets across multiple regression tasks, improving prediction accuracy and computational efficiency by leveraging shared information.
Contribution
It introduces a novel approach for optimal covariate subset selection that adapts to sample size and exploits commonality across multiple regression datasets.
Findings
Effective subset selection improves prediction accuracy.
Shared covariate subsets reduce computational complexity.
Method adapts to varying sample sizes for better performance.
Abstract
An analyst is given a training set consisting of regression datasets of different sizes, which are distributed according to some , , where the distributions are assumed to form a random sample generated by some common source. In particular, the 's have a common set of covariates and they are all labeled. The training set is used by the analyst for selection of subsets of covariates denoted by , whose role is described next. The multi-task problem we consider is as follows: given a number of random labeled datasets (which may be in the training set or not) of size , , estimate separately for each dataset the regression coefficients on the subset of covariates and then predict future dependent variables given their covariates. Naturally, a large sample size of allows a larger…
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
TopicsMachine Learning and Data Classification · Adversarial Robustness in Machine Learning · Machine Learning and Algorithms
