Guardado en:
Detalles Bibliográficos
Autores principales: Lv, Yiqin, Wang, Qi, Liang, Dong, Xie, Zheng
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:https://arxiv.org/abs/2410.22788
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909371945975808
author Lv, Yiqin
Wang, Qi
Liang, Dong
Xie, Zheng
author_facet Lv, Yiqin
Wang, Qi
Liang, Dong
Xie, Zheng
contents Meta learning is a promising paradigm in the era of large models and task distributional robustness has become an indispensable consideration in real-world scenarios. Recent advances have examined the effectiveness of tail task risk minimization in fast adaptation robustness improvement \citep{wang2023simple}. This work contributes to more theoretical investigations and practical enhancements in the field. Specifically, we reduce the distributionally robust strategy to a max-min optimization problem, constitute the Stackelberg equilibrium as the solution concept, and estimate the convergence rate. In the presence of tail risk, we further derive the generalization bound, establish connections with estimated quantiles, and practically improve the studied strategy. Accordingly, extensive evaluations demonstrate the significance of our proposal and its scalability to multimodal large models in boosting robustness.
format Preprint
id arxiv_https___arxiv_org_abs_2410_22788
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Theoretical Investigations and Practical Enhancements on Tail Task Risk Minimization in Meta Learning
Lv, Yiqin
Wang, Qi
Liang, Dong
Xie, Zheng
Machine Learning
Meta learning is a promising paradigm in the era of large models and task distributional robustness has become an indispensable consideration in real-world scenarios. Recent advances have examined the effectiveness of tail task risk minimization in fast adaptation robustness improvement \citep{wang2023simple}. This work contributes to more theoretical investigations and practical enhancements in the field. Specifically, we reduce the distributionally robust strategy to a max-min optimization problem, constitute the Stackelberg equilibrium as the solution concept, and estimate the convergence rate. In the presence of tail risk, we further derive the generalization bound, establish connections with estimated quantiles, and practically improve the studied strategy. Accordingly, extensive evaluations demonstrate the significance of our proposal and its scalability to multimodal large models in boosting robustness.
title Theoretical Investigations and Practical Enhancements on Tail Task Risk Minimization in Meta Learning
topic Machine Learning
url https://arxiv.org/abs/2410.22788