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

Trend · papers per month

6.3%12.5%18.8%25.0% · Oct 199319922001200920182026
48 results for multicategory classification

Paper proposes distributed sparse multicategory discriminant analysis for classification.

problem Sparse multicategory classification with distributed data.
method Convex formulation, distributed setting, invariant discriminant subspace recovery.
result Distributed sparse multicategory linear discriminant analysis performs as good as centralized version after a few rounds of communications.

New methods for multicategory classification with reject and refine options reduce misclassification costs.

problem Reducing misclassification costs in multicategory classification problems.
method Margin-based multicategory classification methods with reject and refine options.
result The refine option provides more constructive information by ruling out implausible classes.

Develops a novel approach for estimating optimal DTRs with multicategory treatments and censored data.

problem Estimating optimal treatment regimes for chronic diseases with censored data.
method Angle-based multicategory classification algorithm for maximizing conditional survival function.
result The proposed method outperforms existing approaches in maximizing conditional survival function.

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 ↗

Proposes MCLLO for assessing and recalibrating multiclass probability predictions.

problem Limited multicategory recalibration methods for assessing and comparing model calibration.
method MCLLO recalibration method that assesses calibration without model access and is easy to interpret.
result MCLLO outperforms other methods in simulations and real-world case studies.

Ordinal data are often seen in real applications. Regular multicategory classification methods are not designed for this data type and a more proper treatment is needed. We consider a framework of ordinal classification which pools the results from binary classifiers together. An inherent difficulty of this framework i…

2015-05-13abs ↗pdf ↗

Classification is an important statistical learning tool. In real application, besides high prediction accuracy, it is often desirable to estimate class conditional probabilities for new observations. For traditional problems where the number of observations is large, there exist many well developed approaches. Recentl…

2016-07-19abs ↗pdf ↗

We generalize categorified Jones-Wenzl projectors in odd Khovanov homology.

problem Categorify Jones-Wenzl projectors for odd Khovanov homology.
method Develop grading multicategories to replace grading categories, proving existence and uniqueness of categorified projectors.
result Existence and uniqueness of categorified Jones-Wenzl projectors in odd Khovanov homology.

Develops methods for near-optimal personalized treatment recommendations.

problem Assigning optimal treatments to patients based on individual characteristics.
method Outcome weighted learning framework to estimate near-optimal alternative individualized treatment recommendations (A-ITR).
result Consistency of proposed methods and upper bound for risk between optimal and estimated recommendations.

Dual-stage sEMG classification improves gesture recognition accuracy.

problem Improving accuracy in hand gesture recognition from sEMG signals.
method Dual-stage classification approach: first stage groups similar activities, second stage classifies within groups.
result Dual-stage classification yields significantly higher accuracy than single-stage approach.

A novel method for classification with rejection using ensemble of cost-sensitive classifiers.

problem Avoid risky misclassification in error-critical applications.
method Learning an ensemble of cost-sensitive classifiers.
result Improved classification accuracy and flexibility in loss selection.

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 ↗

Few-shot image classification is improved by correcting CNNs' texture bias.

problem Few-shot image classification performance is hindered by CNNs' texture bias.
method Corrected CNNs' texture bias using a simpler method than state-of-the-art approaches.
result State-of-the-art performance on miniImageNet task achieved.

Paper introduces LPCs for robust classification with performance bounds.

problem Conventional classification techniques constrain rules and use surrogate losses.
method Robust risk minimization (RRM) for unconstrained classification rules, optimizing 0-1 loss.
result LPCs provide performance bounds and competitive performance with state-of-the-art techniques.

New NHCAs improve multi-category classification efficiency.

problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.

Deep reinforcement learning improves classification accuracy for imbalanced datasets.

problem Imbalanced datasets challenge conventional classification algorithms.
method Formulated as a sequential decision-making process, solved using deep Q-learning network.
result Proposed model outperforms other imbalanced classification algorithms.

Classifies Lie algebra realizations by vector fields.

