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,742 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for conditional generative network

Proposes a new GAN architecture for generating data conditioned on partial information.

problem Generating data conditioned on partial ancillary information.
method Introduces a new Adversarial Network architecture and training strategy.
result The proposed method outperforms standard Conditional GANs in generating data under partial conditioning.

CAN learns conditional and interventional distributions from unlabeled data.

problem Learning conditional and interventional distributions from unlabeled data.
method CAN framework with LGN and CIGN architectures, equipped with an intervention mechanism.
result CAN generates both interventional and conditional samples without needing the causal graph.

Generative model for inferring graph from time series data.

problem Generating graphs conditioned on multivariate time series data.
method Time Series Conditioned Graph Generation-Generative Adversarial Networks (TSGG-GAN).
result Demonstrates effectiveness and generalizability of TSGG-GAN on synthetic and real-world datasets.

Generative neural network designs novel 3D molecules with specified properties.

problem Designing molecules with desired properties in chemistry.
method Conditional generative neural network for 3D molecular structures.
result Demonstrated utility in generating novel molecules with specified motifs or composition.

We compress large neural networks for quick adaptation to specific contexts.

problem How to quickly adapt a pretrained large neural network to specific contexts.
method Propose a Bayesian hypernetwork framework to compress the network and encourage sparsity.
result Generated compressed networks are significantly smaller than baseline methods.

