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

Trend · papers per month

121242362483 · Jun 202019922001200920172026
48 results for classification precision

Paper tackles imbalanced binary classification by optimizing precision and recall directly.

problem Imbalanced binary classification where standard accuracy is misleading.
method Exact constrained reformulations for precision and recall optimization.
result ERO framework outperforms state-of-the-art methods on multiple datasets.

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.

Paper proposes ARB-Loss to improve classification precision in imbalanced datasets.

problem Improving classification precision on minor classes in imbalanced datasets.
method Introduces Attraction-Repulsion-Balanced Loss (ARB-Loss) to balance gradients across different classes.
result ARB-Loss achieves state-of-the-art performance with one-stage training.

It is well-known that the precision of data, hyperparameters, and internal representations employed in learning systems directly impacts its energy, throughput, and latency. The precision requirements for the training algorithm are also important for systems that learn on-the-fly. Prior work has shown that the data and…

2016-07-03abs ↗pdf ↗

Rule-based classifiers quantify uncertainty using Bernoulli random variables.

problem Quantifying the uncertainty of precision estimates for rule-based text classifiers.
method Treat partitions of sub-strings as Bernoulli random variables, compare means using statistical tests, and combine classifiers using Dempster-Shafer theory.
result The approach can be used to combine binary classifiers into a multi-label classifier.

Training of large-scale deep neural networks is often constrained by the available computational resources. We study the effect of limited precision data representation and computation on neural network training. Within the context of low-precision fixed-point computations, we observe the rounding scheme to play a cruc…

2015-02-09abs ↗pdf ↗

The paper analyzes adversarial training effects on classification accuracy.

problem Understanding adversarial training's impact on standard and robust accuracy.
method Derived precise statistical analysis for binary classification problems with Gaussian data.
result Theoretical explanation of standard and robust accuracy trends for adversarial training.

A new metric evaluates classification algorithms at the point of indistinguishability.

problem Evaluating classification algorithms at the point of indistinguishability.
method Set a threshold where algorithm's predictions are indistinguishable from real labels, then measure accuracy of positive labels.
result The new metric avoids pitfalls of existing metrics like AUC and F1-score.

HMQ improves quantization for edge devices with mixed precision.

problem Efficient quantization for edge devices with uniform, power-of-two thresholds.
method Introduces HMQ, a mixed precision quantization block that repurposes Gumbel-Softmax for searching over quantization schemes.
result Achieves competitive and state-of-the-art results on ImageNet despite restrictions.

RCAM-based ensemble combines binary classifiers using similarity and vote scheme.

problem Improving binary classification accuracy through ensemble methods.
method RCAM-based ensemble combining classifiers using similarity and recurrent consult-vote scheme.
result RCAM-based ensemble outperforms individual classifiers and majority voting.

We investigate the classification of topological quandles on some simple manifolds. Precisely we classify all Alexander quandle structures, up to isomorphism, on the real line and the unit circle. For the closed unit interval [0,1][0, 1], we conjecture that there exists only one topological quandle structure on it, i.e. t…

2018-03-02abs ↗pdf ↗

This paper presents the results of an automated volatile organic compound (VOC) classification process implemented by embedding a machine learning algorithm into an Arduino Uno board. An electronic nose prototype is constructed to detect VOCs from three different fruits. The electronic nose is constructed using an arra…

2019-05-15abs ↗pdf ↗

This paper tackles unbiased loss functions for multilabel classification with missing labels.

problem Missing labels in multilabel classification tasks, especially in extreme multi-label classification (XMC).
method Derives unbiased estimators for multilabel reductions, including non-decomposable ones, and addresses increased variance with convex upper-bounds.
result Switching to unbiased estimators can alter the bias-variance trade-off and may require stronger regularization.

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.

SPEQ improves quantized neural networks by stochastic precision sharing and cosine similarity loss.

problem Improving quantized deep neural networks for edge devices.
method SPEQ combines stochastic precision sharing and cosine similarity loss for knowledge distillation.
result SPEQ outperforms existing methods in various tasks.

Study of 4D Ricci solitons with symmetry, finding precise geometric asymptotics.

problem Classifying 4D gradient steady Ricci solitons and understanding their geometric properties.
method Analysis of 4D gradient steady Ricci solitons with O(3)-symmetry under a weak curvature decay condition.
result Find precise geometric asymptotics similar to 3D compact κ-solutions.

There is growing interest in multi-label image classification due to its critical role in web-based image analytics-based applications, such as large-scale image retrieval and browsing. Matrix completion has recently been introduced as a method for transductive (semi-supervised) multi-label classification, and has seve…

2019-04-08abs ↗pdf ↗

In this note, we complete the classification of quasi-alternating Montesinos links. We show that the quasi-alternating Montesinos links are precisely those identified independently by Qazaqzeh-Chbili-Qublan and Champanerkar-Ording. A consequence of our proof is that a Montesinos link LL is quasi-alternating if and onl…

2017-01-29abs ↗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.

Analysis of somatic mutation profiles from cancer patients is essential in the development of cancer research. However, the low frequency of most mutations and the varying rates of mutations across patients makes the data extremely challenging to statistically analyze as well as difficult to use in classification probl…

2019-11-20abs ↗pdf ↗

Convolution and pooling improve kernel methods in image classification.

problem Understanding the interplay between approximation and generalization in convolutional architectures.
method Characterized RKHS of kernels with convolution, pooling, and downsampling, computed generalization error.
result Convolution and pooling operations trade off approximation with generalization power.

In most machine learning applications, classification accuracy is not the primary metric of interest. Binary classifiers which face class imbalance are often evaluated by the FβF_β score, area under the precision-recall curve, Precision at K, and more. The maximization of many of these metrics can be expressed as a con…

2018-02-28abs ↗pdf ↗