A Unified Analysis of Multi-task Functional Linear Regression Models with Manifold Constraint and Composite Quadratic Penalty
Not on the map. Why?
Abstract (arXiv)
This work studies the multi-task functional linear regression models where both the covariates and the unknown regression coefficients (called slope functions) are curves. For slope function estimation, we employ penalized splines to balance bias, variance, and computational complexity. The power of multi-task learning is brought in by imposing additional structures over the slope functions. We propose a general model with double regularization over the spline coefficient matrix: i) a matrix manifold constraint, and ii) a composite penalty as a summation of quadratic terms. Many multi-task learning approaches can be treated as special cases of this proposed model, such as a reduced-rank model and a graph Laplacian regularized model. We show the composite penalty induces a specific norm, which helps to quantify the manifold curvature and determine the corresponding proper subset in the manifold tangent space. The complexity of tangent space subset is then bridged to the complexity of geodesic neighbor via generic chaining. A unified convergence upper bound is obtained and specifically applied to the reduced-rank model and the graph Laplacian regularized model. The phase transition behaviors for the estimators are examined as we vary the configurations of model parameters.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 72 references that are in the map. First posted on arXiv 9 Nov 2022.
Builds on
9 of 72 references.
References · 9
- 2020Multi-Task Learning with Deep Neural Networks: A Surveycited by 374
- 2017Distral: Robust Multitask Reinforcement Learningcited by 231
- 2015The Benefit of Multitask Representation Learningcited by 194
- 2018Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operatorcited by 70
- 2015Randomized sketches for kernels: Fast and optimal non-parametric regressioncited by 31
- 2016Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learningcited by 16
- 2021Minimax Optimal Regression over Sobolev Spaces via Laplacian Regularization on Neighborhood Graphscited by 13
- 2019A maximum principle argument for the uniform convergence of graph Laplacian regressorscited by 9
- 2013Convex Discriminative Multitask Clusteringcited by 5
Built on by
Citing papers per year: 2025: 1.
1 paper.