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.

169,051 papers · 148 categories

Trend · papers per month

175350524699 · Jun 202019922001200920182026
48 results for discrimination functions

Paper optimizes graph neural networks for better structural graph classification.

problem Improving graph neural networks for structural graph classification.
method Focus on aggregation functions, specifically sum and histogram-based functions, to enhance discrimination.
result Design of a graph neural network that learns discriminative graph representations.

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.

Generative classifiers' properties are linked to linear constraints.

problem Understanding the Markov property in generative classifiers.
method Characterization of discrimination functions using linear constraints and a second order finite difference operator.
result Discrimination functions of undirected Markov network classifiers are characterized by sets of linear constraints.

Generalized dual discriminator GANs improve upon traditional GANs by using two discriminators and a flexible loss function.

problem Mode collapse in GANs.
method Introducing dual discriminator αα-GANs and extending the approach to arbitrary functions.
result The approach reduces the optimization problem to a linear combination of an ff-divergence and a reverse ff-divergence.

We propose a Bayesian framework of Gaussian process in order to extend Fisher's discriminant to classify functional data such as spectra and images. The probability structure for our extended Fisher's discriminant is explicitly formulated, and we utilize the smoothness assumptions of functional data as prior probabilit…

2014-12-09abs ↗pdf ↗

Study shows infoGAN's generalization error bound for two-layer networks.

problem Understanding generalization error in infoGAN for two-layer neural networks.
method Analyzes the difference between empirical and population objective functions, derives Rademacher complexity bounds.
result Derives error bound for infoGAN's generalization error in a two-layer network.

Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we consider a novel class of matrix and tensor-valued features, which can be pre-trained using unlabeled samples. We present efficient algorithms f…

2014-12-19abs ↗pdf ↗

Paper introduces new loss functions for Siamese networks using FDA.

problem Training Siamese networks with improved loss functions.
method Proposes Fisher Discriminant Triplet (FDT) and Fisher Discriminant Contrastive (FDC) loss functions based on FDA.
result Shows effectiveness of FDT and FDC on MNIST and histopathology datasets.

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 …

2017-11-07abs ↗pdf ↗

The paper addresses instability in KL divergence estimation using a neural network discriminator.

problem Unstable estimation of KL divergence due to discriminator complexity.
method Using a Reproducing Kernel Hilbert Space (RKHS) to control discriminator complexity.
result Theoretical bound on error probability of KL estimates based on discriminator complexity in RKHS.

PBN combines generative and discriminative capabilities in a neural network.

problem Combining generative and discriminative capabilities in neural networks.
method Convolutional PBN, sharing FF-NN embodiment, combining generative and discriminative qualities.
result PBN shows excellent qualities from either generative or discriminative viewpoint.

Develops interpretable low-dimensional kernels with conic discriminant functions.

problem Improving interpretability in kernel-based classification models.
method Gradually constructs simple feature maps leading to interpretable low-dimensional kernels.
result Obtains high accuracy results without extensive hyperparameter tuning.

Paper proposes a method to stabilize estimation of KL divergence using a discriminator in RKHS.

problem High variance and instability in estimating KL divergence using neural network discriminators.
method Developed a novel construction of the discriminator in RKHS, controlled its complexity, and proved the consistency of the estimator.
result Reduced variance and stabilized training of KL divergence estimates.

We introduce the "Energy-based Generative Adversarial Network" model (EBGAN) which views the discriminator as an energy function that attributes low energies to the regions near the data manifold and higher energies to other regions. Similar to the probabilistic GANs, a generator is seen as being trained to produce con…

2016-09-11abs ↗pdf ↗

Proposes a sparse classifier for discriminative Gaussian Mixture Models.

problem Softmax-based discriminative models assume unimodality, leading to parameter redundancy.
method Sparse Bayesian learning for GMM-based discriminative model, reducing parameters and complexity.
result The SDGM outperforms existing softmax-based discriminative models.

New findings show fixed-kernel discriminators are weaker than feature-learning ones.

problem Comparing performance of fixed-kernel and feature-learning discriminators.
method Using function classes F2\mathcal{F}_2 and F1\mathcal{F}_1, constructing pairs of distributions, and linking IPMs with sliced Wasserstein distances.
result Fixed-kernel IPM and SD cannot discriminate certain distributions that feature-learning IPM and SD can.

We explore the question of whether the representations learned by classifiers can be used to enhance the quality of generative models. Our conjecture is that labels correspond to characteristics of natural data which are most salient to humans: identity in faces, objects in images, and utterances in speech. We propose …

2016-02-09abs ↗pdf ↗

This paper analyzes implicit bias in Deep Linear Discriminant Analysis.

problem The implicit bias of Deep Linear Discriminant Analysis.
method Analyzing gradient flow on a L-layer diagonal linear network.
result Under balanced initialization, the network transforms additive updates into multiplicative updates, conserving the (2/L) quasi-norm.

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…

2018-07-31abs ↗pdf ↗

Generative Adversarial Networks (GANs) were intuitively and attractively explained under the perspective of game theory, wherein two involving parties are a discriminator and a generator. In this game, the task of the discriminator is to discriminate the real and generated (i.e., fake) data, whilst the task of the gene…

2017-11-06abs ↗pdf ↗

Paper introduces a new method to improve GANs by leveraging the discriminator's energy.

problem Improving the quality of generated samples in GANs.
method Discriminator Contrastive Divergence (DCD) method.
result Significant improvement in generation quality on synthetic and real-world data.

We consider an enlarged dimension reduction space in functional inverse regression. Our operator and functional analysis based approach facilitates a compact and rigorous formulation of the functional inverse regression problem. It also enables us to expand the possible space where the dimension reduction functions bel…

2015-03-12abs ↗pdf ↗

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.

We address the problem of correcting group discriminations within a score function, while minimizing the individual error. Each group is described by a probability density function on the set of profiles. We first solve the problem analytically in the case of two populations, with a uniform bonus-malus on the zones whe…

2018-06-07abs ↗pdf ↗

QFDA combines machine learning and information theory for image classification.

problem Lack of literature on combining machine learning and information theory.
method Quantized Fisher Discriminant Analysis (QFDA) using a cost function for rate-distortion optimization.
result QFDA achieves at least as good classification accuracy as FDA on quantized images.

New RNN model learns from fMRI data better than existing methods.

problem Difficulties in gathering large fMRI datasets and lack of interpretability.
method Developed a novel RNN-based model that learns to discriminate and generate fMRI data.
result Improves classification learning and produces meaningful functional communities.

Proposes β4β^{4}-IRT, a new IRT model with enhanced discrimination estimation.

problem Symmetry problem in β3β^3-IRT causing incorrect discrimination values.
method Gradient descent method, link functions, and new parameters for discrimination.
result Improved parameter recovery in experiments compared to β3β^3-IRT.

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…

2018-06-19abs ↗pdf ↗

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…

2012-06-18abs ↗pdf ↗