Pith. sign in

REVIEW 1 cited by

Neural Implicit Manifold Learning for Topology-Aware Density Estimation

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 2206.11267 v2 pith:LUR2IC7Q submitted 2022-06-22 stat.ML cs.LG

classification stat.MLcs.LG
keywords manifoldlearnmathcalmodelsneuralconstraineddatamathbb
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Natural data observed in $\mathbb{R}^n$ is often constrained to an $m$-dimensional manifold $\mathcal{M}$, where $m < n$. This work focuses on the task of building theoretically principled generative models for such data. Current generative models learn $\mathcal{M}$ by mapping an $m$-dimensional latent variable through a neural network $f_\theta: \mathbb{R}^m \to \mathbb{R}^n$. These procedures, which we call pushforward models, incur a straightforward limitation: manifolds cannot in general be represented with a single parameterization, meaning that attempts to do so will incur either computational instability or the inability to learn probability densities within the manifold. To remedy this problem, we propose to model $\mathcal{M}$ as a neural implicit manifold: the set of zeros of a neural network. We then learn the probability density within $\mathcal{M}$ with a constrained energy-based model, which employs a constrained variant of Langevin dynamics to train and sample from the learned manifold. In experiments on synthetic and natural data, we show that our model can learn manifold-supported distributions with complex topologies more accurately than pushforward models.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. A Replica Exchange Markov Chain Monte Carlo Method for Disconnected Implicit Manifolds via Tubular Relaxation

    math.NA 2026-04 unverdicted novelty 6.0 of 10

    A replica exchange MCMC algorithm couples constrained and relaxed chains to sample from disconnected implicit manifolds defined by nonlinear constraints.

Pith tools