The goal in extreme multi-label classification is to learn a classifier which can assign a small subset of relevant labels to an instance from an extremely large set of target labels. Datasets in extreme classification exhibit a long tail of labels which have small number of positive training instances. In this work, w…
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,695 papers · 148 categories
Trend · papers per month
48 results for “Extreme classification”
The paper classifies rotationally symmetric extremal Kähler metrics on complex manifolds.
problem Classifying extremal Kähler metrics on complex manifolds.
method Analyzing polynomial zeros in Calabi's extremal equation.
result No invariant complete extremal Kähler metrics on with positive bisectional curvature.
New loss functions improve extreme classification with missing labels.
problem Large number of infrequent labels and missing labels in XMC.
method Derive unbiased loss functions for XMC, incorporating them into existing algorithms.
result Significant improvement in extreme classification performance (up to 20%) over existing methods.
In extreme classification problems, learning algorithms are required to map instances to labels from an extremely large label set. We build on a recent extreme classification framework with logarithmic time and space, and on a general approach for error correcting output coding (ECOC) with loss-based decoding, and intr…
Extreme classification seeks to assign each data point, the most relevant labels from a universe of a million or more labels. This task is faced with the dual challenge of high precision and scalability, with millisecond level prediction times being a benchmark. We propose DEFRAG, an adaptive feature agglomeration tech…
Classification tasks usually assume that all possible classes are present during the training phase. This is restrictive if the algorithm is used over a long time and possibly encounters samples from unknown classes. The recently introduced extreme value machine, a classifier motivated by extreme value theory, addresse…
Extreme multi-label text classification (XMTC) addresses the problem of tagging each text with the most relevant labels from an extreme-scale label set. Traditional methods use bag-of-words (BOW) representations without context information as their features. The state-ot-the-art deep learning-based method, AttentionXML…
Extreme classification problems are multiclass and multilabel classification problems where the number of outputs is so large that straightforward strategies are neither statistically nor computationally viable. One strategy for dealing with the computational burden is via a tree decomposition of the output space. Whil…
APLC-XLNet improves XMTC by clustering labels and reducing computational time.
problem Efficiently tagging texts with many labels from a large set.
method Fine-tunes XLNet with APLC to approximate cross entropy loss.
result Achieved state-of-the-art results on XMTC benchmarks.
We classify extremal curves in free nilpotent Lie groups. The classification is obtained via an explicit integration of the adjoint equation in Pontryagin Maximum Principle. It turns out that abnormal extremals are precisely the horizontal curves contained in algebraic varieties of a specific type. We also extend the r…
Extreme learning machine (ELM) is a new single hidden layer feedback neural network. The weights of the input layer and the biases of neurons in hidden layer are randomly generated, the weights of the output layer can be analytically determined. ELM has been achieved good results for a large number of classification ta…
Multi-class classification with a very large number of classes, or extreme classification, is a challenging problem from both statistical and computational perspectives. Most of the classical approaches to multi-class classification, including one-vs-rest or multi-class support vector machines, require the exact estima…
Paper proposes an adversarial sampling method for efficient extreme classification.
problem Training classifiers over many classes is computationally expensive.
method Adversarial sampling to draw negative samples from an adversarial model.
result Significantly reduces training time by an order of magnitude.
Proves rigidity of extremal Kerr-Newman horizons.
problem Classifying near-horizon geometries of extremal Kerr-Newman horizons.
method Proves intrinsic geometry constraints leading to rigidity.
result Proves extremal Kerr-Newman horizons are unique.
Forest tree species mapped with high accuracy using satellite data.
problem Classifying dominant tree species in Swedish forests.
method Extreme gradient boosting model with Bayesian optimization, combining Sentinel-1/2 satellite data and field observations.
result Overall accuracy of 85%, F1 score of 0.82, Matthews correlation coefficient of 0.81.
Extreme multi-label classification refers to supervised multi-label learning involving hundreds of thousands or even millions of labels. Datasets in extreme classification exhibit fit to power-law distribution, i.e. a large fraction of labels have very few positive instances in the data distribution. Most state-of-the-…
AF improves classification models by adaptively weighting trees.
problem Improving classification model performance.
method AF combines OP2T for input-dependent weights and MIO for dynamic refinement.
result AF consistently outperforms RF, XGBoost, and other weighted RF.
We present a local classification of conformally equivalent but oppositely oriented 4-dimensional Kaehler metrics which are toric with respect to a common 2-torus action. In the generic case, these "ambitoric" structures have an intriguing local geometry depending on a quadratic polynomial q and arbitrary functions A a…
Study classifies special metrics on specific surfaces.
problem Classifying extremal Kähler metrics with singularities.
method Analyzes Hessian of the Curvature of the Metric on K-surfaces.
result Identifies non-CSC HCMU metrics on and .
New maximal surfaces solve Bernstein problems.
problem Bernstein problems in centroaffine geometry.
method Calabi affine maximal surfaces and orthonormal frame fields.
result Complete centroaffine extremal hypersurfaces solve all Bernstein problems.
XR-Transformer accelerates XMC by recursively fine-tuning on multi-resolution objectives.
problem Efficiently classifying texts with large label sets.
method Recursive multi-resolution fine-tuning of transformers.
result XR-Transformer achieves 20x faster training time and 54% Precision@1 on Amazon-3M.
Study finds conditions for Kähler-Einstein metrics on flag manifolds.
problem Characterizing Kähler-Einstein metrics on flag manifolds.
method Using Lie theoretic data, establish a sufficient and necessary condition for -extremality.
result Identifies criteria for a metric to be a critical point of the first eigenvalue functional.
The study identifies extremal dependence in financial markets using a bootstrap-based testing procedure.
problem Accurately identifying extremal dependence in multivariate heavy-tailed financial data.
method Bootstrap-based testing procedure applied to U.S. and Chinese stock returns.
result The U.S. exhibits more isolated clustering of dependent assets compared to China.
We give a systematic method to calculate some homological data from the global monodromy of a topological elliptic surface. We apply this method to the cases 1) the transcendental lattice of an extremal elliptic K3 surface, 2) the torsion part of Mordell-Weil group of a general elliptic surface, and 3) the Mordell-Weil…
Probabilistic label trees improve XMLC by organizing labels hierarchically.
problem Efficiently tagging instances with a small subset of relevant labels from a large pool.
method Introduce and analyze probabilistic label trees (PLTs) as a generalization of hierarchical softmax for multi-label problems.
result PLTs are consistent for various performance metrics and can be trained online without prior knowledge.
Extreme value theory enhances statistical learning extrapolation for rare events.
problem Challenges in traditional machine learning methods for extreme data.
method Asymptotic theory and statistical tools for tail behavior.
result Effective extrapolation methods for extreme quantiles and anomalies.
Classifies Fano varieties with large pseudoindex and non-free rational curves.
problem Classifying Fano varieties with specific properties.
method Extremal contractions and classification of varieties.
result Complete classification of Fano -folds with pseudoindex at least and Picard number greater than one.
Extreme multi-label classification aims to learn a classifier that annotates an instance with a relevant subset of labels from an extremely large label set. Many existing solutions embed the label matrix to a low-dimensional linear subspace, or examine the relevance of a test instance to every label via a linear scan. …
Classifies states of four rebits using group theory.
problem Classifying states of four rebits in quantum information theory.
method Group theory, specifically -module construction and Galois cohomology.
result Semisimple and mixed orbits of four rebits are classified.
CascadeXML improves multi-resolution learning for XMC with transformer features.
problem Learning subset labels from millions of choices with trade-offs between performance and computation.
method End-to-end multi-resolution learning pipeline using transformer multi-layer architecture.
result Significantly outperforms existing approaches on benchmark datasets.
The task of classifying X-ray data is a problem of both theoretical and clinical interest. Whilst supervised deep learning methods rely upon huge amounts of labelled data, the critical problem of achieving a good classification accuracy when an extremely small amount of labelled data is available has yet to be tackled.…
A classification of 2-dimensional surfaces imbedded in spacetime is presented, according to the algebraic properties of their shape tensor. The classification has five levels, and provides among other things a refinement of the concepts of trapped, umbilical and extremal surfaces, which split into several different cla…
This work analyzes label embedding for large multiclass classification problems.
problem Label embedding for large multiclass classification problems.
method Analysis of label embedding in extreme multiclass classification, presenting an excess risk bound and showing a trade-off between computational and statistical efficiency.
result The statistical penalty for label embedding vanishes with sufficiently low coherence under the Massart noise condition.
Extreme Multi-label classification (XML) is an important yet challenging machine learning task, that assigns to each instance its most relevant candidate labels from an extremely large label collection, where the numbers of labels, features and instances could be thousands or millions. XML is more and more on demand in…
The paper studies extremal hypersurfaces in ellipsoids using centro-affine geometry.
problem Characterizing extremal hypersurfaces in centro-affine geometry.
method Analyzing invariant submanifold flows and deriving variational formulas.
result Circles on with radius are equi-centro-affine maximal.
Label-aware Document Representation via Hybrid Attention for Extreme Multi-Label Text Classificationcs.LG
Extreme multi-label text classification (XMTC) aims at tagging a document with most relevant labels from an extremely large-scale label set. It is a challenging problem especially for the tail labels because there are only few training documents to build classifier. This paper is motivated to better explore the semanti…
Proves intrinsic rigidity of extremal horizons, classifying their geometry.
problem Classifying the intrinsic geometry of extremal horizons.
method Proves existence of Killing vector fields and solves PDEs.
result Proves most general solution for extremal Kerr horizon and classifies near-horizon geometries.
Concentration bounds for the empirical angular measure with statistical learning applicationsmath.ST
The paper provides bounds for the empirical angular measure and applies them to improve statistical learning in extreme regions.
problem Estimating the angular measure in high-dimensional data with different distributions.
method Established bounds for the maximal deviations of the empirical angular measure from the true measure, using rank transformation and analyzing the most extreme observations.
result The bounds provide performance guarantees for statistical learning procedures in extreme regions, such as binary classification and anomaly detection.
In this paper, we propose an AdaBoost-assisted extreme learning machine for efficient online sequential classification (AOS-ELM). In order to achieve better accuracy in online sequential learning scenarios, we utilize the cost-sensitive algorithm-AdaBoost, which diversifying the weak classifiers, and adding the forgett…
The paper classifies electrovacuum spaces in higher dimensions, proving several key results.
problem Classifying regular static black hole solutions of the static Einstein-Maxwell equations.
method Analytical proofs and geometric analysis of electrovacuum spaces.
result An n-dimensional locally conformally flat extremal electrovacuum space must be in the Majumdar-Papapetrou class.
In recent decades, the use of 3D point clouds has been widespread in computer industry. The development of techniques in analyzing point clouds is increasingly important. In particular, mapping of point clouds has been a challenging problem. In this paper, we develop a discrete analogue of the Teichmüller extremal mapp…
New algorithm for XMC from aggregated labels.
problem Finding relevant labels for inputs from a large label universe.
method Developed a scalable algorithm to impute individual labels from group labels.
result Advantages over existing approaches in XMC and MIML tasks.
An extreme wind speed estimation method that considers wind hazard climate types is critical for design wind load calculation for building structures affected by mixed climates. However, it is very difficult to obtain wind hazard climate types from meteorological data records, because they restrict the application of e…
We provide bounds on the first Betti number and structure results for the fundamental group of horizon cross-sections for extreme stationary vacuum black holes in arbitrary dimension, without additional symmetry hypotheses. This is achieved by exploiting a correspondence between the associated near-horizon geometries a…
In the last decade, it has been shown that many hard AI tasks, especially in NLP, can be naturally modeled as extreme classification problems leading to improved precision. However, such models are prohibitively expensive to train due to the memory blow-up in the last layer. For example, a reasonable softmax layer for …
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.
Labeled Latent Dirichlet Allocation (LLDA) is an extension of the standard unsupervised Latent Dirichlet Allocation (LDA) algorithm, to address multi-label learning tasks. Previous work has shown it to perform in par with other state-of-the-art multi-label methods. Nonetheless, with increasing label sets sizes LLDA enc…
Study compares two methods for predicting extreme atmospheric events.
problem Forecasting threshold exceedances of atmospheric variables like temperature and wind speed.
method Direct vs. full distribution probabilistic methods for rare events.
result Full distribution approach outperforms direct method for extreme events.