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

94188281375 · Jun 202019922001200920172026
48 results for Gaussian Classifier

A new method combines simple binary classifiers to build complex multiclass classifiers, achieving performance limits in a Gaussian setting.

problem Building a sophisticated multiclass classifier from simple binary decisions.
method Combining O(logK)O(\log K) simple binary classifiers to form a KK-class classifier.
result Explicit performance bounds across various decoding and dimensional regimes for a stylized Gaussian setting.

We study the robustness of classifiers to various kinds of random noise models. In particular, we consider noise drawn uniformly from the _p\ell\_p ball for p[1,]p \in [1, \infty] and Gaussian noise with an arbitrary covariance matrix. We characterize this robustness to random noise in terms of the distance to the decisio…

2018-02-22abs ↗pdf ↗

DeepCCG adapts classifiers to representation shifts in one step.

problem Adapting classifiers to shifts in continuous representation.
method Empirical Bayesian approach using class conditional Gaussian classifier and KL divergence for selection.
result DeepCCG reduces performance change due to representation shifts.

Study shows how over-parameterized classifiers can still perform well on noisy data.

problem Understanding how maximum margin classifiers perform in over-parameterized settings with noisy data.
method Analyzes maximum margin classifiers on sub-Gaussian mixtures, providing risk bounds.
result Characterizes conditions for 'benign overfitting' in linear classification problems.

Optimal classifiers derived from GMMs are approximated by deep neural networks.

problem Binary classification of high-dimensional overlapping Gaussian mixtures.
method Closed-form expressions for Bayes optimal decision boundaries derived from GMMs' eigenstructure. Empirical validation through synthetic and real-world data.
result Deep neural networks approximate optimal classifiers for GMMs, with decision thresholds related to covariance eigenvectors.

In many cases, neural network classifiers are likely to be exposed to input data that is outside of their training distribution data. Samples from outside the distribution may be classified as an existing class with high probability by softmax-based classifiers; such incorrect classifications affect the performance of …

2020-02-06abs ↗pdf ↗

Paper explores Bayes rule for Gaussian mixtures with missing data, outperforming supervised classifiers.

problem Improving classification accuracy in partially classified samples with missing data.
method Generative model framework with missing-data mechanism, Bayes rule allocation.
result Bayes rule classifier with missing-data mechanism outperforms fully supervised classifiers in various conditions.

Machine learning (ML) classification is increasingly used in safety-critical systems. Protecting ML classifiers from adversarial examples is crucial. We propose that the main threat is that of an attacker perturbing a confidently classified input to produce a confident misclassification. To protect against this we devi…

2019-09-19abs ↗pdf ↗

We introduce a novel approach for training adversarial models by replacing the discriminator score with a bi-modal Gaussian distribution over the real/fake indicator variables. In order to do this, we train the Gaussian classifier to match the target bi-modal distribution implicitly through meta-adversarial training. W…

2017-07-02abs ↗pdf ↗

Classifies surfaces in hyperbolic space with constant Gaussian curvature.

problem Classifying surfaces in hyperbolic space with specific curvature.
method Loop group method, spectral parameter deformation, holomorphic quadratic differentials.
result Weakly complete constant Gaussian curvature surfaces are in one-to-one correspondence with holomorphic quadratic differentials.

The paper presents a probabilistic framework for SPD matrices in machine learning.

problem Machine learning on SPD matrices is fragmented; this paper aims to unify it.
method Unified probabilistic framework using Gaussian distributions and Bayes classifiers.
result Different SPD machine learning tools can be reinterpreted and extended using Gaussian distributions.

Paper uses GMM and MAF for probabilistic classification, outperforming simpler models.

problem Classifying data with complex distributions.
method Density estimation using Gaussian Mixture Model and Masked Autoregressive Flow.
result Proposed classifiers outperform simpler models like linear discriminant analysis.

We study high-dimensional Gaussian mixture classification using statistical physics methods.

problem Classifying high-dimensional Gaussian mixture with general covariance matrices.
method Replica method from statistical physics for asymptotic analysis of convex classifiers.
result Construction and validation of a de-biased estimator for variable selection.

Skew Gaussian Processes improve classification performance by allowing asymmetry.

problem Limited use of Gaussian processes in applications requiring asymmetry.
method Propose Skew-Gaussian processes (SkewGPs) as a non-parametric prior over functions, extending the multivariate Unified Skew-Normal distribution to stochastic processes.
result SkewGPs provide better performance than symmetric Gaussian processes in classification tasks.

The paper explores robust classifiers for imbalanced Gaussian data.

problem Adversarial robustness in machine learning with imbalanced data.
method Developed exact and approximate Bayes-optimal robust classifiers for Gaussian classification problems.
result Revealed fundamental tradeoffs between standard and robust accuracy.

