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

99198296395 · Jun 202019922001200920172026
48 results for ordinal classification

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.

Ordinal data are often seen in real applications. Regular multicategory classification methods are not designed for this data type and a more proper treatment is needed. We consider a framework of ordinal classification which pools the results from binary classifiers together. An inherent difficulty of this framework i…

2015-05-13abs ↗pdf ↗

A new kernel measures brain network similarities, improving disease classification.

problem Lack of edge weight information in existing graph kernels for brain connectivity networks.
method Ordinal pattern kernel for weighted brain connectivity networks.
result The ordinal pattern kernel achieves better classification performance than state-of-the-art graph kernels.

Probability distributions produced by the cross-entropy loss for ordinal classification problems can possess undesired properties. We propose a straightforward technique to constrain discrete ordinal probability distributions to be unimodal via the use of the Poisson and binomial probability distributions. We evaluate …

2017-05-15abs ↗pdf ↗

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.

Proposes models to better represent ordinal data with non-unimodal distributions.

problem Real-world ordinal data often have non-unimodal conditional probability distributions.
method Develops approximately unimodal likelihood models to better represent non-unimodal CPDs.
result Proposed models can effectively represent both unimodal and nearly unimodal CPDs.

This study introduces balanced DRPS and OrderedLogitNN for better QDE of discrete-level questions.

problem Lack of ordinal regression methods and fair evaluation metrics for discrete-level QDE.
method Introduces balanced DRPS and OrderedLogitNN, fine-tunes BERT on RACE++ and ARC datasets.
result OrderedLogitNN outperforms other models on complex QDE tasks.

Study fairness in ordinal regression using threshold models.

problem Fairness in ordinal regression predictions.
method Adapted fairness notions from fair ranking; use threshold model with scoring function and thresholds; apply binary classification for scoring function and local search for thresholds.
result Generalization guarantees on predictor error and fairness violation; effectiveness demonstrated in experiments.

This paper extends the class of ordinal regression models with a structured interpretation of the problem by applying a novel treatment of encoded labels. The net effect of this is to transform the underlying problem from an ordinal regression task to a (structured) classification task which we solve with conditional r…

2019-05-31abs ↗pdf ↗

Proposes a new method for rank-consistent ordinal regression without weight-sharing constraints.

problem Ordinal response variables in real-world prediction problems are often ignored by conventional classification losses.
method CORN framework using conditional training sets and the chain rule for conditional probability distributions.
result Improves performance substantially compared to the CORAL reference approach without weight-sharing restrictions.

In this paper, we explore ordinal classification (in the context of deep neural networks) through a simple modification of the squared error loss which not only allows it to not only be sensitive to class ordering, but also allows the possibility of having a discrete probability distribution over the classes. Our formu…

2016-12-02abs ↗pdf ↗

BinConv improves time series forecasting by preserving ordinal information in a classification framework.

problem Lack of ordinal information in existing classification-based time series forecasting methods.
method Cumulative Binary Encoding (CBE) and BinConv architecture.
result BinConv achieves superior performance in time series forecasting compared to existing methods.

Deep neural networks for ordinal outcomes combining image and tabular data.

problem Lack of interpretable models for ordinal outcomes in mixed data types.
method Ordinal Neural Network Transformation Models (ONTRAMs) integrating DL and classical ordinal regression.
result ONTRAMs achieve performance equivalent to standard multi-class DL models but are faster and more interpretable.

Most classification methods provide either a prediction of class membership or an assessment of class membership probability. In the case of two-group classification the predicted probability can be described as "risk" of belonging to a "special" class . When the required output is a set of ordinal-risk groups, a discr…

2010-12-25abs ↗pdf ↗

Paper uses Sugeno integral for binary classification with ordinal data.

problem Learning from ordinal data in machine learning.
method Proposes a method using the Sugeno integral for binary classification, transforming feature values into local evaluations and tuning a threshold.
result Generalizes approach to kk-maxitive capacities to control classifier flexibility and prevent overfitting.

Study shows 'Ordinal Neural Collapse' in deep OR tasks, revealing simple geometric relationships.

problem Understanding neural collapse in deep Ordinal Regression tasks.
method Combining cumulative link models and Unconstrained Feature Model to investigate neural collapse.
result Demonstrates 'Ordinal Neural Collapse' (ONC) with three key properties.

This work proposes a new feature for transportation mode classification using GPS trajectories.

