Generative Adversarial Networks generate realistic network traffic data.
problem Generating realistic flow-based network traffic for evaluation of NIDS.
method Generative Adversarial Networks (GANs) with preprocessing for categorical attributes.
result Two of three preprocessing methods generate high quality flow-based network traffic.
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.
New invertible transformations improve flow-based generative models.
problem Improving flow-based generative models for better performance.
method Proposed new invertible transformations and coupling layers.
result New coupling layers achieve better results in IDF.
Residual Flows improve flow-based models for density estimation.
problem Density estimation using flow-based models with biased log-density estimates.
method Proposed a Russian roulette estimator for unbiased log-density estimation and used an alternative infinite series for gradient calculation. Improved invertible residual blocks with activation functions avoiding derivative saturation and generalized Lipschitz condition to induced mixed norms.
result Residual Flows achieve state-of-the-art performance on density estimation and outperform coupling block networks in joint generative and discriminative modeling.
Two neural network-based mixture models with E-M learning for efficient likelihood computation.
problem Efficiently computing likelihood in mixture models with complex structures.
method Explicit mixture models with flow-based neural networks, E-M algorithm for parameter learning.
result Demonstrated efficiency in generating samples and maximum likelihood classification.
WaveGlow generates high-quality speech from spectrograms.
problem Speech synthesis quality and efficiency.
method WaveGlow combines Glow and WaveNet insights, using a single network and cost function for efficient, high-quality audio synthesis.
result WaveGlow produces audio samples at over 500 kHz, matching WaveNet quality.
Flow-based models use ODEs to generate complex data distributions.
problem Generating high-dimensional data with complex probability distributions.
method Flow-based models use invertible mappings governed by ODEs to capture these distributions.
result Flow-based models provide exact likelihood estimation and efficient sampling.
Improves sequence modeling with a flow-based recurrent mixture density network.
problem Sequence modeling and sequence-to-sequence mapping applications.
method Generalized recurrent mixture density networks using normalized flow transformations.
result Significantly improved fit to image sequences measured by log-likelihood.
Flow-based models detect anomalies in industrial time series data.
problem Novelty detection in industrial time series data.
method Normalizing flows, specifically Masked Autoregressive Flows and Free-form Jacobian of Reversible Dynamics.
result Flow-based models outperform traditional methods in novelty detection of industrial time series data.
VFG model embeds flow-based models with hierarchical structures using variational inference.
problem Flow-based models struggle with high-dimensional latent spaces and lack of tractable inference for graphical structures.
method Integrates flow-based functions through variational inference with aggregation nodes for hierarchical information integration.
result VFG models achieve improved ELBO and likelihood values on multiple datasets.
Flow-based models generate data with improved theoretical guarantees.
problem Theoretical analysis of flow-based generative models.
method Proximal gradient descent in Wasserstein space for JKO flow model.
result KL guarantee of data generation by JKO flow model is O(ε2). IDF uses integer flows for lossless compression of discrete data.
problem Lossless compression of discrete data with minimal reconstruction errors.
method Integer Discrete Flows (IDF) using integer maps and integer discrete coupling layers.
result IDFs achieve state-of-the-art lossless compression rates on various datasets.
Sum-of-Squares flow improves autoregressive and flow-based density estimation.
problem Density estimation in high dimensions with limitations of existing methods.
method Proposes a Sum-of-Squares (SOS) flow framework based on triangular maps.
result SOS flow achieves competitive results in simulations and real-world datasets.
This paper explores adversarial robustness of flow-based generative models.
problem Robustness of flow-based generative models to adversarial attacks.
method Theoretical and empirical analysis of adversarial robustness for simple and complex flow-based models.
result Flow-based generative models are highly sensitive to adversarial attacks, but robustness can be significantly improved using hybrid adversarial training.
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.
ConfFlow uses transformer networks to generate molecular conformations efficiently.
problem Efficient generation of valid conformations for large molecules.
method Flow-based model using transformer networks that directly samples in coordinate space.
result ConfFlow improves accuracy by up to 40% for large molecule conformations.
A new framework solves complex optimization problems with continuous worst-case distributions.
problem Optimizing under uncertain distributions with continuous worst-case scenarios.
method Flow-based distributionally robust optimization (DRO) with Wasserstein uncertainty sets and invertible transport maps.
result The framework finds continuous worst-case distributions and samples efficiently.
IZF uses flow-based models to overcome ZSL limitations.
problem Hardness of training ZSL models and limited generation quality.
method IZF incorporates flow-based models to learn factorized data embeddings and generates samples.
result IZF significantly outperforms existing methods on ZSL benchmarks.
CoSMIC extends flow-based SVI to transdimensional problems.
problem Bayesian structure learning and model selection with multi-model parameter spaces.
method Normalizing flows with a combined stochastic variational transdimensional inference approach.
result Improved performance on high-cardinality model spaces.
Paper proposes a method to improve MCMC sampling for energy-based models.
problem MCMC sampling of energy-based models is often not mixing in high-dimensional data.
method Proposes using a flow-based model as a backbone to correct the energy-based model, enabling mixing in latent space.
result MCMC sampling of the corrected EBM in the latent space mixes well and traverses modes in the data space.
Improved flow-based inference speeds up and boosts accuracy for complex simulations.
problem Challenging inverse problems in astronomy, such as modeling strong gravitational lens systems.
method Refines flow-based generative models with simulator feedback for posterior inference.
result Improves accuracy by 53% and speeds up inference by up to 67x.
DFMs enable flow-based models for multimodal discrete and continuous data.
problem Combining discrete and continuous data for generative models.
method Discrete Flow Models (DFMs) using Continuous Time Markov Chains.
result DFMs achieve state-of-the-art co-design performance for protein structure and sequence generation.
FCI method uses flow-based techniques to improve prediction confidence.
problem Limited applicability of exchangeable assumptions in predicting contaminated data.
method Adversarial flow to transform data into known distributions, then map to low-dimensional space.
result FCI produces effective predictive sets and accurate outlier detection.
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.
Improved NPE with conditional diffusions and summary networks.
problem Approximating complex posterior distributions efficiently and accurately.
method Conditional diffusions coupled with high-capacity summary networks.
result Conditional diffusions offer improved stability, accuracy, and faster training times.
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.
RG-Flow combines RG and sparse priors for hierarchical image disentanglement.
problem Disentangling and manipulating image representations at different scales.
method Hierarchical flow model using RG and sparse prior distributions.
result RG-Flow enables semantic manipulation and style mixing at different image scales.
New proof shows incremental flow models are essential for universal generation.
problem Understanding the universality of flow-based models in generating natural maps.
method Topological-dynamical argument and algebraic properties of flows.
result Incremental generation is necessary and sufficient for universal flow-based generation.
This study compares two methods for sampling with transport maps, finding flow-based proposals work better for multimodal distributions.
problem Sampling from distributions with complex geometries.
method Compares two approaches: (i) proposal draws from the flow and (ii) reparametrization.
result Flow-based proposals are more effective for multimodal distributions in high dimensions, while reparametrization methods are more robust in other scenarios.
A new flow-based model for molecular graphs achieves better performance with fewer parameters.
problem Generating molecular graphs efficiently and accurately.
method Graph residual flow (GRF) based on residual flows for molecular graphs, with invertibility conditions derived.
result The GRF model achieves comparable performance to existing models with significantly fewer parameters.
TzK model learns tight conditional priors using side information.
problem Learning tight conditional priors using side information.
method TzK is a conditional probability flow-based model that exploits attributes to learn tight conditional priors around target observations. It trains via approximated ML and supports supervised, unsupervised, and semi-supervised learning.
result TzK produces efficient and stable approximations of arbitrary data distributions, comparable to state-of-the-art models.
Study improves flow-based model training from few samples.
problem Training flow-based models from limited data.
method Sharp analysis of two-layer autoencoder with finite sample complexity.
result Generative flow approximates target density with rate Θ_n(1/n).
In this paper, we integrate VAEs and flow-based generative models successfully and get f-VAEs. Compared with VAEs, f-VAEs generate more vivid images, solved the blurred-image problem of VAEs. Compared with flow-based models such as Glow, f-VAE is more lightweight and converges faster, achieving the same performance und…
New method uses KL divergence to detect out-of-distribution data effectively.
problem Flow-based models assign higher likelihoods to OOD data than ID data, making OOD detection challenging.
method Proposes a method leveraging KL divergence and local pixel dependence of representations for anomaly detection.
result Demonstrates effectiveness and robustness on prevalent benchmarks.
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.
Study evaluates Tree-Ring Watermarking in rectified flow-based models, revealing detection and separability limitations.
problem Detecting and separating Tree-Ring Watermarks in rectified flow-based models.
method Extensive experimentation comparing SD 2.1 and FLUX.1-dev models with various text guidance configurations and augmentation attacks.
result Inversion limitations affect watermark recovery and statistical separation.
Survey of flow-based algorithms for improving clusters.
problem Improving clusters obtained by other methods.
method Flow-based algorithms solving maximum flow problems.
result Efficient implementations and extensive numerical experiments.
A time schedule simplifies learning in flow-based models for high-dimensional data.
problem Disappearance of relative probability phase in high-dimensional Gaussian mixture sampling.
method Introduces a time dilation schedule to characterize phases of learning.
result Autoencoder learns to simplify by focusing on relevant parameters for each phase.
Paper harmonizes medical data using flow-based causal inference.
problem Heterogeneity in medical data from different sites and protocols.
method Flow-based normalizing method for counterfactual inference on structural causal models.
result Better cross-domain generalization compared to state-of-the-art algorithms.
MFM integrates multiple evolving populations using Wasserstein manifold flows.
problem Learning dynamics of multiple interacting populations evolving over time.
method Meta Flow Matching (MFM) integrates vector fields on Wasserstein manifold using amortized flow models and GNN embeddings.
result MFM improves prediction of individual treatment responses on multi-patient single-cell drug screen data.
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.
New method trains energy-based models faster and more stably.
problem Training efficiency and stability of energy-based models.
method EBFlow with score-matching objectives.
result EBFlow achieves significant speedup and better performance.
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 solves complex equation on specific types of manifolds.
problem Solving complex Monge-Ampère equation on Kähler manifolds.
method Flow-based arguments to establish existence of smooth solutions.
result Existence of smooth solutions under decreasing right-hand side.
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.
Proposes a new method for high-dimensional density estimation.
problem Estimating high-dimensional probability density functions efficiently.
method Tensorizing flow method combining tensor-train and flow-based generative modeling.
result Efficiently constructs an approximate density in tensor-train form and trains a flow model to match empirical distribution.
ContextFlow++ improves generative models by conditioning on mixed-variable contexts.
problem Lack of effective methods for context conditioning in flow-based generative models.
method Proposes ContextFlow++ with additive conditioning and mixed-variable architecture.
result ContextFlow++ achieves higher performance metrics and faster training.
Study finds unique self-expanders for mean curvature flow.
problem Finding solutions to mean curvature flow.
method Derived equation based on generalized Lawson-Osserman cone and modified equilibria theory.
result Existence and uniqueness of self-expanders proved.