Mean Embeddings with Test-Time Data Augmentation for Ensembling of Representations
Not on the map. Why?
Abstract (arXiv)
Averaging predictions over a set of models -- an ensemble -- is widely used to improve predictive performance and uncertainty estimation of deep learning models. At the same time, many machine learning systems, such as search, matching, and recommendation systems, heavily rely on embeddings. Unfortunately, due to misalignment of features of independently trained models, embeddings, cannot be improved with a naive deep ensemble like approach. In this work, we look at the ensembling of representations and propose mean embeddings with test-time augmentation (MeTTA) simple yet well-performing recipe for ensembling representations. Empirically we demonstrate that MeTTA significantly boosts the quality of linear evaluation on ImageNet for both supervised and self-supervised models. Even more exciting, we draw connections between MeTTA, image retrieval, and transformation invariant models. We believe that spreading the success of ensembles to inference higher-quality representations is the important step that will open many new applications of ensembling.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 13 of its 15 references that are in the map. First posted on arXiv 15 Jun 2021.
Builds on
13 of 15 references.
References · 13
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2021Convex optimizationcited by 2,479
- 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,375
- 2017Fine-tuning CNN Image Retrieval with No Human Annotationcited by 497
- 2019Selective Kernel Networkscited by 401
- 2019Fast AutoAugmentcited by 243
- 2020Training independent subnetworks for robust predictioncited by 177
- 2016End-to-end Learning of Deep Visual Representations for Image Retrievalcited by 122
- 2016TI-POOLING: transformation-invariant pooling for feature learning in Convolutional Neural Networkscited by 66
- 2020Greedy Policy Search: A Simple Baseline for Learnable Test-Time Augmentationcited by 61
- 2020Learning Loss for Test-Time Augmentationcited by 56
1 more
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 1; 2025: 0; 2026: 1.
6 papers.
- 2022Continual Learning with Foundation Models: An Empirical Study of Latent Replaycited by 61
- 2023Online Continual Learning for Robust Indoor Object Recognitioncited by 9
- 2024Improving Black-box Robustness with In-Context Rewritingcited by 8
- 2022Synergy with Translation Artifacts for Training and Inference in Multilingual Taskscited by 6
- 2022Dynamic Test-Time Augmentation via Differentiable Functionscited by 4
- 2026Improving Robustness of Tabular Retrieval via Representational Stabilitycited by 0
- 2026Improving Robustness of Tabular Retrieval via Representational Stability27 Apr 2026
- 2024Improving Black-box Robustness with In-Context Rewriting13 Feb 2024
- 2023Online Continual Learning for Robust Indoor Object Recognition19 Jul 2023
- 2022Dynamic Test-Time Augmentation via Differentiable Functions9 Dec 2022
- 2022Synergy with Translation Artifacts for Training and Inference in Multilingual Tasks18 Oct 2022
- 2022Continual Learning with Foundation Models: An Empirical Study of Latent Replay30 Apr 2022