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

Trend · papers per month

11213242 · Jun 202019922001200920172026
48 results for multi-class categorization

Study compares BERT and XLNet for multi-class categorization of product descriptions.

problem Robustness of multi-class categorization using pre-trained contextualized language models.
method Fine-tuning BERT and XLNet on Amazon product data for multi-class classification.
result Performance decreases linearly with the number of class labels, with BERT consistently outperforming XLNet.

Study categorizes mutual funds using natural language processing from unstructured data.

problem Categorizing mutual funds using unstructured data for financial analysis.
method Used natural language processing models to classify mutual funds from their investment strategy descriptions.
result High accuracy in categorizing mutual funds using NLP from unstructured data.

Automated feature selection is important for text categorization to reduce the feature size and to speed up the learning process of classifiers. In this paper, we present a novel and efficient feature selection framework based on the Information Theory, which aims to rank the features with their discriminative capacity…

2016-02-09abs ↗pdf ↗

This research sets limits on how complex multi-class learning problems can be.

problem Understanding the complexity of multi-class classification problems.
method Established upper bounds on Natarajan dimensions for specific function classes.
result Upper bounds on Natarajan dimensions for multi-class decision trees, random forests, and neural networks.

Develops a machine learning framework for identifying authorship in texts.

problem Identifying the author of texts, especially when authors are unknown or multiple.
method Formulates authorship identification as a text categorization problem, uses supervised machine learning with stylometric features.
result A model accurately predicts authorship with high accuracy, especially with linguistic stylometric features.

Paper develops new algorithms for unsupervised multi-class domain adaptation.

problem Improving performance of machine learning models across different domains without labeled data.
method Introduces MCSD divergence and a new domain adaptation bound, develops adversarial learning objectives, and proposes new algorithms like McDalNets and SymmNets.
result New algorithms improve performance across different domain adaptation settings.

Paper investigates methods to improve classification by inducing a hierarchy from flat labels.

problem Improving classification performance on datasets lacking a natural hierarchy.
method The approach involves clustering conditional distributions and using a hierarchical classifier with the induced hierarchy.
result The methods can discover latent hierarchies and improve accuracy in various applications.

Develops algorithms for multi-class Neyman-Pearson classification with cost sensitivity.

problem Asymmetric misclassification costs in multi-class classification problems.
method Establishes connection with cost-sensitive learning, proposes two algorithms, extends NP oracle properties.
result Proposes algorithms with theoretical guarantees for multi-class Neyman-Pearson classification.

This work presents a new strategy for multi-class classification that requires no class-specific labels, but instead leverages pairwise similarity between examples, which is a weaker form of annotation. The proposed method, meta classification learning, optimizes a binary classifier for pairwise similarity prediction a…

2019-01-02abs ↗pdf ↗

We consider a problem of risk estimation for large-margin multi-class classifiers. We propose a novel risk bound for the multi-class classification problem. The bound involves the marginal distribution of the classifier and the Rademacher complexity of the hypothesis class. We prove that our bound is tight in the numbe…

2015-07-10abs ↗pdf ↗

Paper proposes GEG to enhance fairness in binary and multi-class classification.

problem Fairness in multi-class classification tasks is under-explored.
method Formulates multi-objective problem between effectiveness and fairness constraints, proposes GEG algorithm.
result GEG improves fairness up to 92% and decreases accuracy up to 14%.

Combines neural networks and STL for multi-class time-series classification.

problem Lack of interpretability in neural networks for time-series data.
method Proposes a method that uses neural networks to classify time-series data using STL specifications, introducing margin for multi-class classification and STL-based attributes for interpretability.
result Evaluations show improved interpretability and performance compared to state-of-the-art baselines.

A new method identifies class-specific covariates in multi-class prediction tasks.

problem Identifying covariates specifically associated with one or more outcome classes in multi-class prediction tasks.
method Introducing multi forests (MuFs) with multi-way and binary splits to measure class-associated discriminatory ability.
result The multi-class VIM specifically ranks class-associated covariates highly, unlike conventional VIMs.

Symmetrizes loss functions to improve neural network robustness against noisy labels.

problem Designing robust loss functions for noisy labels in neural networks.
method Symmetrization of multi-class loss functions, focusing on cross-entropy and unhinged loss.
result The multi-class unhinged loss is the unique convex symmetric loss under suitable assumptions.

Paper proposes MMVFL for multi-class VFL with multiple participants.

problem Privacy-preserving multi-class VFL with multiple participants.
method Extends multi-view learning to enable label sharing among multiple VFL participants.
result MMVFL effectively shares label information among multiple VFL participants and matches multi-class classification performance.

New calibration measures for multi-class classification improve model accuracy.

problem Calibration of multi-class classification models is insufficient for safety-critical applications.
method Developed new calibration measures and estimators for multi-class classification.
result Proposed estimators improve interpretability and accuracy of calibration measures.

