Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

3570104139 · May 202619922001200920172026
48 results for invertible flows

Statistical generative models for molecular graphs attract attention from many researchers from the fields of bio- and chemo-informatics. Among these models, invertible flow-based approaches are not fully explored yet. In this paper, we propose a powerful invertible flow for molecular graphs, called graph residual flow…

2019-09-30abs ↗pdf ↗

Incorporates matrix exponential into generative flows for improved performance.

problem Improving generative flow models for better density estimation.
method Integrates matrix exponential into generative flows, proposing new layers and modifying network architecture.
result The proposed model achieves great performance on density estimation.

Flow-based generative models parameterize probability distributions through an invertible transformation and can be trained by maximum likelihood. Invertible residual networks provide a flexible family of transformations where only Lipschitz conditions rather than strict architectural constraints are needed for enforci…

2019-06-06abs ↗pdf ↗

A normalizing flow models a complex probability density as an invertible transformation of a simple density. The invertibility means that we can evaluate densities and generate samples from a flow. In practice, autoregressive flow-based models are slow to invert, making either density estimation or sample generation sl…

2019-06-05abs ↗pdf ↗

ButterflyFlow uses butterfly matrices for efficient invertible layers in normalizing flows.

problem Building efficient invertible layers for complex probability distributions.
method Proposes butterfly layers for invertible linear layers, leveraging their ability to capture complex structures.
result ButterflyFlow achieves strong density estimation and significantly better log-likelihoods on various datasets.

A normalizing flow models a complex probability density as an invertible transformation of a simple base density. Flows based on either coupling or autoregressive transforms both offer exact density evaluation and sampling, but rely on the parameterization of an easily invertible elementwise transformation, whose choic…

2019-06-10abs ↗pdf ↗

CF-INNs can approximate any invertible function, resolving a long-standing problem.

problem Whether CF-INNs can approximate any invertible function.
method Demonstrated CF-INNs are universal approximators for invertible functions by showing a convenient criterion.
result CF-INNs are universal approximators for invertible functions.

i-DenseNets improve parameter efficiency and performance in density estimation.

problem Improving parameter efficiency and performance in density estimation models.
method Invertible Dense Networks (i-DenseNets) with learnable weighted concatenation and Concatenated LipSwish activation function.
result i-DenseNets outperform Residual Flows and other flow-based models in bits per dimension.

This work presents a novel approach to train invertible linear layers by adding rank-one perturbations.

problem Training invertible linear layers during optimization with gradient-based methods is challenging.
method Train rank-one perturbations and add them to weight matrices infrequently, keeping track of inverses and determinants.
result Invertible linear layers improve mixing and mode separation in normalizing flows.

iGNN tackles inverse graph prediction using invertible neural networks.

problem Inverse graph prediction problem in data analysis and machine learning.
method Developed invertible graph neural network (iGNN) to solve inverse prediction problem on graphs.
result iGNN model allows efficient generation from output labels and forward prediction.

This paper focuses on a novel generative approach for 3D point clouds that makes use of invertible flow-based models. The main idea of the method is to treat a point cloud as a probability density in 3D space that is modeled using a cloud-specific neural network. To capture the similarity between point clouds we rely o…

2019-10-16abs ↗pdf ↗

This work tackles exploding inverses in INNs, revealing and mitigating their numerical non-invertibility.

problem Exploding inverses in INNs cause numerical non-invertibility, leading to failures in various tasks.
method Derived bi-Lipschitz properties of INN building blocks, proposed regularizers for local invertibility, and stable INN designs for global invertibility.
result Bi-Lipschitz properties and stable INN designs are crucial for addressing numerical non-invertibility.

New linear flows using exponential of linear transformations improve generative models.

problem Improving generative models in machine learning.
method Developed convolution exponentials and generalized Sylvester Flows using the exponential of linear transformations.
result Convolution exponentials and Convolutional Sylvester Flows outperform other models in log-likelihood.

Augmented KRnet improves flow-based generative modeling by maintaining exact invertibility.

problem Maintaining exact invertibility in flow-based generative models.
method Integrates augmented dimensions into KRnet to achieve full nonlinear updates in two iterations, keeping exact invertibility.
result Augmented KRnet achieves full nonlinear updates in two iterations, maintaining exact invertibility.

A new base distribution for normalizing flows allows modeling complex distributions without sacrificing invertibility.

problem Normalizing flows struggle with complex, non-trivial distributions.
method Learned rejection sampling for base distribution, combined with optimization of log-likelihood and Kullback-Leibler divergence.
result The method effectively models complicated distributions without sacrificing invertibility.

IDF++ improves integer discrete flows for lossless compression.

problem Theoretical limitations of integer discrete flows for lossless compression.
method Investigated and improved integer discrete flows, addressing gradient bias and architecture modifications.
result Different architecture modifications improve integer discrete flows for lossless compression.

In this work, we investigate the use of normalizing flows to model conditional distributions. In particular, we use our proposed method to analyze inverse problems with invertible neural networks by maximizing the posterior likelihood. Our method uses only a single loss and is easy to train. This is an improvement on t…

2019-11-05abs ↗pdf ↗

We propose GraphNVP, the first invertible, normalizing flow-based molecular graph generation model. We decompose the generation of a graph into two steps: generation of (i) an adjacency tensor and (ii) node attributes. This decomposition yields the exact likelihood maximization on graph-structured data, combined with t…