We present a novel tractable generative model that extends Sum-Product Networks (SPNs) and significantly boosts their power. We call it Sum-Product-Quotient Networks (SPQNs), whose core concept is to incorporate conditional distributions into the model by direct computation using quotient nodes, e.g. $P(A|B) = \frac{P(…

2017-10-12abs ↗pdf ↗

Study shows depth improves trainability of neural networks by improving kernel conditioning.

problem Improving trainability of neural networks with random initialization and overparameterization.
method Analyzes the role of depth in training neural networks, proving that depth improves conditioning of kernel matrices.
result General result showing depth improves trainability of neural networks by improving the conditioning of kernel matrices.

New insights into how linear classifiers and leaky ReLU networks can overfit without harming generalization.

problem Understanding conditions for benign overfitting in linear classifiers and leaky ReLU networks.
method Utilizing Karush--Kuhn--Tucker (KKT) conditions for margin maximization.
result Satisfaction of KKT conditions leads to benign overfitting in linear classifiers and leaky ReLU networks.

The GANs are generative models whose random samples realistically reflect natural images. It also can generate samples with specific attributes by concatenating a condition vector into the input, yet research on this field is not well studied. We propose novel methods of conditioning generative adversarial networks (GA…

2016-11-04abs ↗pdf ↗

Generative adversarial networks sample unknown high-dimensional conditional distributions.

problem Sampling from unknown high-dimensional conditional distributions with limited data.
method Generative adversarial networks (GAN) for both sampling and distribution inference.
result GAN effectively samples target conditional distribution with minimal impact on sample quality.

Despite recent advances, the remaining bottlenecks in deep generative models are necessity of extensive training and difficulties with generalization from small number of training examples. We develop a new generative model called Generative Matching Network which is inspired by the recently proposed matching networks …

2016-12-07abs ↗pdf ↗

The study characterizes conditions for trainability and generalization in deep neural networks.

problem Understanding the conditions for deep neural networks to be trainable and generalize well.
method Analysis of Neural Tangent Kernel (NTK) for wide and deep networks.
result Large regions of hyperparameter space exist where networks can memorize training data but fail to generalize.

Unified approach for nonparametric regression and conditional distribution learning.

problem Nonparametric regression and conditional distribution learning problems.
method Generative learning framework with deep neural networks to estimate a conditional generator.
result The approach estimates a regression function and a conditional generator simultaneously, providing good prediction intervals.

The network Lasso is a recently proposed convex optimization method for machine learning from massive network structured datasets, i.e., big data over networks. It is a variant of the well-known least absolute shrinkage and selection operator (Lasso), which is underlying many methods in learning and signal processing i…

2017-09-03abs ↗pdf ↗

This paper addresses the following question of neural network identifiability: Does the input-output map realized by a feed-forward neural network with respect to a given nonlinearity uniquely specify the network architecture, weights, and biases? Existing literature on the subject Sussman 1992, Albertini, Sontag et al…

2019-06-11abs ↗pdf ↗

LcGAN generates synthetic CT images for hemorrhagic lesion segmentation.

problem Scarce training data for hemorrhagic lesion segmentation.
method Lesion conditional Generative Adversarial Network (LcGAN) for synthetic image generation.
result Segmentation improved by 12.8% with synthetic data augmentation.

A new method uses Schrödinger bridges for deep conditional generative learning.

problem Learning conditional distributions with additional information.
method Schrödinger bridge approach with discretized SDE and deep neural network.
result Generated samples have higher quality and can estimate conditional density.

In this paper, we propose a novel generative model named Stacked Generative Adversarial Networks (SGAN), which is trained to invert the hierarchical representations of a bottom-up discriminative network. Our model consists of a top-down stack of GANs, each learned to generate lower-level representations conditioned on …

2016-12-13abs ↗pdf ↗

Faster reconstruction of compressed signals using conditional GAN and NPGD.

problem Recovering compressed signals from measurements.
method Network-based projected gradient descent (NPGD) combined with measurement-conditional generative adversarial networks (GANs/BEGANs).
result Significant speed-up in reconstruction (up to 140-175 times faster).

SymPE breaks symmetries in equivariant networks, improving performance across various tasks.

problem Equivariant networks cannot break symmetries, leading to poor performance in tasks with symmetrical inputs.
method Novel equivariant conditional distributions and randomized canonicalization.
result SymPE significantly improves performance of group-equivariant and graph neural networks.

The recent success of Generative Adversarial Networks (GAN) is a result of their ability to generate high quality images from a latent vector space. An important application is the generation of images from a text description, where the text description is encoded and further used in the conditioning of the generated i…

2019-05-16abs ↗pdf ↗

Traditional GANs use a deterministic generator function (typically a neural network) to transform a random noise input zz to a sample x\mathbf{x} that the discriminator seeks to distinguish. We propose a new GAN called Bayesian Conditional Generative Adversarial Networks (BC-GANs) that use a random generator function…

2017-06-17abs ↗pdf ↗

New test for conditional independence using GNNs avoids estimating conditional distributions.

problem Testing conditional independence of XX and YY given ZZ.
method Proposes a non-parametric testing procedure using GNNs to sample from marginal conditional distributions.
result Test statistic is doubly robust against GNN approximation errors.

We propose a simple yet highly effective method that addresses the mode-collapse problem in the Conditional Generative Adversarial Network (cGAN). Although conditional distributions are multi-modal (i.e., having many modes) in practice, most cGAN approaches tend to learn an overly simplified distribution where an input…

2019-01-25abs ↗pdf ↗

A new method for learning conditional distributions using ODEs and neural networks.

problem Learning conditional distributions efficiently and accurately.
method Conditional Föllmer Flow, discretized with Euler's method, using nonparametric velocity estimation.
result Effective approximation of target conditional distributions, with convergence results for Wasserstein-2 distance.

New method recovers signals from compressed measurements using generative networks with contractive layers.

problem Signal recovery from compressed measurements with generative network priors.
method Developed a new matrix concentration inequality (R2WDC) to relax expansivity conditions for generative networks.
result Signals in the range of a Gaussian generative network can be recovered from few linear measurements with contractive layers.

New method tests CMI using deep neural networks for high-dimensional data.

problem Testing conditional mean independence in high-dimensional settings.
method Population CMI measure and bootstrap-based testing with deep generative neural networks.
result Strong empirical performance and versatility in various scenarios.

Conditional Generative Adversarial Networks (cGANs) are generative models that can produce data samples (xx) conditioned on both latent variables (zz) and known auxiliary information (cc). We propose the Bidirectional cGAN (BiCoGAN), which effectively disentangles zz and cc in the generation process and provides a…

2017-11-20abs ↗pdf ↗