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.
Paper proposes distributed sparse multicategory discriminant analysis for classification.
The paper addresses evaluating survival predictions using discrimination measures, finding a robust method to convert distributions to risks.
Domain adaptation is essential to enable wide usage of deep learning based networks trained using large labeled datasets. Adversarial learning based techniques have shown their utility towards solving this problem using a discriminator that ensures source and target distributions are close. However, here we suggest tha…
The standard practice in Generative Adversarial Networks (GANs) discards the discriminator during sampling. However, this sampling method loses valuable information learned by the discriminator regarding the data distribution. In this work, we propose a collaborative sampling scheme between the generator and the discri…
The study quantifies and compares aleatoric and epistemic discrimination in ML models.
WGANs improve probability distribution approximation with depth and width trade-offs.
New robust discriminant analysis for non-Gaussian data.
Generative adversarial training can be generally understood as minimizing certain moment matching loss defined by a set of discriminator functions, typically neural networks. The discriminator set should be large enough to be able to uniquely identify the true distribution (discriminative), and also be small enough to …
Kernel discriminant analysis uses nonlinear embeddings to improve classification.
A new metric DJP-MMD improves domain adaptation by balancing transferability and discriminability.
Structure-preserving GANs learn distributions with group symmetry efficiently.
Paper compares generative and discriminative models in uncertainty quantification.
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 and the generator distribution . It implies that the trained discriminator can approximate opti…
Unified framework for robust discriminant analysis overcomes Gaussian assumptions.
Mitigates bias in text classification by weighting instances.
While Generative Adversarial Networks (GANs) have empirically produced impressive results on learning complex real-world distributions, recent works have shown that they suffer from lack of diversity or mode collapse. The theoretical work of Arora et al. suggests a dilemma about GANs' statistical properties: powerful d…
A Triangle Generative Adversarial Network (-GAN) is developed for semi-supervised cross-domain joint distribution matching, where the training data consists of samples from each domain, and supervision of domain correspondence is provided by only a few paired samples. -GAN consists of four neural networks, two ge…
Generative Adversarial Networks (GANs) can successfully approximate a probability distribution and produce realistic samples. However, open questions such as sufficient convergence conditions and mode collapse still persist. In this paper, we build on existing work in the area by proposing a novel framework for trainin…
Discriminator guidance improves autoregressive diffusion models for generating molecular graphs.
Simplified GAN model shows how discriminator improves generalization.
We introduce the Metropolis-Hastings generative adversarial network (MH-GAN), which combines aspects of Markov chain Monte Carlo and GANs. The MH-GAN draws samples from the distribution implicitly defined by a GAN's discriminator-generator pair, as opposed to standard GANs which draw samples from the distribution defin…
Generative adversarial networks (GANs) are pow- erful generative models based on providing feed- back to a generative network via a discriminator network. However, the discriminator usually as- sesses individual samples. This prevents the dis- criminator from accessing global distributional statistics of generated samp…
We present a neural network architecture based upon the Autoencoder (AE) and Generative Adversarial Network (GAN) that promotes a convex latent distribution by training adversarially on latent space interpolations. By using an AE as both the generator and discriminator of a GAN, we pass a pixel-wise error function acro…
Pairwise discriminators stabilize adversarial training by ensuring the generator's alignment is preserved.
Recent works propose using the discriminator of a GAN to filter out unrealistic samples of the generator. We generalize these ideas by introducing the implicit Metropolis-Hastings algorithm. For any implicit probabilistic model and a target distribution represented by a set of samples, implicit Metropolis-Hastings oper…
Majority of state-of-the-art deep learning methods are discriminative approaches, which model the conditional distribution of labels given inputs features. The success of such approaches heavily depends on high-quality labeled instances, which are not easy to obtain, especially as the number of candidate classes increa…
A new robust and flexible classification method for non-Gaussian data.
FedGAN trains GANs across distributed data sources with reduced communication.
We propose in this paper a novel approach to tackle the problem of mode collapse encountered in generative adversarial network (GAN). Our idea is intuitive but proven to be very effective, especially in addressing some key limitations of GAN. In essence, it combines the Kullback-Leibler (KL) and reverse KL divergences …
In this letter, we derive the optimal discriminant functions for modulation classification based on the sampled distribution distance. The proposed method classifies various candidate constellations using a low complexity approach based on the distribution distance at specific testpoints along the cumulative distributi…
Generative classifier derived from any discriminative classifier rejects illegal inputs.
GANs learn distributions by matching low-degree moments.
Recently, considerable effort has been devoted to deep domain adaptation in computer vision and machine learning communities. However, most of existing work only concentrates on learning shared feature representation by minimizing the distribution discrepancy across different domains. Due to the fact that all the domai…
New method trains generative models without discriminators, improving stability and accuracy.
Optimized GAN discriminator using polyharmonic interpolation.
Generative adversarial networks (GANs) have been shown to produce realistic samples from high-dimensional distributions, but training them is considered hard. A possible explanation for training instabilities is the inherent imbalance between the networks: While the discriminator is trained directly on both real and fa…
Discriminative classifier for compositional data using hierarchical mixture of Generalized Dirichlet models.
New method improves OOD detection by integrating diffusion models into discriminator models.
Robust GQDA improves classification accuracy in non-Normal data.
Proposes TFDF to learn transferable and discriminative features for unsupervised domain adaptation.
New findings show fixed-kernel discriminators are weaker than feature-learning ones.
Four new methods for computing generalized chi-square distribution.
Hybrid method improves mutual information estimation from samples.
Generalized dual discriminator GANs improve upon traditional GANs by using two discriminators and a flexible loss function.
Generative adversarial nets (GANs) are a promising technique for modeling a distribution from samples. It is however well known that GAN training suffers from instability due to the nature of its maximin formulation. In this paper, we explore ways to tackle the instability problem by dualizing the discriminator. We sta…
Reinterprets classifiers as energy-based models for joint distributions.
We introduce a new discriminant analysis method (Empirical Discriminant Analysis or EDA) for binary classification in machine learning. Given a dataset of feature vectors, this method defines an empirical feature map transforming the training and test data into new data with components having Gaussian empirical distrib…
The problem of unsupervised learning node embeddings in graphs is one of the important directions in modern network science. In this work we propose a novel framework, which is aimed to find embeddings by \textit{discriminating distributions of similarities (DDoS)} between nodes in the graph. The general idea is implem…