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.

169,051 papers · 148 categories

Trend · papers per month

168337505673 · Jun 202019922001200920182026
48 results for classification order

Efficient method classifies locally stationary time series based on second-order characteristics.

problem Classifying locally stationary time series for various applications.
method Autoregressive approximation, ensemble aggregation, distance-based threshold.
result Zero misclassification error rate asymptotically for mildly differing second-order characteristics.

A hybrid model reduces graph complexity for improved classification accuracy.

problem High computational complexity and large number of parameters in higher-order graph convolutional networks.
method Weight sharing mechanism and novel fusion pooling layer to reduce parameters and complexity.
result The proposed model achieves highest classification accuracy with fewer trainable parameters.

Method extracts features from signals for classification with explainability.

problem Lack of interpretability in signal classification models.
method Combining scattering transform and multiclass logistic regression with zeroth-order optimization.
result Uncovered the meaning of scattering transform coefficients.

New classification of nonorientable 4-manifolds with specific fundamental groups.

problem Classifying nonorientable 4-manifolds with cyclic fundamental groups.
method Simple cut-and-paste construction, using results from Hambleton-Kreck-Teichner and Khan.
result Plausible classification of a large set of nonorientable 4-manifolds with cyclic fundamental groups of order 2p.

HyperBERT enhances BERT for node classification on text-attributed hypergraphs.

problem Challenges in capturing hypergraph structure and text attributes in node classification.
method Mixing hypergraph-aware layers with BERT for improved node classification.
result HyperBERT achieves state-of-the-art results on text-attributed hypergraph benchmarks.

In this paper the notion of an M-th order invariant bilinear differential pairing is introduced and a formal definition is given. If the manifold has an AHS structure, then various first order pairings are constructed. This yields a classification of all first order invariant bilinear differential pairings on homogeneo…

2007-03-29abs ↗pdf ↗

This paper improves multi-label classification by leveraging high-order label correlations.

problem Improving accuracy in multi-label classification tasks using label correlations.
method Exploiting high-order label correlations through a supervised learning classifier system (UCS) and label powerset (LP) strategy.
result The proposed method outperforms other LP-based methods on multiple benchmark datasets.

New algebraic-geometric method classifies superintegrable systems in any dimension.

problem Classifying superintegrable systems in arbitrary dimensions is challenging.
method Algebraic-geometric approach based on quasi-projective varieties.
result Established foundations for classification in arbitrary dimensions.

Paper introduces variance-based measures for second-order uncertainty quantification in classification problems.

problem Uncertainty in machine learning predictions and decision-making.
method Second-order uncertainty quantification using variance-based measures.
result Variance-based measures effectively quantify uncertainty on a class-based level and are competitive with entropy-based measures.

Paper proposes a new MLC framework without predefined label order, improving performance and generalization.

problem Exposure bias in multi-label classification due to lack of predefined label order.
method Proposes a new framework that transforms MLC into a sequence prediction problem without predefined label order.
result The proposed method outperforms competitive baselines and has better generalization capability.

IsoNN learns graph representations without node order constraints.

problem Lack of interpretability and erratic performance in graph classification due to node-orderless property.
method IsoNN uses graph matching with subgraph templates to learn isomorphic features and break node-order.
result IsoNN achieves superior performance on graph classification tasks compared to existing methods.

Classifies scalar second-order PDEs with low-dimensional symmetry groups.

problem Classifying differential equations with specific symmetry groups.
method Algebraic technique based on covariant form for constructing equations.
result Complete classification of quasi-linear scalar second-order PDEs with free symmetry groups of dimension ≤3.

We present a family of four-dimensional Lorentzian manifolds whose invariant classification requires the seventh covariant derivative of the curvature tensor. The spacetimes in questions are null radiation, type N solutions on an anti-de Sitter background. The large order of the bound is due to the fact that these spac…

2007-10-03abs ↗pdf ↗

A new GCN model learns higher-order neighbors without explicit adjacency matrix computation.

problem GCN's performance drops for deeper structures due to limited neighborhood information.
method Assumes higher-order neighbors are similar to first-order neighbors, learns weights through Lasso to minimize feature loss.
result HWGCN achieves state-of-the-art results on various datasets.

Third-order symmetric Lorentzian manifolds, i.e. Lorentzian manifold with zero third derivative of the curvature tensor, are classified. These manifolds are exhausted by a special type of pp-waves, they generalize Cahen-Wallach spaces and second-order symmetric Lorentzian spaces.

2014-07-14abs ↗pdf ↗

Using the classification of transitive groups we classify indecomposable quandles of size <36. This classification is available in Rig, a GAP package for computations related to racks and quandles. As an application, the list of all indecomposable quandles of size <36 not of type D is computed.

2011-05-26abs ↗pdf ↗

A new optimizer for deep learning improves accuracy and reduces training time.

problem Training deep neural networks for classification tasks.
method Hybrid Newton/Gradient Descent (NGD) method exploiting convexity of cross-entropy loss.
result Improves validation error and provides qualitative differences in hidden layer basis functions.

Paper introduces r-DEP classifier for binary classification tasks.

problem No natural ordering for feature patterns in practical situations.
method Introduces reduced dilation-erosion (r-DEP) classifier using multi-valued mathematical morphology.
result r-DEP classifiers outperform traditional SVCs in balanced accuracy.

Enhances image classification by integrating semantic hierarchy into CNN models.

problem Limited use of external guidance in image classification.
method Integrates label-hierarchy knowledge into CNN-based classifiers and uses order-preserving embeddings.
result Boosts image classification performance through semantic hierarchy integration.

A model verifies during classification to reduce memorization, matching baseline accuracy with fewer parameters.

problem Classification systems require memorizing all classes, leading to increased memory usage and poor sample efficiency.
method Iterative nondifferentiable queries for verification during classification, balancing recognition and verification.
result The model can match baseline accuracy while using fewer parameters, but requires careful balance between recognition and verification.

HONEM learns embeddings for higher-order networks, improving performance in various tasks.

problem Existing methods fail to capture non-Markovian higher-order dependencies in networks.
method HONEM is a higher-order network embedding method designed for HON, capturing non-Markovian dependencies.
result HONEM outperforms other methods in node classification, network reconstruction, link prediction, and visualization.

New methods for ordinal classification of interval-valued data and functional data.

problem Ordinal classification of interval-valued data and functional data.
method Six ordinal classifiers are proposed, including parametric, binary decomposition, logistic regression, distance-based, k-nearest-neighbor, kernel PCA, and random forest methods.
result Considering ordering and interval-valued information improves the accuracy of ordinal classification.

Novel analysis improves weighted majority vote in multiclass classification.

problem Improving the performance of weighted majority vote in multiclass classification.
method Analyzes expected risk of weighted majority vote, considering prediction correlations and provides a bound for efficient minimization.
result Minimization of the new bound typically does not degrade the test error of the ensemble.

In [Tohoku Math. J. 62 (2010), 45--53] the second author showed that, except for a few cases, the order NN of a cyclic group of self-homeomorphisms of a closed orientable topological surface SgS_g of genus g2g \geq 2 determines the group up to a topological conjugation, provided that N3gN\geq 3g. The first author et al…

2017-02-08abs ↗pdf ↗

New radar-based method improves multiclass classification of road users, especially in challenging conditions.

problem Accurate classification of multiple road users in challenging scenarios.
method 50 features extracted from radar data, subset chosen, tested on random forest and LSTM classifiers, addressed data imbalance issues.
result Substantial improvements in multiclass classification compared to ordinary methods.

C-HMCNN(h) improves HMC classification by leveraging class hierarchy.

problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.