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

2905808701,160 · Jun 202019922001200920172026
48 results for classification algorithms

The paper examines how algorithmic classification affects behavior and proposes democratizing stakes to mitigate predatory practices.

problem The impact of algorithmic classification on individual behavior and fairness in decision-making processes.
method Characterization of optimal classification by an algorithm designer and analysis of the effect of democratizing stakes.
result Optimal classification can lead to surprising behavior patterns, and democratizing stakes can mitigate predatory practices.

Paper compares AutoML methods for recommending classification algorithms.

problem Finding the best classification algorithm for a dataset.
method Four AutoML methods using Evolutionary Algorithms and CASH approach.
result EA-based methods, especially decision-tree induction, produce interpretable models.

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.

Paper analyzes multiclass classification with high-dimensional data.

problem Understanding statistical properties and behavior of multiclass classification algorithms.
method Asymptotic analysis of linear multiclass classification.
result Test error varies significantly across different training algorithms and data distributions.

Sequence classification is an important data mining task in many real world applications. Over the past few decades, many sequence classification methods have been proposed from different aspects. In particular, the pattern-based method is one of the most important and widely studied sequence classification methods in …

2019-05-17abs ↗pdf ↗

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.

Algorithm minimizes risk for multiclass classification of stochastic diffusion paths.

problem Multiclass classification of stochastic diffusion paths with distinct drift functions.
method Empirical risk minimization using L2 risk.
result Achieves fast rates of convergence under margin assumption.

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.

The study examines machine learning classification algorithms and their generalizability using Framingham Heart Study data.

problem Addressing biases and generalizability issues in machine learning classification algorithms.
method Comparison of eight machine learning classification algorithms on Framingham Heart Study data.
result Double discriminant scoring of type I is the most generalizable algorithm.

Fair classification has been a topic of intense study in machine learning, and several algorithms have been proposed towards this important task. However, in a recent study, Friedler et al. observed that fair classification algorithms may not be stable with respect to variations in the training dataset -- a crucial con…

2019-02-21abs ↗pdf ↗

Classification is an important supervised machine learning method, which is necessary and challenging issue for ecological research. It offers a way to classify a dataset into subsets that share common patterns. Notably, there are many classification algorithms to choose from, each making certain assumptions about the …

2018-12-21abs ↗pdf ↗

Crowdsourcing utilizes the wisdom of crowds for collective classification via information (e.g., labels of an item) provided by labelers. Current crowdsourcing algorithms are mainly unsupervised methods that are unaware of the quality of crowdsourced data. In this paper, we propose a supervised collective classificatio…

2015-07-23abs ↗pdf ↗

New algorithms for hierarchical classification using conformal prediction.

problem Valid prediction sets in hierarchical classification tasks.
method Extended split conformal prediction framework with two inference algorithms.
result Empirical evaluations show effectiveness in achieving nominal coverage.

Gaptron algorithm reduces mistakes in online multiclass classification.

problem Online multiclass classification with limited information.
method Randomized first-order algorithm exploiting the gap between zero-one loss and surrogate losses.
result First linear time algorithm with O(KT)O(K\sqrt{T}) expected regret.

We give complete algorithms and source code for constructing (multilevel) statistical industry classifications, including methods for fixing the number of clusters at each level (and the number of levels). Under the hood there are clustering algorithms (e.g., k-means). However, what should we cluster? Correlations? Ret…

2016-07-17abs ↗pdf ↗

Active deep learning classification of hyperspectral images is considered in this paper. Deep learning has achieved success in many applications, but good-quality labeled samples are needed to construct a deep learning network. It is expensive getting good labeled samples in hyperspectral images for remote sensing appl…

2016-11-30abs ↗pdf ↗

As machine learning algorithms become increasingly sophisticated to exploit subtle features of the data, they often become more dependent on simulations. This paper presents a new approach called weakly supervised classification in which class proportions are the only input into the machine learning algorithm. Using on…

