Conditional Meta-Learning of Linear Representations
원문 초록
Standard meta-learning for representation learning aims to find a common representation to be shared across multiple tasks. The effectiveness of these methods is often limited when the nuances of the tasks' distribution cannot be captured by a single representation. In this work we overcome this issue by inferring a conditioning function, mapping the tasks' side information (such as the tasks' training dataset itself) into a representation tailored to the task at hand. We study environments in which our conditional strategy outperforms standard meta-learning, such as those in which tasks can be organized in separate clusters according to the representation they share. We then propose a meta-algorithm capable of leveraging this advantage in practice. In the unconditional setting, our method yields a new estimator enjoying faster learning rates and requiring less hyper-parameters to tune than current state-of-the-art methods. Our results are supported by preliminary experiments.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Latent Representation Learning of Multi-scale Thermophysics: Application to Dynamics in Shocked Porous Energetic Material
Are encoders able to learn landmarkers for warm-starting of Hyperparameter Optimization?
Semantic Structure Enhanced Contrastive Adversarial Hash Network for Cross-media Representation Learning
An Experimental Study of Quantitative Evaluations on Saliency Methods
On Designing Diffusion Autoencoders for Efficient Generation and Representation Learning
Dual Dimensions Geometric Representation Learning Based Document Dewarping
토론
이 논문과 연결된 포럼 글이 아직 없습니다.