Demo Data from VLDB 2026 / reviewers in the wild / expert
Pankaj Bhagwat
dblp:368/8051
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers |
Trustworthy machine learning · 76% Probabilistic and Bayesian machine learning · 19% Representation and self-supervised learning · 6% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian model selection › model averaging
bayesian model averaging |
0.9 | 1 | 2025 | CBMA: Improving Conformal Prediction through Bayesian Model Averaging · ICLR 2025 |
Machine learning › Trustworthy machine learning › uncertainty estimation
conformal prediction |
0.9 | 1 | 2025 | CBMA: Improving Conformal Prediction through Bayesian Model Averaging · ICLR 2025 |
Machine learning › Trustworthy machine learning
fairness |
0.9 | 1 | 2025 | Understanding Fairness and Prediction Error through Subspace Decomposition and Influence Analysis · NeurIPS 2025 |
Machine learning › Trustworthy machine learning › fairness › fairness trade-off
fairness-accuracy trade-off |
0.9 | 1 | 2025 | Understanding Fairness and Prediction Error through Subspace Decomposition and Influence Analysis · NeurIPS 2025 |
Machine learning › Trustworthy machine learning
uncertainty estimation |
0.9 | 1 | 2025 | CBMA: Improving Conformal Prediction through Bayesian Model Averaging · ICLR 2025 |
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
sufficient dimension reduction |
0.3 | 1 | 2025 | Understanding Fairness and Prediction Error through Subspace Decomposition and Influence Analysis · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
sufficient dimension reduction · 0.9influence functions · 0.9conformal prediction · 0.9bayesian model averaging · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CBMA: Improving Conformal Prediction through Bayesian Model AveragingabstractConformal prediction has emerged as a popular technique for facilitating valid predictive inference across a spectrum of machine learning models, under minimal assumption of exchangeability. Recently, Hoff (2023) showed that full conformal Bayes provides the most efficient prediction sets (smallest by expected volume) among all prediction sets that are valid at the $(1 - \alpha)$ level if the model is correctly specified. However, a critical issue arises when the Bayesian model itself may be mis-specified, resulting in prediction interval that might be suboptimal, even though it still enjoys the frequentist coverage guarantee. To address this limitation, we propose an innovative solution that combines Bayesian model averaging (BMA) with conformal prediction. This hybrid not only leverages the strengths of Bayesian conformal prediction but also introduces a layer of robustness through model averaging. Theoretically, we prove that the resulting prediction interval will converge to the optimal level of efficiency, if the true model is included among the candidate models. This assurance of optimality, even under potential model uncertainty, provides a significant improvement over existing methods, ensuring more reliable and precise uncertainty quantification. Pankaj Bhagwat, Linglong Kong, Bei Jiang |
ICLR | 1 |
| 2025 | Understanding Fairness and Prediction Error through Subspace Decomposition and Influence AnalysisabstractMachine learning models have achieved widespread success but often inherit and amplify historical biases, resulting in unfair outcomes. Traditional fairness methods typically impose constraints at the prediction level, without addressing underlying biases in data representations. In this work, we propose a principled framework that adjusts data representations to balance predictive utility and fairness. Using sufficient dimension reduction, we decompose the feature space into target-relevant, sensitive, and shared components, and control the fairness–utility trade-off by selectively removing sensitive information. We provide a theoretical analysis of how prediction error and fairness gaps evolve as shared subspaces are added, and employ influence functions to quantify their effects on the asymptotic behavior of parameter estimates. Experiments on both synthetic and real-world datasets validate our theoretical insights and show that the proposed method effectively improves fairness while preserving predictive performance. Enze Shi, Pankaj Bhagwat, Zhixian Yang, Linglong Kong, Bei Jiang |
NeurIPS | 2 |