Pith. sign in

REVIEW 3 minor 175 cited by

Density estimation using Real NVP

T0 review · 0 major / 3 minor · reviewed 2026-05-11 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Real NVP transformations provide invertible mappings that make density estimation tractable with exact likelihood computation, sampling, and latent inference.

desk verdict Real NVP adds non-volume-preserving affine couplings to invertible flows, delivering exact likelihoods and sampling on image data with a clean derivation and supporting experiments. read the letter →

arxiv 1605.08803 v3 pith:KSHKSRA6 submitted 2016-05-27 cs.LG cs.AIcs.NEstat.ML

Laurent Dinh , Jascha Sohl-Dickstein , Samy Bengio This is my paper · ORCID
classification cs.LGcs.AIcs.NEstat.ML
keywords densityestimationrealNVPinvertibletransformationsunsupervisedlearninggenerativemodelsnaturalimagesexactlikelihoodlatentspace
checked against Cost.FunctionalEquationCost.JcostCoreFoundation.DAlembert.Inevitability
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces real-valued non-volume preserving transformations, called real NVP, to expand the class of usable probabilistic models for unsupervised learning. These transformations are designed to be invertible and learnable, so that the resulting models support exact log-likelihood evaluation, exact sampling from the model, exact recovery of latent variables, and an interpretable latent space. The authors apply the method to natural images and evaluate it through generated samples, likelihood scores, and direct manipulation of the latent variables on four datasets. A sympathetic reader cares because most high-dimensional density estimators previously required approximations that made some of these operations intractable or biased.

What carries the argument

real NVP transformations built from stacked affine coupling layers whose scale and translation functions are parameterized by neural networks, allowing the Jacobian determinant to be computed in closed form.

What would settle it

If a real NVP model trained on the same image datasets produces samples that bear no visual resemblance to the data or reports log-likelihood values far below those of other published density estimators, the practical utility claim would be refuted.

Watch

Extended reading notes

Core claim

We extend the space of such models using real-valued non-volume preserving (real NVP) transformations, a set of powerful invertible and learnable transformations, resulting in an unsupervised learning algorithm with exact log-likelihood computation, exact sampling, exact inference of latent variables, and an interpretable latent space. We demonstrate its ability to model natural images on four datasets through sampling, log-likelihood evaluation and latent variable manipulations.

Load-bearing premise

The neural-network-parameterized affine coupling layers are expressive enough to capture the structure of natural images without needing impractically many layers.

Editorial extensions

If this is right

  • Any data point can be assigned an exact probability under the learned distribution.
  • New samples are obtained by drawing from a simple base distribution and applying the inverse transformation.
  • Latent codes for observed images are recovered exactly rather than approximated.
  • The latent space supports direct arithmetic operations that produce semantically meaningful changes in the generated images.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same coupling-layer construction could be adapted to sequential or graph-structured data if the conditioner networks are replaced by appropriate architectures.
  • Exact inference removes the need for variational bounds, which may simplify training objectives in other generative settings.
  • Because the transformations are volume-preserving up to a known factor, they might be combined with other invertible flows to trade off expressivity against computational cost.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The paper introduces real-valued non-volume preserving (Real NVP) transformations based on affine coupling layers. These yield invertible maps whose Jacobians are triangular, allowing exact log-likelihood evaluation via the change-of-variables formula, exact sampling by inversion, and exact latent inference. The model is demonstrated on four image datasets (CIFAR-10, ImageNet 32×32, LSUN, CelebA) with reported log-likelihoods, samples, and latent-space manipulations.

Significance. If the central construction holds, the work is significant: it supplies a flow-based generative model that simultaneously achieves exact likelihood, exact sampling, and competitive performance on high-dimensional natural images, addressing a key limitation of contemporaneous methods such as VAEs and GANs. The multi-scale architecture and neural-network parameterizations for the scale and translation functions are shown to be sufficiently expressive for the reported tasks.

minor comments (3)
  1. [§3.2] §3.2, Eq. (6): the multi-scale architecture description would benefit from an explicit statement of how the checkerboard and channel-wise masks are alternated across layers to ensure full mixing.
  2. [Table 1] Table 1: the log-likelihood numbers are given without standard errors across multiple runs; adding these would strengthen the quantitative comparison to NICE and other baselines.
  3. [Figure 4] Figure 4: the latent-space arithmetic examples are visually informative, but the paper does not report a quantitative measure (e.g., reconstruction error after manipulation) to support the claim of an interpretable latent space.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading and positive evaluation of the manuscript. The provided summary accurately reflects the core contributions of Real NVP, including the use of affine coupling layers for invertible transformations with tractable Jacobians, enabling exact likelihood, sampling, and inference. We are pleased that the significance for flow-based generative modeling on high-dimensional image data is recognized.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; derivation is self-contained

full rationale

The central construction defines affine coupling layers whose Jacobian is triangular by direct substitution (scale factors on one partition, identity on the other), yielding an exactly computable determinant via the change-of-variables formula. Log-likelihood, sampling, and latent inference follow immediately from this definition without fitted parameters or self-referential predictions. Prior work (NICE) is cited for context but is not load-bearing for the new real NVP properties or reported results. Empirical log-likelihoods on image datasets are external benchmarks, not internal fits renamed as predictions. No self-definitional, uniqueness-imported, or ansatz-smuggled steps appear.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The central claim rests on the standard change-of-variables formula for densities under diffeomorphisms and on the assumption that neural networks can parameterize sufficiently flexible coupling functions; no ad-hoc constants or new entities are introduced.

