Pith. sign in

REVIEW

Combating the Instability of Mutual Information-based Losses via Regularization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.07932 v4 pith:VJTCAPDK submitted 2020-11-16 cs.LG cs.ITmath.ITstat.ML

classification cs.LGcs.ITmath.ITstat.ML
keywords lossesmi-basedneuralregularizationinstabilitylearninglossmutual
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Notable progress has been made in numerous fields of machine learning based on neural network-driven mutual information (MI) bounds. However, utilizing the conventional MI-based losses is often challenging due to their practical and mathematical limitations. In this work, we first identify the symptoms behind their instability: (1) the neural network not converging even after the loss seemed to converge, and (2) saturating neural network outputs causing the loss to diverge. We mitigate both issues by adding a novel regularization term to the existing losses. We theoretically and experimentally demonstrate that added regularization stabilizes training. Finally, we present a novel benchmark that evaluates MI-based losses on both the MI estimation power and its capability on the downstream tasks, closely following the pre-existing supervised and contrastive learning settings. We evaluate six different MI-based losses and their regularized counterparts on multiple benchmarks to show that our approach is simple yet effective.

Discussion (0). Continue with ORCID to comment.

Pith tools