Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.00122

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2510.00122 (cs)
[Submitted on 30 Sep 2025 ]

Title: Approximately Unimodal Likelihood Models for Ordinal Regression

Title: 近似单峰似然模型用于有序回归

Authors:Ryoya Yamasaki
Abstract: Ordinal regression (OR, also called ordinal classification) is classification of ordinal data, in which the underlying target variable is categorical and considered to have a natural ordinal relation for the underlying explanatory variable. A key to successful OR models is to find a data structure `natural ordinal relation' common to many ordinal data and reflect that structure into the design of those models. A recent OR study found that many real-world ordinal data show a tendency that the conditional probability distribution (CPD) of the target variable given a value of the explanatory variable will often be unimodal. Several previous studies thus developed unimodal likelihood models, in which a predicted CPD is guaranteed to become unimodal. However, it was also observed experimentally that many real-world ordinal data partly have values of the explanatory variable where the underlying CPD will be non-unimodal, and hence unimodal likelihood models may suffer from a bias for such a CPD. Therefore, motivated to mitigate such a bias, we propose approximately unimodal likelihood models, which can represent up to a unimodal CPD and a CPD that is close to be unimodal. We also verify experimentally that a proposed model can be effective for statistical modeling of ordinal data and OR tasks.
Abstract: 序数回归(OR,也称为序数分类)是对序数数据的分类,其中潜在的目标变量是分类型的,并且被认为对于潜在的解释变量具有自然的序数关系。 成功OR模型的关键在于找到一种“自然序数关系”的数据结构,这种结构在许多序数数据中是共通的,并将其反映到这些模型的设计中。 一项最近的OR研究发现,许多现实世界的序数数据表现出一种趋势,即给定解释变量的一个值时目标变量的条件概率分布(CPD)通常是单峰的。 因此,一些先前的研究开发了单峰似然模型,在这些模型中,预测的CPD被保证为单峰的。 然而,实验观察也表明,许多现实世界的序数数据中存在解释变量的某些值,使得潜在的CPD不是单峰的,因此单峰似然模型可能在这样的CPD上出现偏差。 因此,为了减轻这种偏差,我们提出了近似单峰似然模型,这些模型可以表示最多为单峰的CPD以及接近单峰的CPD。 我们还通过实验验证了所提出的模型在序数数据的统计建模和OR任务中的有效性。
Subjects: Machine Learning (cs.LG) ; Machine Learning (stat.ML)
Cite as: arXiv:2510.00122 [cs.LG]
  (or arXiv:2510.00122v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2510.00122
arXiv-issued DOI via DataCite

Submission history

From: Ryoya Yamasaki [view email]
[v1] Tue, 30 Sep 2025 18:03:17 UTC (11,801 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
stat.ML
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
cs.LG
stat

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号