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

92185277369 · Jun 202019922001200920172026
48 results for discriminator design

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 ↗

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.

Designs an MLP from LDA for multi-Gaussian class classification.

problem Classifying inputs with multiple Gaussian distributions.
method Interprets MLP as generalized LDA, using LDAs for half-space partitioning, neurons for subspace isolation, and merging for class-wise representation.
result Automatic feedforward design for MLP architecture and weights.

SONA improves conditional generation by balancing authenticity and alignment.

problem Challenges in balancing authenticity and conditional alignment in conditional generative models.
method SONA integrates unconditional discrimination, matching-aware supervision, and adaptive weighting to balance authenticity and alignment.
result SONA achieves superior sample quality and conditional alignment compared to state-of-the-art methods.

This paper focuses on the discrimination capacity of aggregation functions: these are the permutation invariant functions used by graph neural networks to combine the features of nodes. Realizing that the most powerful aggregation functions suffer from a dimensionality curse, we consider a restricted setting. In partic…

2019-05-31abs ↗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.

In this note, we point out a basic link between generative adversarial (GA) training and binary classification -- any powerful discriminator essentially computes an (f-)divergence between real and generated samples. The result, repeatedly re-derived in decision theory, has implications for GA Networks (GANs), providing…

2017-09-05abs ↗pdf ↗

Improved LDA method for better classification and dimensionality reduction.

problem Improving linear discriminant analysis for better classification performance.
method Integrates spectrally-corrected covariance matrix and regularized discriminant analysis.
result SRLDA has a linear classification global optimal solution under spiked model assumption.

In recent years, Generative Adversarial Networks (GANs) have drawn a lot of attentions for learning the underlying distribution of data in various applications. Despite their wide applicability, training GANs is notoriously difficult. This difficulty is due to the min-max nature of the resulting optimization problem an…

2019-04-22abs ↗pdf ↗

Discovering new physical products and processes often demands enormous experimentation and expensive simulation. To design a new product with certain target characteristics, an extensive search is performed in the design space by trying out a large number of design combinations before reaching to the target characteris…

2018-10-31abs ↗pdf ↗

PropEn uses matching to create a larger dataset for efficient design optimization.

problem Limited data and complex landscapes in scientific applications.
method PropEn uses a matching approach to implicitly guide design without a discriminator.
result PropEn efficiently approximates the gradient of property improvement within the data distribution.

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.

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 ↗

We present Generative Adversarial Capsule Network (CapsuleGAN), a framework that uses capsule networks (CapsNets) instead of the standard convolutional neural networks (CNNs) as discriminators within the generative adversarial network (GAN) setting, while modeling image data. We provide guidelines for designing CapsNet…

2018-02-17abs ↗pdf ↗

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…

2017-09-19abs ↗pdf ↗

A variety of real-world tasks involve the classification of images into pre-determined categories. Designing image classification algorithms that exhibit robustness to acquisition noise and image distortions, particularly when the available training data are insufficient to learn accurate models, is a significant chall…

2016-03-08abs ↗pdf ↗

Study uses LLMs for financial sentiment analysis without fine-tuning.

problem Lack of prescriptive knowledge to leverage generative models in FSA.
method Proposes a design framework with heterogeneous LLM agents based on Minsky's theory.
result Framework yields better accuracies, especially with substantial discussions.

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…

2018-06-27abs ↗pdf ↗

Despite many years of research into latent Dirichlet allocation (LDA), applying LDA to collections of non-categorical items is still challenging. Yet many problems with much richer data share a similar structure and could benefit from the vast literature on LDA. We propose logistic LDA, a novel discriminative variant o…

2019-09-03abs ↗pdf ↗

New metrics improve quantum ensemble learning efficiency and power.

problem Quantum ensembles' distances poorly understood due to measurement constraints.
method Introduce MMD-kk hierarchy of integral probability metrics for quantum ensembles.
result MMD-kk requires fewer samples for full discriminative power at higher kk.

