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

157314470627 · Jun 202019922001200920172026
48 results for multiple classification

The paper classifies symmetric triads with multiplicities and their applications.

problem Classifying symmetric triads with multiplicities and their applications.
method Developed the theory of symmetric triads with multiplicities, classified abstract triads, and determined corresponding triads for commutative compact triads.
result Classified symmetric triads with multiplicities and their applications.

Introduces Rashomon Capacity to measure predictive multiplicity in probabilistic classifiers.

problem Predictive multiplicity in classification models leading to unjustified decisions.
method Introduces Rashomon Capacity, a metric for probabilistic classifiers, and provides a rigorous derivation.
result Rashomon Capacity captures nuanced score variations and provides strategies for disclosing conflicting models.

The paper tackles fair classification with multiple sensitive features.

problem Existing fair classification methods often consider a single sensitive feature, but in practice, individuals are defined by multiple sensitive features.
method Characterizes Bayes-optimal fair classifiers for multiple sensitive features under various fairness measures, proposing in-processing and post-processing algorithms.
result Bayes-optimal fair classifiers for multiple sensitive features are instance-dependent thresholding rules that rely on a weighted sum of group membership probabilities.

Prediction problems often admit competing models that perform almost equally well. This effect challenges key assumptions in machine learning when competing models assign conflicting predictions. In this paper, we define predictive multiplicity as the ability of a prediction problem to admit competing models with confl…

2019-09-14abs ↗pdf ↗

Physiological signals that provide the objective repression of human affective states are attracted increasing attention in the emotion recognition field. However, the single signal is difficult to obtain completely and accurately description for emotion. Multiple physiological signals fusing models, building the unifo…

2020-01-01abs ↗pdf ↗

The paper extends multiple instance learning to multiclass and regression problems.

problem Learning from aggregate observations where supervision is given to sets of instances.
method Probabilistic framework for various aggregate observations, including classification and regression.
result The proposed estimator has nice convergence properties under mild assumptions.

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.

Logistic regression can handle noisy labels effectively when labels are imperfectly assigned by multiple experts.

problem Label noise in supervised classification due to manual labelling by multiple experts.
method Using approximate posterior probabilities of class membership from multiple experts to train logistic regression models.
result Logistic regression can be robust to label noise when classification difficulty is the only source of errors.

The classification work [5], [9] left unsettled only those anomalous isoparametric hypersurfaces with four principal curvatures and multiplicity pair {4,5},{6,9}\{4,5\},\{6,9\} or {7,8}\{7,8\} in the sphere. By systematically exploring the ideal theory in commutative algebra in conjunction with the geometry of isoparametric hypers…

2011-04-16abs ↗pdf ↗

The paper proposes a novel MKL approach for OCC using p\ell_p-norm constraints.

problem Addressing the MKL problem for one-class classification.
method A min-max saddle point Lagrangian optimisation problem is formulated and solved efficiently.
result The proposed method outperforms baselines and other algorithms on various data sets.

This research improves multimodal systems by adding a second objective and regularisation methods.

problem Improving performance of multimodal systems with multiple objectives and regularisation.
method Introduces a second objective over multimodal fusion using variational inference and regularisation methods.
result Demonstrates potential for multiple objectives and probabilistic methods to lower variance and improve generalisation.

Paper proposes a time-frequency analysis method for blind modulation classification in MIMO systems.

problem Blind modulation classification in MIMO systems with overlapping signals and unknown channel parameters.
method Time-frequency analysis using windowed short-time Fourier transform, conversion to RGB spectrogram images, convolutional neural network for classification, decision fusion.
result Proposed scheme achieves high classification accuracy at different SNRs, outperforming existing methods.

Framework uses dropout to efficiently explore Rashomon set for multiplicity estimation.

problem Efficiently measuring and mitigating conflicting model outputs in classification tasks.
method Dropout-based exploration of Rashomon set for multiplicity estimation.
result Framework outperforms baselines in multiplicity metric estimation with significant runtime speedup.

