Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sivaramakrishnan R. Kaveri

dblp:369/5949 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 75% Image recognition and object detection · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › uncertainty estimation
conformal prediction
0.712023
Conformal Prediction Sets for Ordinal Classification · NeurIPS 2023
Computer vision › Image recognition and object detection
ordinal classification
0.712023
Conformal Prediction Sets for Ordinal Classification · NeurIPS 2023
Machine learning › Trustworthy machine learning › uncertainty estimation
prediction sets
0.712023
Conformal Prediction Sets for Ordinal Classification · NeurIPS 2023
Machine learning › Trustworthy machine learning
uncertainty estimation
0.712023
Conformal Prediction Sets for Ordinal Classification · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

non-parametric unimodal distribution modeling · 0.7conformal prediction · 0.7
YearPublicationVenuePosition
2023 Conformal Prediction Sets for Ordinal Classification
abstract
Ordinal classification (OC), i.e., labeling instances along classes with a natural ordering, is common in multiple applications such as size or budget based recommendations and disease severity labeling. Often in practical scenarios, it is desirable to obtain a small set of likely classes with a guaranteed high chance of including the true class. Recent works on conformal prediction (CP) address this problem for the classification setting with non-ordered labels but the resulting prediction sets (PS) are often non-contiguous and unsuitable for ordinal classification. In this work, we propose a framework to adapt existing CP methods to generate contiguous sets with guaranteed coverage and minimal cardinality. Our framework employs a novel non-parametric approach for modeling unimodal distributions. Empirical results on both synthetic and real-world datasets demonstrate our method outperforms SOTA baselines by 4% on Accuracy@K and 8% on PS size.
Srujana Merugu, Sivaramakrishnan R. Kaveri
NeurIPS3