We study the problem of supervised linear dimensionality reduction, taking an information-theoretic viewpoint. The linear projection matrix is designed by maximizing the mutual information between the projected signal and the class label (based on a Shannon entropy measure). By harnessing a recent theoretical result on…

2012-06-27abs ↗pdf ↗

Sparse GEMINI selects relevant features for clustering without assumptions.

problem Feature selection in clustering with relevant clusters and variables.
method Discriminative clustering model maximizing GEMINI with l1 penalty.
result Sparse GEMINI selects relevant subsets of variables without prior hypotheses.

Improved R-QDA classifier performs well in unbalanced data settings.

problem High sensitivity of R-QDA to covariance matrix estimation noise in unbalanced data.
method Proposes an improved R-QDA with two regularization parameters and a modified bias.
result Significantly better classification performance compared to traditional R-QDA.

Machine learning is increasingly targeting areas where input data cannot be accurately described by a single vector, but can be modeled instead using the more flexible concept of random vectors, namely probability measures or more simply point clouds of varying cardinality. Using deep architectures on measures poses, h…

2018-11-19abs ↗pdf ↗

We propose a rejection sampling scheme using the discriminator of a GAN to approximately correct errors in the GAN generator distribution. We show that under quite strict assumptions, this will allow us to recover the data distribution exactly. We then examine where those strict assumptions break down and design a prac…

2018-10-16abs ↗pdf ↗

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.

New GAN design uses conditional independence graphs to improve model-based GANs.

problem Designing model-based GANs using additional information about underlying distribution.
method Study subadditivity properties of probability divergences to design model-based GANs.
result Model-based GANs using neighborhood discriminators provide significant statistical and computational benefits.

We develop tools for utilizing correspondence experiments to detect illegal discrimination by individual employers. Employers violate US employment law if their propensity to contact applicants depends on protected characteristics such as race or sex. We establish identification of higher moments of the causal effects …

2019-07-15abs ↗pdf ↗

vsOED optimizes experiment design with reinforcement learning for Bayesian models.

problem Optimizing the sequence of experiments in Bayesian models for efficient data collection.
method Reinforcement learning with variational posterior approximations to optimize design policy.
result vsOED achieves superior sample efficiency compared to existing methods.

Machine learning identifies boundaries of real solutions in polynomial systems.

problem Locating boundaries in parameter space for real solutions of polynomial systems.
method Supervised machine learning approach using nearest neighbor and deep learning approximations.
result Efficiently approximates the real discriminant locus for multidimensional parameter spaces.

Generic generation and manipulation of text is challenging and has limited success compared to recent deep generative modeling in visual domain. This paper aims at generating plausible natural language sentences, whose attributes are dynamically controlled by learning disentangled latent representations with designated…

2017-03-02abs ↗pdf ↗

In recent years, kernel-based sparse coding (K-SRC) has received particular attention due to its efficient representation of nonlinear data structures in the feature space. Nevertheless, the existing K-SRC methods suffer from the lack of consistency between their training and test optimization frameworks. In this work,…

2019-03-12abs ↗pdf ↗

Four new methods for computing generalized chi-square distribution.

problem Computing the generalized chi-square distribution accurately and efficiently.
method Two exact and two approximate methods, with software for cdf, pdf, and inverse cdf.
result Comparison of methods' accuracy and speed, identifying best for different cases.

The paper tackles adaptive questioning to classify candidate ability.

problem Designing an optimal sequence of adaptive questions to classify candidate ability.
method Develops lower bounds and geometrical insights for sequential questioning strategies, and arrives at algorithms that match these bounds.
result Asymptotically, any candidate needs to be asked questions at most at two levels, facilitating endogenous exploration.

Bayesian approach for handling incomplete clinical data.

problem Challenges in machine learning with multimodal, incomplete clinical data.
method Generative and discriminative learning, semi-supervised strategy, imputation of missing views.
result Automatic imputation of missing views and robust inference across different data sources.