Multi Task Learning: A Survey and Future Directions

Taeho Lee, Junhee Seok
{"title":"Multi Task Learning: A Survey and Future Directions","authors":"Taeho Lee, Junhee Seok","doi":"10.1109/ICAIIC57133.2023.10067098","DOIUrl":null,"url":null,"abstract":"Multi-task learning (MTL) is a problem that must be applied in modern recommendation systems and is just as difficult. In the recent e-commerce advertising market, it is necessary to be able to predict not only the probability of users clicking, but also the probability of conversion and purchase. By predicting multi-task, it is possible to increase the accuracy of each task and optimize advertisements for various goals of advertisers. Traditional conversion rate (CVR) prediction models have difficulty learning because the number of conversions is too small compared to the total number of impressions. This problem is called a data sparsity (DS) problem. Another problem is that CVR models trained with samples of clicked impressions infer on samples of all impressions. This problem is called a sample selection bias (SSB) problem. This paper is a summary of the various solutions and current limitations and further directions about solving sample selection bias problem and data sparsity problem.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIIC57133.2023.10067098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Multi-task learning (MTL) is a problem that must be applied in modern recommendation systems and is just as difficult. In the recent e-commerce advertising market, it is necessary to be able to predict not only the probability of users clicking, but also the probability of conversion and purchase. By predicting multi-task, it is possible to increase the accuracy of each task and optimize advertisements for various goals of advertisers. Traditional conversion rate (CVR) prediction models have difficulty learning because the number of conversions is too small compared to the total number of impressions. This problem is called a data sparsity (DS) problem. Another problem is that CVR models trained with samples of clicked impressions infer on samples of all impressions. This problem is called a sample selection bias (SSB) problem. This paper is a summary of the various solutions and current limitations and further directions about solving sample selection bias problem and data sparsity problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多任务学习:综述及未来发展方向
多任务学习(MTL)是一个必须应用于现代推荐系统的问题,也是一个难题。在最近的电子商务广告市场中,不仅需要能够预测用户点击的概率,还需要能够预测转化和购买的概率。通过多任务预测,可以提高每个任务的准确性,并针对广告商的各种目标优化广告。传统的转化率(CVR)预测模型很难学习,因为转化率与总印象数相比太少了。这个问题被称为数据稀疏性(DS)问题。另一个问题是,使用点击印象样本训练的CVR模型是基于所有印象样本进行推断的。这个问题被称为样本选择偏差(SSB)问题。本文总结了解决样本选择偏倚问题和数据稀疏性问题的各种解决方案,以及目前的局限性和进一步的发展方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Development of AI Educational Datasets Library Using Synthetic Dataset Generation Method Channel Access Control Instead of Random Backoff Algorithm Illegal 3D Content Distribution Tracking System based on DNN Forensic Watermarking Deep Learning-based Spectral Efficiency Maximization in Massive MIMO-NOMA Systems with STAR-RIS Data Pipeline Design for Dangerous Driving Behavior Detection System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1