assumptions (1)
  • standard math Change of variables formula for probability densities under invertible differentiable transformations
    Invoked to obtain exact log-likelihood from the Jacobian determinant of the coupling layers.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Density estimation using Real NVP." pith.science (2026). https://pith.science/paper/KSHKSRA6

@misc{pith2026160508803,
  author       = {Pith},
  title        = {Pith review of: Density estimation using Real NVP},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KSHKSRA6}},
  note         = {Machine review of arXiv:1605.08803}
}
read the original abstract

Unsupervised learning of probabilistic models is a central yet challenging problem in machine learning. Specifically, designing models with tractable learning, sampling, inference and evaluation is crucial in solving this task. We extend the space of such models using real-valued non-volume preserving (real NVP) transformations, a set of powerful invertible and learnable transformations, resulting in an unsupervised learning algorithm with exact log-likelihood computation, exact sampling, exact inference of latent variables, and an interpretable latent space. We demonstrate its ability to model natural images on four datasets through sampling, log-likelihood evaluation and latent variable manipulations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Showing 60 of 175 Pith papers that cite this

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 793 citations worldwide. See all 175 Pith citations

  1. When Does LeJEPA Learn a World Model?

    stat.ML 2026-05 unverdicted novelty 8.0 of 10

    LeJEPA achieves linear identifiability of latent variables uniquely when the latents are Gaussian in worlds with stationary additive-noise transitions.

  2. Score-Based Generative Modeling through Stochastic Differential Equations

    cs.LG 2020-11 unverdicted novelty 8.0 of 10

    Introduces an SDE-based framework for score-based generative modeling that unifies prior methods, enables predictor-corrector sampling and neural ODE likelihoods, and achieves SOTA unconditional image generation on CIFAR-10.

  3. Denoising Diffusion Implicit Models

    cs.LG 2020-10 unverdicted novelty 8.0 of 10

    DDIMs construct non-Markovian diffusion processes that share DDPM training objectives but allow much faster reverse sampling, demonstrated empirically at 10-50x wall-clock speedup.

  4. Learning Backward Transport for Source Localization

    physics.flu-dyn 2026-07 conditional novelty 7.0 of 10

    Source localization reduces to Langevin sampling of a learned backward tracer propagator, unifying chemotaxis and cast-and-surge and beating classical heuristics across wind regimes in 2D turbulence.

  5. Sampling the Schwinger Model with Gauge-Equivariant Diffusion

    hep-lat 2026-06 unverdicted novelty 7.0 of 10

    A gauge-equivariant diffusion model samples Schwinger model configurations, yielding unbiased observables matching MCMC and qualitatively less topological freezing than HMC.

  6. Generative Site-Specific Beamforming for UPAs via Decoupled Channel Sensing

    eess.SP 2026-06 unverdicted novelty 7.0 of 10

    A cross-fused generative beamforming method decouples 2D UPA channel sensing and uses bidirectional cross-attention plus conditional normalizing flows to generate high-gain beam candidates, reporting up to 83.6% norma...

  7. Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    Enforcing local orthogonality on the Jacobian of the generative mapping yields identifiability for general nonlinear models when the latent domain has full combinatorial support.

  8. Dynamical Partition Functions of Stochastic Dynamics via Variational Flows

    cond-mat.stat-mech 2026-06 unverdicted novelty 7.0 of 10

    A new variational flow model framework to compute dynamical partition functions and trajectory thermodynamics in high-dimensional stochastic systems.

  9. Expectations vs. Realities: The Cost of MSE-Optimal Forecasting Under Conditional Uncertainty

    cs.LG 2026-06 conditional novelty 7.0 of 10

    MSE-optimal multi-step forecasters cannot match the marginal distribution of realizations under nonzero conditional uncertainty, creating a quantifiable accuracy-realism Pareto frontier across benchmarks.

  10. Adaptive Order Policies for Masked Diffusion

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    A policy network learns to choose unmasking order in masked diffusion by reweighting the loss, outperforming random and heuristic baselines on ordering-sensitive tasks.

  11. Parameter-Efficient Generative Modeling with Controlled Vector Fields

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    Presents a controlled vector field framework for continuous generative modeling where velocity is formed from fixed bracket-generating fields modulated by scalar controls, with an expressivity principle under controll...

  12. Flow-Based Global Proposals for Monte Carlo Sampling in SU(2) Lattice Gauge Theory

    hep-lat 2026-05 unverdicted novelty 7.0 of 10

    A coupling-flow global proposal for Monte Carlo sampling in 2D pure SU(2) lattice gauge theory is shown to be formally valid and to reproduce the target ensemble in proof-of-principle tests, with modest hybrid gains b...

  13. Increasing the Precision of Surrogate Models for Weak Lensing Mass Maps with Flow Matching

    astro-ph.CO 2026-05 unverdicted novelty 7.0 of 10

    A flow matching generative model produces weak lensing mass maps with fidelity improved to below 1% and 5% on basic and higher-order statistics relative to GAN benchmarks.

  14. DriftXpress: Faster Drifting Models via Projected RKHS Fields

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    DriftXpress approximates the attraction field of drifting models with a Nyström landmark projection, reducing training time by 2.6–6.7× at comparable FID.

  15. Normalizing Trajectory Models

    cs.CV 2026-05 unverdicted novelty 7.0 of 10

    NTM uses per-step conditional normalizing flows plus a trajectory-wide predictor to achieve exact-likelihood 4-step sampling that matches or exceeds baselines on text-to-image tasks.

  16. TMDs in the Lens of Generative AI: A Pixel-Based Approach to Partonic Imaging

    hep-ph 2026-05 unverdicted novelty 7.0 of 10

    A nonparametric pixel-based Bayesian method integrates TMD evolution with generative AI sampling and SVD to extract parton distributions and identify unconstrained null components from multi-scale observables.

  17. Flow-Based Conformal Predictive Distributions

    stat.ML 2026-02 unverdicted novelty 7.0 of 10

    Differentiable nonconformity scores induce flows that sample conformal prediction set boundaries, and mixing flows across levels produces conformal predictive distributions whose quantiles match the sets.

  18. Breaking the Resolution Barrier: Arbitrary-resolution Deep Image Steganography Framework

    cs.CV 2026-01 unverdicted novelty 7.0 of 10

    ARDIS enables arbitrary-resolution deep image steganography via frequency decoupling in hiding and latent-guided implicit reconstruction for blind recovery.

  19. Application of deep neural networks for computing the renormalization group flow of the two-dimensional phi^4 field theory

    cond-mat.dis-nn 2025-10 unverdicted novelty 7.0 of 10

    RGFlow uses flow-based neural networks to learn bijective real-space RG transformations for the 2D phi^4 theory, identifying a Wilson-Fisher-like critical point and estimating the correlation length exponent.

  20. A Computable Measure of Suboptimality for Entropy-Regularised Variational Objectives

    stat.CO 2025-09 conditional novelty 7.0 of 10

    Kernel gradient discrepancy gives a computable, theory-backed measure of suboptimality for entropy-regularised variational objectives, and it reduces to kernel Stein discrepancy in the standard Bayesian case.

  21. On Surjectivity of Neural Networks: Can you elicit any behavior from your model?

    cs.LG 2025-08 conditional novelty 7.0 of 10

    Pre-LayerNorm transformers and linear attention are almost always surjective, so any target output has an input that produces it in the continuous embedding space.

  22. Normalizing Flow to Augmented Posterior: Conditional Density Estimation with Interpretable Dimension Reduction for High Dimensional Data

    stat.ME 2025-07 conditional novelty 7.0 of 10

    A normalizing flow whose latent variable combines a posterior of a predictive model for the covariate x with a Gaussian nuisance component performs conditional density estimation and supervised dimension reduction for...

  23. Steering Your Diffusion Policy with Latent Space Reinforcement Learning

    cs.RO 2025-06 unverdicted novelty 7.0 of 10

    DSRL steers pretrained diffusion policies for robotics by applying RL to their latent noise inputs, achieving sample-efficient real-world adaptation with only black-box access.

  24. Beyond Invisibility: Learning Robust Visible Watermarks for Stronger Copyright Protection

    cs.LG 2025-06 conditional novelty 7.0 of 10

    HARVIM learns watermark placement to maximize reconstruction error under an inpainting-based removal model, showing modest gains over random watermarks.

  25. Relational Neurosymbolic Markov Models

    cs.AI 2024-12 conditional novelty 7.0 of 10

    A new relational neurosymbolic Markov model class enforces logical constraints in sequential deep probabilistic models, trained with a differentiable particle filter.

  26. Model-agnostic search for dijet resonances with anomalous jet substructure in proton-proton collisions at $\sqrt{s}$ = 13 TeV

    hep-ex 2024-12 accept novelty 7.0 of 10

    A model-agnostic CMS search for dijet resonances with anomalous jet substructure finds no excess and reports first exclusion limits on several benchmark signals, with ML anomaly detection improving sensitivity over in...

  27. JetFormer: An Autoregressive Generative Model of Raw Images and Text

    cs.LG 2024-11 conditional novelty 7.0 of 10

    JetFormer jointly trains an autoregressive transformer and a normalizing flow end-to-end on raw text and pixels, producing images in the same quality band as VQ-VAE/VAE baselines while providing exact log-likelihood bounds.

  28. Variational Sequential Optimal Experimental Design using Reinforcement Learning

    stat.ML 2023-06 unverdicted novelty 7.0 of 10

    vsOED uses a variational one-point reward and RL policy optimization to provide a lower bound on expected information gain for sequential experimental design, supporting nuisance parameters, implicit likelihoods, and ...

  29. FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow

    cs.CL 2019-09 accept novelty 7.0 of 10

    A flow-based latent variable model enables non-autoregressive neural machine translation with parallel decoding and near-constant time, reaching BLEU scores comparable to state-of-the-art non-autoregressive systems.

  30. Mining for Dark Matter Substructure: Inferring subhalo population properties from strong lenses with machine learning

    astro-ph.CO 2019-09 conditional novelty 7.0 of 10

    A neural likelihood ratio estimator trained on simulated strong lensing images can infer the abundance and mass slope of dark matter subhalos from an ensemble of lenses.

  31. Guided Image Generation with Conditional Invertible Neural Networks

    cs.CV 2019-07 unverdicted novelty 7.0 of 10

    Proposes cINN architecture for conditional image generation that by construction yields diverse sharp samples, demonstrated on MNIST digit generation and image colorization with latent space manipulation.

  32. Flow-based conditional cardiac anatomy generation for virtual cohorts

    cs.LG 2026-08 conditional novelty 6.0 of 10

    CAN-FLOW, a two-step conditional normalizing flow generator trained on LDDMM momenta from 2,208 UK Biobank hearts, produces sex-, age-, and BMI-conditioned biventricular anatomies whose variability matches the real co...

  33. Breaking the Curse with BAND: Nonparametric Distribution Estimation in High Dimensions

    stat.ML 2026-07 conditional novelty 6.0 of 10

    Sparse Bayesian-network factorization plus sparsity-aware regression yields polynomial TV rates for high-dimensional mixed-type distribution estimation, beating classical histogram rates under sparsity.

  34. Amortized Moment Matching for Visual Generation

    cs.LG 2026-07 accept novelty 6.0 of 10

    Amortized Fréchet Distance uses neural nets to match conditional means and covariances, yielding stronger one-step visual generators than explicit FD-loss or multi-step teachers.

  35. Normalizing Flows to Reconstruct Pseudo-PDFs

    hep-lat 2026-07 conditional novelty 6.0 of 10

    An invertible neural network trained on Gaussian-process-prior samples reconstructs pseudo-PDFs from limited Ioffe-time data in closure tests, with constraints preserved but latent-dimension-dependent extrapolation.

  36. Probabilistic redshift estimation of unresolved galaxies from multi-band background light maps

    astro-ph.CO 2026-07 conditional novelty 6.0 of 10

    Conditional normalising flows trained on mock multi-band images recover the redshift distribution of unresolved galaxies with sub-percent accuracy in mean and width, under idealized simulation-matched conditions.

  37. Transformers with Physics-Informed Encodings and Simulation-Based Inference for Robust Detection of Eccentric Binary Black Holes in Pulsar Timing Array Data

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Physics-informed Transformer encodings plus conditional normalizing flows yield sharper, better-calibrated posteriors for eccentric BBHs in white-noise PTA data than physics-agnostic SBI baselines.

  38. Flow-Based Surrogates for High-Dimensional Likelihoods in Experimental Neutrino Physics

    hep-ex 2026-07 accept novelty 6.0 of 10

    A hybrid coupling-plus-autoregressive normalizing flow trained on a 110-parameter T2K-like near-detector likelihood reaches 98% relative ESS versus 5% for the post-fit Gaussian and matches MCMC flux predictions.

  39. Neural posterior estimation of Galactic Binary signals for the LISA mission

    astro-ph.IM 2026-06 unverdicted novelty 6.0 of 10

    Conditional normalizing flows perform likelihood-free parameter estimation for single and overlapping LISA galactic binaries, generating thousands of posterior samples per second after training on simulations.

  40. Three-Body Earth-Moon Transfers with Different Departure/Arrival Orbital Altitudes: New Phenomenon and Diffusion Model-Augmented Construction

    math.OC 2026-06 unverdicted novelty 6.0 of 10

    Identifies discontinuous TOF behavior in three-body Earth-Moon transfers and augments grid search with a diffusion model, reporting 47-56% better convergence and 39-40% time savings for different orbital altitudes.

  41. MIMFlow: Integrating Masked Image Modeling with Normalizing Flows for End-to-End Image Generation

    cs.CV 2026-06 unverdicted novelty 6.0 of 10

    MIMFlow uses a VAE on masked images to feed semantic latents to a normalizing flow while a decoder handles high-frequency details, reporting FID 2.50 and 71.3% linear probing on ImageNet 256x256 with 128 tokens.

  42. Towards Practical Field-Level Inference for Weak Lensing

    astro-ph.CO 2026-06 unverdicted novelty 6.0 of 10

    Field-level inference from weak lensing maps yields significantly tighter cosmological constraints than power-spectrum analysis when using the same forward-modeling pipeline, especially on small scales.

  43. Learning the Universe: Posterior Reliability of Neural Generative Models in High-Dimensional Field-Level Inference of Cosmic Initial Conditions

    astro-ph.CO 2026-06 unverdicted novelty 6.0 of 10

    Generative models for cosmological field-level inference can reproduce posterior means and cross-correlations yet fail to capture correct uncertainty geometry when validated against HMC reference samples.

  44. GenPO++: Generative Policy Optimization with Jacobian-free Likelihood Ratios

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    GenPO++ achieves exact Jacobian-free likelihood ratio computation for generative flow policies by embedding history states as auxiliary memory in a high-order reversible ODE solver.

  45. A Per-Component Diagnostic Protocol for Neural HJB-PIDE Solvers under Control-Dependent L\'evy Jumps

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    Introduces a per-component diagnostic protocol that decomposes the Hamiltonian and cross-checks value function components against independent references to detect operator errors in neural HJB-PIDE solvers with Lévy jumps.

  46. InfoAtlas: A Foundation Model for Zero-Shot Statistical Dependence Estimate

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    InfoAtlas is a pretrained neural model for zero-shot mutual information estimation that matches state-of-the-art accuracy with 100x speedup and handles varying dimensions via a single model.

  47. A Post-Processing Conformal Prediction Approach for Conditional Coverage via Pivotal Scores

    stat.ME 2026-05 unverdicted novelty 6.0 of 10

    PIT-CP post-processes nonconformity scores via one-dimensional conditional density estimation to produce approximately pivotal scores, achieving approximate conditional coverage in conformal prediction for i.i.d. data.

  48. Unbiased Diffusion Variational Inversion via Principled Posterior Matching

    cs.CV 2026-05 unverdicted novelty 6.0 of 10

    PPM derives a tractable gradient for exact KL optimization in diffusion variational inversion to achieve unbiased posterior matching without heuristic approximations.

  49. Bounding-Box Trajectories Matter for Video Anomaly Detection

    cs.CV 2026-05 unverdicted novelty 6.0 of 10

    TrajVAD shows that bounding-box trajectories modeled via normalizing flows can serve as a primary cue for video anomaly detection, with the trajectory-only variant achieving 87.7% AP on ShanghaiTech and best results on MSAD.

  50. UST-Hand: An Uncertainty-aware Spatiotemporal Point Cloud Interaction Network for 3D Self-supervised Hand Pose Estimation

    cs.CV 2026-05 unverdicted novelty 6.0 of 10

    UST-Hand is a self-supervised 3D hand pose estimation method using conditional normalizing flows for uncertainty-aware hypothesis sampling and probabilistic point cloud interactions to achieve up to 37.8% better MPVPE...

  51. TVRN: Invertible Neural Networks for Compression-Aware Temporal Video Rescaling

    eess.IV 2026-05 unverdicted novelty 6.0 of 10

    TVRN combines invertible wavelet-based networks with a surrogate gradient approximator and compression-aware asymmetric design to improve frame-rate rescaling quality under real codecs.

  52. Operator Spectroscopy of Trained Lattice Samplers

    hep-lat 2026-05 unverdicted novelty 6.0 of 10

    Operator projections of trained sampler functions in 2D phi^4 lattice theory decompose residuals into zero-mode Binder and finite-k correlator components, distinguishing flow-matching, diffusion, and normalizing-flow models.

  53. CONTRA: Conformal Prediction Region via Normalizing Flow Transformation

    stat.ML 2026-05 unverdicted novelty 6.0 of 10

    CONTRA generates sharp multi-dimensional conformal prediction regions by defining nonconformity scores as distances from the center in the latent space of a normalizing flow.

  54. Multivariate Time Series Anomaly Detection via Dual-Branch Reconstruction and Autoregressive Flow-based Residual Density Estimation

    cs.LG 2026-03 unverdicted novelty 6.0 of 10

    DBR-AF decouples cross-variable correlations in reconstruction and applies autoregressive flows to model residual densities for improved anomaly detection in multivariate time series.

  55. MPDiT: Multi-Patch Global-to-Local Transformer Architecture For Efficient Flow Matching and Diffusion Model

    cs.CV 2026-03 unverdicted novelty 6.0 of 10

    MPDiT uses a hierarchical multi-patch design in transformers to lower computation in diffusion models by handling coarse global features first then fine local details, plus faster-converging embeddings.

  56. Conditional flow matching for physics-constrained inverse problems with finite training data

    stat.ML 2026-03 unverdicted novelty 6.0 of 10

    Conditional flow matching learns a velocity field to sample from measurement-conditioned posteriors in physics inverse problems, with early stopping to prevent variance collapse and selective memorization under finite...

  57. Inferring the population properties of galactic binaries from LISA's stochastic foreground

    astro-ph.HE 2026-02 unverdicted novelty 6.0 of 10

    A neural posterior estimator trained on simulated LISA foreground spectra recovers galactic binary population parameters, including total number, with good accuracy in validation tests.

  58. SERNF: Sample-Efficient Real-World Dexterous Policy Fine-Tuning via Action-Chunked Critics and Normalizing Flows

    cs.RO 2026-02 unverdicted novelty 6.0 of 10

    SERNF fine-tunes dexterous manipulation policies on real hardware by pairing normalizing-flow policies with action-chunked critics and conservative off-policy RL.

  59. Analytic Bijections for Smooth and Interpretable Normalizing Flows

    cs.LG 2026-01 conditional novelty 6.0 of 10

    Three new analytic bijections and a radial flow architecture give globally smooth, closed-form invertible normalizing flows that match or beat spline baselines on benchmarks and improve phi^4 lattice-field sampling.

  60. The Ensemble Schr{\"o}dinger Bridge filter for Nonlinear Data Assimilation

    cs.LG 2025-12 unverdicted novelty 6.0 of 10

    The Ensemble Schrödinger Bridge filter adds a diffusion-based analysis step to ensemble prediction, enabling effective nonlinear data assimilation without structural model error or training.

See all 175 Pith citations

Reference graph

Works this paper leans on

71 extracted references · 71 canonical work pages · cited by 175 Pith papers (see all)

  1. [1]

    TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems

    Martın Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, et al. Tensorflow: Large-scale machine learning on heterogeneous distributed systems. arXiv preprint arXiv:1603.04467, 2016

    work page Pith review arXiv 2016

  2. [2]

    Understanding symmetries in deep networks

    Vijay Badrinarayanan, Bamdev Mishra, and Roberto Cipolla. Understanding symmetries in deep networks. arXiv preprint arXiv:1511.01029, 2015

    work page Pith review arXiv 2015

  3. [3]

    Density modeling of images using a generalized normalization transformation

    Johannes Ballé, Valero Laparra, and Eero P Simoncelli. Density modeling of images using a generalized normalization transformation. arXiv preprint arXiv:1511.06281, 2015

    work page arXiv 2015

  4. [4]

    An information-maximization approach to blind separation and blind deconvolution

    Anthony J Bell and Terrence J Sejnowski. An information-maximization approach to blind separation and blind deconvolution. Neural computation, 7(6):1129–1159, 1995

    work page 1995

  5. [5]

    Artificial neural networks and their application to sequence recognition

    Yoshua Bengio. Artificial neural networks and their application to sequence recognition. 1991

    work page 1991

  6. [6]

    Modeling high-dimensional discrete data with multi-layer neural networks

    Yoshua Bengio and Samy Bengio. Modeling high-dimensional discrete data with multi-layer neural networks. In NIPS, volume 99, pages 400–406, 1999

    work page 1999

  7. [7]

    Stochastic gradient estimate variance in contrastive divergence and persistent contrastive divergence

    Mathias Berglund and Tapani Raiko. Stochastic gradient estimate variance in contrastive divergence and persistent contrastive divergence. arXiv preprint arXiv:1312.6002, 2013

    work page Pith review arXiv 2013

  8. [8]

    Generating Sentences from a Continuous Space

    Samuel R Bowman, Luke Vilnis, Oriol Vinyals, Andrew M Dai, Rafal Jozefowicz, and Samy Bengio. Generating sentences from a continuous space. arXiv preprint arXiv:1511.06349, 2015

    work page Pith review arXiv 2015

Show all 71 references
  1. [9]

    Super-resolution with deep convolutional sufficient statistics

    Joan Bruna, Pablo Sprechmann, and Yann LeCun. Super-resolution with deep convolutional sufficient statistics. arXiv preprint arXiv:1511.05666, 2015

    2015

  2. [10]

    Importance weighted autoencoders

    Yuri Burda, Roger Grosse, and Ruslan Salakhutdinov. Importance weighted autoencoders. arXiv preprint arXiv:1509.00519, 2015

    2015

  3. [11]

    Gaussianization

    Scott Shaobing Chen and Ramesh A Gopinath. Gaussianization. In Advances in Neural Information Processing Systems, 2000

    2000

  4. [12]

    A recurrent latent variable model for sequential data

    Junyoung Chung, Kyle Kastner, Laurent Dinh, Kratarth Goel, Aaron C Courville, and Yoshua Bengio. A recurrent latent variable model for sequential data. In Advances in neural information processing systems, pages 2962–2970, 2015

    2015

  5. [13]

    The helmholtz machine

    Peter Dayan, Geoffrey E Hinton, Radford M Neal, and Richard S Zemel. The helmholtz machine. Neural computation, 7(5):889–904, 1995

    1995

  6. [14]

    Higher order statistical decorrelation without information loss

    Gustavo Deco and Wilfried Brauer. Higher order statistical decorrelation without information loss. In G. Tesauro, D. S. Touretzky, and T. K. Leen, editors,Advances in Neural Information Processing Systems 7, pages 247–254. MIT Press, 1995

    1995

  7. [15]

    Denton, Soumith Chintala, Arthur Szlam, and Rob Fergus

    Emily L. Denton, Soumith Chintala, Arthur Szlam, and Rob Fergus. Deep generative image models using a laplacian pyramid of adversarial networks. In Advances in Neural Information Processing Systems 28: 10 Published as a conference paper at ICLR 2017 Annual Conference on Neural...

    2017

  8. [16]

    Sample-based non-uniform random variate generation

    Luc Devroye. Sample-based non-uniform random variate generation. InProceedings of the 18th conference on Winter simulation, pages 260–265. ACM, 1986

    1986

  9. [17]

    Nice: non-linear independent components estimation

    Laurent Dinh, David Krueger, and Yoshua Bengio. Nice: non-linear independent components estimation. arXiv preprint arXiv:1410.8516, 2014

    2014

  10. [18]

    Graphical models for machine learning and digital communication

    Brendan J Frey. Graphical models for machine learning and digital communication. MIT press, 1998

    1998

  11. [19]

    Gatys, Alexander S

    Leon A. Gatys, Alexander S. Ecker, and Matthias Bethge. Texture synthesis using convolutional neural networks. In Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canad...

    2015

  12. [20]

    MADE: masked autoencoder for distribution estimation

    Mathieu Germain, Karol Gregor, Iain Murray, and Hugo Larochelle. MADE: masked autoencoder for distribution estimation. CoRR, abs/1502.03509, 2015

    2015

  13. [21]

    Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C

    Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C. Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Syste...

    2014

  14. [22]

    Towards conceptual compression

    Karol Gregor, Frederic Besse, Danilo Jimenez Rezende, Ivo Danihelka, and Daan Wierstra. Towards conceptual compression. arXiv preprint arXiv:1604.08772, 2016

    2016

  15. [23]

    Continuous deep q-learning with model-based acceleration

    Shixiang Gu, Timothy Lillicrap, Ilya Sutskever, and Sergey Levine. Continuous deep q-learning with model-based acceleration. arXiv preprint arXiv:1603.00748, 2016

    2016

  16. [24]

    Deep residual learning for image recognition

    Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. CoRR, abs/1512.03385, 2015

    2015 arXiv

  17. [25]

    Identity mappings in deep residual networks

    Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Identity mappings in deep residual networks. CoRR, abs/1603.05027, 2016

    2016

  18. [26]

    Long short-term memory.Neural Computation, 9(8):1735–1780, 1997

    Sepp Hochreiter and Jürgen Schmidhuber. Long short-term memory.Neural Computation, 9(8):1735–1780, 1997

    1997

  19. [27]

    Stochastic variational inference

    Matthew D Hoffman, David M Blei, Chong Wang, and John Paisley. Stochastic variational inference. The Journal of Machine Learning Research, 14(1):1303–1347, 2013

    2013

  20. [28]

    Independent component analysis, volume 46

    Aapo Hyvärinen, Juha Karhunen, and Erkki Oja. Independent component analysis, volume 46. John Wiley & Sons, 2004

    2004

  21. [29]

    Nonlinear independent component analysis: Existence and uniqueness results

    Aapo Hyvärinen and Petteri Pajunen. Nonlinear independent component analysis: Existence and uniqueness results. Neural Networks, 12(3):429–439, 1999

    1999

  22. [30]

    Generating images with recurrent adversarial networks

    Daniel Jiwoong Im, Chris Dongjoo Kim, Hui Jiang, and Roland Memisevic. Generating images with recurrent adversarial networks. arXiv preprint arXiv:1602.05110, 2016

    2016

  23. [31]

    Batch normalization: Accelerating deep network training by reducing internal covariate shift

    Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. arXiv preprint arXiv:1502.03167, 2015

    2015

  24. [32]

    Exploring the limits of language modeling

    Rafal Józefowicz, Oriol Vinyals, Mike Schuster, Noam Shazeer, and Yonghui Wu. Exploring the limits of language modeling. CoRR, abs/1602.02410, 2016

    2016

  25. [33]

    Adam: A method for stochastic optimization

    Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014

    2014 arXiv

  26. [34]

    Improving variational inference with inverse autoregressive flow

    Diederik P Kingma, Tim Salimans, and Max Welling. Improving variational inference with inverse autoregressive flow. arXiv preprint arXiv:1606.04934, 2016

    2016

  27. [35]

    Auto-encoding variational bayes

    Diederik P Kingma and Max Welling. Auto-encoding variational bayes. arXiv preprint arXiv:1312.6114, 2013

    2013 arXiv

  28. [36]

    Learning multiple layers of features from tiny images, 2009

    Alex Krizhevsky and Geoffrey Hinton. Learning multiple layers of features from tiny images, 2009

    2009

  29. [37]

    The neural autoregressive distribution estimator

    Hugo Larochelle and Iain Murray. The neural autoregressive distribution estimator. In AISTATS, 2011

    2011

  30. [38]

    Autoencoding beyond pixels using a learned similarity metric

    Anders Boesen Lindbo Larsen, Søren Kaae Sønderby, and Ole Winther. Autoencoding beyond pixels using a learned similarity metric. CoRR, abs/1512.09300, 2015

    2015

  31. [39]

    Efficient backprop

    Yann A LeCun, Léon Bottou, Genevieve B Orr, and Klaus-Robert Müller. Efficient backprop. InNeural networks: Tricks of the trade, pages 9–48. Springer, 2012

    2012

  32. [40]

    Deeply-supervised nets

    Chen-Yu Lee, Saining Xie, Patrick Gallagher, Zhengyou Zhang, and Zhuowen Tu. Deeply-supervised nets. arXiv preprint arXiv:1409.5185, 2014

    2014

  33. [41]

    Deep learning face attributes in the wild

    Ziwei Liu, Ping Luo, Xiaogang Wang, and Xiaoou Tang. Deep learning face attributes in the wild. In Proceedings of International Conference on Computer Vision (ICCV), December 2015

    2015

  34. [42]

    Auxiliary deep generative models

    Lars Maaløe, Casper Kaae Sønderby, Søren Kaae Sønderby, and Ole Winther. Auxiliary deep generative models. arXiv preprint arXiv:1602.05473, 2016

    2016

  35. [43]

    Neural variational inference and learning in belief networks

    Andriy Mnih and Karol Gregor. Neural variational inference and learning in belief networks. arXiv preprint arXiv:1402.0030, 2014

    2014

  36. [44]

    Human-level control through deep reinforcement learning

    V olodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Bellemare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Human-level control through deep reinforcement learning. Nature, 518(7540):529–533, 2015

    2015

  37. [45]

    A view of the em algorithm that justifies incremental, sparse, and other variants

    Radford M Neal and Geoffrey E Hinton. A view of the em algorithm that justifies incremental, sparse, and other variants. In Learning in graphical models, pages 355–368. Springer, 1998. 11 Published as a conference paper at ICLR 2017

    1998

  38. [46]

    Pixel recurrent neural networks

    Aaron van den Oord, Nal Kalchbrenner, and Koray Kavukcuoglu. Pixel recurrent neural networks. arXiv preprint arXiv:1601.06759, 2016

    2016

  39. [47]

    Unsupervised representation learning with deep convolutional generative adversarial networks

    Alec Radford, Luke Metz, and Soumith Chintala. Unsupervised representation learning with deep convolutional generative adversarial networks. CoRR, abs/1511.06434, 2015

    2015

  40. [48]

    Variational inference with normalizing flows

    Danilo Jimenez Rezende and Shakir Mohamed. Variational inference with normalizing flows. arXiv preprint arXiv:1505.05770, 2015

    2015

  41. [49]

    Stochastic backpropagation and approxi- mate inference in deep generative models

    Danilo Jimenez Rezende, Shakir Mohamed, and Daan Wierstra. Stochastic backpropagation and approxi- mate inference in deep generative models. arXiv preprint arXiv:1401.4082, 2014

    2014

  42. [50]

    High-dimensional probability estimation with deep density models

    Oren Rippel and Ryan Prescott Adams. High-dimensional probability estimation with deep density models. arXiv preprint arXiv:1302.5125, 2013

    2013

  43. [51]

    Learning representations by back- propagating errors

    David E Rumelhart, Geoffrey E Hinton, and Ronald J Williams. Learning representations by back- propagating errors. Cognitive modeling, 5(3):1, 1988

    1988

  44. [52]

    Imagenet large scale visual recognition challenge

    Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al. Imagenet large scale visual recognition challenge. International Journal of Computer Vision, 115(3):211–252, 2015

    2015

  45. [53]

    Deep boltzmann machines

    Ruslan Salakhutdinov and Geoffrey E Hinton. Deep boltzmann machines. In International conference on artificial intelligence and statistics, pages 448–455, 2009

    2009

  46. [54]

    Weight normalization: A simple reparameterization to accelerate training of deep neural networks

    Tim Salimans and Diederik P Kingma. Weight normalization: A simple reparameterization to accelerate training of deep neural networks. arXiv preprint arXiv:1602.07868, 2016

    2016

  47. [55]

    Markov chain monte carlo and variational inference: Bridging the gap

    Tim Salimans, Diederik P Kingma, and Max Welling. Markov chain monte carlo and variational inference: Bridging the gap. arXiv preprint arXiv:1410.6460, 2014

    2014

  48. [56]

    Mean field theory for sigmoid belief networks

    Lawrence K Saul, Tommi Jaakkola, and Michael I Jordan. Mean field theory for sigmoid belief networks. Journal of artificial intelligence research, 4(1):61–76, 1996

    1996

  49. [57]

    Very deep convolutional networks for large-scale image recogni- tion

    Karen Simonyan and Andrew Zisserman. Very deep convolutional networks for large-scale image recogni- tion. arXiv preprint arXiv:1409.1556, 2014

    2014 arXiv

  50. [58]

    Information processing in dynamical systems: Foundations of harmony theory

    Paul Smolensky. Information processing in dynamical systems: Foundations of harmony theory. Technical report, DTIC Document, 1986

    1986

  51. [59]

    Weiss, Niru Maheswaranathan, and Surya Ganguli

    Jascha Sohl-Dickstein, Eric A. Weiss, Niru Maheswaranathan, and Surya Ganguli. Deep unsupervised learning using nonequilibrium thermodynamics. In Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015, pages 2256–2265, 2015

    2015

  52. [60]

    Resnet in resnet: Generalizing residual architectures

    Sasha Targ, Diogo Almeida, and Kevin Lyman. Resnet in resnet: Generalizing residual architectures. CoRR, abs/1603.08029, 2016

    2016

  53. [61]

    Generative image modeling using spatial lstms

    Lucas Theis and Matthias Bethge. Generative image modeling using spatial lstms. In Advances in Neural Information Processing Systems, pages 1918–1926, 2015

    1918

  54. [62]

    A note on the evaluation of generative models

    Lucas Theis, Aäron Van Den Oord, and Matthias Bethge. A note on the evaluation of generative models. CoRR, abs/1511.01844, 2015

    2015

  55. [63]

    Variational gaussian process

    Dustin Tran, Rajesh Ranganath, and David M Blei. Variational gaussian process. arXiv preprint arXiv:1511.06499, 2015

    2015

  56. [64]

    Rnade: The real-valued neural autoregressive density- estimator

    Benigno Uria, Iain Murray, and Hugo Larochelle. Rnade: The real-valued neural autoregressive density- estimator. In Advances in Neural Information Processing Systems, pages 2175–2183, 2013

    2013

  57. [65]

    Learning functions across many orders of magnitudes

    Hado van Hasselt, Arthur Guez, Matteo Hessel, and David Silver. Learning functions across many orders of magnitudes. arXiv preprint arXiv:1602.07714, 2016

    2016

  58. [66]

    Order matters: Sequence to sequence for sets

    Oriol Vinyals, Samy Bengio, and Manjunath Kudlur. Order matters: Sequence to sequence for sets. arXiv preprint arXiv:1511.06391, 2015

    2015

  59. [67]

    Embed to control: A locally linear latent dynamics model for control from raw images

    Manuel Watter, Jost Springenberg, Joschka Boedecker, and Martin Riedmiller. Embed to control: A locally linear latent dynamics model for control from raw images. In Advances in Neural Information Processing Systems, pages 2728–2736, 2015

    2015

  60. [68]

    Simple statistical gradient-following algorithms for connectionist reinforcement learning

    Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning, 8(3-4):229–256, 1992

    1992

  61. [69]

    Multi-scale context aggregation by dilated convolutions

    Fisher Yu and Vladlen Koltun. Multi-scale context aggregation by dilated convolutions. arXiv preprint arXiv:1511.07122, 2015

    2015

  62. [70]

    Construction of a large-scale image dataset using deep learning with humans in the loop

    Fisher Yu, Yinda Zhang, Shuran Song, Ari Seff, and Jianxiong Xiao. Construction of a large-scale image dataset using deep learning with humans in the loop. arXiv preprint arXiv:1506.03365, 2015

    2015

  63. [71]

    Colorful image colorization

    Richard Zhang, Phillip Isola, and Alexei A Efros. Colorful image colorization. arXiv preprint arXiv:1603.08511, 2016. 12 Published as a conference paper at ICLR 2017 A Samples Figure 7: Samples from a model trained on Imagenet (64× 64). 13 Published as a conference paper at IC...

    2016

Pith tools

Reviewed May 11, 2026 · model on record in the stance chip above.