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.

169,051 papers · 148 categories

Trend · papers per month

1122 · Oct 201819922001200920182026
26 results for Multiclass-Classifier

Paper studies multiclass classifiers from binary classifiers, proving methods and demonstrating advantages.

problem Constructing efficient multiclass classifiers from binary ones.
method Two methods: one vs. all and hierarchical classification, with a new leverage-hierarchical method introduced.
result Proves upper bounds and exact formulas for multiclass regret in terms of binary regrets.

Paper proposes MCMA architecture for neural approximate computing with higher invocation rate and energy savings.

problem Limited invocation rate of neural approximators leading to suboptimal energy efficiency.
method Introduces MCMA architecture with a multiclass classifier and multiple approximators, sharing hardware resources and efficiently swapping approximators.
result Significantly higher invocation rate and energy savings compared to existing methods.

Paper presents a new method for multiclass classification using hyperplane arrangements.

problem Developing efficient multiclass classifiers.
method Mixed integer programming formulations with hyperplane arrangements, kernel trick adaptation, and dimensionality reductions.
result Our proposal outperforms other methods in multiclass classification tasks.

Paper tackles noisy bandit feedback for multiclass classification.

problem Learning multiclass classifier with corrupted feedback.
method Proposes an unbiased estimator technique to estimate noise rates and an end-to-end framework.
result Algorithm achieves mistake bounds of O(T)O(\sqrt{T}) in high noise and O(Ticefrac23)O(T^{ icefrac{2}{3}}) in worst case.

We propose a new splitting criterion for a meta-learning approach to multiclass classifier design that adaptively merges the classes into a tree-structured hierarchy of increasingly difficult binary classification problems. The classification tree is constructed from empirical estimates of the Henze-Penrose bounds on t…

2017-11-09abs ↗pdf ↗

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.

Proposes a new method to improve multiclass probability calibration.

problem Uncalibrated class probabilities in multiclass classifiers leading to over-confidence.
method Dirichlet calibration method applicable to any model class, derived from Dirichlet distributions.
result Improved probabilistic predictions across various datasets and classifiers.

Gradient boosted decision trees are a popular machine learning technique, in part because of their ability to give good accuracy with small models. We describe two extensions to the standard tree boosting algorithm designed to increase this advantage. The first improvement extends the boosting formalism from scalar-val…

2017-10-31abs ↗pdf ↗

Paper designs optimal ECOCs using IP for robust multiclass classification.

problem Designing robust ECOCs for multiclass classification.
method Integer Programming formulation to minimize codebooks with desirable error-correcting properties, leveraging graph-theoretic structure and edge clique covers.
result IP-generated codebooks achieve high nominal and robust adversarial accuracy.

Data mining techniques predict breast cancer types with high accuracy.

problem Early detection of breast cancer to reduce mortality rates.
method Twelve classification algorithms applied to the Breast Cancer Wisconsin dataset.
result High accuracy in predicting malignant and benign breast cancer.

Geometry-aware KDE model improves multiclass quantification.

problem Accurately estimating class prevalence for label shift adaptation.
method Log-ratio representations and Aitchison geometry for compositional data, shrinkage regularization.
result Competitive with state-of-the-art quantifiers, often improving over standard KDE-based baselines.

Binary and multiclass epilepsy detection methods using EEG features.

problem Epilepsy diagnosis from EEG data.
method Feature extraction from power spectrum, spectrogram, and bispectrogram; eight machine learning algorithms used.
result Random forest and backpropagation algorithms achieved highest accuracy for binary and multiclass classification.

A new weighted MCC measure improves classifier performance evaluation.

problem Lack of measures sensitive to observation weights in multiclass classification.
method Proposes weighted versions of Pearson-Matthews Correlation Coefficient (MCC) for binary and multiclass classification.
result Weighted MCC values are higher for classifiers that perform better on highly weighted observations.

New method gives provable error bounds for neural nets under distribution shift.

problem Proving reliable error bounds for neural networks under distribution shift.
method Optimizing a classifier to disagree with another, using a new 'disagreement loss'.
result Valid error bounds with comparable accuracy to competitive methods.

EAST aligns neural network classifiers with user-defined evaluation metrics.

problem Mismatch between neural network training and evaluation metrics leads to suboptimal performance.
method EAST uses dynamic thresholding, soft-set confusion matrix, and annealing to align neural network predictions with target evaluation metrics.
result EAST improves alignment between training objectives and evaluation metrics, outperforming existing methods.

Delaytron learns multi-class classifiers with delayed feedbacks, achieving efficient regret bounds.

problem Learning multi-class classifiers with delayed bandit feedbacks where delays are unknown.
method Online algorithm Delaytron with adaptive learning for unknown delays.
result Achieves efficient regret bounds for various loss scenarios.