VLDB 2026 Research / reviewers in the wild / expert
Andre Vauvelle
dblp:345/8340
· DBLP profile ↗
1ranked-venue papers
1as 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 first-author · 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 |
Probabilistic and Bayesian machine learning · 25% Trustworthy machine learning · 25% Learning theory · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › learning with incomplete data
censored data |
0.7 | 1 | 2023 | Differentiable sorting for censored time-to-event data · NeurIPS 2023 |
Machine learning › Learning theory
ranking |
0.7 | 1 | 2023 | Differentiable sorting for censored time-to-event data · NeurIPS 2023 |
Machine learning › Deep learning architectures and training
risk prediction |
0.7 | 1 | 2023 | Differentiable sorting for censored time-to-event data · NeurIPS 2023 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
survival analysis |
0.7 | 1 | 2023 | Differentiable sorting for censored time-to-event data · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
differentiable sorting networks · 0.7cox partial likelihood · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Differentiable sorting for censored time-to-event dataabstractSurvival analysis is a crucial semi-supervised task in machine learning with significant real-world applications, especially in healthcare. The most common approach to survival analysis, Cox’s partial likelihood, can be interpreted as a ranking model optimized on a lower bound of the concordance index. We follow these connections further, with listwise ranking losses that allow for a relaxation of the pairwise independence assumption. Given the inherent transitivity of ranking, we explore differentiable sorting networks as a means to introduce a stronger transitive inductive bias during optimization. Despite their potential, current differentiable sorting methods cannot account for censoring, a crucial aspect of many real-world datasets. We propose a novel method, Diffsurv, to overcome this limitation by extending differentiable sorting methods to handle censored tasks. Diffsurv predicts matrices of possible permutations that accommodate the label uncertainty introduced by censored samples. Our experiments reveal that Diffsurv outperforms established baselines in various simulated and real-world risk prediction scenarios. Furthermore, we demonstrate the algorithmic advantages of Diffsurv by presenting a novel method for top-k risk prediction that surpasses current methods. Andre Vauvelle, Benjamin Wild, Roland Eils, Spiros C. Denaxas |
NeurIPS | 1 |