2018
DOI: 10.1016/j.image.2018.02.013
|View full text |Cite
|
Sign up to set email alerts
|

Multi-task classification with sequential instances and tasks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…However, manually tuning these hyperparameters are expensive and intractable in web-scale recommendation scenarios. An alternative approach [23] in practice is to optimize each task iteratively, which, may stick at a local optimum and fail to perform well in some tasks. Instead, we use the idea of homoscedastic uncertainty [13] to weigh the loss of each task automatically during model training.…”
Section: Learning Task Weights With Homoscedastic Uncertaintymentioning
confidence: 99%
“…However, manually tuning these hyperparameters are expensive and intractable in web-scale recommendation scenarios. An alternative approach [23] in practice is to optimize each task iteratively, which, may stick at a local optimum and fail to perform well in some tasks. Instead, we use the idea of homoscedastic uncertainty [13] to weigh the loss of each task automatically during model training.…”
Section: Learning Task Weights With Homoscedastic Uncertaintymentioning
confidence: 99%