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

Trend · papers per month

4590134179 · May 202619922001200920172026
48 results for quantum inception score

Recent work (Pennington et al, 2017) suggests that controlling the entire distribution of Jacobian singular values is an important design consideration in deep learning. Motivated by this, we study the distribution of singular values of the Jacobian of the generator in Generative Adversarial Networks (GANs). We find th…

2018-02-23abs ↗pdf ↗

Class labels have been empirically shown useful in improving the sample quality of generative adversarial nets (GANs). In this paper, we mathematically study the properties of the current variants of GANs that make use of class label information. With class aware gradient and cross-entropy decomposition, we reveal how …

2017-03-06abs ↗pdf ↗

We propose a rejection sampling scheme using the discriminator of a GAN to approximately correct errors in the GAN generator distribution. We show that under quite strict assumptions, this will allow us to recover the data distribution exactly. We then examine where those strict assumptions break down and design a prac…

2018-10-16abs ↗pdf ↗

Deep generative models are powerful tools that have produced impressive results in recent years. These advances have been for the most part empirically driven, making it essential that we use high quality evaluation metrics. In this paper, we provide new insights into the Inception Score, a recently proposed and widely…

2018-01-06abs ↗pdf ↗

Generative models have made immense progress in recent years, particularly in their ability to generate high quality images. However, that quality has been difficult to evaluate rigorously, with evaluation dominated by heuristic approaches that do not correlate well with human judgment, such as the Inception Score and …

2019-11-30abs ↗pdf ↗

SSDMs generate quantum states directly, outperforming classical methods.

problem Generating pure-state quantum representations efficiently.
method Score-based generative model on complex projective manifold.
result SSDMs match target pure-state ensembles by orders of magnitude.

SQS uses quantum kernels to improve credit scoring with fewer data points.

problem Credit scoring models struggle with scarce and skewed data.
method Systemic Quantum Score (SQS) leverages quantum kernels for better pattern extraction.
result SQS shows improved performance and pattern extraction with fewer data points.

Training generative adversarial networks requires balancing of delicate adversarial dynamics. Even with careful tuning, training may diverge or end up in a bad equilibrium with dropped modes. In this work, we improve CS-GAN with natural gradient-based latent optimisation and show that it improves adversarial dynamics b…

2019-12-02abs ↗pdf ↗

We propose a new algorithm to incorporate class conditional information into the critic of GANs via a multi-class generalization of the commonly used Hinge loss that is compatible with both supervised and semi-supervised settings. We study the compromise between training a state of the art generator and an accurate cla…

2019-12-09abs ↗pdf ↗

Improves GANs by sampling from an energy-based model induced by discriminator scores.

problem Improving the quality of images generated by GANs.
method DDLS (Discriminator Driven Latent Sampling) using the sum of latent prior log-density and discriminator output score.
result Significantly improves Inception Score on CIFAR-10 dataset.

Recent advances in generative modeling have led to an increased interest in the study of statistical divergences as means of model comparison. Commonly used evaluation methods, such as the Frechet Inception Distance (FID), correlate well with the perceived quality of samples and are sensitive to mode dropping. However,…

2018-05-31abs ↗pdf ↗

High-quality image synthesis with diffusion models, achieving state-of-the-art FID score.

problem Generating high-quality images from latent variables.
method Training diffusion probabilistic models with a weighted variational bound, inspired by denoising score matching and Langevin dynamics.
result State-of-the-art FID score of 3.17 on CIFAR10 dataset.

Generative models of natural images have progressed towards high fidelity samples by the strong leveraging of scale. We attempt to carry this success to the field of video modeling by showing that large Generative Adversarial Networks trained on the complex Kinetics-600 dataset are able to produce video samples of subs…

2019-07-15abs ↗pdf ↗

The problem of video frame prediction has received much interest due to its relevance to many computer vision applications such as autonomous vehicles or robotics. Supervised methods for video frame prediction rely on labeled data, which may not always be available. In this paper, we provide a novel unsupervised deep-l…

2019-08-28abs ↗pdf ↗

We propose a method of moments (MoM) algorithm for training large-scale implicit generative models. Moment estimation in this setting encounters two problems: it is often difficult to define the millions of moments needed to learn the model parameters, and it is hard to determine which properties are useful when specif…

2018-06-28abs ↗pdf ↗