2017-02-01abs ↗pdf ↗

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 new network-based method for high-level data classification without normalization.

problem Evaluation and classification of data with hidden attribute interactions.
method A new network-building methodology based on attribute-attribute interactions, avoiding normalization.
result Improvement in accuracy of high-level classification using betweenness centrality.

The paper investigates AI robustness through experiments and statistical analysis.

problem Inaccurate AI predictions can lead to safety and adoption issues.
method Design of experiments framework to study AI classification robustness.
result AI algorithms' robustness is influenced by various factors.

A new algorithm efficiently selects features for functional data classification.

problem Feature selection and classification of functional data in high-dimensional spaces.
method Developed a novel optimization problem integrating logistic loss and functional features. Employed functional principal components and a new adaptive Dual Augmented Lagrangian algorithm for efficient minimization.
result FSFC outperforms other methods in computational time and classification accuracy.

SOAR generates rules for both positive and negative classes in binary classification.

problem Lack of interpretability in machine learning models for binary classification.
method Extends or-of-and classification technique to both positive and negative classes.
result Competitive classification performance with simulated-annealing optimization.

Improved ROCKET algorithm for brain activity classification.

problem Classifying multivariate time series data from brain activity.
method Detach-Rocket Ensemble, leveraging pruning and ensemble methods.
result Competitive classification accuracy and interpretable channel relevance.

Cost-Sensitive Online Classification has drawn extensive attention in recent years, where the main approach is to directly online optimize two well-known cost-sensitive metrics: (i) weighted sum of sensitivity and specificity; (ii) weighted misclassification cost. However, previous existing methods only considered firs…

2018-04-06abs ↗pdf ↗

Study on missing data mechanisms and simple imputation methods in fairness of machine learning algorithms.

problem Impact of missing data mechanisms and simple imputation methods on fairness of machine learning algorithms.
method Three popular datasets for classification fairness were used. Missing values were generated using three missing data mechanisms. Various missing data handling techniques (listwise deletion, mean imputation, mode imputation, multiple imputation) were applied to the datasets. Fairness was assessed using classification algorithms (random forests).
result Missing data mechanism does not significantly impact fairness; listwise deletion gives highest fairness on average.

This paper studies fairness and privacy in federated learning, proposing algorithms to balance both.

problem Joint impact of differential privacy and fairness in federated classification.
method Proposes FDP-Fair and CDP-Fair algorithms for demographic disparity constrained classification under federated differential privacy.
result Established theoretical guarantees on privacy, fairness, and excess risk control.

This paper evaluates algorithms for classification and outlier detection accuracies in temporal data. We focus on algorithms that train and classify rapidly and can be used for systems that need to incorporate new data regularly. Hence, we compare the accuracy of six fast algorithms using a range of well-known time-ser…

2018-05-02abs ↗pdf ↗

Langevin algorithms improve training of very deep neural networks, especially for image classification.

problem Training very deep neural networks is challenging due to increased non-linearity and the risk of getting stuck in local minima.
method Comparison of Langevin and non-Langevin algorithms for training deep neural networks, introduction of Layer Langevin algorithm.
result Langevin algorithms, especially Layer Langevin, lead to significant improvements in training deep neural networks, particularly for image classification tasks.

New algorithm uses random projections for robust, sparse data classification.

problem Improving robustness and sparsity in data classification.
method Randomly projects data into a high-dimensional space, truncates small entries, and applies a cap operation.
result The method enhances classification accuracy with minimal loss, especially in noisy conditions.

The sparse group lasso optimization problem is solved using a coordinate gradient descent algorithm. The algorithm is applicable to a broad class of convex loss functions. Convergence of the algorithm is established, and the algorithm is used to investigate the performance of the multinomial sparse group lasso classifi…

2012-05-06abs ↗pdf ↗

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.

New algorithm reduces feature count and accelerates error convergence.

problem Exponential error convergence in data classification with optimized random features.
method Optimized random features accelerated by quantum machine learning.
result Achieves exponential error convergence under low-noise condition.