BIER — Boosting Independent Embeddings Robustly

Citations Over TimeTop 10% of 2017 papers

Abstract

Learning similarity functions between image pairs with deep neural networks yields highly correlated activations of large embeddings. In this work, we show how to improve the robustness of embeddings by exploiting independence in ensembles. We divide the last embedding layer of a deep network into an embedding ensemble and formulate training this ensemble as an online gradient boosting problem. Each learner receives a reweighted training sample from the previous learners. This leverages large embedding sizes more effectively by significantly reducing correlation of the embedding and consequently increases retrieval accuracy of the embedding. Our method does not introduce any additional parameters and works with any differentiable loss function. We evaluate our metric learning method on image retrieval tasks and show that it improves over state-ofthe- art methods on the CUB-200-2011, Cars-196, Stanford Online Products, In-Shop Clothes Retrieval and VehicleID datasets by a significant margin.

Related Papers

• → A Survey of Ensemble Learning: Concepts, Algorithms, Applications, and Prospects(2022)1,060 cited
• → Bagged ensembles with tunable parameters(2018)39 cited
• → Ensemble Techniques to improve the performance of the High Dimensional MultiClass Algorithms(2022)3 cited
• → A Characterization for Generalized Hukuhara Differentiable Interval-Valued Functions and Some Rules of Calculus(2022)2 cited
• → Researching on combining boosting ensembles(2008)3 cited