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

68136204272 · Jun 202019922001200920172026
48 results for Semi-supervised ordinal regression

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.

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.

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.

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.

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.

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.

A new neural network model for ordinal regression.

problem Ordinal regression with non-proportional odds.
method Interpretable neural network for both continuous and discrete responses, training a non-linear neural network as a coefficient function.
result N3^3POM preserves interpretability while offering flexibility.

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.

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.

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.

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 ↗

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 ↗

Ordinal Regression (OR) aims to model the ordering information between different data categories, which is a crucial topic in multi-label learning. An important class of approaches to OR models the problem as a linear combination of basis functions that map features to a high dimensional non-linear space. However, most…

2018-06-18abs ↗pdf ↗

Sex trafficking is a global epidemic. Escort websites are a primary vehicle for selling the services of such trafficking victims and thus a major driver of trafficker revenue. Many law enforcement agencies do not have the resources to manually identify leads from the millions of escort ads posted across dozens of publi…

2019-08-15abs ↗pdf ↗

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

The paper tackles feature selection for ordinal regression, considering feature redundancies and privileged information.

problem Discovering relevant factors in ranked data with potentially redundant features and privileged information.
method Develops feature relevance bounds for linear ordinal regression, considering feature redundancies and privileged information.
result Identifies all strongly and weakly relevant features and their type of relevance.

Paper introduces semi-supervised linear extremile regression for high-dimensional data.

problem Challenges in high-dimensional extremile regression due to data sparsity and overfitting.
method Proposes semi-supervised learning for linear extremile regression, achieving n\sqrt{n}-consistency.
result Demonstrates improved estimation efficiency and performance in high-dimensional settings.

Study semi-supervised learning with noisy proxy covariates, deriving bounds and showing gains.

problem Learning from noisy proxy covariates with scarce labels.
method Two-stage estimator learning kernel eigenfeatures from all proxy covariates and fitting a ridge predictor on labeled data.
result Finite sample bounds show fast labeled sample rates and consistent gains over supervised and semi-supervised baselines.

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 ↗

New RNN model forecasts unseen time series with little training data.

problem Lack of data for RNNs to generalize well in time series forecasting.
method Proposes a novel RNN-based model that learns shared feature embeddings over quantised time series.
result Accurately forecasts unseen time series with minimal training data.

ETM models improve efficiency in semi-supervised logistic regression.

problem Improving efficiency in logistic regression with limited labeled data.
method Developed exponential tilt mixture (ETM) models for semi-supervised estimation.
result ETM-based estimation demonstrates improved efficiency over supervised logistic regression.

The goal of Ordinal Regression is to find a rule that ranks items from a given set. Several learning algorithms to solve this prediction problem build an ensemble of binary classifiers. Ranking by Projecting uses interdependent binary perceptrons. These perceptrons share the same direction vector, but use different bia…

2019-11-25abs ↗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.

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.

Bayesian methods improve inference for cumulative probit models on large datasets.

problem Challenges in Bayesian inference for large cumulative probit models.
method Proposed scalable algorithms using Variational Bayes and Expectation Propagation.
result Superior computational performance and accuracy compared to MCMC.

Unified framework for semi-supervised regression with misspecified models.

problem Estimating regression coefficients in conditional mean models with unlabeled data.
method Developed an augmented inverse probability weighted (AIPW) method using regularized calibrated estimators for PS and OR nuisance models.
result The proposed estimator is consistent, asymptotically normal, and provides valid confidence intervals even with misspecified OR models and high-dimensional data.

This paper presents Correlated Nystrom Views (XNV), a fast semi-supervised algorithm for regression and classification. The algorithm draws on two main ideas. First, it generates two views consisting of computationally inexpensive random features. Second, XNV applies multiview regression using Canonical Correlation Ana…

2013-06-24abs ↗pdf ↗

We address the problem of general supervised learning when data can only be accessed through an (indefinite) similarity function between data points. Existing work on learning with indefinite kernels has concentrated solely on binary/multi-class classification problems. We propose a model that is generic enough to hand…

2012-10-22abs ↗pdf ↗

SDORE uses neural networks to estimate regression functions and their gradients, even with limited labeled data.

problem Nonparametric estimation of regression functions and their gradients.
method Semi-supervised deep ReQU neural networks with gradient norm regularization.
result Achieves minimax optimal convergence rates in L2L^{2}-norm and plug-in gradient estimator convergence.

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 ↗

Optimal and safe semi-supervised learning estimator for high-dimensional data.

problem Improving regression parameter estimation with unlabeled data in high-dimensional settings.
method Established minimax lower bound, proposed optimal and safe semi-supervised estimators.
result Optimal semi-supervised estimator achieves the minimax lower bound.