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.

Shai Feldman

dblp:294/4380 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 3 first-author · 5 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
5 papers
Trustworthy machine learning · 87% Probabilistic and Bayesian machine learning · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
uncertainty estimation
3.552025
Conformalized Survival Analysis for General Right-Censored Data · ICLR 2025
Label Noise Robustness of Conformal Prediction · J. Mach. Learn. Res. 2024
Robust Conformal Prediction Using Privileged Information · NeurIPS 2024
Machine learning › Trustworthy machine learning › uncertainty estimation
conformal prediction
3.042025
Conformalized Survival Analysis for General Right-Censored Data · ICLR 2025
Label Noise Robustness of Conformal Prediction · J. Mach. Learn. Res. 2024
Robust Conformal Prediction Using Privileged Information · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
quantile regression
1.222023
Calibrated Multiple-Output Quantile Regression with Representation Learning · J. Mach. Learn. Res. 2023
Improving Conditional Coverage via Orthogonal Quantile Regression · NeurIPS 2021
Bioinformatics and computational biology
survival analysis
0.912025
Conformalized Survival Analysis for General Right-Censored Data · ICLR 2025
Machine learning › Trustworthy machine learning › uncertainty estimation › conformal prediction
robust conformal prediction
0.812024
Robust Conformal Prediction Using Privileged Information · NeurIPS 2024
Machine learning › Trustworthy machine learning › uncertainty estimation › conformal prediction
conditional coverage
0.512021
Improving Conditional Coverage via Orthogonal Quantile Regression · NeurIPS 2021
Machine learning › Trustworthy machine learning › uncertainty estimation
prediction intervals
0.512021
Improving Conditional Coverage via Orthogonal Quantile Regression · NeurIPS 2021
Machine learning › Trustworthy machine learning
robustness
0.522024
Label Noise Robustness of Conformal Prediction · J. Mach. Learn. Res. 2024
Robust Conformal Prediction Using Privileged Information · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.212024
Robust Conformal Prediction Using Privileged Information · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.212024
Label Noise Robustness of Conformal Prediction · J. Mach. Learn. Res. 2024

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

conformal prediction · 3.2weighted conformal prediction · 0.8risk control · 0.8privileged information · 0.8deep generative model · 0.7quantile regression · 0.5orthogonal loss · 0.5
YearPublicationVenuePosition
2025 Conformalized Survival Analysis for General Right-Censored Data
abstract
We develop a framework to quantify predictive uncertainty in survival analysis, providing a reliable lower predictive bound (LPB) for the true, unknown patient survival time. Recently, conformal prediction has been used to construct such valid LPBs for *type-I right-censored data*, with the guarantee that the bound holds with high probability. Crucially, under the type-I setting, the censoring time is observed for all data points. As such, informative LPBs can be constructed by framing the calibration as an estimation task with covariate shift, relying on the conditionally independent censoring assumption. This paper expands the conformal toolbox for survival analysis, with the goal of handling the ubiquitous *general right-censored setting*, in which either the censoring or survival time is observed, but not both. The key challenge here is that the calibration cannot be directly formulated as a covariate shift problem anymore. Yet, we show how to construct LPBs with distribution-free finite-sample guarantees, under the same assumptions as conformal approaches for type-I censored data. Experiments demonstrate the informativeness and validity of our methods in simulated settings and showcase their practical utility using several real-world datasets.
Hen Davidov, Shai Feldman, Gil Shamai, Ron Kimmel, Yaniv Romano
ICLR2
2024 Robust Conformal Prediction Using Privileged Information
abstract
We develop a method to generate prediction sets with a guaranteed coverage rate that is robust to corruptions in the training data, such as missing or noisy variables. Our approach builds on conformal prediction, a powerful framework to construct prediction sets that are valid under the i.i.d assumption. Importantly, naively applying conformal prediction does not provide reliable predictions in this setting, due to the distribution shift induced by the corruptions. To account for the distribution shift, we assume access to privileged information (PI). The PI is formulated as additional features that explain the distribution shift, however, they are only available during training and absent at test time. We approach this problem by introducing a novel generalization of weighted conformal prediction and support our method with theoretical coverage guarantees. Empirical experiments on both real and synthetic datasets indicate that our approach achieves a valid coverage rate and constructs more informative predictions compared to existing methods, which are not supported by theoretical guarantees.
Shai Feldman, Yaniv Romano
NeurIPS1
2024 Label Noise Robustness of Conformal Prediction
abstract
We study the robustness of conformal prediction, a powerful tool for uncertainty quantification, to label noise. Our analysis tackles both regression and classification problems, characterizing when and how it is possible to construct uncertainty sets that correctly cover the unobserved noiseless ground truth labels. We further extend our theory and formulate the requirements for correctly controlling a general loss function, such as the false negative proportion, with noisy labels. Our theory and experiments suggest that conformal prediction and risk-controlling techniques with noisy labels attain conservative risk over the clean ground truth labels whenever the noise is dispersive and increases variability. In other adversarial cases, we can also correct for noise of bounded size in the conformal prediction algorithm in order to ensure achieving the correct risk of the ground truth labels without score or data regularity.
Bat-Sheva Einbinder, Shai Feldman, Stephen Bates, Anastasios Angelopoulos, Asaf Gendler, Yaniv Romano
J. Mach. Learn. Res.2
2023 Calibrated Multiple-Output Quantile Regression with Representation Learning
abstract
We develop a method to generate predictive regions that cover a multivariate response variable with a user-specified probability. Our work is composed of two components. First, we use a deep generative model to learn a representation of the response that has a unimodal distribution. Existing multiple-output quantile regression approaches are effective in such cases, so we apply them on the learned representation, and then transform the solution to the original space of the response. This process results in a flexible and informative region that can have an arbitrary shape, a property that existing methods lack. Second, we propose an extension of conformal prediction to the multivariate response setting that modifies any method to return sets with a pre-specified coverage level. The desired coverage is theoretically guaranteed in the finite-sample case for any distribution. Experiments conducted on both real and synthetic data show that our method constructs regions that are significantly smaller compared to existing techniques.
Shai Feldman, Stephen Bates, Yaniv Romano
J. Mach. Learn. Res.1
2021 Improving Conditional Coverage via Orthogonal Quantile Regression
abstract
We develop a method to generate prediction intervals that have a user-specified coverage level across all regions of feature-space, a property called conditional coverage. A typical approach to this task is to estimate the conditional quantiles with quantile regression---it is well-known that this leads to correct coverage in the large-sample limit, although it may not be accurate in finite samples. We find in experiments that traditional quantile regression can have poor conditional coverage. To remedy this, we modify the loss function to promote independence between the size of the intervals and the indicator of a miscoverage event. For the true conditional quantiles, these two quantities are independent (orthogonal), so the modified loss function continues to be valid. Moreover, we empirically show that the modified loss function leads to improved conditional coverage, as evaluated by several metrics. We also introduce two new metrics that check conditional coverage by looking at the strength of the dependence between the interval size and the indicator of miscoverage.
Shai Feldman, Stephen Bates, Yaniv Romano
NeurIPS1