New loss function improves classification for imbalanced and sensitive groups.

problem Optimizing metrics like balanced error and equal opportunity in imbalanced and sensitive classification.
method Developed a principled vector-scaling (VS) loss function that addresses multiplicative adjustments necessary at terminal training phase.
result The VS loss function improves minority class performance and generalizes to different types of imbalances.

Data stream classification methods demonstrate promising performance on a single data stream by exploring the cohesion in the data stream. However, multiple data streams that involve several correlated data streams are common in many practical scenarios, which can be viewed as multi-task data streams. Instead of handli…

2019-08-15abs ↗pdf ↗

Paper proposes GEG to enhance fairness in binary and multi-class classification.

problem Fairness in multi-class classification tasks is under-explored.
method Formulates multi-objective problem between effectiveness and fairness constraints, proposes GEG algorithm.
result GEG improves fairness up to 92% and decreases accuracy up to 14%.

Improved signal classification using multiple wavelets and their smooth coefficients.

problem Signal classification accuracy declines with reduced attributes.
method Transform data with multiple wavelets, combine outputs, apply ensemble classifiers.
result Proposed technique outperforms raw data and single wavelet approaches.

We study the classification problem of singularities of function-germs with harmonic leading terms of two variables under the right-equivalence. We observe that the multiple actions of Laplacian appear for the classifications of such class of function-germs.

2016-10-29abs ↗pdf ↗

New classifier combines locally linear kernels for fast and accurate non-linear classification.

problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a 1\ell_1 Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels.
result The resulting classifier achieves high accuracy with fast inference time.

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 ↗

Proposes sigmoidF1 loss for multilabel classification, improving performance metrics.

problem Lack of smooth, tractable loss functions for multilabel classification.
method Introduces sigmoidF1, a smooth F1 score surrogate loss function.
result sigmoidF1 outperforms other loss functions on various datasets and metrics.

Tree-based algorithm for functional data analysis reduces generalization error.

problem Classification and regression problems with functional data.
method Constrained convex optimization for weighted functional L2L^{2} space, multiple splitting rules, and weighted integral features.
result Reduces generalization error while maintaining interpretability.

The paper develops distribution-free methods for ordinal classification.

problem Constructing valid prediction sets for ordinal classification problems.
method Leveraging conformal prediction and multiple testing with FWER control.
result The proposed methods achieve satisfactory levels of marginal and class-specific conditional coverages.

Let (M,ω)(M,ω) be a connected symplectic manifold on which a connected Lie group GG acts properly and in a Hamiltonian fashion with moment map $μ:M \lra \mf g^*$. Our purpose is investigate multiplicity-free actions, giving criteria to decide a multiplicity freenes of the action. As an application we give the complete cl…

2004-02-17abs ↗pdf ↗

To explore underlying complementary information from multiple views, in this paper, we propose a novel Latent Multi-view Semi-Supervised Classification (LMSSC) method. Unlike most existing multi-view semi-supervised classification methods that learn the graph using original features, our method seeks an underlying late…

2019-09-09abs ↗pdf ↗

We study the classification problem of singularities of function-germs with harmonic leading terms of two variables under the right-equivalence. We study the classification in the cases that the order of function-germs is at most 7. Moreover, we observe that the multiple actions of Laplacian appear for the classificati…

2015-11-11abs ↗pdf ↗

Efficient algorithm for evaluating hierarchical classification methods at multiple operating points.

problem Evaluating hierarchical classification methods at multiple operating points.
method Efficient algorithm to produce operating characteristic curves for any method that assigns scores to every class in the hierarchy.
result Top-down classifiers are dominated by a naive flat softmax classifier across the entire operating range.

This paper classifies Hamiltonian actions by symplectic groupoids using Delzant subspaces.

problem Classifying Hamiltonian actions by regular proper symplectic groupoids.
method Using Delzant subspaces and cohomology groups to classify actions.
result Classifies faithful multiplicity-free Hamiltonian actions in terms of Delzant subspaces.