problem Classifying Lie algebra realizations by vector fields.
method Generalized correspondence between classification of transitive local realizations and subalgebras, formulated a reasonable classification problem, presented an algorithm for construction.
result Algorithm for constructing classification of general realizations.

Classification outperforms regression in portfolio construction, yielding higher Sharpe ratios.

problem Determining which machine learning approach (classification vs. regression) is more effective for portfolio construction.
method Used stacking ensemble of gradient boosted tree, random forest, and neural network models.
result Classification yields higher Sharpe ratios and economically significant alphas compared to regression.

C-HMCNN(h) improves HMC classification by leveraging class hierarchy.

problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.

Advances few-shot classification by treating it as supervised learning and proposing new training techniques.

problem Formulating the ability of humans to learn from limited data in machine learning.
method Formulated few-shot classification as a supervised learning problem and introduced multi-episode and cross-way training techniques.
result Proposed training strategies accelerate the training process without accuracy loss.

Improves NILM with multi-label SRC, outperforming state-of-the-art.

problem Non-intrusive load monitoring (NILM) for energy disaggregation.
method Modified multi-label sparse representation based classification (SRC).
result Significant improvement over state-of-the-art techniques with minimal training data.

New approach improves classification guarantees by focusing on direction rather than regression risk.

problem Improving classification guarantees in binary classification problems.
method Establishing a geometric distinction between classification and regression, leveraging scale invariance.
result Improved guarantees for classification risk compared to regression risk.

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}}}$.

A new network-based high-level data classification method using betweenness centrality.

problem Traditional data classification techniques focus on physical features, while high-level classification considers semantic meaning.
method Proposes a network-based high-level classification technique using betweenness centrality.
result Competent classification performance in nine real datasets compared to traditional models.

Adversaries reprogram text classification models without changing the original network.

problem Reprogramming neural networks trained on discrete input spaces like text classification.
method Context-based vocabulary remapping model for white-box and black-box settings.
result Successfully repurposed various text-classification models for new tasks.

This thesis evaluates text-based vs audio-based classification of mental health interviews.

problem Classifying psychiatric illness using text-based methods.
method Design and evaluate a text classification network on mental health interviews, using belabBERT.
result Text-based classification is a strong alternative to audio-based methods.

This review explores resampling techniques for imbalanced binary classification.

problem Imbalanced classes lead to poor prediction results in classification.
method Classical, cost-sensitive, and Neyman-Pearson paradigms with resampling techniques and classification methods.
result Complex dynamics among resampling techniques, base methods, metrics, and imbalance ratios.

Study on error probability for classification of heavy-tailed renewal processes.

problem Error probability in classification of heavy-tailed renewal processes.
method Asymptotic expressions for Bhattacharyya bound on misclassification error probabilities.
result Obtained asymptotic expressions for misclassification error probabilities.

This paper tackles tweet classification by identifying purpose and position.

problem Difficulties in determining user intention and attitude in short, informal tweets.
method Transformed tweet classification into a multi-label problem and applied a multi-label classification method with post-processing.
result The method effectively classifies tweet purpose and position, outperforming individual classification methods.

Text classification on drug SMILES strings yields competitive drug type classification results.

problem Classifying drug types using conventional text classification methods.
method Treated drug SMILES as sentences and applied basic NLP methods for classification.
result Competitive drug type classification results achieved.

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.

A new method combines topological features with graph convolutional networks for improved paper classification.

problem Classifying papers based on their content and structure.
method Combining topological features of nodes with information propagation through Graph Convolutional Networks (GCN).
result The method improves classification accuracy on CiteSeer and Cora datasets, matching or exceeding text-based classification results.

This work bounds classification error in machine learning for low Bayes error conditions.

problem Understanding the error mismatch between Bayes error and model-based classification error.
method Applying classification error bounds to study the relationship with Kullback-Leibler divergence and proposing a linear approximation for low Bayes error conditions.
result A linear approximation of the classification error bound for low Bayes error conditions is proposed.

Interactive tool helps choose and understand classification metrics.

problem Common metrics for binary classification have limitations.
method Graphical application to visualize and explore evaluation metrics.
result Promotes careful attention to interpretation of metrics.