Demo Data from EDBT 2026 / reviewers in the wild / expert
Vijay S. Nori
dblp:24/4991
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1
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 · 44% Language models and text generation · 22% Information extraction and text analysis · 22% | |
| Theoretical computer science
1 paper |
Approximation and online algorithms · 87% Algorithmic game theory and mechanism design · 13% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › interpretability › attribution methods
feature attribution |
0.9 | 1 | 2025 | OrdShap: Feature Position Importance for Sequential Black-Box Models · NeurIPS 2025 |
Machine learning › Trustworthy machine learning
interpretability |
0.9 | 1 | 2025 | OrdShap: Feature Position Importance for Sequential Black-Box Models · NeurIPS 2025 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.3 | 1 | 2025 | Memorize and Rank: Elevating Large Language Models for Clinical Diagnosis Prediction · AAAI 2025 |
Machine learning › Representation and self-supervised learning › contrastive learning
hierarchical contrastive learning |
0.3 | 1 | 2025 | Memorize and Rank: Elevating Large Language Models for Clinical Diagnosis Prediction · AAAI 2025 |
Approximation and online algorithms
online algorithms |
0.0 | 1 | 1999 | Online Resource Minimization · SODA 1999 |
Approximation and online algorithms
resource minimization |
0.0 | 1 | 1999 | Online Resource Minimization · SODA 1999 |
Algorithmic game theory and mechanism design
resource allocation |
0.0 | 1 | 1999 | Online Resource Minimization · SODA 1999 |
Methods — techniques the papers use, named apart from their topics
shapley value · 0.9fine-tuning · 0.9contrastive learning · 0.9competitive analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Memorize and Rank: Elevating Large Language Models for Clinical Diagnosis PredictionabstractClinical diagnosis prediction models, when provided with a patient's medical history, aim to detect potential diseases early, facilitating timely intervention and improving prognostic outcomes. However, the inherent scarcity of patient data and large disease candidate space often pose challenges in developing satisfactory models for this intricate task. The exploration of leveraging Large Language Models (LLMs) for encapsulating clinical decision processes has been limited. We introduce MERA, a clinical diagnosis prediction model that bridges pertaining natural language knowledge with medical practice. We apply hierarchical contrastive learning on a disease candidate ranking list to alleviate the large decision space issue. With concept memorization through fine-tuning, we bridge the natural language clinical knowledge with medical codes. Experimental results on MIMIC-III and IV datasets show that MERA achieves the state-of-the-art diagnosis prediction performance and dramatically elevates the diagnosis prediction capabilities of generative LMs. Mingyu Derek Ma, Yijia Xiao, Anthony Cuturrufo, Vijay S. Nori, Eran Halperin, Wei Wang 0010 |
AAAI | 5 |
| 2025 | OrdShap: Feature Position Importance for Sequential Black-Box ModelsabstractSequential deep learning models excel in domains with temporal or sequential dependencies, but their complexity necessitates post-hoc feature attribution methods for understanding their predictions. While existing techniques quantify feature importance, they inherently assume fixed feature ordering — conflating the effects of (1) feature values and (2) their positions within input sequences. To address this gap, we introduce OrdShap, a novel attribution method that disentangles these effects by quantifying how a model's predictions change in response to permuting feature position. We establish a game-theoretic connection between OrdShap and Sanchez-Bergantiños values, providing a theoretically grounded approach to position-sensitive attribution. Empirical results from health, natural language, and synthetic datasets highlight OrdShap's effectiveness in capturing feature value and feature position attributions, and provide deeper insight into model behavior. Davin Hill, Brian L. Hill, Aria Masoomi, Vijay S. Nori, Robert E. Tillman, Jennifer G. Dy |
NeurIPS | 4 |
| 1999 | Online Resource Minimization
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh, Craig A. Tovey |
SODA | 2 |