Timezone: »

 
Spotlight
Deep Combinatorial Aggregation
Yuesong Shen · Daniel Cremers

Wed Dec 07 09:00 AM -- 11:00 AM (PST) @
in Lightning Talks 3B-1 »

Neural networks are known to produce poor uncertainty estimations, and a variety of approaches have been proposed to remedy this issue. This includes deep ensemble, a simple and effective method that achieves state-of-the-art results for uncertainty-aware learning tasks. In this work, we explore a combinatorial generalization of deep ensemble called deep combinatorial aggregation (DCA). DCA creates multiple instances of network components and aggregates their combinations to produce diversified model proposals and predictions. DCA components can be defined at different levels of granularity. And we discovered that coarse-grain DCAs can outperform deep ensemble for uncertainty-aware learning both in terms of predictive performance and uncertainty estimation. For fine-grain DCAs, we discover that an average parameterization approach named deep combinatorial weight averaging (DCWA) can improve the baseline training. It is on par with stochastic weight averaging (SWA) but does not require any custom training schedule or adaptation of BatchNorm layers. Furthermore, we propose a consistency enforcing loss that helps the training of DCWA and modelwise DCA. We experiment on in-domain, distributional shift, and out-of-distribution image classification tasks, and empirically confirm the effectiveness of DCWA and DCA approaches.

Keywords: Uncertainty Estimation · consistency enforcing loss · deep combinatorial weight averaging · deep combinatorial aggregation

Author Information

Yuesong Shen (Technical University of Munich)
Daniel Cremers (Technical University of Munich)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors