A new method for graph node embeddings by discriminating similarity distributions.
problem Unsupervised learning of node embeddings in graphs.
method Maximizing the earth mover distance between distributions of similarities of similar and dissimilar nodes.
result Generates embeddings with state-of-the-art performance in link prediction.
One popular generative model that has high-quality results is the Generative Adversarial Networks(GAN). This type of architecture consists of two separate networks that play against each other. The generator creates an output from the input noise that is given to it. The discriminator has the task of determining if the…
Similarity-based clustering and semi-supervised learning methods separate the data into clusters or classes according to the pairwise similarity between the data, and the pairwise similarity is crucial for their performance. In this paper, we propose a novel discriminative similarity learning framework which learns dis…
FedGAN trains GANs across distributed data sources with reduced communication.
problem Training GANs across non-independent data sources with privacy and communication constraints.
method FedGAN uses local generators and discriminators synced via an intermediary, proving convergence under standard assumptions.
result FedGAN converges and performs similarly to general distributed GANs with reduced communication complexity.
This work improves transferability by considering conditional distributions in feature representations.
problem Improving transferability across multiple domains by considering conditional distributions.
method Introducing von Neumann conditional divergence to quantify the functional dependence between features and desired response.
result Favorable performance in terms of smaller generalization error and less catastrophic forgetting.
Self-supervised GAN prevents forgetting in sequential tasks.
problem Discriminator forgetting in GANs leads to training instability.
method Add self-supervision to the discriminator to maintain useful representations.
result Self-supervised GAN outperforms regular GANs in learning better representations.
We present local discriminative Gaussian (LDG) dimensionality reduction, a supervised dimensionality reduction technique for classification. The LDG objective function is an approximation to the leave-one-out training error of a local quadratic discriminant analysis classifier, and thus acts locally to each training po…
This study examines how well GANs estimate the Wasserstein metric.
problem Estimating the Wasserstein metric from samples in GANs.
method Analyzes c-transform formulation to improve Wasserstein metric estimation. result The c-transform does not perform best in the generative setting. The discriminative approach to classification using deep neural networks has become the de-facto standard in various fields. Complementing recent reservations about safety against adversarial examples, we show that conventional discriminative methods can easily be fooled to provide incorrect labels with very high confi…
In this paper, we present a novel and general framework called {\it Maximum Entropy Discrimination Markov Networks} (MaxEnDNet), which integrates the max-margin structured learning and Bayesian-style estimation and combines and extends their merits. Major innovations of this model include: 1) It generalizes the extant …
New graph-based discriminators improve sample complexity and expressiveness in learning theory.
problem Identifying if two distributions are identical with limited samples.
method Introducing k-ary based discriminators, which use families of Boolean k-ary functions to distinguish between distributions.
result Having k-ary functions (k ≥ 2) improves distinguishability and sample complexity compared to classical hypothesis classes.
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 …
New method improves unsupervised feature learning for natural data.
problem Natural data's correlated and long-tail distribution challenges instance-level contrastive learning.
method Cross-level instance-group discrimination (CLD) to integrate between-instance similarity.
result CLD achieves new state-of-the-art performance on various datasets.
FlipTest detects discrimination in classifiers using optimal transport.
problem Detecting discrimination in classifiers without causal information.
method Optimal transport to match individuals in different protected groups, creating similar pairs of in-distribution samples.
result FlipTest identifies subgroups that may be harmed by model discrimination, even when the model satisfies group fairness criteria.
Paper presents mdfa to identify victims of discrimination in black box classifiers.
problem Identifying victims of discrimination in black box classifiers.
method Reduces discrimination measurement to matching distributions and sensitive attribute coincidence prediction.
result Identifies African-American individuals at high risk of violent recidivism.
ASA improves ASR by adapting SD models to SI model's deep feature distribution.
problem Improving ASR performance on new speakers with limited data.
method Adversarial learning to regularize SD model's deep features to match SI model's.
result ASA achieves significant word error rate improvements over SI models.
Analyzes how restricted f-GANs differ from classical inference methods.
problem Understanding the inductive bias of generative adversarial networks.
method Theoretical characterization of restricted f-GANs, focusing on linear KL-GANs.
result The optimal generator distribution is a combination of maximum likelihood and method of moments solutions.
Paper proposes distributed sparse multicategory discriminant analysis for classification.
problem Sparse multicategory classification with distributed data.
method Convex formulation, distributed setting, invariant discriminant subspace recovery.
result Distributed sparse multicategory linear discriminant analysis performs as good as centralized version after a few rounds of communications.
We present an autoencoder that leverages learned representations to better measure similarities in data space. By combining a variational autoencoder with a generative adversarial network we can use learned feature representations in the GAN discriminator as basis for the VAE reconstruction objective. Thereby, we repla…
Logit distance bounds representational similarity of models.
problem Approximating linear similarity when distributions are close.
method Defined a logit distance and proved its relationship to representational dissimilarity.
result Logit distance bounds representational similarity, providing nontrivial control in practice.
Enhances image-to-image translation using adversarial latent space.
problem Image-to-image translation task in computer vision.
method Introduces an adversarial discriminator on the latent representation to enforce similar latent space distributions.
result Significantly outperforms competing approaches on MNIST and USPS domain adaptation tasks.
We consider a discriminative learning (regression) problem, whereby the regression function is a convex combination of k linear classifiers. Existing approaches are based on the EM algorithm, or similar techniques, without provable guarantees. We develop a simple method based on spectral techniques and a `mirroring' tr…
The paper addresses evaluating survival predictions using discrimination measures, finding a robust method to convert distributions to risks.
problem Evaluating survival distribution predictions with discrimination measures is challenging and often leads to unfair comparisons.
method The paper surveys existing methods and recommends summing over the predicted cumulative hazard as the most robust method to convert distributions to risks.
result Summing over the predicted cumulative hazard is the most robust method to convert distribution predictions to risk predictions.
In this paper, we propose a method for image-set classification based on convex cone models, focusing on the effectiveness of convolutional neural network (CNN) features as inputs. CNN features have non-negative values when using the rectified linear unit as an activation function. This naturally leads us to model a se…
Paper tackles unsupervised learning under latent label shift across domains.
problem Discovering classes from unlabeled data with shifting label distributions.
method Introduces unsupervised learning under Latent Label Shift (LLS), leveraging domain-discriminative models.
result Proves that with domain information, unsupervised classification can improve upon standard methods.
Beta-SOD detects and corrects noisy object re-identification using cosine similarity and Beta mixtures.
problem Noisy object re-identification in image datasets.
method Reframed Re-ID as a similarity task, using Siamese networks and Beta mixture models.
result Superior performance in noisy conditions compared to state-of-the-art methods.
Distance metric learning (DML) approaches learn a transformation to a representation space where distance is in correspondence with a predefined notion of similarity. While such models offer a number of compelling benefits, it has been difficult for these to compete with modern classification algorithms in performance …
This paper introduces a novel clustering method using jointly learned nonlinear transforms.
problem Improving clustering performance in image data.
method A novel clustering principle based on min-max similarity/dissimilarity assignment with jointly learned nonlinear transforms.
result The method outperforms state-of-the-art clustering methods in image clustering tasks.
A new clustering method estimates non-linear boundaries and automatically selects the number of clusters.
problem Discriminative clustering with non-linear boundaries and data abnormalities.
method Regularized mutual information objective function with a mixture of Gaussian and uniform distributions.
result Automatic selection of the number of components and estimation of non-linear boundaries.
Improves GANs by enforcing diverse feature learning.
problem GANs can collapse to a single configuration and be unstable.
method Enforces diverse feature learning by penalizing correlated features.
result Enforces diverse features, stabilizes training, and improves image synthesis.
Proposes a curriculum-based dropout discriminator for domain adaptation.
problem Improving domain adaptation using deep learning networks trained on large labeled datasets.
method Introduces a curriculum-based dropout discriminator that gradually increases sample variance and uses reverse gradients to align source and target feature representations.
result The proposed model outperforms state-of-the-art results in domain adaptation tasks.
Improved GAN sampling by collaborating discriminator and generator.
problem Loss of discriminator information during standard GAN sampling.
method Collaborative sampling between generator and discriminator, gradient-based updates.
result Generated samples are closer to real data distribution.
Study on merging predictors in causal and anticausal directions using CMAXENT.
problem Comparing merging predictors in causal and anticausal directions.
method Using CMAXENT as inductive bias, study differences in merging predictors.
result CMAXENT solution reduces to logistic regression in causal direction and LDA in anticausal direction.
This paper refines MMD for domain adaptation by balancing intra-class and inter-class distances.
problem Balancing intra-class and inter-class distances for better feature discriminability in domain adaptation.
method The paper theoretically proves two facts about MMD and proposes a novel discriminative MMD method to balance intra-class and inter-class distances.
result The proposed method improves feature discriminability and outperforms state-of-the-art methods.
This paper presents a distance-based discriminative framework for learning with probability distributions. Instead of using kernel mean embeddings or generalized radial basis kernels, we introduce embeddings based on dissimilarity of distributions to some reference distributions denoted as templates. Our framework exte…
The study quantifies and compares aleatoric and epistemic discrimination in ML models.
problem Sources of discrimination in ML models and their impact on performance.
method Quantifying aleatoric and epistemic discrimination using statistical experiments and model accuracy.
result State-of-the-art fairness interventions are effective at removing epistemic discrimination but not aleatoric discrimination in datasets with missing values.
MH-GAN uses a discriminator to improve sampling from a GAN's distribution.
problem Improving sampling from a GAN's implicitly defined distribution.
method Combines Markov chain Monte Carlo and GANs, using a discriminator to wrap the generator.
result MH-GAN samples from the true distribution even when the generator is imperfect.
WGANs improve probability distribution approximation with depth and width trade-offs.
problem Approximating complex probability distributions accurately.
method Wasserstein GANs with GroupSort discriminators, quantified generalization bound.
result High-capacity discriminators are crucial for WGANs' performance.
New robust discriminant analysis for non-Gaussian data.
problem Classical discriminant analysis struggles with non-Gaussian distributions and contaminated datasets.
method Each data point follows its own ES distribution with arbitrary scale, leading to robust classification.
result Maximum-likelihood estimation and classification are simple, fast, and robust.
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.
problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.
A new metric DJP-MMD improves domain adaptation by balancing transferability and discriminability.
problem Improving domain adaptation performance by balancing transferability and discriminability.
method Discriminative Joint Probability Maximum Mean Discrepancy (DJP-MMD) replaces the traditional joint MMD.
result DJP-MMD outperforms traditional MMDs in image classification tasks.
A new method uncovers intrinsic data structures for unsupervised domain adaptation.
problem Learning domain-aligned features can damage intrinsic target discrimination.
method Structurally Regularized Deep Clustering (H-SRDC) integrating structural source regularization.
result H-SRDC outperforms existing methods in image classification and semantic segmentation.
CST detects discrimination by comparing protected and non-protected individuals with a counterfactual.
problem Detecting discrimination in classifiers using legal fairness conditions.
method Operationalizes fairness given the difference using counterfactual reasoning.
result CST uncovers more discrimination cases than traditional situation testing.
We propose a new approach to train the Generative Adversarial Nets (GANs) with a mixture of generators to overcome the mode collapsing problem. The main intuition is to employ multiple generators, instead of using a single one as in the original GAN. The idea is simple, yet proven to be extremely effective at covering …
We propose a penalized likelihood method to jointly estimate multiple precision matrices for use in quadratic discriminant analysis and model based clustering. A ridge penalty and a ridge fusion penalty are used to introduce shrinkage and promote similarity between precision matrix estimates. Block-wise coordinate desc…
HC test measures word-frequency similarity for authorship attribution.
problem Identifying the author of a document based on word-frequency patterns.
method Adapting Higher Criticism (HC) to compare word-frequency tables.
result HC identifies characteristic words of the author, unaffected by topic structure.
Generates samples from a target distribution using a discriminator.
problem Sampling from complex target distributions.
method Implicit Metropolis-Hastings algorithm using GAN discriminator.
result Discriminator loss bounds the distance to target distribution.