EDBT 2026 Demo / reviewers in the wild / expert
Varun Mulchandani
dblp:399/9804
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—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 |
Trustworthy machine learning · 56% Efficient and distributed learning · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › data selection
data pruning |
0.9 | 1 | 2025 | Severing Spurious Correlations with Data Pruning · ICLR 2025 |
Machine learning › Trustworthy machine learning › robustness
spurious correlation |
0.9 | 1 | 2025 | Severing Spurious Correlations with Data Pruning · ICLR 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.3 | 1 | 2025 | Severing Spurious Correlations with Data Pruning · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
spurious feature detection · 0.9data pruning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Severing Spurious Correlations with Data PruningabstractDeep neural networks have been shown to learn and rely on spurious correlations present in the data that they are trained on. Reliance on such correlations can cause these networks to malfunction when deployed in the real world, where these correlations may no longer hold. To overcome the learning of and reliance on such correlations, recent studies propose approaches that yield promising results. These works, however, study settings where the strength of the spurious signal is significantly greater than that of the core, invariant signal, making it easier to detect the presence of spurious features in individual training samples and allow for further processing. In this paper, we identify new settings where the strength of the spurious signal is relatively weaker, making it difficult to detect any spurious information while continuing to have catastrophic consequences. We also discover that spurious correlations are learned primarily due to only a handful of all the samples containing the spurious feature and develop a novel data pruning technique that identifies and prunes small subsets of the training data that contain these samples. Our proposed technique does not require inferred domain knowledge, information regarding the sample-wise presence or nature of spurious information, or human intervention. Finally, we show that such data pruning attains state-of-the-art performance on previously studied settings where spurious information is identifiable. Varun Mulchandani, Jung-Eun Kim |
ICLR | 1 |