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

122245367489 · Jun 202019922001200920172026
48 results for process discrimination

Discriminator guidance improves autoregressive diffusion models for generating molecular graphs.

problem Improving the accuracy of autoregressive diffusion models for generating molecular graphs.
method Deriving ways to use a discriminator with a pretrained generative model in the discrete case, including optimal and sub-optimal scenarios.
result Using a discriminator can correct pretrained models and improve exact sampling from the data distribution.

Discrimination-aware classification is receiving an increasing attention in data science fields. The pre-process methods for constructing a discrimination-free classifier first remove discrimination from the training data, and then learn the classifier from the cleaned data. However, they lack a theoretical guarantee f…

2017-02-28abs ↗pdf ↗

Non-discrimination is a recognized objective in algorithmic decision making. In this paper, we introduce a novel probabilistic formulation of data pre-processing for reducing discrimination. We propose a convex optimization for learning a data transformation with three goals: controlling discrimination, limiting distor…

2017-04-11abs ↗pdf ↗

New method computes discriminative classifiers from generative models.

problem Discriminative vs generative classifiers are often seen as distinct, but this work shows they can be equivalent.
method General theoretical result showing generative classifiers can be computed discriminatively.
result Bayesian Maximum Posterior classifier from generative models matches discriminative classifier definition.

New method improves OOD detection by integrating diffusion models into discriminator models.

problem Overconfidence in discriminator models leads to poor OOD detection.
method Integrates diffusion models into discriminator and generation models to mitigate overconfidence.
result Demonstrates significant improvement in AUROC scores for challenging datasets.

The paper examines Nash equilibrium in GANs for stationary Gaussian processes.

problem Existence and uniqueness of Nash equilibrium in GANs for stationary Gaussian processes.
method Analyzes the existence of Nash equilibrium in GANs for stationary Gaussian processes, considering different discriminator families.
result The existence of Nash equilibrium depends on the discriminator family and symmetry properties of the generator family.

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 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 ↗

Paper introduces a method to improve survival model calibration without sacrificing discrimination.

problem Survival models struggle to balance accurate ranking and event prediction.
method Uses conformal regression to enhance calibration without compromising discrimination.
result The approach improves model calibration across 11 real-world datasets.

Neural network based generative models with discriminative components are a powerful approach for semi-supervised learning. However, these techniques a) cannot account for model uncertainty in the estimation of the model's discriminative component and b) lack flexibility to capture complex stochastic patterns in the la…

2017-06-29abs ↗pdf ↗

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 ↗

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) 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…

2018-02-12abs ↗pdf ↗

This paper presents a new conditional GAN (named convex relaxing CGAN or crCGAN) to replicate the conventional constrained topology optimization algorithms in an extremely effective and efficient process. The proposed crCGAN consists of a generator and a discriminator, both of which are deep convolutional neural networ…

2019-01-22abs ↗pdf ↗

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.

The paper optimizes designs for distinguishing between Gaussian process models.

problem Discriminating between two Gaussian process models.
method Sequential and static design criteria, including Kullback Leibler divergences and log-likelihood ratios.
result Necessary conditions for optimal design measures are provided.

A novel GPDA method for high-dimensional functional data.

problem Classification and feature selection challenges in high-dimensional, non-stationary functional data.
method Unified two-layer non-stationary Gaussian process with Ising prior for variable selection and classification.
result Demonstrated superior performance on simulated and proteomics datasets.

Unsupervised domain adaptation aims at transferring knowledge from the labeled source domain to the unlabeled target domain. Previous adversarial domain adaptation methods mostly adopt the discriminator with binary or KK-dimensional output to perform marginal or conditional alignment independently. Recent experiments …

2020-01-01abs ↗pdf ↗

New method detects metastable basins in high dimensions using trajectory sampling.

problem Identifying distinct basins in high-dimensional Markov processes.
method Discriminative approach based on marginal trajectory distribution comparison.
result Bayes-optimal classifier achieves high accuracy distinguishing between basins.

This paper defines a positive and unlabeled classification problem for standard GANs, which then leads to a novel technique to stabilize the training of the discriminator in GANs. Traditionally, real data are taken as positive while generated data are negative. This positive-negative classification criterion was kept f…

2020-02-04abs ↗pdf ↗

Recent work on fairness in machine learning has focused on various statistical discrimination criteria and how they trade off. Most of these criteria are observational: They depend only on the joint distribution of predictor, protected attribute, features, and outcome. While convenient to work with, observational crite…

2017-06-08abs ↗pdf ↗

The insurance industry uses predictions based on customer characteristics, but this can lead to discrimination. We propose using Wasserstein barycenters to mitigate biases.

problem Discrimination in insurance predictions based on sensitive features like gender or race.
method Propose using Wasserstein barycenters instead of simple scaling to mitigate biases in insurance predictions.
result Demonstrates the effectiveness of Wasserstein barycenters in mitigating biases in insurance predictions.

GANs learn distributions by matching low-degree moments.

problem Understanding when GANs learn the target distribution efficiently.
method Theoretical analysis and empirical observation of GAN training process.
result GANs can learn notable distributions by matching polynomially many low-degree moments.

Proposes a test to ensure predictive algorithms predict intended outcomes better than unintended ones.

problem Unintended model behavior leading to prediction of unintended outcomes.
method Falsification framework using nonparametric hypothesis testing to compare prediction losses across outcomes.
result Establishes discriminant validity with respect to gender but not race in an admissions setting.