New method improves Variational Auto-Encoders using convex combination of Inverse Autoregressive Flows.
problem Improving Variational Auto-Encoders (VAEs) for better performance.
method Introducing multiple lower-triangular matrices with ones on the diagonal and combining them using a convex combination to enrich a linear Inverse Autoregressive Flow.
result The proposed method outperforms other volume-preserving flows and is competitive with state-of-the-art linear normalizing flows.
The framework of normalizing flows provides a general strategy for flexible variational inference of posteriors over latent variables. We propose a new type of normalizing flow, inverse autoregressive flow (IAF), that, in contrast to earlier published flows, scales well to high-dimensional latent spaces. The proposed f…
Improves autoregressive models for better density estimation.
problem Limited flexibility of autoregressive models.
method Stacked autoregressive models with random number modeling.
result Achieves state-of-the-art performance in density estimation.
Cubic-Spline Flows improve autoregressive flow performance in density estimation.
problem Improving the performance of flow-based models in density estimation.
method Stacking a new coupling transform based on monotonic cubic splines with LU-decomposed linear layers.
result Cubic-Spline Flows close the gap with autoregressive flows on density-estimation tasks.
NAF combines neural networks with autoregressive models for better density estimation.
problem Improving density estimation and speech synthesis speed.
method Generalizes autoregressive models using neural networks for invertible transformations.
result NAF is a universal approximator for continuous probability distributions and outperforms IAF.
Sylvester flows improve variational inference by making transformations more flexible.
problem Flexible approximate posterior distributions for variational inference.
method Introduce Sylvester normalizing flows as a generalization of planar flows.
result Sylvester flows perform favorably compared to planar and inverse autoregressive flows on various datasets.
NeuTra-lizes bad geometry in HMC using neural transport.
problem Difficult-to-normalize posterior distributions with unfavorable geometry.
method Neural transport (NeuTra) HMC, using inverse autoregressive flows (IAF) to correct geometry.
result Significantly outperforms vanilla HMC in time and effective-sample-size rates.
Framework uses low-dimensional maps to solve high-dimensional Bayesian inference problems.
problem High-dimensional Bayesian inference problems.
method Structure-exploiting lazy maps and flows, focusing on low-dimensional subspace.
result Weak convergence of generated distributions to the posterior.
Unified approach to VAEs using flexible priors and inverse AFs.
problem Improving VAEs for better sample generation and inference.
method Layerwise density estimation, inverse autoregressive flows (inverse AF).
result Inverse AF can approximate any posterior, improving VAEs.
New bidirectional model predicts magnetohydrodynamics fields and estimates uncertainty.
problem Predicting multiple fields in magnetohydrodynamics with uncertainty.
method Bidirectional autoregressive latent diffusion approach.
result Model can estimate uncertainty without ground truth using self-supervised consistency.
Deep neural network solves complex groundwater contaminant source identification.
problem Identifying groundwater contaminant sources in highly heterogeneous media.
method Deep autoregressive neural network surrogate for forward model, ILUES for inversion.
result Deep autoregressive neural network provides accurate approximation for high-dimensional model.
Discrete flows extend normalizing flows to discrete data, improving various applications.
problem Applying normalizing flows to discrete data distributions.
method Developed discrete autoregressive and bipartite flows, showing their effectiveness on various discrete data tasks.
result Discrete autoregressive flows outperform autoregressive baselines on synthetic discrete distributions and Potts models.
Paper uses black-box inference to estimate non-linear latent force models.
problem Estimating posterior state and forcing term in non-linear systems with unknown forcing terms.
method Black-box variational inference with local inverse autoregressive flows.
result Demonstrates effectiveness of approximation on known posterior systems and non-linear dynamics.
DLF combines autoregressive and flow-based methods for efficient and high-performance image generation.
problem Limited density estimation performance and parallelizability of flow-based and autoregressive models.
method Dynamic Linear Flow (DLF) with partially autoregressive structure.
result DLF achieves state-of-the-art performance on ImageNet 32x32 and 64x64 images.
Paper proposes energy objective for training normalizing flows without determinants.
problem Challenges in training normalizing flows due to Jacobian determinants.
method Introduces energy objective based on proper scoring rules, determinant-free.
result Energy objective supports novel model families and competitive performance.
Improved lattice field theory simulations with local-Autoregressive Conditional Normalizing Flow.
problem Efficiently sampling lattice field theories with computational challenges.
method Integrates locality into autoregressive conditional normalizing flows.
result Autocorrelation times improved by orders of magnitude for φ4 theory on a 2D lattice. B-NAF is a more compact flow for density estimation and inference.
problem Efficiently modeling complex density functions with fewer parameters.
method Directly models a bijection using a single feed-forward network with block matrices.
result B-NAF uses orders of magnitude fewer parameters while being competitive.
Autoregressive flow models can perform causal discovery and inference tasks.
problem Causal inference tasks such as causal discovery and interventional predictions.
method Using autoregressive flow models to estimate causal directions and make predictions.
result Autoregressive flows can accurately perform causal inference tasks without restrictive assumptions.
Improved flow-based models capture dependencies better with multi-scale autoregressive priors.
problem Limited expressiveness of flow-based models for long-range data dependencies.
method Introducing channel-wise dependencies through multi-scale autoregressive priors (mAR) in split coupling flow layers (mAR-SCF).
result Achieves state-of-the-art density estimation results on MNIST, CIFAR-10, and ImageNet.
Causal autoregressive flows enable accurate causal inference and prediction.
problem Causal discovery and interventional predictions in machine learning.
method Autoregressive normalizing flows with fixed variable orderings.
result Causal models derived from autoregressive flows are identifiable and allow for accurate interventional and counterfactual predictions.
Method uses autoregressive models to interpret neural network representations.
problem Understanding and quantifying information preserved in neural network layers.
method Trains autoregressive models to invert model representations and estimate mutual information.
result Mutual information between inputs and network layers decreases over training.
Flow++ improves flow-based models by dequantizing with variational methods and using expressive architectures.
problem Flow-based models have poor density estimation compared to autoregressive models.
method Variational dequantization, expressive affine flows, and improved architecture design.
result Flow++ is now the state-of-the-art non-autoregressive model for unconditional density estimation.
HCNAF models complex conditional distributions for probabilistic occupancy forecasting.
problem Modeling complex conditional probability density functions for occupancy forecasting.
method Hyper-Conditioned Neural Autoregressive Flow (HCNAF) combining AF and hyper-network.
result HCNAF achieves state-of-the-art performance in self-driving datasets.
SNL trains autoregressive flows on simulated data to learn likelihood for Bayesian inference.
problem Intractable likelihood in simulator models.
method Trains autoregressive flow on simulated data to model likelihood.
result SNL is more robust, accurate, and requires less tuning than related methods.
A new model uses normalizing flows for discrete sequences, improving generation speed.
problem Modeling discrete sequences like text using normalizing flows poses challenges.
method Proposes a VAE-based model with autoregressive and non-autoregressive flow architectures.
result Flow-based models can match or improve on autoregressive baselines for discrete sequence tasks.
Bayesian method estimates Kronecker graphical models from autoregressive processes.
problem Estimating Kronecker graphical models from autoregressive Gaussian processes.
method Bayesian approach to estimate Kronecker graphical models.
result Effectiveness demonstrated through numerical experiments and real-world data application.
EventFlow forecasts event sequences without autoregression, improving accuracy.
problem Forecasting errors in autoregressive models for event sequences.
method EventFlow uses flow matching to learn joint distributions over event times directly.
result EventFlow reduces forecast error by 20%-53% compared to baselines.
MaCow improves flow-based models for image density estimation.
problem Flow-based models struggle with density estimation compared to autoregressive models.
method Introduced masked convolutional generative flow (MaCow) using masked convolution.
result Significant improvements in density estimation on image benchmarks.
A new neural network for efficient density estimation.
problem Efficient density estimation for high-dimensional data.
method Triangular neural network implementation of neural autoregressive flow (NAF).
result Achieves state-of-the-art bits-per-dimension indices on MNIST and CIFAR-10.
Paper uses GMM and MAF for probabilistic classification, outperforming simpler models.
problem Classifying data with complex distributions.
method Density estimation using Gaussian Mixture Model and Masked Autoregressive Flow.
result Proposed classifiers outperform simpler models like linear discriminant analysis.
AR-Flow VAE improves blind source separation with flexible autoregressive priors.
problem Unsupervised blind source separation of latent signals from mixtures.
method AR-Flow VAE uses autoregressive flows to model latent sources, enhancing flexibility and capturing complex dependencies.
result AR-Flow VAE effectively separates latent sources, demonstrating improved performance over conventional methods.
This review compares various deep generative models.
problem Training deep neural networks to model data distributions.
method Comprehensive comparison of VAEs, GANs, flows, energy models, and autoregressives.
result Trade-offs and interrelationships among different models.
Non-autoregressive method speeds up protein folding prediction 23 times.
problem Generating protein sequences with higher order interactions.
method Discrete diffusion conditioned on 3D structure using ProteinMPNN.
result 23 times speed up in inference without performance loss.
Simplifies residual flows to make flow-based modeling more practical.
problem Extremely high computational cost of residual flows limits their applicability.
method Introduces Quasi-Autoregressive (QuAR) approach to residual flows.
result Significantly reduces compute time and memory requirements for flow-based modeling.
Neural spline flows enhance flow models with rational-quadratic splines.
problem Improving flexibility and density estimation in flow models.
method Proposes a new differentiable module based on monotonic rational-quadratic splines.
result Demonstrates improved performance in density estimation, variational inference, and generative modeling of images.
Neural networks improve gravitational-wave parameter estimation.
problem Estimating parameters of binary black hole systems from gravitational-wave data.
method Autoregressive normalizing flows for likelihood-free inference.
result Performance comparable to current best deep-learning approaches, with fast sampling.
ELF simplifies normalizing flows, making them more efficient and universal.
problem Computational inefficiency of normalizing flows.
method ELF introduces a simple, one-layer network with closed-form Lipschitz constants, combining the ease of residual flows with the performance of autoregressive flows.
result ELF is a provably universal density approximator, more efficient computationally and parameter-wise.
This study compares different types of normalizing flows for generating complex distributions.
problem Comparing different types of normalizing flows for generating complex distributions.
method Real-valued non-Volume preserving (RealNVP), masked autoregressive flow (MAF), coupling rational quadratic spline (C-RQS), and autoregressive rational quadratic spline (A-RQS) were compared using statistical tests.
result A-RQS algorithm outperforms others in terms of accuracy and training speed.
GraphAF generates chemically valid molecules efficiently and accurately.
problem Generating chemically valid molecular structures while optimizing chemical properties.
method Flow-based autoregressive model combining autoregressive and flow-based approaches.
result GraphAF generates 68% chemically valid molecules without chemical knowledge rules and 100% with rules, achieving state-of-the-art performance.
Study inverse problems for twisted geodesic flows on manifolds.
problem Understanding inverse problems for twisted geodesic flows.
method Generalized ray transforms and tensor tomography.
result New insights into rigidity problems for twisted geodesic flows.
The paper studies self-expanding solutions to inverse curvature flows in Euclidean spaces.
problem Investigating self-expanding solutions to inverse curvature flows in Euclidean spaces.
method Using homogeneous symmetric functions of principal curvatures, the paper analyzes self-expanding solutions to a broad class of inverse curvature flows.
result Complete non-compact self-expanders to these flows with asymptotically cylindrical ends must be rotationally symmetric.
SAHMM-VAE separates sources adaptively using hidden Markov priors.
problem Unsupervised blind source separation.
method Source-wise adaptive Hidden Markov prior variational autoencoder.
result Different latent dimensions align with different source-specific temporal organizations.
Improved LSTM and ARIMA model for traffic flow forecasting.
problem Poor stability, high data requirements, and adaptability issues in existing traffic flow prediction methods.
method Combination prediction method based on improved LSTM and ARIMA models.
result The SDLSTM-ARIMA model achieves higher accuracy in traffic flow prediction.
Study on positivity in inverse σ-flow convergence for (n-1, n-1) cohomology classes.
problem Finding necessary and sufficient conditions for solvability of inverse σ_k equations.
method Analyzing positivity in the inverse σ_{n-1}-flow for (n-1, n-1) cohomology classes.
result Partial verification of conjecture for inverse σ_{n-1}-flow and 3-folds.
The paper studies a flow of Legendre curves, generalizing the inverse curvature flow of regular curves.
problem Analyzing the inverse curvature flow of Legendre curves.
method Investigates the unique existence, monotonicity, and asymptotic behavior of the flow.
result The flow asymptotically converges to a self-similar solution, categorized by initial curve.
PixelCNN models can achieve state-of-the-art results on CIFAR-10 with exact likelihood computation.
problem Dequantization gap in modeling discrete data like images.
method Introducing subset flows to allow exact computation of likelihoods for discrete data.
result PixelCNN models trained with exact likelihood computation achieve state-of-the-art results on CIFAR-10.
Flow on curves in inversive geometry converges to loxodromics.
problem Gradient flow for curve length in inversive geometry.
method Invariant gradient flow for invariant length functional.
result Solutions exist for all time and converge to loxodromic curves.
Proves existence of proper solutions for inverse mean curvature flow.
problem Existence of proper solutions for inverse mean curvature flow.
method Proves existence theorem assuming non-degeneracy conditions on isoperimetric profile.
result No curvature assumption in existence theorem.