paper-with-me

Papers

Negative Inner-Loop Learning Rates Learn Universal Features

2022-03-18 · Tom Starshak

Model Agnostic Meta-Learning (MAML) consists of two optimization loops: the outer loop learns a meta-initialization of model parameters that is shared across tasks, and the inner loop task-specific adaptation step. A variant of MAML, Meta-SGD, uses the same two loop structure, but also learns the learning-rate for the adaptation step. Little attention has been paid to how the learned learning-rate of Meta-SGD affects feature reuse. In this paper, we study the effect that a learned learning-rate has on the per-task feature representations in Meta-SGD. The learned learning-rate of Meta-SGD often contains negative values. During the adaptation phase, these negative learning rates push features away from task-specific features and towards task-agnostic features. We performed several experiments on the Mini-Imagenet dataset. Two neural networks were trained, one with MAML, and one with Meta-SGD. The feature quality for both models was tested as follows: strip away the linear classification layer, pass labeled and unlabeled samples through this encoder, classify the unlabeled samples according to their nearest neighbor. This process was performed: 1) after training and using the meta-initialization parameters; 2) after adaptation, and validated on that task; and 3) after adaptation, and validated on a different task. The MAML trained model improved on the task it was adapted to, but had worse performance on other tasks. The Meta-SGD trained model was the opposite; it had worse performance on the task it was adapted to, but improved on other tasks. This confirms the hypothesis that Meta-SGD's negative learning rates cause the model to learn task-agnostic features rather than simply adapt to task specific features.

📄 PDF Abstract BibTeX arXiv:2203.10185

Code (0)

등록된 구현이 없습니다.

Tasks

Meta-Learning

Methods 이 논문이 사용한 방법론

MAML 설명 없음

Similar Papers 제목 키워드 기반

Meta-learning with negative learning rates

2021-02-01 · ICLR 2021 1 · Alberto Bernacchia

Deep learning models require a large amount of data to perform well. When data is scarce for a target task, we can transfer the knowledge gained by training on similar tasks to quickly learn the target. A successful appr…

Meta-Learningregression

Representation Learning with Weighted Inner Product for Universal Approximation of General Similarities

2019-02-27 · Geewook Kim, Akifumi Okuno, Kazuki Fukui, Hidetoshi Shimodaira

We propose $\textit{weighted inner product similarity}$ (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive…

Graph EmbeddingModel SelectionRepresentation Learning

DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loops

2023-11-10 · Hangtong Xu, Yuanbo Xu, Yongjian Yang, Fuzhen Zhuang 외

Recommendation models trained on the user feedback collected from deployed recommendation systems are commonly biased. User feedback is considerably affected by the exposure mechanism, as users only provide feedback on t…

Recommendation Systems

Stabilization with Closed-loop DOA Enlargement: An Interval Analysis Approach

2020-08-11

In this paper, the stabilization problem with closed-loop domain of attraction (DOA) enlargement for discrete-time general nonlinear plants is solved. First, a sufficient condition for asymptotic stabilization and estima…

Learning to (Learn at Test Time)

2023-10-20 · Yu Sun, Xinhao Li, Karan Dalal, Chloe Hsu 외

We reformulate the problem of supervised learning as learning to learn with two nested loops (i.e. learning problems). The inner loop learns on each individual instance with self-supervision before final prediction. The …