Online Hyperparameter Meta-Learning with Hypergradient Distillation
원문 초록
Many gradient-based meta-learning methods assume a set of parameters that do not participate in inner-optimization, which can be considered as hyperparameters. Although such hyperparameters can be optimized using the existing gradient-based hyperparameter optimization (HO) methods, they suffer from the following issues. Unrolled differentiation methods do not scale well to high-dimensional hyperparameters or horizon length, Implicit Function Theorem (IFT) based methods are restrictive for online optimization, and short horizon approximations suffer from short horizon bias. In this work, we propose a novel HO method that can overcome these limitations, by approximating the second-order term with knowledge distillation. Specifically, we parameterize a single Jacobian-vector product (JVP) for each HO step and minimize the distance from the true second-order term. Our method allows online optimization and also is scalable to the hyperparameter dimension and the horizon length. We demonstrate the effectiveness of our method on two different meta-learning methods and three benchmark datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Are encoders able to learn landmarkers for warm-starting of Hyperparameter Optimization?
Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates
KDH-MLTC: Knowledge Distillation for Healthcare Multi-Label Text Classification
Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization
A Unified Framework against Topology and Class Imbalance
Boosting Lightweight Single Image Super-resolution via Joint-distillation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.