Pith. sign in

REVIEW 1 cited by

Representation Learning for Sequence Data with Deep Autoencoding Predictive Components

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 2010.03135 v2 pith:AUTPQXCG submitted 2020-10-07 cs.LG

classification cs.LG
keywords informationpredictivelatentdatalearningsequencespaceautoencoding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose Deep Autoencoding Predictive Components (DAPC) -- a self-supervised representation learning method for sequence data, based on the intuition that useful representations of sequence data should exhibit a simple structure in the latent space. We encourage this latent structure by maximizing an estimate of predictive information of latent feature sequences, which is the mutual information between past and future windows at each time step. In contrast to the mutual information lower bound commonly used by contrastive learning, the estimate of predictive information we adopt is exact under a Gaussian assumption. Additionally, it can be computed without negative sampling. To reduce the degeneracy of the latent space extracted by powerful encoders and keep useful information from the inputs, we regularize predictive information learning with a challenging masked reconstruction loss. We demonstrate that our method recovers the latent space of noisy dynamical systems, extracts predictive features for forecasting tasks, and improves automatic speech recognition when used to pretrain the encoder on large amounts of unlabeled data.

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. Information Subtraction: Learning Representations for Conditional Entropy

    cs.LG 2025-01 reject novelty 5.0 of 10

    Information Subtraction trains a generator against two mutual information estimators to represent conditional entropy H(Y|X), but the objective does not reliably remove the conditioned variable's information.

Pith tools