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

7.5%15.0%22.5%30.0% · May 199519922001200920172026
48 results for classifier techniques

Dynamic Ensemble Selection (DES) techniques aim to select locally competent classifiers for the classification of each new test sample. Most DES techniques estimate the competence of classifiers using a given criterion over the region of competence of the test sample (its the nearest neighbors in the validation set). T…

2018-04-18abs ↗pdf ↗

This study evaluates data pre-processing techniques for class imbalance in biomedical data.

problem Class imbalance in biomedical datasets affects model performance.
method Resampling and feature selection techniques evaluated using SVM, C4.5, LDA, and KNN classifiers.
result Feature Selection outperforms other methods in most cases, especially with SVM.

This paper extends the earlier work on an oscillating error correction technique. Specifically, it extends the design to include further corrections, by adding new layers to the classifier through a branching method. This technique is still consistent with earlier work and also neural networks in general. With this ext…

2017-11-19abs ↗pdf ↗

Regulators require financial institutions to estimate counterparty default risks from liquid CDS quotes for the valuation and risk management of OTC derivatives. However, the vast majority of counterparties do not have liquid CDS quotes and need proxy CDS rates. Existing methods cannot account for counterparty-specific…

2017-05-19abs ↗pdf ↗

We introduce the State Classification Problem (SCP) for hybrid systems, and present Neural State Classification (NSC) as an efficient solution technique. SCP generalizes the model checking problem as it entails classifying each state ss of a hybrid automaton as either positive or negative, depending on whether or not …

2018-07-26abs ↗pdf ↗

This paper surveys deep learning techniques for non-neural classifiers.

problem Improving performance and generality of non-neural classifiers using deep learning methods.
method Reviews feature learning, optimization, and regularization methods from deep networks for non-neural classifiers.
result Many opportunities and challenges remain for expanding deep learning to non-neural classifiers.