problem Classifying transportation modes from GPS trajectories to optimize urban mobility.
method The Ordinal Pattern Transition Graph and its self-transition probability are used for classification.
result The proposed feature outperforms existing methods in transportation mode classification.

Reinforcement learning usually makes use of numerical rewards, which have nice properties but also come with drawbacks and difficulties. Using rewards on an ordinal scale (ordinal rewards) is an alternative to numerical rewards that has received more attention in recent years. In this paper, a general approach to adapt…

2019-05-06abs ↗pdf ↗

Improved motion prediction for self-driving cars using trajectory sets and auxiliary losses.

problem Accurately predicting future vehicle motion for self-driving cars.
method Classification over trajectory sets with an auxiliary loss for off-road predictions and spatial-temporal relationships.
result Significant improvement in motion prediction performance on small datasets using map information.

Binary feedback outperforms ordinal comparisons in ranking recovery.

problem Challenges the conventional wisdom that ordinal comparisons offer richer information.
method Proposes a parametric framework for modeling ordinal paired comparisons, binarizing ordinal data, and proving faster convergence rates for binary comparisons.
result Binarizing ordinal data significantly improves ranking recovery accuracy and exhibits a substantial performance gap.

The real-world data is often susceptible to label noise, which might constrict the effectiveness of the existing state of the art algorithms for ordinal regression. Existing works on ordinal regression do not take label noise into account. We propose a theoretically grounded approach for class conditional label noise i…

2019-12-07abs ↗pdf ↗

Ordinal regression (OR) is a special multiclass classification problem where an order relation exists among the labels. Recent years, people share their opinions and sentimental judgments conveniently with social networks and E-Commerce so that plentiful large-scale OR problems arise. However, few studies have focused …

2018-12-19abs ↗pdf ↗

Study homeomorphism groups of ordinals, proving strong distortion and normal generators.

problem Understanding algebraic and geometric properties of homeomorphism groups of ordinals.
method Analyzing successor ordinals with connections to permutation groups and manifolds.
result Proves strong distortion and normal generators for homeomorphism groups of ordinals.

When eliciting judgements from humans for an unknown quantity, one often has the choice of making direct-scoring (cardinal) or comparative (ordinal) measurements. In this paper we study the relative merits of either choice, providing empirical and theoretical guidelines for the selection of a measurement scheme. We pro…

2014-06-25abs ↗pdf ↗

This paper applies deep learning to ordinal regression, modeling it as a binary search.

problem Ordinal regression with deep learning models.
method Formulated ordinal regression as a binary search problem, using recurrent neural networks.
result Deep learning model shows comparable or better predictive power compared to traditional methods.

Algorithm finds real line mapping from points under ordinal constraints.

problem Finding a mapping from points to real line under ordinal constraints.
method Approximation algorithm for dense case in O(n7)+(1/ε)O(1/ε1/8)nO(n^7) + (1/\varepsilon)^{O(1/\varepsilon^{1/8})} n time.
result Computes a solution satisfying (1O(ε1/8))(1-O(\varepsilon^{1/8}))-fraction of all constraints.

In this paper, we address the problem of measuring and analysing sensation, the subjective magnitude of one's experience. We do this in the context of the method of triads: the sensation of the stimulus is evaluated via relative judgments of the form: "Is stimulus S_i more similar to stimulus S_j or to stimulus S_k?". …

2019-08-21abs ↗pdf ↗

New framework learns complex AI attitudes from heterogeneous data.

problem Heterogeneous ordinal structure in AI attitudes, poorly captured by existing methods.
method Monotone Gaussian score embedding, BNP complexity discovery, confirmatory fixed-K estimation.
result Reduced holdout MSE by 25.8% over single-graph baseline.

Proposes a deep ordinal regression framework using optimal transport loss and unimodal output probabilities.

problem Lack of unimodal output probabilities in recent ordinal regression models.
method Introduces a deep learning framework based on optimal transport loss and unimodal output distribution, inspired by the Proportional Odds model.
result Demonstrates improved performance and unimodal output probabilities on real-world datasets compared to existing methods.

In this short paper, the Electre Tri-Machine Learning Method, generally used to solve ordinal classification problems, is proposed for solving the Record Linkage problem. Preliminary experimental results show that, using the Electre Tri method, high accuracy can be achieved and more than 99% of the matches and nonmatch…

2015-05-25abs ↗pdf ↗