Deep generative models (DGMs) of images are now sufficiently mature that they produce nearly photorealistic samples and obtain scores similar to the data distribution on heuristics such as Frechet Inception Distance (FID). These results, especially on large-scale datasets such as ImageNet, suggest that DGMs are learnin…

2019-05-26abs ↗pdf ↗

Despite recent progress in generative image modeling, successfully generating high-resolution, diverse samples from complex datasets such as ImageNet remains an elusive goal. To this end, we train Generative Adversarial Networks at the largest scale yet attempted, and study the instabilities specific to such scale. We …

2018-09-28abs ↗pdf ↗

ECS evaluates synthetic CXR images' distributional fidelity.

problem Evaluating synthetic CXR images' distributional fidelity under privacy constraints.
method Characteristic function transforms of feature embeddings.
result ECS uncovers clinically relevant distributional discrepancies.

Quantum Support Vector Classifier outperforms other QML models in finance fraud detection.

problem Detecting financial fraud using Quantum Machine Learning.
method Comparative study of four QML models: Quantum Support Vector Classifier, Variational Quantum Classifier, Estimator QNN, and Sampler QNN.
result Quantum Support Vector Classifier achieved the highest F1 scores (0.98) for fraud and non-fraud classes.

Quantum neural networks improve causal inference in biomedical studies, especially for small samples.

problem Addressing selection bias in comparing surgical techniques using observational data.
method Developed QNN-based propensity score models focusing on four key covariates (Age, Sex, Stage, BMI). Employed a linear ZFeatureMap for data encoding, SummedPaulis for predictions, and CMA-ES for optimization. Integrated noise modeling to enhance predictive stability.
result QNNs, particularly with noise-aware strategies, outperformed classical models in small samples, achieving AUC up to 0.750 for n=100.

In this paper, we propose the Self-Attention Generative Adversarial Network (SAGAN) which allows attention-driven, long-range dependency modeling for image generation tasks. Traditional convolutional GANs generate high-resolution details as a function of only spatially local points in lower-resolution feature maps. In …

2018-05-21abs ↗pdf ↗

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 ↗

Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.

problem Creating efficient stock portfolios from a large dataset.
method Used classical and quantum solvers to optimize portfolios of 3,171 US stocks.
result Demonstrated the effectiveness of quantum and classical solvers in portfolio optimization.

Maximum likelihood estimation of energy-based models is a challenging problem due to the intractability of the log-likelihood gradient. In this work, we propose learning both the energy function and an amortized approximate sampling mechanism using a neural generator network, which provides an efficient approximation o…

2019-01-24abs ↗pdf ↗

We introduce Primal-Dual Wasserstein GAN, a new learning algorithm for building latent variable models of the data distribution based on the primal and the dual formulations of the optimal transport (OT) problem. We utilize the primal formulation to learn a flexible inference mechanism and to create an optimal approxim…

2018-05-24abs ↗pdf ↗

A new GAN loss function based on cumulant generating functions improves stability and robustness.

problem Improving the stability and performance of GANs.
method Cumulant GAN loss function based on variational R{é}nyi divergence.
result Cumulant GAN achieves linear convergence to Nash equilibrium and superior performance in image generation.

A commonly used evaluation metric for text-to-image synthesis is the Inception score (IS) \cite{inceptionscore}, which has been shown to be a quality metric that correlates well with human judgment. However, IS does not reveal properties of the generated images indicating the ability of a text-to-image synthesis method…

2019-10-31abs ↗pdf ↗

We introduce a new generative model where samples are produced via Langevin dynamics using gradients of the data distribution estimated with score matching. Because gradients can be ill-defined and hard to estimate when the data resides on low-dimensional manifolds, we perturb the data with different levels of Gaussian…

2019-07-12abs ↗pdf ↗

Within a broad class of generative adversarial networks, we show that discriminator optimization process increases a lower bound of the dual cost function for the Wasserstein distance between the target distribution pp and the generator distribution pGp_G. It implies that the trained discriminator can approximate opti…

2019-10-15abs ↗pdf ↗

We introduce autoregressive implicit quantile networks (AIQN), a fundamentally different approach to generative modeling than those commonly used, that implicitly captures the distribution using quantile regression. AIQN is able to achieve superior perceptual quality and improvements in evaluation metrics, without incu…

2018-06-14abs ↗pdf ↗