Tailoring: encoding inductive biases by optimizing unsupervised objectives at prediction time
Ferran Alet, Maria Bauzá, Kenji Kawaguchi, Nurullah Giray Kuru, Tomás Lozano-Pérez, Leslie Pack Kaelbling
Abstract
From CNNs to attention mechanisms, encoding inductive biases into neural networks has been a fruitful source of improvement in machine learning. Auxiliary losses are a general way of encoding biases in order to help networks learn better representations by adding extra terms to the loss function. However, since they are minimized on the training data, they suffer from the same generalization gap as regular task losses. Moreover, by changing the loss function, the network is optimizing a different objective than the one we care about. In this work we solve both problems: first, we take inspiration from transductive learning and note that, after receiving an input but before making a prediction, we can fine-tune our models on any unsupervised objective. We call this process tailoring, because we customize the model to each input. Second, we formulate a nested optimization (similar to those in meta-learning) and train our models to perform well on the task loss after adapting to the tailoring loss. The advantages of tailoring and meta-tailoring are discussed theoretically and demonstrated empirically on several diverse examples: encoding inductive conservation laws from physics to improve predictions, improving local smoothness to increase robustness to adversarial examples, and using contrastive losses on the query image to improve generalization.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 261ecbc7-fa86-43d3-b0ac-1e81d69e0074Cited by top-tier papers6
- MEMO: Test Time Robustness via Adaptation and AugmentationMarvin Zhang, Sergey Levine, Chelsea FinnNeurIPS 2022 · 595 citations
- Adaptive Risk Minimization: Learning to Adapt to Domain ShiftMarvin Zhang, Henrik Marklund, Nikita Dhawan, Abhishek Gupta et al.NeurIPS 2021 · 284 citations
- Evaluating the Adversarial Robustness of Adaptive Test-time DefensesFrancesco Croce, Sven Gowal, Thomas Brunner, Evan Shelhamer et al.ICML 2022 · 85 citations
- Noether Networks: meta-learning useful conserved quantitiesFerran Alet, Dylan Doblar, Allan Zhou, Josh Tenenbaum et al.NeurIPS 2021 · 36 citations
- OCD: Learning to Overfit with Conditional Diffusion ModelsShahar Lutati, Lior WolfICML 2023 · 13 citations
Builds on5
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- A Baseline for Few-Shot Image ClassificationGuneet Singh Dhillon, Pratik Chaudhari, Avinash Ravichandran, Stefano SoattoICLR 2020 · 640 citations
- Meta-Learning with Warped Gradient DescentSebastian Flennerhag, Andrei A. Rusu, Razvan Pascanu, Francesco Visin et al.ICLR 2020 · 221 citations
- MACER: Attack-free and Scalable Robust Training via Maximizing Certified RadiusRuntian Zhai, Chen Dan, Di He, Huan Zhang et al.ICLR 2020 · 195 citations
- Momentum Contrast for Unsupervised Visual Representation LearningKaiming He, Haoqi Fan, Yuxin Wu, Saining Xie et al.CVPR 2020
Related papers
- Inductive biases of multi-task learning and finetuning: multiple regimes of feature reuseSamuel Lippl, Jack W. LindseyNeurIPS 2024 · 13 citations
- Test Time Adaptation via Conjugate Pseudo-labelsSachin Goyal, Mingjie Sun, Aditi Raghunathan, J. Zico KolterNeurIPS 2022 · 152 citations
- Adaptive Transfer Learning on Graph Neural NetworksXueting Han, Zhenhuan Huang, Bang An, Jing BaiKDD 2021 · 30 citations
- Contrastive Consolidation of Top-Down Modulations Achieves Sparsely Supervised Continual LearningViet Anh Khoa Tran, Emre Neftci, Willem WyboNeurIPS 2025 · 4 citations
- Unsupervised Learning for Combinatorial Optimization Needs Meta LearningHaoyu Peter Wang, Pan LiICLR 2023 · 2 citations