We consider a discriminative learning (regression) problem, whereby the regression function is a convex combination of k linear classifiers. Existing approaches are based on the EM algorithm, or similar techniques, without provable guarantees. We develop a simple method based on spectral techniques and a `mirroring' tr…

2013-11-11abs ↗pdf ↗

Proposes dynamic model type recommendation for OLP technique.

problem Limited local competence of base-classifiers in uneven data distributions.
method Builds a multi-label meta-classifier to recommend model types based on local data complexity.
result Statistically similar performance to original OLP with fixed base-classifier model.

We present a theoretical analysis and empirical evaluations of a novel set of techniques for computational cost reduction of classifiers that are based on learned transform and soft-threshold. By modifying optimization procedures for dictionary and classifier training, as well as the resulting dictionary entries, our t…

2015-04-26abs ↗pdf ↗

VORACE uses random classifiers to vote for the best class, saving time and expertise.

problem Finding the best classifier for a dataset is costly and requires domain expertise.
method Randomly generated classifiers vote to determine the best class ranking.
result VORACE outperforms state-of-the-art methods on various datasets.

PLIs improve classifier performance by fine-tuning latent representations.

problem Difficult interpretation of high-dimensional latent representations in neural networks.
method Back-propagation of manual changes to low-dimensional embeddings using t-distributed stochastic neighbourhood embeddings.
result Manual separation of class clusters in latent space enhances classifier performance.

In this paper, we propose a novel dynamic ensemble selection framework using meta-learning. The framework is divided into three steps. In the first step, the pool of classifiers is generated from the training data. The second phase is responsible to extract the meta-features and train the meta-classifier. Five distinct…

2018-11-01abs ↗pdf ↗

The use of alternative measures to evaluate classifier performance is gaining attention, specially for imbalanced problems. However, the use of these measures in the classifier design process is still unsolved. In this work we propose a classifier designed specifically to optimize one of these alternative measures, nam…

2013-05-07abs ↗pdf ↗

Recent research has repeatedly shown that machine learning techniques can be applied to either whole files or file fragments to classify them for analysis. We build upon these techniques to show that for samples of un-labeled compiled computer object code, one can apply the same type of analysis to classify important a…

2018-05-06abs ↗pdf ↗

Dynamic classifier chains with XGBoost reduces multi-label classification costs and improves label dependency handling.

problem Static label ordering in multi-label classification limits model performance.
method Combining dynamic classifier chains with XGBoost for efficient multi-label prediction.
result Dynamic label ordering improves model performance and reduces training costs.

AutoML explores vs. exploits promising classifiers to improve performance.

problem Maximizing ML pipeline performance within limited time and resource constraints.
method Empirical study comparing exploiting vs. exploring the search space for promising classifiers.
result Exploiting the most promising classifiers does not statistically improve pipeline performance.

Class imbalance problem is commonly faced while developing machine learning models for real-life issues. Due to this problem, the fitted model tends to be biased towards the majority class data, which leads to lower precision, recall, AUC, F1, G-mean score. Several researches have been done to tackle this problem, most…

2019-08-18abs ↗pdf ↗

For many natural language processing (NLP) tasks the amount of annotated data is limited. This urges a need to apply semi-supervised learning techniques, such as transfer learning or meta-learning. In this work we tackle Named Entity Recognition (NER) task using Prototypical Network - a metric learning technique. It le…

2018-12-14abs ↗pdf ↗

This work presents a new classifier that is specifically designed to be fully interpretable. This technique determines the probability of a class outcome, based directly on probability assignments measured from the training data. The accuracy of the predicted probability can be improved by measuring more probability es…

2017-10-27abs ↗pdf ↗

The study classifies and imitates trading agents in financial markets.

problem Classifying and imitating trading agents in continuous double auctions.
method Developed an agent-based model for trading, applied opponent modeling for classification, and used behavioral cloning for imitation.
result Techniques for classification and imitation were experimentally compared and evaluated.

With the widespread use of the internet, the size of the text data increases day by day. Poems can be given as an example of the growing text. In this study, we aim to classify poetry according to poet. Firstly, data set consisting of three different poetry of poets written in English have been constructed. Then, text …

2018-10-24abs ↗pdf ↗

There is a rising interest in studying the robustness of deep neural network classifiers against adversaries, with both advanced attack and defence techniques being actively developed. However, most recent work focuses on discriminative classifiers, which only model the conditional distribution of the labels given the …

2018-02-19abs ↗pdf ↗

Paper presents an efficient algorithm for learning minimax risk classifiers with large-scale data.

problem Efficient learning of minimax risk classifiers for large-scale data with multiple classes.
method Combination of constraint and column generation for efficient learning.
result 10x speedup for general large-scale data and 100x speedup with many classes.

Adversarial consistency depends on the uniqueness of adversarial Bayes classifiers.

problem Consistency of adversarial surrogate losses is not guaranteed.
method Connected consistency of adversarial surrogate losses to the uniqueness of adversarial Bayes classifiers.
result A convex surrogate loss is statistically consistent for adversarial learning if and only if the adversarial Bayes classifier is unique.

New method generates realistic adversarial images with smaller perturbations.

problem Generating realistic adversarial images with small perturbations.
method Imposes spatial distortions (scaling, rotation, shear, translation) in addition to perturbations.
result Produces visually more realistic attacks that deceive classifiers without affecting human predictions.

The paper studies consistency of surrogate loss procedures under constrained classifiers.

problem Consistency of surrogate loss approaches under constrained classifiers without correct specification.
method The paper develops theoretical results and hinge loss based procedures for a constrained classification problem.
result Hinge losses are the only surrogate losses that preserve consistency in second-best scenarios.

A new QDA classifier for high-dimensional data with spiked covariance.

problem Classifying high-dimensional data with distinct covariance matrices.
method Proposes a novel quadratic classification technique with parameters chosen to maximize the fisher-discriminant ratio.
result The proposed classifier outperforms classical R-QDA and requires lower computational complexity.

It is widely known in the machine learning community that class noise can be (and often is) detrimental to inducing a model of the data. Many current approaches use a single, often biased, measurement to determine if an instance is noisy. A biased measure may work well on certain data sets, but it can also be less effe…

2014-03-07abs ↗pdf ↗

We present a novel algorithm (Principal Sensitivity Analysis; PSA) to analyze the knowledge of the classifier obtained from supervised machine learning techniques. In particular, we define principal sensitivity map (PSM) as the direction on the input space to which the trained classifier is most sensitive, and use anal…

2014-12-21abs ↗pdf ↗

Classifies totally geodesic submanifolds in specific geometric spaces.

problem Identifying totally geodesic submanifolds in homogeneous nearly Kähler 6-manifolds and their G2-cones.
method Developed new techniques for studying totally geodesic submanifolds in analytic Riemannian manifolds, homogeneous spaces, and Riemannian cones.
result Obtained a classification of totally geodesic submanifolds in homogeneous nearly Kähler 6-manifolds and their G2-cones.

Process Mining consists of techniques where logs created by operative systems are transformed into process models. In process mining tools it is often desired to be able to classify ongoing process instances, e.g., to predict how long the process will still require to complete, or to classify process instances to diffe…

2018-09-16abs ↗pdf ↗

A review of nearest neighbour classifiers, focusing on similarity measures and computational efficiency.

problem Improving the performance of nearest neighbour classifiers.
method Explains mechanisms for assessing similarity (distance), identifying nearest neighbours, and reducing data dimensionality.
result Added new sections on time-series similarity measures, retrieval speed-up, and intrinsic dimensionality.