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,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Apr 199419922001200920172026
48 results for Probabilistic Classification Vector Machine

Extends PCVM for multi-class classification with improved accuracy.

problem Lack of probabilistic outputs and contradictory predictions in multi-class classification.
method Proposes mPCVM with two learning algorithms: top-down and bottom-up.
result Superior performance, especially with many classes, validated on synthetic and benchmark data.

Transfer learning improves sparse, interpretable probabilistic classification.

problem Sparse and interpretable models in transfer learning.
method Two transfer learning extensions integrated into sparse and interpretable probabilistic classification vector machine.
result Transfer learning extensions improve sparsity and performance.

New method classifies manifold-valued data using Riemannian geometry.

problem Classifying data on curved Riemannian manifolds.
method Probabilistic Learning Vector Quantization on Symmetric Positive Definite Matrices.
result The method outperforms traditional Euclidean methods on manifold-valued data.

We show that the multi-class support vector machine (MSVM) proposed by Lee et. al. (2004), can be viewed as a MAP estimation procedure under an appropriate probabilistic interpretation of the classifier. We also show that this interpretation can be extended to a hierarchical Bayesian architecture and to a fully-Bayesia…

2012-06-27abs ↗pdf ↗

Sparse Bayesian learning is a state-of-the-art supervised learning algorithm that can choose a subset of relevant samples from the input data and make reliable probabilistic predictions. However, in the presence of high-dimensional data with irrelevant features, traditional sparse Bayesian classifiers suffer from perfo…

2016-09-18abs ↗pdf ↗

We propose a probabilistic enhancement of standard kernel Support Vector Machines for binary classification, in order to address the case when, along with given data sets, a description of uncertainty (e.g., error bounds) may be available on each datum. In the present paper, we specifically consider Gaussian distributi…

2019-04-14abs ↗pdf ↗

We define a generalized likelihood function based on uncertainty measures and show that maximizing such a likelihood function for different measures induces different types of classifiers. In the probabilistic framework, we obtain classifiers that optimize the cross-entropy function. In the possibilistic framework, we …

2013-01-16abs ↗pdf ↗

In this paper we propose a simple yet powerful method for learning representations in supervised learning scenarios where each original input datapoint is described by a set of vectors and their associated outputs may be given by soft labels indicating, for example, class probabilities. We represent an input datapoint …

2012-06-18abs ↗pdf ↗

Study proposes new methods to calculate probabilistic benchmarks in noisy data.

problem Identifying opportunities for improvement in comparable units with noisy data.
method 2-step methodology involving undersampling and relevance vector machine.
result Higher discrimination power achieved with macro-economic environment variables.

New framework uses conformal predictions for robust, scalable machine learning classification.

problem Developing robust and reliable machine learning models for classification.
method Introducing scalable classifiers linked to statistical order theory and probabilistic learning theory, defining a score function and conformal safety set.
result Demonstrated practical implications in cybersecurity for identifying DNS tunneling attacks.

Machine learning approaches to multi-label document classification have to date largely relied on discriminative modeling techniques such as support vector machines. A drawback of these approaches is that performance rapidly drops off as the total number of labels and the number of labels per document increase. This pr…

2011-07-13abs ↗pdf ↗

Proposes a probabilistic approach to semi-supervised learning using normalizing flows.

problem Leveraging unlabelled data for semi-supervised learning with limited labelled data.
method Uses a normalizing flow to learn the posterior distribution over predictions for labelled data, serving as a prior for unlabelled data.
result Demonstrates improved performance on various tasks with varying output complexity.

Recently, there has been much interest in finding globally optimal Bayesian network structures. These techniques were developed for generative scores and can not be directly extended to discriminative scores, as desired for classification. In this paper, we propose an exact method for finding network structures maximiz…

2012-06-27abs ↗pdf ↗

Paper proposes fully Bayesian approach for RVM classification, improving accuracy especially in imbalanced data.

problem Difficulty in conducting RVM classification due to lack of closed-form solution for weight parameter posterior.
method Proposes Generic Bayesian and Fully Bayesian approaches with hierarchical hyperprior structure.
result Improves classification performance, especially in imbalanced data.

Discriminative linear models are a popular tool in machine learning. These can be generally divided into two types: The first is linear classifiers, such as support vector machines, which are well studied and provide state-of-the-art results. One shortcoming of these models is that their output (known as the 'margin') …

2012-06-27abs ↗pdf ↗

Proposes an L1-regularized functional SVM for binary classification with functional covariates.

problem Binary classification with multivariate functional covariates.
method L1-regularized functional support vector machine (SVM) with an accompanying algorithm.
result The proposed classifier performs well in prediction and feature selection.

Support Vector Machine (SVM) is an efficient classification approach, which finds a hyperplane to separate data from different classes. This hyperplane is determined by support vectors. In existing SVM formulations, the objective function uses L2 norm or L1 norm on slack variables. The number of support vectors is a me…

2018-04-06abs ↗pdf ↗

Study compares deterministic and probabilistic ML for precise AM component dimensions.

problem Accurately estimate dimensions of additively manufactured parts with variability.
method Employed models integrating continuous and categorical factors, tested deterministic and probabilistic ML methods.
result Gaussian Process Regression and Bayesian Neural Networks provide strong predictive performance and uncertainty quantification.

The least-squares support vector machine is a frequently used kernel method for non-linear regression and classification tasks. Here we discuss several approximation algorithms for the least-squares support vector machine classifier. The proposed methods are based on randomized block kernel matrices, and we show that t…

2017-03-22abs ↗pdf ↗

Bayesian model fuses multiple classifiers with explicit correlation modeling.

problem Combining outputs of multiple classifiers with explicit correlation.
method Hierarchical Bayesian model with correlated Dirichlet distribution.
result Fused classifier performance can be Bayes optimal even for highly correlated base classifiers.

There are various algorithms and methodologies used for automated screening of cervical cancer by segmenting and classifying cervical cancer cells into different categories. This study presents a critical review of different research papers published that integrated AI methods in screening cervical cancer via different…

2018-11-02abs ↗pdf ↗

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.

Quantum SVM improves financial data classification.

problem Classifying financial data using quantum machine learning.
method Application of quantum kernels to financial data, specifically DSEx Broad Index.
result Empirical quantum advantage demonstrated for financial data classification.

The support vector machines (SVM) algorithm is a popular classification technique in data mining and machine learning. In this paper, we propose a distributed SVM algorithm and demonstrate its use in a number of applications. The algorithm is named high-performance support vector machines (HPSVM). The major contributio…

2019-05-01abs ↗pdf ↗

We generalize a support vector machine to a support spinor machine by using the mathematical structure of wedge product over vector machine in order to extend field from vector field to spinor field. The separated hyperplane is extended to Kolmogorov space in time series data which allow us to extend a structure of sup…

2017-09-11abs ↗pdf ↗

New algorithms reduce computational burden for principal support vector machines.

problem High computational cost of principal support vector machines for large datasets.
method Two distributed estimation algorithms for principal support vector machines.
result Statistical efficiency is maintained with distributed algorithms.