Pith. sign in

REVIEW 2 cited by

Block Neural Autoregressive Flow

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 1904.04676 v1 pith:ZK2OLJUA submitted 2019-04-09 stat.ML cs.LG

classification stat.MLcs.LG
keywords flowautoregressivedensityneuralblockfunctionsapproximatorb-naf
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Normalising flows (NFS) map two density functions via a differentiable bijection whose Jacobian determinant can be computed efficiently. Recently, as an alternative to hand-crafted bijections, Huang et al. (2018) proposed neural autoregressive flow (NAF) which is a universal approximator for density functions. Their flow is a neural network (NN) whose parameters are predicted by another NN. The latter grows quadratically with the size of the former and thus an efficient technique for parametrization is needed. We propose block neural autoregressive flow (B-NAF), a much more compact universal approximator of density functions, where we model a bijection directly using a single feed-forward network. Invertibility is ensured by carefully designing each affine transformation with block matrices that make the flow autoregressive and (strictly) monotone. We compare B-NAF to NAF and other established flows on density estimation and approximate inference for latent variable models. Our proposed flow is competitive across datasets while using orders of magnitude fewer parameters.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. LazyDINO: Fast, scalable, and efficiently amortized Bayesian inversion via structure-exploiting and surrogate-driven measure transport

    math.NA 2024-11 conditional novelty 6.0 of 10

    A new amortized Bayesian inversion method trains a derivative-informed neural surrogate of the parameter-to-observable map and then uses it to optimize a lazy transport map in a low-dimensional latent space.

  2. Unconstrained Monotonic Neural Networks

    cs.LG 2019-08 conditional novelty 5.0 of 10

    An invertible scalar map is defined as the integral of a positive-output neural network and stacked into an autoregressive normalizing flow (UMNN-MAF) with competitive density-estimation results.

Pith tools