High-dimensional Joint Sparsity Random Effects Model for Multi-task Learning
Joint sparsity regularization in multi-task learning has attracted much attention in recent years. The traditional convex formulation employs the group Lasso relaxation to achieve joint sparsity across tasks. Although this approach leads to a simple convex formulation, it suffers from several issues due to the looseness of the relaxation. To remedy this problem, we view jointly sparse multi-task learning as a specialized random effects model, and derive a convex relaxation approach that involves two steps. The first step learns the covariance matrix of the coefficients using a convex formulation which we refer to as sparse covariance coding; the second step solves a ridge regression problem with a sparse quadratic regularizer based on the covariance matrix obtained in the first step. It is shown that this approach produces an asymptotically optimal quadratic regularizer in the multitask learning setting when the number of tasks approaches infinity. Experimental results demonstrate that the convex formulation obtained via the proposed model significantly outperforms group Lasso (and related multi-stage formulations
Code (0)
등록된 구현이 없습니다.
Tasks
Multi-Task LearningVocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
Moment-Based Selection of Multiresponse Linear Mixed-Effects Models
We propose MOMENT (\textbf{MO}ment-Based \textbf{M}ixed-\textbf{E}ffects Selectio\textbf{N} and Es\textbf{T}imation), a stage-wise moment-based framework that exploits second-order cross-moment identities to select and e…
Conjugate gradient methods for high-dimensional GLMMs
Generalized linear mixed models (GLMMs) are a widely used tool in statistical analysis. The main bottleneck of many computational approaches lies in the inversion of the high dimensional precision matrices associated wit…
Deep Image prior with StruCtUred Sparsity (DISCUS) for dynamic MRI reconstruction
High-quality training data are not always available in dynamic MRI. To address this, we propose a self-supervised deep learning method called deep image prior with structured sparsity (DISCUS) for reconstructing dynamic …
compressed sensingMRI ReconstructionHorseshoe Forests for High-Dimensional Causal Survival Analysis
We develop a Bayesian tree ensemble model to estimate heterogeneous treatment effects in censored survival data with high-dimensional covariates. Instead of imposing sparsity through the tree structure, we place a horses…
Binary Random Projections with Controllable Sparsity Patterns
Random projection is often used to project higher-dimensional vectors onto a lower-dimensional space, while approximately preserving their pairwise distances. It has emerged as a powerful tool in various data processing …