Normalizing flows improve density estimation from noisy data.
problem Estimating underlying density from noisy samples.
method Use normalizing flows for density estimation with arbitrary noise distributions, using amortized variational inference.
result Normalizing flows can outperform Gaussian mixtures for density deconvolution.
Method uses normalizing flows to efficiently sample from complex target densities.
problem Sampling from complex target densities with zero values in regions of transformation.
method Normalizing flows to address exploding reverse Kullback-Leibler divergence.
result Demonstrated efficient sampling from multi-mode complex density function.
Proposes differentially private normalizing flows for privacy-preserving density estimation.
problem Privacy concerns in density estimation models when individuals are directly associated with the training data.
method Uses normalizing flow models with explicit differential privacy guarantees.
result Substantially outperforms previous state-of-the-art approaches in privacy-preserving density estimation.
Paper proposes methods to learn sub-manifolds and estimate densities in normalizing flows.
problem Normalizing flows struggle with finding sub-manifolds in high-dimensional data.
method Introduces per-pixel penalized log-likelihood and hierarchical training approaches.
result Validated superior performance in manifold learning and density estimation.
We improve density-based distances using normalizing flows and score matching.
problem Inaccurate density estimates and poor convergence in graph-based methods for high-dimensional spaces.
method Learn densities with normalizing flows and refine geodesics with a score model.
result Improved density-based distances that scale to high dimensions and improve numerical stability.
A new method inflates and deflates data manifolds to estimate densities without losing universality.
problem Density estimation on low-dimensional manifolds with non-Euclidean support.
method Inflation-deflation approach using Normalizing Flows with added noise.
result Exact estimation of densities on manifolds with sufficient conditions and Gaussian noise approximation.
Normalizing flows can now estimate densities on unknown manifolds.
problem Normalizing flows struggle with data on unknown low-dimensional manifolds.
method Conformal Embedding Flows, which combine standard flows with trainable conformal embeddings.
result Tractable density estimation on manifold-supported data is possible.
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.
Neural density estimators are flexible families of parametric models which have seen widespread use in unsupervised machine learning in recent years. Maximum-likelihood training typically dictates that these models be constrained to specify an explicit density. However, this limitation can be overcome by instead using …
ROME improves density estimation for multi-modal, non-normal data.
problem Robust multi-modal density estimation in non-normal, highly correlated distributions.
method ROME uses clustering to segment multi-modal data into uni-modal clusters, then combines KDE estimates for each cluster.
result ROME outperforms state-of-the-art methods and is more robust to various distributions.
NanoFlow reduces parameter complexity in normalizing flows.
problem Efficient parameter complexity in flow-based models.
method Single neural density estimator with flow indication embedding.
result Sublinear parameter complexity achieved.
GANs struggle with density estimation on simple datasets, while normalizing flows perform well.
problem Comparing GANs and normalizing flows for density estimation on non-image data.
method An extensive grid search over GAN architectures, hyperparameters, and training procedures; comparison on low-dimensional synthetic datasets.
result Normalizing flows outperform GANs in density estimation, especially in terms of Wasserstein distance.
Gradient Boosted Normalizing Flows improve flexibility of NFs without increasing complexity.
problem Improving flexibility of normalizing flows without increasing complexity.
method Gradient Boosting applied to normalizing flows to create a mixture model structure.
result GBNFs outperform non-boosted NFs and produce better results with simpler components.
Contrast uses normalizing flows to create precise prediction regions for multi-dimensional outputs.
problem Generating reliable prediction regions for multi-dimensional outputs in supervised and unsupervised learning.
method Contrast uses normalizing flows to define nonconformity scores based on distances in latent space, creating sharp prediction regions.
result Contrast maintains guaranteed coverage probability and outperforms existing methods in generating accurate prediction regions.
We consider the problem of density estimation on Riemannian manifolds. Density estimation on manifolds has many applications in fluid-mechanics, optics and plasma physics and it appears often when dealing with angular variables (such as used in protein folding, robot limbs, gene-expression) and in general directional s…
This paper uses normalizing flows to approximate transport maps between densities.
problem Approximating transport maps between given densities.
method Construct time-dependent controls using normalizing flows.
result Provides bounds on the number of switches for piecewise constant approximations.
We suggest an algorithm allowing to obtain some new integral-geometric formulae from the existing formulae of Crofton type. These new formulae are applied to get smooth versions of BKK theorem. The algorithm is based on the calculations in the ring of normal densities on a manifold.
A method for eliciting expert beliefs using preferential questions and normalizing flows.
problem Eliciting high-dimensional probability distributions from noisy judgments.
method Normalizing flows based on preferential questions with a novel functional prior.
result The method allows for the inference of arbitrarily flexible densities from preferential judgments.
Robustly infers manifold density and geometry under high-dimensional noise.
problem Inaccurate kernel density estimation under high-dimensional noise.
method Doubly stochastic normalization of Gaussian kernel.
result Robust tools for density estimation, noise magnitude estimation, and distance approximation.
Kernel smoothing on unknown manifolds with bounds and asymptotic normality.
problem Data on unknown manifolds without boundaries.
method Finite sample bounds and asymptotic normality for kernel smoothing and its derivatives.
result Established finite sample bounds and asymptotic normality for kernel smoothing.
The paper proposes a new method for probabilistic load forecasting using Bernstein-Polynomial Normalizing Flows.
problem High variability in short-term load forecasting at the low-voltage level due to fluctuating demand and increasing electrification.
method Flexible conditional density forecasting based on Bernstein polynomial normalizing flows with neural network control.
result Density predictions outperform traditional methods for 24h-ahead load forecasting.
Use of an autoencoder (AE) as a normal model is a state-of-the-art technique for unsupervised-anomaly detection in sounds (ADS). The AE is trained to minimize the sample mean of the anomaly score of normal sounds in a mini-batch. One problem with this approach is that the anomaly score of rare-normal sounds becomes hig…
Learning probabilistic models that can estimate the density of a given set of samples, and generate samples from that density, is one of the fundamental challenges in unsupervised machine learning. We introduce a new generative model based on denoising density estimators (DDEs), which are scalar functions parameterized…
We prove that the marginal densities of a global probability mass function in a primal normal factor graph and the corresponding marginal densities in the dual normal factor graph are related via local mappings. The mapping depends on the Fourier transform of the local factors of the models. Details of the mapping, inc…
GANF uses normalizing flows to detect anomalies in multiple time series.
problem Detecting anomalies in multiple time series with interdependencies.
method Bayesian network integration with normalizing flows for unsupervised anomaly detection.
result GANF effectively detects anomalies and identifies distribution drift in time series data.
SurVAE Flows combine VAEs and flows using surjective transformations.
problem Combining the strengths of VAEs and flows to model complex densities.
method Modular framework of composable deterministic and stochastic transformations.
result Exact likelihood computation and lower bound on likelihood.
Normal-bundle bootstrap generates new data preserving geometric structure.
problem Probabilistic models often exhibit salient geometric structure.
method NBB method decomposes probability measure into manifold and normal spaces, estimates manifold as density ridge, and generates new data by bootstrapping projection vectors.
result NBB generates new data that preserves the geometric structure of a given data set.
Improves normalizing flows by incorporating data dependencies.
problem Current normalizing flow learning assumes independent data, leading to errors.
method Proposes a likelihood objective with dependencies and efficient learning algorithm.
result Improves density estimation and data generation on real-world data.
Generalized score matching for densities on general domains.
problem Estimating density functions on complex, non-standard domains.
method A generalized score matching approach for densities on general domains.
result The method provides theoretical guarantees and empirical advantages.
Normalized compound random measures are flexible nonparametric priors for related distributions. We consider building general nonparametric regression models using normalized compound random measure mixture models. Posterior inference is made using a novel pseudo-marginal Metropolis-Hastings sampler for normalized comp…
In Divide & Recombine (D&R), big data are divided into subsets, each analytic method is applied to subsets, and the outputs are recombined. This enables deep analysis and practical computational performance. An innovate D\&R procedure is proposed to compute likelihood functions of data-model (DM) parameters for big dat…
PFs and iPFs learn principal manifolds for efficient density estimation.
problem Understanding the geometric structure of normalizing flows.
method Characterize flows using principal manifolds and contours.
result PFs and iPFs can learn principal manifolds and perform density estimation.
A new method detects anomalies in trajectory data using normalizing flows.
problem Detecting anomalous patterns in high-dimensional, varying-length spatial data.
method Probability density estimation via normalizing flows for each trajectory segment, aggregating likelihoods.
result The proposed method, GRADINGS, effectively identifies anomalies in real-world trajectory data.
We tackle unsupervised anomaly detection (UAD), a problem of detecting data that significantly differ from normal data. UAD is typically solved by using density estimation. Recently, deep neural network (DNN)-based density estimators, such as Normalizing Flows, have been attracting attention. However, one of their draw…
Study classifies mappings of bivariate normal densities, revealing three types with distinct geometric and statistical properties.
problem Understanding the properties of two-component bivariate normal mixtures.
method Classification via A-equivalence and statistical analysis. result Three distinct types of mappings with specific geometric and statistical properties, and upper bounds for the number of modes.
FNFs model parameter-dependent densities by combining a fixed flow with a polynomial parameter-dependent transformation.
problem Learning a separate flow for every parameter configuration is intractable.
method Factorizable Normalizing Flows (FNFs) represent the parameter-dependent density as a fixed flow for a reference configuration and a learnable polynomial transformation factorized over parameters.
result FNFs enable the recovery of the combined effect of multiple parameters without sampling their joint space, providing a scalable and interpretable solution.
AdaAnn optimizes annealing for efficient probability density approximation.
problem Efficiently approximating complex probability distributions with multiple modes.
method AdaAnn is an adaptive annealing scheduler that adjusts temperature increments based on KL divergence.
result AdaAnn improves computational efficiency in variational inference and parameter estimation.
We propose a supervised anomaly detection method based on neural density estimators, where the negative log likelihood is used for the anomaly score. Density estimators have been widely used for unsupervised anomaly detection. By the recent advance of deep learning, the density estimation performance has been greatly i…
Copula-based normalizing flows improve flexibility and stability for heavy-tailed data.
problem Limited expressive power of vanilla normalizing flows.
method Generalize base distribution to copula for more accurate representation of target distribution.
result Copula-based normalizing flows improve flexibility, stability, and effectiveness for heavy-tailed data.
Method estimates densities on manifolds using dequantization.
problem Estimating densities on non-Euclidean manifolds.
method Inspired by dequantization, coordinate transformation, and normalizing flows.
result Successfully models densities on spheres, tori, and orthogonal groups.
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.
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.
M-flows learn data manifolds and densities, improving manifold learning and inference.
problem Representing datasets with manifold structure more faithfully.
method Combining normalizing flows, GANs, autoencoders, and energy-based models, with a new training algorithm.
result M-flows learn data manifolds better than standard flows and provide handles for dimensionality reduction.
TTF improves performance of normalizing flows for heavy-tailed distributions.
problem Improving performance of normalizing flows for heavy-tailed distributions.
method Uses a Gaussian base distribution and a final transformation layer to produce heavy tails.
result Experimental results show TTF outperforms current methods, especially in high-dimensional or heavy-tailed scenarios.
Improves modeling of sets with permutation invariant densities.
problem Challenges in calculating trace limit practicality of current methods.
method Proposes an alternative approach to define permutation equivariant transformations with closed form trace.
result Improves both training and final performance.
The paper proposes a method to learn evolving multivariate distributions from sample paths.
problem Learning the temporal evolution of multivariate densities from sample data.
method Normalizing flows to construct time-dependent mappings.
result The method can approximate evolving probability density functions from observed data.
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…
A new training method for normalizing flows without samples.
problem Training normalizing flows without samples but with energy functions.
method Interpolates energy functions to find a transport vector field.
result Optimizes transport vector field and energy function to satisfy continuity equation.