Max-margin classifiers' behavior is studied in high dimensions with non-Gaussian features.

problem Understanding the role of featurization maps and high-dimensional misclassification error.
method High-dimensional asymptotics, Gaussian model, support vector representation.
result Asymptotic behavior of max-margin classifiers is determined by feature covariance and label covariance.

In the framework of supervised classification (discrimination) for functional data, it is shown that the optimal classification rule can be explicitly obtained for a class of Gaussian processes with "triangular" covariance functions. This explicit knowledge has two practical consequences. First, the consistency of the …

2010-04-28abs ↗pdf ↗

GNIs induce a regulariser that penalizes high-frequency components in neural network activations.

problem Understanding the regularizing effect of Gaussian noise injections on neural network activations.
method Deriving the explicit regularizer by marginalizing out injected noise and analyzing its effect in the Fourier domain.
result GNIs induce a regularizer that produces calibrated classifiers with large margins.

We propose an active set selection framework for Gaussian process classification for cases when the dataset is large enough to render its inference prohibitive. Our scheme consists of a two step alternating procedure of active set update rules and hyperparameter optimization based upon marginal likelihood maximization.…

2011-02-22abs ↗pdf ↗

We show how to turn any classifier that classifies well under Gaussian noise into a new classifier that is certifiably robust to adversarial perturbations under the 2\ell_2 norm. This "randomized smoothing" technique has been proposed recently in the literature, but existing guarantees are loose. We prove a tight robu…

2019-02-08abs ↗pdf ↗

We introduce a wrapped Gaussian for SPD matrices, enhancing data analysis.

problem Handling circular and non-flat data distributions on SPD manifolds.
method Introduced a non-isotropic wrapped Gaussian using the exponential map, derived theoretical properties, and proposed a maximum likelihood framework.
result Demonstrated the robustness and flexibility of the wrapped Gaussian model on synthetic and real-world datasets.

Study on clustering in high dimensions with anisotropic Gaussian mixtures, showing interpolation can be optimal and robust.

problem Clustering in high-dimensional anisotropic Gaussian mixtures.
method Derive minimax bounds, analyze 2\ell_2-regularized classifiers, and investigate interpolation's robustness.
result Interpolating solutions can be optimal and robust under certain conditions.

A new method reduces energy consumption in machine learning by using multiple, less costly data sources.

problem High computational and energy costs in machine learning model training.
method Augmented Gaussian Process (AGP-MISO) with multi-source optimization.
result The AGP-MISO method reduces computational time and energy consumption compared to traditional approaches.

Study modular surfaces in Lorentz-Minkowski 3-space, classifying and analyzing their curvature and applications.

problem Understanding the curvature properties of modular surfaces in Lorentz-Minkowski space.
method Analyzing the sign of Gaussian and mean curvature, classifying surfaces, and applying to conformal field theories.
result Complete classification of zero Gaussian curvature modular surfaces and non-existence of non-planar maximal modular surfaces.

Proposes a deep neural network for multi-dimensional functional data classification.

problem Classifying multi-dimensional functional data with non-Gaussian distributions.
method Trains a deep neural network on the principle components of the training data.
result FDNN achieves minimax optimality when log density ratio has a locally connected modular structure.

The study classifies parallel mean curvature spheres in a sphere-hyperbolic product space.

problem Understanding surfaces with parallel mean curvature in a specific Riemannian product space.
method Analyzing the holomorphic quadratic differential and topological constraints.
result Classification of all parallel mean curvature spheres with vanishing differential.

Study selective classification with halfspaces, achieving error bounds under Gaussian distributions.

problem Modeling relationships in subsets of data defined by selection rules.
method Sparse linear classifiers for subsets defined by halfspaces, focusing on Gaussian feature distributions.
result First PAC-learning algorithm for homogeneous halfspace selectors with error guarantee $\bigO*{\sqrt{\mathrm{opt}}}$.

Variational methods have been recently considered for scaling the training process of Gaussian process classifiers to large datasets. As an alternative, we describe here how to train these classifiers efficiently using expectation propagation. The proposed method allows for handling datasets with millions of data insta…

2015-07-16abs ↗pdf ↗

Model predicts epileptic seizures with high accuracy using EEG signals.

problem Predicting epileptic seizures with high accuracy for diagnosis and treatment.
method Pearson's product-moment correlation coefficient with a linear classifier on generalized Gaussian modeling.
result 100% effectiveness for sensitivity and specificity greater than 83%.

Adversarial training can lead to overfitting without compromising robustness.

problem Explaining benign overfitting in adversarially robust linear classification.
method Theoretical analysis and numerical experiments on adversarial training.
result Adversarially trained linear classifiers can achieve near-optimal risks despite overfitting noisy data.