{"url":"/task/ordinal-classification","name":"Ordinal Classification","slug":"ordinal-classification","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":72,"papers_with_code":22,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/ordinal-classification-on-oasis-nacc-icbm","slug":"ordinal-classification-on-oasis-nacc-icbm","dataset":"OASIS+NACC+ICBM+ABIDE+IXI","dataset_url":null,"rows_in_archive":1,"metrics":["Mean absolute error"],"first_row_in_archive_order":{"model":"ResNet-18","paper_title":"Ordinal Classification with Distance Regularization for Robust Brain Age Prediction","paper_url":"/paper/ordinal-classification-with-distance-1","paper_date":"2023-10-25","arxiv_id":"2403.10522","code_links":[{"title":"jaygshah/Robust-Brain-Age-Prediction","url":"https://github.com/jaygshah/Robust-Brain-Age-Prediction"}],"syntology":null}}],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":22,"of":22,"tagged_in_all":72,"items":[{"url":"/paper/learning-to-rank-meets-language-boosting-1","title":"Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification","date":"2023-06-24","arxiv_id":"2306.13856","repositories_listed":2,"syntology":{"n":23,"n_ran":9,"n_unverified":14,"n_pointer_only":0}},{"url":"/paper/ultra-fast-deep-lane-detection-with-hybrid","title":"Ultra Fast Deep Lane Detection with Hybrid Anchor Driven Ordinal Classification","date":"2022-06-15","arxiv_id":"2206.07389","repositories_listed":2,"syntology":null},{"url":"/paper/csaw-m-an-ordinal-classification-dataset-for","title":"CSAW-M: An Ordinal Classification Dataset for Benchmarking Mammographic Masking of Cancer","date":"2021-12-02","arxiv_id":"2112.01330","repositories_listed":2,"syntology":null},{"url":"/paper/190513392","title":"Cumulative link models for deep ordinal classification","date":"2019-05-27","arxiv_id":"1905.13392","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-depression-detection-via-question","title":"Enhancing Depression Detection via Question-wise Modality Fusion","date":"2025-03-26","arxiv_id":"2503.20496","repositories_listed":1,"syntology":null},{"url":"/paper/splitting-criteria-for-ordinal-decision-trees","title":"Splitting criteria for ordinal decision trees: an experimental study","date":"2024-12-18","arxiv_id":"2412.13697","repositories_listed":1,"syntology":null},{"url":"/paper/dlordinal-a-python-package-for-deep-ordinal","title":"dlordinal: a Python package for deep ordinal classification","date":"2024-07-24","arxiv_id":"2407.17163","repositories_listed":1,"syntology":null},{"url":"/paper/conformal-risk-control-for-ordinal","title":"Conformal Risk Control for Ordinal Classification","date":"2024-05-01","arxiv_id":"2405.00417","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}},{"url":"/paper/ordinal-classification-for-interval-valued","title":"Ordinal classification for interval-valued data and interval-valued functional data","date":"2023-10-30","arxiv_id":"2310.19433","repositories_listed":1,"syntology":null},{"url":"/paper/ordinal-classification-with-distance-1","title":"Ordinal Classification with Distance Regularization for Robust Brain Age Prediction","date":"2023-10-25","arxiv_id":"2403.10522","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-and-deep-learning-based","title":"Convolutional and Deep Learning based techniques for Time Series Ordinal Classification","date":"2023-06-16","arxiv_id":"2306.10084","repositories_listed":1,"syntology":null},{"url":"/paper/a-generalized-framework-to-predict-continuous","title":"A generalized framework to predict continuous scores from medical ordinal labels","date":"2023-05-30","arxiv_id":"2305.19097","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-siamese-network-to-predict-the-time","title":"Interpretable Weighted Siamese Network to Predict the Time to Onset of Alzheimer's Disease from MRI Images","date":"2023-04-14","arxiv_id":"2304.07097","repositories_listed":1,"syntology":null},{"url":"/paper/controlling-class-layout-for-deep-ordinal","title":"Controlling Class Layout for Deep Ordinal Classification via Constrained Proxies Learning","date":"2023-03-01","arxiv_id":"2303.00396","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/quasi-unimodal-distributions-for-ordinal","title":"Quasi-Unimodal Distributions for Ordinal Classification","date":"2022-03-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-repeatability-of-deep-learning","title":"Improving the repeatability of deep learning models with Monte Carlo dropout","date":"2022-02-15","arxiv_id":"2202.07562","repositories_listed":1,"syntology":null},{"url":"/paper/decreasing-annotation-burden-of-pairwise","title":"Decreasing Annotation Burden of Pairwise Comparisons with Human-in-the-Loop Sorting: Application in Medical Image Artifact Rating","date":"2022-02-10","arxiv_id":"2202.04823","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/real-time-multi-level-neonatal-heart-and-lung","title":"Real-Time Multi-Level Neonatal Heart and Lung Sound Quality Assessment for Telehealth Applications","date":"2021-09-29","arxiv_id":"2109.15127","repositories_listed":1,"syntology":null},{"url":"/paper/an-effectiveness-metric-for-ordinal","title":"An Effectiveness Metric for Ordinal Classification: Formal Properties and Experimental Results","date":"2020-06-01","arxiv_id":"2006.01245","repositories_listed":1,"syntology":null},{"url":"/paper/deep-ordinal-classification-with-inequality","title":"Non-parametric Uni-modality Constraints for Deep Ordinal Classification","date":"2019-11-25","arxiv_id":"1911.10720","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-squared-error-reformulation-for","title":"A simple squared-error reformulation for ordinal classification","date":"2016-12-02","arxiv_id":"1612.00775","repositories_listed":1,"syntology":null},{"url":"/paper/oadaboost-an-adaboost-variant-for-ordinal","title":"oAdaBoost: An AdaBoost Variant for Ordinal Classification","date":"2015-01-12","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":4,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}