Estimating sparse regression models in multi-task learning and transfer learning through adaptive penalisation.

IF 5.4
Armin Rauschenberger, Petr V Nazarov, Enrico Glaab
{"title":"Estimating sparse regression models in multi-task learning and transfer learning through adaptive penalisation.","authors":"Armin Rauschenberger, Petr V Nazarov, Enrico Glaab","doi":"10.1093/bioinformatics/btaf406","DOIUrl":null,"url":null,"abstract":"<p><strong>Method: </strong>Here, we propose a simple two-stage procedure for sharing information between related high-dimensional prediction or classification problems. In both stages, we perform sparse regression separately for each problem. While this is done without prior information in the first stage, we use the coefficients from the first stage as prior information for the second stage. Specifically, we designed feature-specific and sign-specific adaptive weights to share information on feature selection, effect directions, and effect sizes between different problems.</p><p><strong>Results: </strong>The proposed approach is applicable to multi-task learning as well as transfer learning. It provides sparse models (i.e. with few non-zero coefficients for each problem) that are easy to interpret. We show by simulation and application that it tends to select fewer features while achieving a similar predictive performance as compared to available methods.</p><p><strong>Availability and implementation: </strong>An implementation is available in the R package \"sparselink\" (https://github.com/rauschenberger/sparselink, https://cran.r-project.org/package=sparselink).</p>","PeriodicalId":93899,"journal":{"name":"Bioinformatics (Oxford, England)","volume":" ","pages":""},"PeriodicalIF":5.4000,"publicationDate":"2025-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12502914/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bioinformatics (Oxford, England)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioinformatics/btaf406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Method: Here, we propose a simple two-stage procedure for sharing information between related high-dimensional prediction or classification problems. In both stages, we perform sparse regression separately for each problem. While this is done without prior information in the first stage, we use the coefficients from the first stage as prior information for the second stage. Specifically, we designed feature-specific and sign-specific adaptive weights to share information on feature selection, effect directions, and effect sizes between different problems.

Results: The proposed approach is applicable to multi-task learning as well as transfer learning. It provides sparse models (i.e. with few non-zero coefficients for each problem) that are easy to interpret. We show by simulation and application that it tends to select fewer features while achieving a similar predictive performance as compared to available methods.

Availability and implementation: An implementation is available in the R package "sparselink" (https://github.com/rauschenberger/sparselink, https://cran.r-project.org/package=sparselink).

基于自适应惩罚的多任务学习和迁移学习稀疏回归模型估计。
方法:在这里,我们提出了一个简单的两阶段过程,用于在相关的高维预测或分类问题之间共享信息。在这两个阶段,我们分别对每个问题执行稀疏回归。虽然这是在第一阶段没有先验信息的情况下完成的,但我们使用第一阶段的系数作为第二阶段的先验信息。具体而言,我们设计了特定于特征和特定于符号的自适应权重,以便在不同问题之间共享关于特征选择、效应方向和效应大小的信息。结果:该方法适用于多任务学习和迁移学习。它提供了易于解释的稀疏模型(即每个问题的非零系数很少)。我们通过仿真和应用表明,与现有方法相比,它倾向于选择更少的特征,同时实现相似的预测性能。可用性:在R包“sparselink”(https://github.com/rauschenberger/sparselink, https://cran.r-project.org/package=sparselink)中可以获得实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信