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

Trend · papers per month

2885768641,152 · Jun 202019922001200920172026
48 results for classification problem

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 ↗

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.

The cost-sensitive classification problem plays a crucial role in mission-critical machine learning applications, and differs with traditional classification by taking the misclassification costs into consideration. Although being studied extensively in the literature, the fundamental limits of this problem are still n…

2018-05-20abs ↗pdf ↗

Probabilistic learning for binary classification with categorical variables.

problem Binary classification with categorical covariates.
method Probabilistic analysis and two algorithms for learning boolean functions.
result Effective learning of boolean functions from binary data.

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.

We show how binary classification methods developed to work on i.i.d. data can be used for solving statistical problems that are seemingly unrelated to classification and concern highly-dependent time series. Specifically, the problems of time-series clustering, homogeneity testing and the three-sample problem are addr…

2012-10-22abs ↗pdf ↗

This paper classifies solutions for a specific geometric problem.

problem Classifying solutions for the planar isotropic LpL_p dual Minkowski problem.
method Converted the ODE for the solution into an integral and studied its asymptotic behavior, duality, and monotonicity.
result Complete classification of solutions for the equation.

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.

Paper proposes a new efficient transport-based dissimilarity measure for time series classification.

problem Classifying time series with warping distortions.
method Defining a problem statement, proposing an Optimal Transport-based dissimilarity measure.
result The proposed method can solve the time series classification problem with reduced computational cost.

ICE algorithm solves exact 0-1 loss linear classification problem efficiently.

problem Exact solution to the 0-1 loss linear classification problem for non-linearly separable data.
method Incremental cell enumeration (ICE) algorithm, leveraging combinatorial and incidence relations.
result First provably optimal algorithm for exact 0-1 loss linear classification problem.

A novel feature selection method for SVM improves model accuracy and interpretability.

problem Feature selection in nonlinear SVM classification problems.
method Embedded min-max optimization problem, leveraging duality theory.
result Improves model accuracy and interpretability on benchmark data sets.

A new method for compressive classification using bridge regression.

problem Efficient pattern classification with compact representation.
method Proposed a deterministic bridge regression solution for compressive classification.
result Validation of the proposed solution through numerical studies on simulated and real-world data.

We study realizations of Lie algebras by vector fields. A correspondence between classification of transitive local realizations and classification of subalgebras is generalized to the case of regular local realizations. A reasonable classification problem for general realizations is rigorously formulated and an algori…

2017-03-02abs ↗pdf ↗

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.

Kernel extreme learning machine (KELM) is a novel feedforward neural network, which is widely used in classification problems. To some extent, it solves the existing problems of the invalid nodes and the large computational complexity in ELM. However, the traditional KELM classifier usually has a low test accuracy when…

2019-02-20abs ↗pdf ↗

Paper shows similarity learning can lead to strong binary classification performance.

problem How similarity learning can lead to good classification performance.
method Product-type formulation of similarity learning is connected to binary classification through an excess risk bound.
result Similarity learning can directly elicit a decision boundary for binary classification.

Bayesian online meta-learning framework tackles catastrophic forgetting in few-shot classification.

problem Catastrophic forgetting in few-shot classification problems.
method Bayesian online learning, meta-learning, Laplace approximation, variational inference.
result Framework effectively achieves goal of overcoming catastrophic forgetting in few-shot classification.

A new meta-meta classification method tackles few-shot learning tasks.

problem Learning with limited data in small-data settings.
method Designing an ensemble of learners for a large set of problems, then learning how to combine them for a new problem.
result Meta-meta classification outperforms traditional meta-learning and ensembling approaches in one-shot learning tasks.

Classification problems in security settings are usually contemplated as confrontations in which one or more adversaries try to fool a classifier to obtain a benefit. Most approaches to such adversarial classification problems have focused on game theoretical ideas with strong underlying common knowledge assumptions, w…

2018-02-21abs ↗pdf ↗

Proposes interpretable time series classification through extracted features.

problem Interpretable time series classification in complex problems.
method Extracts features from time series to improve interpretability of traditional classifiers.
result No statistically significant differences in accuracy compared to state-of-the-art models.

High dimensional data analysis is known to be as a challenging problem. In this article, we give a theoretical analysis of high dimensional classification of Gaussian data which relies on a geometrical analysis of the error measure. It links a problem of classification with a problem of nonparametric regression. We giv…

2008-06-04abs ↗pdf ↗

Classification is a fundamental problem in machine learning and data mining. During the past decades, numerous classification methods have been presented based on different principles. However, most existing classifiers cast the classification problem as an optimization problem and do not address the issue of statistic…

2019-01-03abs ↗pdf ↗

Binary classification is a common statistical learning problem in which a model is estimated on a set of covariates for some outcome indicating the membership of one of two classes. In the literature, there exists a distinction between hard and soft classification. In soft classification, the conditional class probabil…

2014-11-19abs ↗pdf ↗

Classifiers based on sparse representations have recently been shown to provide excellent results in many visual recognition and classification tasks. However, the high cost of computing sparse representations at test time is a major obstacle that limits the applicability of these methods in large-scale problems, or in…

2014-02-09abs ↗pdf ↗

New measure of feature influence in classification problems considering feature dependencies.

problem Measuring the influence of features in classification problems with dependencies.
method Developed a new measure based on cooperative game theory, providing axiomatic characterization and demonstrating its equivalence to the Banzhaf-Owen value.
result The proposed influence measure effectively characterizes feature importance in classification problems with feature dependencies.

We consider the problem of classification when inputs correspond to sets of vectors. This setting occurs in many problems such as the classification of pieces of mail containing several pages, of web sites with several sections or of images that have been pre-segmented into smaller regions. We propose generalizations o…

2011-03-25abs ↗pdf ↗

Improved incremental sequence classification with temporal consistency.

problem Updating predictions as new sequence elements are revealed.
method Temporal-difference learning and a temporal-consistency condition for successive predictions.
result Optimizing a novel loss function improves data efficiency and predictive accuracy.