Reinterprets DNF as a deep generative LDA model for complex data.
problem Limited applicability of LDA in complex data scenarios.
method Proposes a discriminative normalization flow (DNF) model and interprets it as a deep generative LDA.
result DNF and its subspace version outperform conventional LDA in modeling complex data.
E-NFs generate molecules and their positions while preserving Euclidean symmetries.
problem Generating molecules with their positions while preserving Euclidean symmetries.
method Integrating E(n) graph neural networks into a differential equation to create an invertible equivariant function.
result E-NFs significantly outperform baselines and existing methods in log-likelihood for particle systems and molecules.
The Information Bottleneck (IB) objective uses information theory to formulate a task-performance versus robustness trade-off. It has been successfully applied in the standard discriminative classification setting. We pose the question whether the IB can also be used to train generative likelihood models such as normal…
Improves deep generative model samples via gradient flow.
problem Inconsistent generation quality across samples.
method Discriminator Gradient Flow (DGflow) using entropy-regularized f-divergences.
result Significant improvement in generated sample quality.
Hybrid model avoids forgetting across tasks and classes.
problem Challenges of continual learning in modern deep learning.
method Hybrid generative-discriminative approach using normalizing flows.
result Strong performance on various continual learning benchmarks.
We prove that the twisted Kahler-Einstein metrics that arise on the base of certain holomorphic fiber space with Calabi-Yau fibers have conical-type singularities along the discriminant locus. These fiber spaces arise naturally when studying the collapsing of Ricci-flat Kahler metrics on Calabi-Yau manifolds, and of th…
Study collapsing Calabi-Yau metrics and flows on fiber spaces.
problem Understanding the behavior of Calabi-Yau metrics and flows during collapsing.
method Analyzing the collapsing of Calabi-Yau metrics and Kähler-Ricci flows on fiber spaces.
result Identify the collapsed Gromov-Hausdorff limit and bounds for Hausdorff measure.
MixerFlow combines MLP-Mixer with normalizing flows for efficient image modeling.
problem Efficiently modeling complex image densities using generative models.
method Proposes MixerFlow, a novel architecture based on MLP-Mixer for normalizing flows.
result Demonstrates improved density estimation and better scaling with higher image resolutions.
The paper proposes deep normalization to improve speaker recognition performance.
problem Non-Gaussian and non-homogeneous distributions of deep speaker vectors negatively impact speaker recognition.
method Proposes a deep normalization approach based on a novel discriminative normalization flow (DNF) model.
result DNF-based normalization delivers substantial performance gains and strong generalization capability.
Distance, normals, and double normals for real plane curves with singularities
problem Relation between normals and double normals and critical points of the squared distance function for real algebraic curves with singularities
method Investigate the topological discriminant of the distance function
result The topological discriminant consists of the evolute and distinguished normal lines at algebraic singular points
GC-Flow uses graph flows for better clustering than traditional GCNs.
problem Traditional GCNs miss useful clustering information.
method Designing normalizing flows to replace GCN layers, creating a generative model.
result GC-Flow produces well-separated clusters while maintaining predictive power.
Robust GQDA improves classification accuracy in non-Normal data.
problem Non-robustness of GQDA under data contamination.
method Introduced robust estimators for mean vector and dispersion matrix.
result Robust GQDA classifiers perform significantly better in real data applications.
Develops methods for integrating multivariate normals and computing classification measures.
problem Computing performance of multivariate normal models is challenging due to lack of general analytical expressions.
method Mathematical results and open-source software for integrating and analyzing multivariate normal distributions.
result Provides tools for calculating classification errors, discriminability, and reliability.
This paper analyzes implicit bias in Deep Linear Discriminant Analysis.
problem The implicit bias of Deep Linear Discriminant Analysis.
method Analyzing gradient flow on a L-layer diagonal linear network.
result Under balanced initialization, the network transforms additive updates into multiplicative updates, conserving the (2/L) quasi-norm.
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.
New method trains normalizing flows using entropy-regularized transport.
problem Training continuous normalizing flows efficiently.
method Formulates flows as gradients of scalar potentials, training only these potentials.
result Trains normalizing flows without explicit flow computation during training.
Variational inference relies on flexible approximate posterior distributions. Normalizing flows provide a general recipe to construct flexible variational posteriors. We introduce Sylvester normalizing flows, which can be seen as a generalization of planar flows. Sylvester normalizing flows remove the well-known single…
MAGIC-Flow generates and classifies medical images with interpretability.
problem Challenges in generative modeling for medical imaging.
method Conditional multiscale normalizing flow architecture.
result MAGIC-Flow creates realistic, diverse samples and improves classification.
We consider a pseudo-Riemannian metric that changes signature along a smooth curve on a surface, called the discriminant curve. The discriminant curve separates the surface locally into a Riemannian and a Lorentzian domain. We study the local behaviour and properties of geodesics at a point on the discriminant where th…
PL-MCMC samples from normalizing flows' conditional distributions.
problem Sampling from complex conditional distributions learned by normalizing flows.
method Metropolis-Hastings implementation of PL-MCMC.
result PL-MCMC asymptotically samples from exact conditional distributions.
Fractal Flow enhances normalizing flows with interpretable latent space and hierarchical modeling.
problem High-dimensional density estimation and generative modeling challenges.
method Integrates topic modeling (LDA) and fractal strategy into normalizing flows.
result Achieves latent clustering, controllable generation, and superior estimation accuracy.
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.
Study shows limits of certain normalizing flows in higher dimensions.
problem Understanding the representation power of normalizing flows in different dimensions.
method Rigorously established bounds on expressive power of basic normalizing flows.
result Limited representation power in higher dimensions, especially with moderate depth.
The paper connects complex normalizing flows to Kähler-Ricci flows using geometric and statistical perspectives.
problem Understanding the relationship between complex normalizing flows and Kähler-Ricci flows.
method Develops connections between complex normalizing flows and Kähler-Ricci flows by relating the log determinant to Ricci curvature and using a Bayesian perspective.
result Reconciles the complex normalizing flow and Kähler-Ricci flow, showing they are related under certain conditions.
Riemannian flows model curved spaces better.
problem Normalizing flows misspecified on curved spaces.
method Riemannian continuous normalizing flows using ODE solutions.
result Improves modeling on spheres, torii, and hyperbolic spaces.
New framework explains normalizing flows' power and limitations.
problem Understanding the expressive power and limitations of normalizing flows.
method Theoretical framework for well-conditioned coupling-based normalizing flows and volume-preserving flows.
result RealNVP is distributionally universal, but volume-preserving flows are not.
A new method learns latent space normalizing flow for approximate inference in generator models.
problem Approximate inference in generator models with complex posterior distributions.
method Jointly learns latent space normalizing flow and generator model using MCMC-based maximum likelihood.
result The short-run Langevin flow approximates the posterior and aligns with the normalizing flow prior.
TCNF models SDEs using time deformation of Brownian motion.
problem Modeling SDEs with existing methods.
method Time-changed normalizing flows (TCNF) based on time deformation of Brownian motion.
result Improved modeling of SDEs, including Ornstein-Uhlenbeck process.
Paper introduces Categorical Normalizing Flows for better handling of categorical data.
problem Limited application of normalizing flows on categorical data due to lack of intrinsic order.
method Categorical Normalizing Flows use continuous transformations to model latent relations in categorical data, optimizing both continuous representation and model likelihood.
result GraphCNF, a permutation-invariant generative model, outperforms state-of-the-art on molecule generation.
This study evaluates different normalizing flow architectures for MCMC.
problem Lack of systematic comparison of normalizing flow architectures in MCMC.
method Extensive evaluation of various normalizing flow architectures on different MCMC methods and target distributions.
result Contractive residual flows are the best general-purpose models for MCMC.
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. Guillarmou extends X-ray transform to magnetic and thermostat flows.
problem Stability of magnetic X-ray transforms.
method Generalizes normal operator to thermostat and magnetic flows, proving ellipticity.
result Elliptic pseudodifferential operators of order -1 for generalized normal operators.
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.
New normalizing flows in hyperbolic space improve posterior modeling for hierarchical data.
problem Limited flexibility of existing normalizing flows in Euclidean space for hierarchical data.
method Elevated normalizing flows to hyperbolic spaces using coupling transforms and Wrapped Hyperboloid Coupling.
result Improved performance on density estimation and hierarchical graph data.
Normalizing flows are shown to be equivalent to Bayesian networks, revealing new insights.
problem Understanding the limitations and capabilities of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models and analyzing their structure.
result Normalizing flows can be reduced to Bayesian networks, revealing new insights into their structure and capabilities.
Self Normalizing Flows improve normalizing flows by reducing computational complexity.
problem Efficient gradient computation in normalizing flows, especially in Jacobian determinant terms.
method Introducing Self Normalizing Flows that replace expensive terms with learned approximate inverses.
result Models can be trained more quickly and perform better than functionally constrained counterparts.
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.
The study examines the limitations of bi-Lipschitz Normalizing Flows in approximating certain distributions.
problem The expressivity of bi-Lipschitz Normalizing Flows in approximating specific target distributions.
method Characterization of expressivity through lower bounds on Total Variation distance and discussion of potential remedies.
result Several target distributions are difficult to approximate using bi-Lipschitz Normalizing Flows, and lower bounds on their approximation are provided.
ImpFlows generalize normalizing flows by implicitly defining transformations.
problem Creating flexible and tractable probability distributions.
method Implicitly defined invertible transformations using roots of equations.
result ImpFlows can represent functions that ResFlows cannot, with comparable parameters.
Adversarial learning methods have been proposed for a wide range of applications, but the training of adversarial models can be notoriously unstable. Effectively balancing the performance of the generator and discriminator is critical, since a discriminator that achieves very high accuracy will produce relatively uninf…
New proof shows coupling-based flows converge linearly to diagonalize data covariance.
problem Understanding convergence of coupling-based normalizing flows to arbitrary data distributions.
method Proved linear convergence rate for whitening of data distribution.
result Coupling-based flows achieve linear convergence to diagonalize data covariance.
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.
Normalizing flows fail to detect OOD data due to learning local pixel correlations.
problem Detecting out-of-distribution data in machine learning systems.
method Investigated why normalizing flows fail to distinguish between in- and out-of-distribution data, and modified flow architecture to improve OOD detection.
result Modifying flow architecture can improve OOD detection by biasing the flow towards learning semantic structure of the target data.
A new framework enhances generative modeling by learning local flows over complex manifolds.
problem Limited expressivity of current normalizing flows for low-dimensional manifolds.
method Vector quantized local normalizing flows (VQ-Flows) using a VQ-AE atlas and conditional flows.
result Enhanced modeling of complex data distributions over manifolds.
The standard state-of-the-art backend for text-independent speaker recognizers that use i-vectors or x-vectors, is Gaussian PLDA (G-PLDA), assisted by a Gaussianization step involving length normalization. G-PLDA can be trained with both generative or discriminative methods. It has long been known that heavy-tailed PLD…
A new clustering method estimates non-linear boundaries and automatically selects the number of clusters.
problem Discriminative clustering with non-linear boundaries and data abnormalities.
method Regularized mutual information objective function with a mixture of Gaussian and uniform distributions.
result Automatic selection of the number of components and estimation of non-linear boundaries.
New variational flows improve Monte Carlo and normalization tasks.
problem Intractable global optimum in expressive variational families.
method Constructing asymptotically exact variational flows from involutive MCMC kernels.
result Provable total variation convergence of new variational families.
Residual flows are shown to approximate MMD well.
problem Lack of theoretical understanding of normalizing flows' expressiveness.
method Proved residual flows are universal approximators in MMD.
result Residual flows can approximate MMD with a bounded number of blocks.