← All AI/ML open problems

Embeddings & representations · Statistical learning theory / Open question

Recovering the Hidden Structure of Data

Useful representations should capture the structure that generated the observations, not merely distinguish training examples.

OpenEditorially scopedFramework needs definitionCompiled 2026-11-19

Seed catalog · Showing the bundled record.

Problem statement

Let observations be x=g(c,s), where g is an unknown bi-Lipschitz map on a compact latent cube, c consists of k independent content factors and s contains nuisance factors. Paired augmentations resample s and perturb c by noise of norm at most eta; intervention labels identify which factor was perturbed. Determine when finite-data self-supervised learning recovers c up to componentwise invertible maps and permutation, with recovery error controlled by eta, sample size and map regularity.

Assumptions and scope

  • Fix the latent distribution, mixing/decoder class and allowed symmetry group; latent coordinates are not uniquely defined without identifying structure.
  • Specify observable augmentation labels or strengths and a measured bound on content corruption; arbitrary unknown transformations can destroy identifiability.
  • Separate population identifiability, finite-sample estimation and convergence of a specified encoder-training procedure. Charge the number of views and independent source instances.

What would settle it?

A robust finite-sample recovery theorem with an explicit optimization or estimation procedure and matching ambiguity examples, stating exactly which latent transformations remain unidentifiable.

Selected for a theoretical or computational target. A fitted scaling curve or improved benchmark score alone does not establish the stated learning-theoretic guarantee.

Status and evidence

Content/style identification up to invertible maps, augmentation-driven sparse feature learning and approximate sufficiency bounds are established. Smith's 2026 conditional-Gaussian model also identifies coordinates through augmentation variance fingerprints. The target is robust recovery with finite data under a declared misspecified augmentation model. This is an editorial, source-motivated research target. The preliminary review through 2026-11-19 does not certify novelty or exclude an unlocated resolution.

Preliminary source check; not an expert-verified open status or an independent audit of proposed proofs. The compilation date is not a literature-review cutoff.

Sources and further reading

  1. von Kügelgen et al. — Self-Supervised Learning with Data Augmentations Provably Isolates Content from Style ↗partial theory · source checked 2026-11-19

    Abstract checked: invariant content is identifiable up to an invertible map under the latent augmentation model; this does not identify every content coordinate.

  2. Smith — Variance Fingerprints: Component-Wise Identification of Content Factors by Augmentation Design ↗partial theory · source checked 2026-11-19

    Abstract checked: recorded augmentation strengths give component identification up to permutation, scaling and translation in a conditional Gaussian model. Component-wise identification is not generally unstudied.

  3. Wen and Li — Toward Understanding the Feature Learning Process of Self-Supervised Contrastive Learning ↗partial theory · source checked 2026-11-19

    Abstract checked: ReLU networks provably learn sparse rather than dense features under appropriate augmentations; feature decoupling explains the mechanism.

  4. Lin and Mei — A Statistical Theory of Contrastive Learning via Approximate Sufficient Statistics ↗partial theory · source checked 2026-11-19

    Abstract checked: contrastive losses yield approximately sufficient encoders and downstream risk bounds, including augmentation error.