Due to myriads of classes, designing accurate and efficient classifiers becomes very challenging for multi-class classification. Recent research has shown that class structure learning can greatly facilitate multi-class learning. In this paper, we propose a novel method to learn the class structure for multi-class clas…

2012-02-14abs ↗pdf ↗

Paper tackles cybersecurity attack detection with an ensemble approach.

problem Challenges in multi-class classification for cyber security breaches.
method Designing a multi-node multi-class classification ensemble approach.
result Proposed approach outperforms full-data approach in multi-node data-censoring cases.

New method calibrates multi-class predictions efficiently without sacrificing accuracy.

problem Efficiently calibrating multi-class predictions without sacrificing accuracy.
method Formulated robust projected smooth calibration and new recalibration algorithms.
result Achieves strong guarantees for binary classification tasks with polynomial complexity.

Improves probability estimates for small datasets in multi-class problems.

problem Inaccurate probability estimates in classification tasks, especially on small datasets.
method Introduced Data Generation and Grouping algorithm to improve calibration on small datasets, then applied to multi-class problems.
result Calibration error can be decreased using the proposed approach.

The study analyzes multi-class teacher-student perceptron performance and generalization errors.

problem Analyzing multi-class classification with the teacher-student perceptron.
method Deriving asymptotic expressions for Bayes-optimal and empirical risk minimization (ERM) generalization errors.
result Regularised cross-entropy minimization yields close-to-optimal accuracy for multi-class classification.

We consider the problem of multi-class classification and a stochastic opti- mization approach to it. We derive risk bounds for stochastic mirror descent algorithm and provide examples of set geometries that make the use of the algorithm efficient in terms of error in k.

2016-06-30abs ↗pdf ↗

Improves ROC/AUC for multi-class classification.

problem Lack of sensible plots, sensitivity to imbalanced data, inability to specify mis-classification cost, and lack of evaluation uncertainty quantification.
method Factorizes multi-class ROC into a one-dimensional vector representation for visualization and summary.
result Provides a binary AUC-equivalent summary and mis-classification weights specification.

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.

Study extends learnability equivalence to multi-class and regression, overcoming binary classification limits.

problem Equivalence of online and private learnability in multi-class and regression settings.
method Introduced a novel Littlestone dimension variant and threshold functions for multi-class classification.
result Online learnability implies private learnability in multi-class classification but not in regression.

Domain generalization is the problem of assigning labels to an unlabeled data set, given several similar data sets for which labels have been provided. Despite considerable interest in this problem over the last decade, there has been no theoretical analysis in the setting of multi-class classification. In this work, w…

2019-05-24abs ↗pdf ↗

Multi-class classification with a very large number of classes, or extreme classification, is a challenging problem from both statistical and computational perspectives. Most of the classical approaches to multi-class classification, including one-vs-rest or multi-class support vector machines, require the exact estima…

2018-11-24abs ↗pdf ↗

In the last few years, many different performance measures have been introduced to overcome the weakness of the most natural metric, the Accuracy. Among them, Matthews Correlation Coefficient has recently gained popularity among researchers not only in machine learning but also in several application fields such as bio…

2010-08-17abs ↗pdf ↗

Improved algorithms solve multi-period multi-class packing problems with bandit feedback.

problem Optimizing item packing under budget constraints with class-dependent rewards and bandit feedback.
method Developed a new estimator and a closed-form bandit policy for linear contextual multi-class multi-period packing problems.
result The proposed policy achieves sublinear regret in non-degenerate contexts, significantly outperforming benchmarks.

The number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present classification software in which the partitioning of multi-class classification…

2014-04-15abs ↗pdf ↗

ETGP improves multi-class classification efficiency.

problem Efficiently handling non-stationary, dependent multi-class classification problems.
method ETGP uses transformed Gaussian processes with efficient sparse variational inference.
result ETGPs outperform state-of-the-art methods in multi-class classification tasks.

Machine Learning has become very famous currently which assist in identifying the patterns from the raw data. Technological advancement has led to substantial improvement in Machine Learning which, thus helping to improve prediction. Current Machine Learning models are based on Classical Theory, which can be replaced b…

2018-10-10abs ↗pdf ↗

Recent studies in the literature have paid much attention to the sparsity in linear classification tasks. One motivation of imposing sparsity assumption on the linear discriminant direction is to rule out the noninformative features, making hardly contribution to the classification problem. Most of those work were focu…

2014-12-26abs ↗pdf ↗

StructureBoost improves gradient boosting for complex categorical variables efficiently.

problem Efficiently handling complex categorical variables with known structure.
method Two methods to overcome computational obstacles in SCDT enumeration for structured categorical variables.
result StructureBoost outperforms existing packages on complex categorical problems.

Categorical bundles provide a natural framework for gauge theories involving multiple gauge groups. Unlike the case of traditional bundles there are distinct notions of triviality, and hence also of local triviality, for categorical bundles. We study categorical principal bundles that are product bundles in the categor…

2015-06-14abs ↗pdf ↗