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

Trend · papers per month

2795588371,116 · Jun 202019922001200920172026
48 results for ordinal data

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.

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.

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.

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.

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 ↗

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.

Unified CI test for categorical and ordinal data maintains power in high dimensions.

problem Rapid degradation of statistical power in existing CI tests for high-dimensional conditioning variables.
method Unified CI test for categorical and ordinal data, maintaining reasonable calibration and power in high dimensions.
result Our test outperforms existing baselines in model testing and structure learning for dense directed graphical models.

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 ↗

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.

K-Models clusters functional data with ordinal constraints for better interpretability.

problem Challenges in extracting meaningful insights from functional data due to lack of interpretability.
method Integrates ordinal constraints into clustering to improve interpretability and structure identification.
result Enhances interpretability of clustering results while maintaining performance.

A scalable algorithm improves AUC optimization for semi-supervised ordinal regression.

problem Optimizing AUC for semi-supervised ordinal regression with limited labeled data.
method Proposes QS3^3ORAO using quadruply stochastic gradients for scalable kernelized learning.
result Converges to optimal solution at O(1/t)O(1/t) rate, demonstrating efficiency and effectiveness.

Proposes a VAE variant for ordinal content factors.

problem Isolating ordinal-valued content factors in deep latent variable models.
method Introduces a partially ordered set (poset) structure and a conditional Gaussian spacing prior model.
result Significant improvements in content-style separation over previous non-ordinal approaches.

The increasing occurrence of ordinal data, mainly sociodemographic, led to a renewed research interest in ordinal regression, i.e. the prediction of ordered classes. Besides model accuracy, the interpretation of these models itself is of high relevance, and existing approaches therefore enforce e.g. model sparsity. For…

2019-02-20abs ↗pdf ↗

The study explores how to infer the geometry of space forms from similarity comparisons.

problem Inferring the geometry of space forms from unreliable similarity measurements.
method Introducing ordinal capacity and spread, proving their relation to space form properties, and using statistical analysis of similarity measurements.
result The statistical behavior of ordinal spread variables can identify the underlying space form.

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 ↗

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 ↗

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.

TabSODA improves imputation of surveys with skips and ordinal data.

problem Handling structural skips and ordinal responses in survey data.
method TabSODA uses an Elucidated Diffusion Model with skip pattern detection and ordinal awareness.
result TabSODA reduces ordinal missing-at-random (MACE) by up to 23.7% and improves categorical accuracy by up to 9%.

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 ↗

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 ↗

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 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.

Study shows non-systematic bias in customer satisfaction surveys limits data value.

problem Non-systematic bias in customer satisfaction surveys limits data value.
method Used real customer satisfaction survey data of a large retail bank to show the irreducible error and suggest thoughtful survey design methods.
result A thoughtful survey design can reduce non-systematic error in customer satisfaction surveys.

Preference learning (PL) is a core area of machine learning that handles datasets with ordinal relations. As the number of generated data of ordinal nature is increasing, the importance and role of the PL field becomes central within machine learning research and practice. This paper introduces an open source, scalable…

2015-06-04abs ↗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.

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.

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.

Lognormal distribution used for predicting team rankings in an orienteering relay race.

problem Predicting final team rankings in an orienteering relay race.
method Used lognormal distribution and Fenton-Wilkinson approximations for order statistics.
result Accurate predictions of team rankings using order statistics.

The paper proposes a test to determine the number of latent classes in ordinal categorical data.

problem Determining the correct number of latent classes in latent class models with ordinal categorical data.
method The test statistic centers the largest singular value of a normalized residual matrix by a simple sample-size adjustment.
result The test statistic converges to zero under the null hypothesis and exceeds a fixed positive constant under an under-fitted alternative.