Hyperbolic GANs improve image generation metrics.
problem Improving image generation quality in neural networks.
method Integrating hyperbolic layers into GAN architectures.
result Hyperbolic GANs achieve better metrics than Euclidean counterparts.
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
48 results for “Hyperbolic GAN”
Improves stability in hyperbolic neural networks for complex data generation.
problem Numerical instability in hyperbolic neural networks hinders complex architecture development.
method Proposes a novel hyperbolic AE-GAN architecture with stable layers.
result Demonstrates state-of-the-art performance in generating complex data.
Study Gauss maps of surfaces in Heisenberg group using hyperbolic geometry.
problem Understanding the geometry of surfaces in Heisenberg group.
method Using Gans model of hyperbolic plane, relate tension field of Gauss map to surface's mean curvature.
result Established a relationship between tension field and mean curvature.
Survey of GANs and autoencoders, addressing mode collapse and likelihood issues.
problem Addressing mode collapse and likelihood issues in GANs and autoencoders.
method Explains various GAN and autoencoder variants, their applications, and methods to resolve issues.
result Various methods to resolve mode collapse and improve likelihood in GANs and autoencoders.
A new GAN model -GAN with tunable loss function addresses gradient vanishing and mode collapse issues.
problem Addressing vanishing gradients and mode collapse in GANs.
method Introduced a tunable GAN -GAN using a supervised -loss function.
result Holistic understanding of -GAN related to Arimoto divergence and convergence properties.
Unbalanced GANs stabilize GAN training by pre-training the generator with VAE.
problem Stable training of GANs to avoid mode collapses and improve image quality.
method Pre-train GAN generator with VAE, balance generator and discriminator training, prevent discriminator's early convergence.
result Unbalanced GANs reduce mode collapses and outperform ordinary GANs in stability, convergence, and image quality.
GANs can approximate SDEs for large time steps.
problem Approximating SDEs for large time steps using GANs.
method Proposed a conditional GAN architecture to enable strong approximation of SDEs.
result Supervised GAN outperformed standard GAN and other schemes in strong error.
Generative adversarial networks (GANs) have enjoyed much success in learning high-dimensional distributions. Learning objectives approximately minimize an -divergence (-GANs) or an integral probability metric (Wasserstein GANs) between the model and the data distribution using a discriminator. Wasserstein GANs en…
Prb-GAN uses dropout and variational inference to improve GAN performance.
problem GANs struggle with mode loss and training instability.
method Introduces Prb-GANs with dropout and variational inference for parameter distribution.
result Improves GAN performance through dropout and variational inference.
xAI-GAN improves GANs by providing richer feedback, enhancing image quality.
problem Challenges in GAN training, especially resource-intensive and data-intensive.
method Integrates xAI systems to provide richer corrective feedback from discriminators to generators.
result Improves image quality by up to 23.18% on MNIST and FMNIST datasets.
This paper reviews GANs algorithms, theory, and applications.
problem Lack of comprehensive study on GANs connections and evolution.
method Detailed introduction of GANs algorithms, theoretical investigation, and application illustrations.
result Comprehensive review of GANs from algorithms, theory, and applications perspectives.
Fisher GANcs.LG
Generative Adversarial Networks (GANs) are powerful models for learning complex distributions. Stable training of GANs has been addressed in many recent works which explore different metrics between distributions. In this paper we introduce Fisher GAN which fits within the Integral Probability Metrics (IPM) framework f…
A recent technical breakthrough in the domain of machine learning is the discovery and the multiple applications of Generative Adversarial Networks (GANs). Those generative models are computationally demanding, as a GAN is composed of two deep neural networks, and because it trains on large datasets. A GAN is generally…
Demystifying MMD GANsstat.ML
We investigate the training and performance of generative adversarial networks using the Maximum Mean Discrepancy (MMD) as critic, termed MMD GANs. As our main theoretical contribution, we clarify the situation with bias in GAN loss functions raised by recent work: we show that gradient estimators used in the optimizat…
GANs may not have Nash equilibria, but proximal training can find solutions.
problem Existence of Nash equilibria in GANs optimization.
method Proximal training approach to find solutions.
result Proximal training finds solutions to GAN problems.
Empirical study shows GANs overfit and drop modes when training is deterministic.
problem Understanding overfitting and mode drop in GAN training.
method Empirical analysis of GAN training with and without stochasticity.
result GANs overfit and drop modes when training is deterministic.
Generative Adversarial Networks (GANs) have been used in several machine learning tasks such as domain transfer, super resolution, and synthetic data generation. State-of-the-art GANs often use tens of millions of parameters, making them expensive to deploy for applications in low SWAP (size, weight, and power) hardwar…
GANs analyzed for performance and training issues.
problem Performance and training issues of GANs.
method SDE approximations for training GANs.
result Improved understanding of GANs through analytical perspectives.
Despite excellent progress in recent years, mode collapse remains a major unsolved problem in generative adversarial networks (GANs).In this paper, we present spectral regularization for GANs (SR-GANs), a new and robust method for combating the mode collapse problem in GANs. Theoretical analysis shows that the optimal …
Vanilla GANs are connected to Wasserstein distance for better understanding.
problem Understanding the statistical properties of Vanilla GANs.
method Connecting Vanilla GANs to Wasserstein distance and proving an oracle inequality.
result An oracle inequality for Vanilla GANs in Wasserstein distance is obtained.
Several dihedral angles prediction methods were developed for protein structure prediction and their other applications. However, distribution of predicted angles would not be similar to that of real angles. To address this we employed generative adversarial networks (GAN). Generative adversarial networks are composed …
Generative adversarial networks (GAN) have been effective for learning generative models for real-world data. However, existing GANs (GAN and its variants) tend to suffer from training problems such as instability and mode collapse. In this paper, we propose a novel GAN framework called evolutionary generative adversar…
Unified framework compresses GANs up to 47x with minimal quality loss.
problem High parameter complexity of GANs for resource-constrained devices.
method Unified optimization framework combining model distillation, channel pruning, and quantization.
result 47x compression of CartoonGAN with minimal quality degradation.
NR-GANs learn clean images from noisy data.
problem Learning clean images from noisy training data.
method Introduced a noise generator and distribution/transformation constraints.
result NR-GANs can generate clean images from noisy data.
This work improves GAN stability with theoretical conditions.
problem GANs exhibit unstable behavior during training.
method Developed a theoretical framework and conditions for GAN stability.
result Constructs a GAN that fulfills stability conditions.
This paper uses SDEs to analyze GANs training and long-run behavior.
problem Understanding the training process and long-run behavior of GANs.
method Established SDE approximations for GANs training and analyzed long-run behavior via invariant measures.
result The long-run behavior of GANs training can be studied via the invariant measures of its SDE approximations.
Generative Adversarial Networks (GANs) are a powerful class of generative models. Despite their successes, the most appropriate choice of a GAN network architecture is still not well understood. GAN models for image synthesis have adopted a deep convolutional network architecture, which eliminates or minimizes the use …
FE-GAN improves VaR and ES estimation in financial risk management.
problem Improving VaR and ES estimation in financial risk management.
method Feature-Enriched Generative Adversarial Networks (FE-GAN) with specialized models like WGAN and Tail-GAN.
result FE-GAN significantly outperforms traditional GANs in VaR and ES estimation.
MIM-based GAN improves rare event generation in GANs.
problem Improving rare event generation in GANs.
method Adopting MIM (exponential form of information metric) to replace KL divergence in GANs.
result MIM-based GAN achieves state-of-the-art performance in anomaly detection.
This paper analyzes and improves GANs' approximation ability.
problem Theoretical and algorithmic analysis of GANs' approximation property.
method Theoretical analysis and SDG approach to enhance GANs' approximation ability.
result The generator of GANs can universally approximate the potential data distribution.
Diffusion-GAN uses diffusion to improve GAN training stability and realism.
problem Stability and realism issues in training GANs.
method Diffusion-GAN employs a forward diffusion chain to generate Gaussian-mixture distributed instance noise, with adaptive diffusion process and timestep-dependent discriminator.
result Diffusion-GAN produces more realistic images with higher stability and data efficiency.
Technical report on f-divergences and f-GAN training properties.
problem Understanding and optimizing f-divergences for GAN training.
method Elementary derivation and detailed expressions of f-divergences and their variational lower bounds.
result Informative properties of f-divergences and f-GAN training, including gradient matching and stability improvements.
GANS are powerful generative models that are able to model the manifold of natural images. We leverage this property to perform manifold regularization by approximating the Laplacian norm using a Monte Carlo approximation that is easily computed with the GAN. When incorporated into the feature-matching GAN of Improved …
GAN+VER improves GANs by regularizing entropy to reduce mode collapse.
problem Mode collapse in GANs where the generator fails to capture all modes.
method Maximizing a variational lower bound on the entropy of generated samples.
result Significant improvement in evaluation metrics for real and generated samples.
Despite the growing prominence of generative adversarial networks (GANs), optimization in GANs is still a poorly understood topic. In this paper, we analyze the "gradient descent" form of GAN optimization i.e., the natural setting where we simultaneously take small gradient steps in both generator and discriminator par…
We examined the use of modern Generative Adversarial Nets to generate novel images of oil paintings using the Painter By Numbers dataset. We implemented Spectral Normalization GAN (SN-GAN) and Spectral Normalization GAN with Gradient Penalty, and compared their outputs to a Deep Convolutional GAN. Visually, and quantit…
GAN-based semi-supervised learning improves classifier generalization.
problem Improving classifier performance with limited labeled data.
method Theoretical analysis of GAN-SSL, proving equivalence of discriminator optimization and supervised learning, and exploring conditions for perfect discriminator.
result GAN-SSL theoretically outputs a perfect discriminator on both labeled and unlabeled data.
Filtering out unrealistic images from trained generative adversarial networks (GANs) has attracted considerable attention recently. Two density ratio based subsampling methods---Discriminator Rejection Sampling (DRS) and Metropolis-Hastings GAN (MH-GAN)---were recently proposed, and their effectiveness in improving GAN…
A framework selects GANs for specific applications efficiently.
problem Fragmented knowledge leads to trial-error selection of GANs.
method Comprehensive summary of GANs, comparison, and novel framework.
result Significant reduction in search space for GAN selection.
A study on -GANs proving convergence and estimation guarantees.
problem Analyzing the convergence and estimation guarantees of -GANs.
method Proved a correspondence between -GANs and -divergences, and provided estimation bounds.
result Estimation bounds indicate diverse GAN behavior as a function of .
New error bounds for GANs with nonlinear objective functions derived.
problem Statistical consistency of GANs with nonlinear objective functions.
method Derivation of statistical error bounds for -GANs using Rademacher complexity.
result Proves the statistical consistency of -GANs.
Paper uses DNN-based MoM-GAN to estimate contaminated data distributions.
problem Estimating distributions of data with outliers or contamination.
method Combines GAN and MoM estimation with DNN for modeling.
result DNN-based MoM-GAN achieves better error bounds than other methods.
Study proposes a new GAN for realistic discrete financial orders.
problem Previous GANs generated fake orders in continuous spaces, not discrete.
method Introduced policy gradient for learning in discrete spaces.
result Model outperforms previous models in generated order distribution.
Private PGB boosts synthetic data quality using GANs and privacy techniques.
problem Differentially private GANs struggle with convergence and poor output quality.
method Combines reweighted samples from GAN training using Private Multiplicative Weights method.
result Improves synthetic data quality across various datasets and tasks.
A new GAN framework teaches models to avoid undesirable data.
problem Improving GANs' ability to learn from and avoid negative samples.
method Introducing 'negative samples' to GANs, inspired by Rumi's philosophy.
result The Rumi Framework accelerates GAN learning and improves generalization.
This paper offers a mathematical introduction to GANs.
problem Understanding GANs from a mathematical perspective.
method Mathematical analysis of GANs.
result Provides clarity for math-oriented students.
From GAN to WGANcs.LG
This paper explains the math behind a generative adversarial network (GAN) model and why it is hard to be trained. Wasserstein GAN is intended to improve GANs' training by adopting a smooth metric for measuring the distance between two probability distributions.
GANs generate realistic financial data for research.
problem Creating realistic financial datasets for research and benchmarking.
method Proposed a novel type of GAN and methods for preprocessing and evaluation.
result GANs can replicate financial datasets with high fidelity.