The paper proposes a method to estimate synthesis flow quality across different technologies and designs.
problem Challenges in developing high-quality synthesis flows for ICs and SoCs.
method Training a Long Short-Term Memory (LSTM) based RNN regressor to predict Quality-of-Result (QoR) for unseen synthesis flows.
result The approach achieves over 98% accuracy in predicting QoRs within one technology and over 96.3% accuracy across different technologies and designs.
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.
Paper introduces new motion synthesis model using normalizing flows.
problem Data-driven motion synthesis with probabilistic and controllable models.
method Probabilistic, generative, autoregressive model using normalizing flows and LSTMs.
result Randomly sampled motion from the model outperforms task-agnostic baselines.
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…
Improved generative models using flexible convolutions.
problem Generating high-quality images efficiently.
method Generalized 1 x 1 convolutions to d x d convolutions, chaining autoregressive and periodic convolutions.
result Flexible d x d convolutions significantly improve generative flow models' performance.
Flow matching improves synthetic data generation for tabular data.
problem Generating synthetic tabular data while preserving privacy.
method Flow matching (FM) and Variational FM for tabular data synthesis.
result FM outperforms diffusion baselines in tabular data synthesis.
Recent work has shown that Field-Programmable Gate Arrays (FPGAs) play an important role in the acceleration of Machine Learning applications. Initial specification of machine learning applications are often done using a high-level Python-oriented framework such as Tensorflow, followed by a manual translation to either…
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.
The study examines optimal synthesis in a radially symmetric Grushin space with conditions on the weight function.
problem Optimal synthesis in a radially symmetric Grushin space with a weight function.
method Analysis of the geometry of R3 with a weighted Carnot-Carathéodory metric, providing conditions for Grushin-like structure, and describing optimal synthesis. result Sufficient conditions on the weight function ensure a Grushin-like structure, and the candidate cut time coincides with the true cut time in the integrable case.
New methodology controls synthetic data bias for neural program synthesis.
problem Deep networks generalize poorly to certain data distributions when trained on synthetic examples.
method Proposes a new methodology to control and evaluate the bias of synthetic data distributions over programs and specifications.
result Training deep networks on controlled synthetic data distributions leads to improved cross-distribution generalization performance.
Paper trains two models to improve synthesis quality and unsupervised learning.
problem Improving synthesis quality and unsupervised learning.
method Joint training of an energy-based model and a flow-based model using adversarial value function.
result Significant improvement in synthesis quality of the flow model.
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.
InVAErt networks use data-driven methods for system synthesis and identifiability analysis.
problem Model synthesis and identifiability analysis for complex systems.
method Deterministic encoder and decoder, normalizing flow, variational encoder, loss function penalty coefficients, latent space sampling.
result Validation through various system types, demonstrating effectiveness of the framework.
Enhanced text-to-speech synthesizes expressive speech from a single example.
problem Creating a new expressive speech style from a single example of speech.
method Combines VAE and Normalizing Flows to improve disentanglement and naturalness.
result Reduces KL-divergence by 22% and improves perceptual metrics.
Auto-decoder synthesizes graphs from latent codes.
problem Creating new graph structures from specified distributions.
method Generative model learns latent codes from empirical distribution. Self-attention identifies likely connectivity patterns. Graph-based normalizing flows sample latent codes.
result Model outperforms state of the art by 1.5x in accuracy and 2x in speed.
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…
ReDi improves few-step generation for discrete data models.
problem Slow sampling speeds in discrete flow-based models.
method Rectified Discrete Flow (ReDi) reduces factorization error by rectifying coupling.
result Empirically, ReDi reduces Conditional Total Correlation and enables few-step generation.
CAFLOW uses auto-regressive flows to translate images efficiently.
problem Image-to-image translation tasks.
method Transforms conditioning image into latent encodings using normalizing flows, models conditional distribution with auto-regressive distributions.
result Outperforms former conditional flow designs.
Programming has been an important skill for researchers and practitioners in computer science and other related areas. To learn basic programing skills, a long-time systematic training is usually required for beginners. According to a recent market report, the computer software market is expected to continue expanding …
Normalizing flows and autoregressive models have been successfully combined to produce state-of-the-art results in density estimation, via Masked Autoregressive Flows (MAF), and to accelerate state-of-the-art WaveNet-based speech synthesis to 20x faster than real-time, via Inverse Autoregressive Flows (IAF). We unify a…
Synthetic tabular data synthesis models balance utility and risk.
problem Generating synthetic tabular data for regulated domains.
method Latent flow models with various learning targets, paths, and sampling methods.
result Velocity and posterior matching objectives yield higher utility, while score and noise matching achieve lower risk.
Improved image generation through iterative flow matching to reduce hallucinations.
problem Hallucinations in image generation models.
method Iterative flow matching to refine and correct paths in generative models.
result Enhanced generative modeling with reduced unrealistic images.
Generative model learns functional vector fields for pharmacokinetics.
problem Generating accurate virtual cohorts and forecasting patient trajectories without manual tuning.
method Prior-Fitted Functional Flows model, learning functional vector fields conditioned on sparse, irregular data.
result State-of-the-art predictive accuracy on real-world datasets.
Novel flows generate molecules without post-processing.
problem Generating new molecules efficiently and without post-processing issues.
method Continuous normalizing E(3)-equivariant flows based on node ODEs coupled as a graph PDE.
result Generated samples achieve state-of-the-art performance on QM9 and ZINC250K benchmarks.
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.
Paper proposes efficient image inversion and editing using rectified stochastic differential equations.
problem Inversion and editing of real images using generative models.
method Proposes RF inversion using dynamic optimal control and a linear quadratic regulator, extending to stochastic sampler for Flux.
result Allows state-of-the-art performance in zero-shot inversion and editing, outperforming prior works.
Guided Flows enhance sample quality in conditional image generation and text-to-speech.
problem Improving sample quality in conditional generative models.
method Integrating classifier-free guidance into Flow Matching (FM) models for Continuous Normalizing Flows (CNFs).
result Guided Flows significantly improve sample quality in conditional image generation and text-to-speech synthesis.
Paper presents a GAN model for realistic river image synthesis.
problem Generating high-quality river images for hydrological research.
method Used a Progressive Growing GAN (PGGAN) architecture to overcome training challenges.
result Demonstrated the effectiveness of GANs in generating high-resolution river images.
MSG-GAN stabilizes GANs by passing gradients at multiple scales.
problem Stability and adaptability of GANs to different datasets.
method Introducing MSG-GAN with multi-scale gradient flow.
result MSG-GAN converges stably on various image datasets and loss functions.
Privacy-preserving synthetic data from EHRs for learning and inference.
problem Sharing sensitive EHR data while maintaining patient privacy.
method Differentially private normalizing flows for density estimation and variational inference.
result Privacy-preserving synthetic data can yield good utility at a reasonable privacy cost.
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.
New method generates geolocated synthetic populations from real data.
problem Generating synthetic populations with explicit geographic coordinates.
method Mapping coordinates into a latent space using Normalizing Flows (NF), then combining with other features in a Variational Autoencoder (VAE).
result NF+VAE architecture outperforms existing methods in generating geolocated synthetic populations.
Tree-based synthesis improves forecast accuracy in GDP and inflation.
problem Improving forecast accuracy in GDP and inflation.
method Developed a nonparametric synthesis function using regression trees.
result Tree-based synthesis leads to improved forecast accuracy.
Speech synthesis from EEG features using RNN.
problem Speech synthesis from EEG data.
method Recurrent Neural Network (RNN) regression model to predict acoustic features from EEG features.
result Feasibility of synthesizing speech directly from EEG features demonstrated.
SeqRF straightens generative model flows to speed up sampling.
problem High global truncation error in ODE-based solvers for generative models.
method SeqRF, a learning technique that straightens the probability flow.
result Significantly improved sampling speed and synthesis quality.
Neural model synthesizes music with flexible timbre controls.
problem Creating audio samples with varied timbres from musical scores.
method Recurrent neural network conditioned on learned instrument embedding followed by WaveNet vocoder.
result Learned embedding space captures diverse timbres and enables interpolation for morphing.
SED integrates synthesis, execution, and debugging for neural program synthesis.
problem Challenges in synthesizing complex programs that match specifications.
method SED combines synthesis, execution, and debugging to improve neural program generation.
result SED reduces error rates and outperforms standard decoding methods.
Paper proves CFlows can approximate any diffeomorphism and applies it in Bayesian optimization.
problem Proving the universality of CFlows in approximating diffeomorphisms.
method Deriving the universality of Para-CFlows through affine coupling layers and invertible linear transforms.
result Para-CFlows can approximate any diffeomorphism in C^k-norm.
System uses machine learning and automated reasoning to speed up PBE synthesis.
problem Slow synthesis in PBE due to domain-specific knowledge and large training datasets.
method Preprocess SyGuS PBE problems with a neural network to reduce search space, then use automated reasoning for faster solution.
result System outperforms all competing tools in the 2019 SyGuS Competition for the PBE Strings track by 47.65%.
Predicts routing congestion in FPGA designs using machine learning.
problem Routing congestion estimation is absent or inaccurate in HLS design methods.
method Machine learning to predict routing congestion in HLS.
result Accurately estimates routing congestion with errors of 6.71% and 10.05%.
WaveCycleGAN2 improves speech synthesis quality by reducing aliasing.
problem Human ear can still distinguish synthesized speech from natural speech.
method WaveCycleGAN2 uses generators without down/up-sampling modules and combines discriminators from waveform and acoustic parameter domains.
result WaveCycleGAN2 achieves high-quality speech synthesis with comparable mean opinion scores to natural speech.
Automated synthesis planning from scientific literature using AI.
problem Accelerate materials design and discovery by connecting scientific literature to synthesis insights.
method Word embeddings from language models, named entity recognition, conditional variational autoencoder.
result The model predicts precursors for perovskite materials using historical data.
The discovery of processes for the synthesis of new materials involves many decisions about process design, operation, and material properties. Experimentation is crucial but as complexity increases, exploration of variables can become impractical using traditional combinatorial approaches. We describe an iterative met…
Deep reinforcement learning optimizes retrosynthetic planning for chemical synthesis.
problem Optimizing chemical synthesis plans from molecular targets to simpler starting materials.
method Deep reinforcement learning to estimate synthesis costs and values of molecules.
result Trained neural networks outperform heuristic approaches in synthesizing unfamiliar molecules.
Improved visual speech synthesis using adapted ASR acoustic models.
problem Lack of synchronized audio, video, and depth data for speaker-independent speech-driven visual speech synthesis.
method Adapted an ASR acoustic model trained on audio-only data to the visual speech synthesis domain.
result Viewers significantly prefer animations generated from the adapted ASR acoustic model.
Generative model improves audio synthesis from TF features.
problem Challenges in generating high-quality audio from TF features.
method Used a GAN to generate invertible TF features from short-time Fourier transforms.
result Generated TF features from GAN outperformed direct waveform generation.
Flow matching adapts to manifold structures without diffusion.
problem Theoretical understanding of flow matching in manifold-supported settings.
method Flow matching with linear interpolation on smooth manifolds, analyzing velocity field and density estimator.
result Non-asymptotic convergence guarantee and statistical consistency of flow matching on manifolds.
A neural program synthesis method with iterative fix operations.
problem Creating correct programs from input-output examples.
method Combines encoder-decoder synthesis with a differentiable fixer.
result Improves synthesis accuracy by reducing discrepancies between outputs and desired outputs.