Pith. sign in

REVIEW

Self-supervised Representation Learning with Relative Predictive Coding

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 2103.11275 v3 pith:6NOJPEYC submitted 2021-03-21 cs.LG cs.ITmath.IT

classification cs.LGcs.ITmath.IT
keywords learningrelativecodingcontrastiveintroducesobjectivepredictiverepresentation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper introduces Relative Predictive Coding (RPC), a new contrastive representation learning objective that maintains a good balance among training stability, minibatch size sensitivity, and downstream task performance. The key to the success of RPC is two-fold. First, RPC introduces the relative parameters to regularize the objective for boundedness and low variance. Second, RPC contains no logarithm and exponential score functions, which are the main cause of training instability in prior contrastive objectives. We empirically verify the effectiveness of RPC on benchmark vision and speech self-supervised learning tasks. Lastly, we relate RPC with mutual information (MI) estimation, showing RPC can be used to estimate MI with low variance.

Discussion (0). Continue with ORCID to comment.

Pith tools