2019-05-28abs ↗pdf ↗

OT-Flow uses optimal transport to improve CNFs for faster and more accurate density estimation.

problem Computational challenges in continuous normalizing flows.
method OT-Flow leverages optimal transport to regularize CNFs and uses exact trace computation.
result OT-Flow achieves competitive performance with one-fourth the number of weights and significant speedups.

Kernelised flows improve density estimation and generation with fewer parameters.

problem Limited expressiveness of flow-based models due to invertibility constraints.
method Integrates kernels into normalising flows to enhance expressiveness and efficiency.
result Kernelised flows outperform neural network-based flows in parameter efficiency and low-data scenarios.

ProFITi model forecasts irregular time series with missing values using conditional flows.

problem Probabilistic forecasting of irregularly sampled multivariate time series with missing values.
method ProFITi model uses conditional normalizing flows and invertible layers to learn joint distributions conditioned on past observations and queried channels and times.
result ProFITi model provides 4 times higher likelihood than the previous best model.

Flowification enriches neural networks with an inverse pass and likelihood monitoring.

problem Neural networks lack an inverse pass and likelihood monitoring, limiting their generative capabilities.
method Introduce flowification, enriching neural networks with a stochastic inverse pass and likelihood monitoring.
result Certain neural network architectures can be enriched to fall under the generalized notion of a normalizing flow.

We show that standard ResNet architectures can be made invertible, allowing the same model to be used for classification, density estimation, and generation. Typically, enforcing invertibility requires partitioning dimensions or restricting network architectures. In contrast, our approach only requires adding a simple …

2018-11-02abs ↗pdf ↗

Generative flows are attractive because they admit exact likelihood optimization and efficient image synthesis. Recently, Kingma & Dhariwal (2018) demonstrated with Glow that generative flows are capable of generating high quality images. We generalize the 1 x 1 convolutions proposed in Glow to invertible d x d convolu…

2019-01-30abs ↗pdf ↗

A new model decouples global and local image representations without supervision.

problem Learning decoupled global and local image representations without supervision.
method Variational auto-encoding framework with invertible generative flow.
result The model effectively learns decoupled representations of images.

Flow-based generative models (Dinh et al., 2014) are conceptually attractive due to tractability of the exact log-likelihood, tractability of exact latent-variable inference, and parallelizability of both training and synthesis. In this paper we propose Glow, a simple type of generative flow using an invertible 1x1 con…

2018-07-09abs ↗pdf ↗

Flow-based deep generative models learn data distributions by transforming a simple base distribution into a complex distribution via a set of invertible transformations. Due to the invertibility, such models can score unseen data samples by computing their exact likelihood under the learned distribution. This makes fl…

2019-06-17abs ↗pdf ↗

We propose a new way of constructing invertible neural networks by combining simple building blocks with a novel set of composition rules. This leads to a rich set of invertible architectures, including those similar to ResNets. Inversion is achieved with a locally convergent iterative procedure that is parallelizable …

2019-07-18abs ↗pdf ↗

Invertible flow-based generative models are an effective method for learning to generate samples, while allowing for tractable likelihood computation and inference. However, the invertibility requirement restricts models to have the same latent dimensionality as the inputs. This imposes significant architectural, memor…

2020-02-20abs ↗pdf ↗

The Normalizing Flow (NF) models a general probability density by estimating an invertible transformation applied on samples drawn from a known distribution. We introduce a new type of NF, called Deep Diffeomorphic Normalizing Flow (DDNF). A diffeomorphic flow is an invertible function where both the function and its i…

2018-10-08abs ↗pdf ↗

Monotonic neural networks have recently been proposed as a way to define invertible transformations. These transformations can be combined into powerful autoregressive flows that have been shown to be universal approximators of continuous probability distributions. Architectures that ensure monotonicity typically enfor…

2019-08-14abs ↗pdf ↗

Normalizing flows attempt to model an arbitrary probability distribution through a set of invertible mappings. These transformations are required to achieve a tractable Jacobian determinant that can be used in high-dimensional scenarios. The first normalizing flow designs used coupling layer mappings built upon affine …

2020-01-15abs ↗pdf ↗

We address representational challenges in normalizing flows, particularly depth and conditioning issues.

problem Challenges in training normalizing flows, including vanishing/exploding gradients and poor conditioning.
method Analyzes representational aspects of depth and conditioning in normalizing flows, proving theoretical bounds and investigating phenomena.
result Proves that shallow affine coupling networks are universal approximators in Wasserstein distance if ill-conditioning is allowed.

Normalizing flows are deep generative models that allow efficient likelihood calculation and sampling. The core requirement for this advantage is that they are constructed using functions that can be efficiently inverted and for which the determinant of the function's Jacobian can be efficiently computed. Researchers h…

2020-02-27abs ↗pdf ↗

Graphical normalizing flows use Bayesian networks to improve normalizing flows' interpretability and performance.

problem Improving the interpretability and performance of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models, proposing graphical normalizing flows with either prescribed or learnable graph structures.
result Graphical conditioners lead to competitive white box density estimators.

Flow models recover causal transformations from observational data and a valid ordering.

problem Causal inference with only observational data and a valid causal ordering.
method Flow models that can recover component-wise, invertible transformations of exogenous variables.
result Flow models outperform previous methods and deliver consistent performance across various structural causal models.