HyperFlow: Gradient-Free Emulation of Few-Shot Fine-Tuning
Not on the map. Why?
Abstract (arXiv)
While test-time fine-tuning is beneficial in few-shot learning, the need for multiple backpropagation steps can be prohibitively expensive in real-time or low-resource scenarios. To address this limitation, we propose an approach that emulates gradient descent without computing gradients, enabling efficient test-time adaptation. Specifically, we formulate gradient descent as an Euler discretization of an ordinary differential equation (ODE) and train an auxiliary network to predict the task-conditional drift using only the few-shot support set. The adaptation then reduces to a simple numerical integration (e.g., via the Euler method), which requires only a few forward passes of the auxiliary network -- no gradients or forward passes of the target model are needed. In experiments on cross-domain few-shot classification using the Meta-Dataset and CDFSL benchmarks, our method significantly improves out-of-domain performance over the non-fine-tuned baseline while incurring only 6% of the memory cost and 0.02% of the computation time of standard fine-tuning, thus establishing a practical middle ground between direct transfer and fully fine-tuned approaches.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 41 of its 55 references that are in the map. First posted on arXiv 21 Apr 2025.
Builds on
41 of 55 references.
References · 41
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,700
- 2017Prototypical Networks for Few-shot Learningcited by 3,015
29 more
- 2016Matching Networks for One Shot Learningcited by 2,255
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
- 2016HyperNetworkscited by 1,027
- 2016Learning to learn by gradient descent by gradient descentcited by 620
- 2022Vision Transformer Adapter for Dense Predictionscited by 565
- 2017Learning multiple visual domains with residual adapterscited by 557
- 2019Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examplescited by 315
- 2022Pushing the Limits of Simple Pipelines for Few-Shot Learning: External Data and Fine-Tuning Make a Differencecited by 126
- 2019Improved Few-Shot Visual Classificationcited by 115
- 2021Parameter Prediction for Unseen Deep Architecturescited by 89
- 2022Learning to Learn with Generative Models of Neural Network Checkpointscited by 86
- 2020Self-training for Few-shot Transfer Across Extreme Task Differencescited by 76
- 2022Hyper-Representations as Generative Models: Sampling Unseen Neural Network Weightscited by 64
- 2021Dynamic Distillation Network for Cross-Domain Few-Shot Recognition with Unlabeled Datacited by 50
- 2024Towards Scalable and Versatile Weight Space Learningcited by 41
- 2023MetaDiff: Meta-Learning with Conditional Diffusion for Few-Shot Learningcited by 40
- 2022Understanding Cross-Domain Few-Shot Learning Based on Domain Similarity and Few-Shot Difficultycited by 37
- 2021Continuous vs. Discrete Optimization of Deep Neural Networkscited by 34
- 2023Revisiting Few-Shot Object Detection with Vision-Language Modelscited by 32
- 2024Towards Few-Shot Adaptation of Foundation Models via Multitask Finetuningcited by 31
- 2023Universal Few-shot Learning of Dense Prediction Tasks with Visual Token Matchingcited by 29
- 2024Few-shot Adaptation of Multi-modal Foundation Models: A Surveycited by 28
- 2023ProtoDiff: Learning to Learn Prototypical Networks by Task-Guided Diffusioncited by 16
- 2024Conditional LoRA Parameter Generationcited by 16
- 2024Make-An-Agent: A Generalizable Policy Network Generator with Behavior-Prompted Diffusioncited by 14
- 2020A Dynamical View on Optimization Algorithms of Overparameterized Neural Networkscited by 12
- 2021MetaNODE: Prototype Optimization as a Neural ODE for Few-Shot Learningcited by 11
- 2024Chameleon: A Data-Efficient Generalist for Dense Visual Prediction in the Wildcited by 6
- 2020Stochastic gradient algorithms from ODE splitting perspectivecited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.