Masksembles for Uncertainty Estimation
Nikita Durasov, Timur M. Bagautdinov, Pierre Baqué, Pascal Fua
Abstract
Deep neural networks have amply demonstrated their prowess but estimating the reliability of their predictions remains challenging. Deep Ensembles are widely considered as being one of the best methods for generating uncertainty estimates but are very expensive to train and evaluate. MC-Dropout is another popular alternative, which is less expensive, but also less reliable. Our central intuition is that there is a continuous spectrum of ensemble-like models of which MC-Dropout and Deep Ensembles are extreme examples. The first one uses effectively infinite number of highly correlated models while the second one relies on a finite number of independent models. To combine the benefits of both, we introduce Masksembles. Instead of randomly dropping parts of the network as in MC-dropout, Masksemble relies on a fixed number of binary masks, which are parameterized in a way that allows to change correlations between individual models. Namely, by controlling the overlap between the masks and their size one can choose the optimal configuration for the task at hand. This leads to a simple and easy to implement method with performance on par with Ensembles at a fraction of the cost. We experimentally validate Masksembles on two widely used datasets, CIFAR10 and ImageNet.
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 336a2ae5-d4b9-4c27-ace3-00e3bf74375eCited by top-tier papers28
- Dropout Q-Functions for Doubly Efficient Reinforcement LearningTakuya Hiraoka, Takahisa Imagawa, Taisei Hashimoto, Takashi Onishi et al.ICLR 2022 · 157 citations
- MixMo: Mixing Multiple Inputs for Multiple Outputs via Deep SubnetworksAlexandre Ramé, Rémy Sun, Matthieu CordICCV 2021 · 64 citations
- Anti-Exploration by Random Network DistillationAlexander Nikulin, Vladislav Kurenkov, Denis Tarasov, Sergey KolesnikovICML 2023 · 55 citations
- FiLM-Ensemble: Probabilistic Deep Learning via Feature-wise Linear ModulationMehmet Ozgur Turkoglu, Alexander Becker, Hüseyin Anil Gündüz, Mina Rezaei et al.NeurIPS 2022 · 46 citations
- Leveraging Self-Supervision for Cross-Domain Crowd CountingWeizhe Liu, Nikita Durasov, Pascal FuaCVPR 2022 · 43 citations
Builds on4
- AugMix: A Simple Data Processing Method to Improve Robustness and UncertaintyDan Hendrycks, Norman Mu, Ekin Dogus Cubuk, Barret Zoph et al.ICLR 2020 · 1,572 citations
- BatchEnsemble: an Alternative Approach to Efficient Ensemble and Lifelong LearningYeming Wen, Dustin Tran, Jimmy BaICLR 2020 · 569 citations
- Pitfalls of In-Domain Uncertainty Estimation and Ensembling in Deep LearningArsenii Ashukha, Alexander Lyzhov, Dmitry Molchanov, Dmitry P. VetrovICLR 2020 · 354 citations
- Conservative Uncertainty Estimation By Fitting Prior NetworksKamil Ciosek, Vincent Fortuin, Ryota Tomioka, Katja Hofmann et al.ICLR 2020 · 65 citations
Related papers
- Bayesian Posterior Approximation With Stochastic EnsemblesOleksandr Balabanov, Bernhard Mehlig, Hampus LinanderCVPR 2023
- Disrupting Deep Uncertainty Estimation Without Harming AccuracyIdo Galil, Ran El-YanivNeurIPS 2021 · 27 citations
- Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic SparsityShiwei Liu, Tianlong Chen, Zahra Atashgahi, Xiaohan Chen et al.ICLR 2022 · 62 citations
- Window-Based Early-Exit Cascades for Uncertainty Estimation: When Deep Ensembles are More Efficient than Single ModelsGuoxuan Xia, Christos-Savvas BouganisICCV 2023 · 17 citations
- A Simple Yet Powerful Deep Active Learning With Snapshots EnsemblesSeohyeon Jung, Sanghyun Kim, Juho LeeICLR 2023
