CORTEXA
← Browse
arxivstat.MLcs.LG2026-07-01

Deep Multitask Learning for Mixed-Type Outcomes with Shared Sparsity

Huichao Li, Tong Wang, Sanguo Zhang, Shuangge Ma

Most existing multitask learning approaches are limited by their reliance on task-specific loss functions tailored to the scale and type of each outcome. When outcomes differ across tasks, these losses are generally not directly comparable, which makes it difficult to formulate a unified objective and may limit information sharing across tasks. We propose a multitask transformation framework in which task-specific responses may differ through unknown monotone transformations. Motivated by high-dimensional biological applications in which the predictor dimension may diverge with the sample size while only a common subset of predictors is informative, we consider shared sparsity across tasks. Under this framework, we estimate the target functions and identify important predictors by optimizing a smoothed rank-based criterion with a group-Lasso penalty, implemented through a multitask deep neural network with a shared first layer. We establish the nonasymptotic excess-risk bounds, and variable-selection consistency for the proposed estimator. Simulation studies show that the proposed method achieves competitive prediction and variable-selection performance compared with competing approaches. Analyses of gene-expression studies with continuous, binary, and mixed outcomes further illustrate that the proposed method improves prediction and identifies biologically meaningful shared predictors.

View free PDFSource page

Related papers

arxivstat.MLcs.LG2026-07-15

Lipschitz Continuity in Deep Learning: A Systematic Review of Theoretical Foundations, Estimation Methods, Regularization Approaches, and Certifiable Robustness

Róisín Luo, James McDermott, Colm O'Riordan

Lipschitz continuity is a fundamental property of neural networks that characterizes their sensitivity to input perturbations. It plays a pivotal role in deep learning, governing \textbf{robustness}, \textbf{generalization} and \textbf{optimization dynamics}. Despite its importan…

View free PDFSource page
arxivcs.LGcond-mat.softcs.AIphysics.data-anstat.ML2026-07-21

Deep learning-based prediction of time-resolved adhesive forces in viscoelastic Hertzian contacts

Ali Maghami, Merten Stender, Michele Ciavarella, Antonio Papangelo

Fast prediction of the response of adhesive soft viscoelastic contacts represents a current challenge in soft robotics and for gripping and manipulation tasks. Determining the complete time-resolved force trajectory requires full numerical simulations, whose computational cost is…

View free PDFSource page
arxivcs.LGcs.AIstat.ML2026-07-23

Hilbert Operator for Progressive Encoding (HOPE): A Mathematical Framework for Deconstructing Learned Representations in Deep Networks

Hossein Mobahi, Peter L. Bartlett

Deep neural networks encode complex representations, but deconstructing this internal knowledge remains a challenge. Given the link between learning and compression, network compression offers a promising lens to analyze this knowledge. However, standard compression heuristics of…

View free PDFSource page
arxivcs.LGmath.NAmath.OCstat.ML2026-06-29

Convergence of Continual Learning in Homogeneous Deep Networks

Matan Schliserman, Gon Buzaglo, Itay Evron, Daniel Soudry

We characterize weakly regularized continual classification in homogeneous models as sequential projections onto task margin sets. This result generalizes prior analyses restricted to either stationary (single-task) deep models or continual linear models. We show that global conv…

View free PDFSource page