Pith. sign in

REVIEW 1 cited by

Unsupervised Learning of Structured Representations via Closed-Loop Transcription

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 2210.16782 v1 pith:LTHAYA6G submitted 2022-10-30 cs.CV

classification cs.CV
keywords unsupervisedrepresentationrepresentationsdiscriminativelearningclosed-loopfeaturesgenerative
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper proposes an unsupervised method for learning a unified representation that serves both discriminative and generative purposes. While most existing unsupervised learning approaches focus on a representation for only one of these two goals, we show that a unified representation can enjoy the mutual benefits of having both. Such a representation is attainable by generalizing the recently proposed \textit{closed-loop transcription} framework, known as CTRL, to the unsupervised setting. This entails solving a constrained maximin game over a rate reduction objective that expands features of all samples while compressing features of augmentations of each sample. Through this process, we see discriminative low-dimensional structures emerge in the resulting representations. Under comparable experimental conditions and network complexities, we demonstrate that these structured representations enable classification performance close to state-of-the-art unsupervised discriminative representations, and conditionally generated image quality significantly higher than that of state-of-the-art unsupervised generative models. Source code can be found at https://github.com/Delay-Xili/uCTRL.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Simplifying DINO via Coding Rate Regularization

    cs.CV 2025-02 conditional novelty 6.0 of 10

    Replacing DINO's complex anti-collapse machinery with an explicit coding rate regularizer yields simpler, more stable, and higher-performing self-supervised models.

Pith tools