AI RESEARCH
Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness and Safety
arXiv CS.LG
•
ArXi:2605.17126v1 Announce Type: cross We study the multi-task linear regression problem in the presence of contaminated tasks. We address the setting where the unknown parameters of a majority of tasks are close in the $\ell_2$-norm, while a fraction of tasks are arbitrary outliers. Existing theoretical frameworks for this problem rely heavily on the assumption that the empirical second moment of each task has a minimum eigenvalue bounded away from zero (order $\Omega(1)$). Crucially, this assumption fails in many high-dimensional scenarios, rendering prior guarantees vacuous.