EDBT 2026 Demo / reviewers in the wild / expert
Dongyang Zeng
dblp:418/4646
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 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.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › retrieval-augmented generation
context selection |
0.9 | 1 | 2025 | EAReranker: Efficient Embedding Adequacy Assessment for Retrieval Augmented Generation · NeurIPS 2025 |
Information retrieval › reranking
document re-ranking |
0.9 | 1 | 2025 | EAReranker: Efficient Embedding Adequacy Assessment for Retrieval Augmented Generation · NeurIPS 2025 |
Information retrieval
retrieval-augmented generation |
0.9 | 1 | 2025 | EAReranker: Efficient Embedding Adequacy Assessment for Retrieval Augmented Generation · NeurIPS 2025 |
Information retrieval
retrieval evaluation |
0.9 | 1 | 2025 | EAReranker: Efficient Embedding Adequacy Assessment for Retrieval Augmented Generation · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
embedding-based scoring · 0.9decoder-only transformer · 0.9bin-aware weighted loss · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Perturbation distillation and backdoor feature induction for universal defense in deep vision models
Dongyang Zeng, Shunzhao Zhang, Shuo Zhang 0011, Binxing Fang, Zhikai Yang |
Pattern Recognit. | 1 |
| 2025 | EAReranker: Efficient Embedding Adequacy Assessment for Retrieval Augmented GenerationabstractWith the increasing adoption of Retrieval-Augmented Generation (RAG) systems for knowledge-intensive tasks, ensuring the adequacy of retrieved documents has become critically important for generation quality. Traditional reranking approaches face three significant challenges: substantial computational overhead that scales with document length, dependency on plain text that limits application in sensitive scenarios, and insufficient assessment of document value beyond simple relevance metrics. We propose EAReranker, an efficient embedding-based adequacy assessment framework that evaluates document utility for RAG systems without requiring access to original text content. The framework quantifies document adequacy through a comprehensive scoring methodology considering verifiability, coverage, completeness and structural aspects, providing interpretable adequacy classifications for downstream applications. EAReranker employs a Decoder-Only Transformer architecture that introduces embedding dimension expansion method and bin-aware weighted loss, designed specifically to predict adequacy directly from embedding vectors. Our comprehensive evaluation across four public benchmarks demonstrates that EAReranker achieves competitive performance with state-of-the-art plaintext rerankers while maintaining constant memory usage ($\sim$550MB) regardless of input length and processing 2-3x faster than traditional approaches. The semantic bin adequacy prediction accuracy of 92.85\% LACC@10 and 86.12\% LACC@25 demonstrates its capability to effectively filter out inadequate documents that could potentially mislead or adversely impact RAG system performance, thereby ensuring only high-utility information serves as generation context. These results establish EAReranker as an efficient and practical solution for enhancing RAG system performance through improved context selection while addressing the computational and privacy challenges of existing methods. Dongyang Zeng, Wei Zhang 0049, Shuo Zhang 0011, Xinwang Liu 0002, Binxing Fang |
NeurIPS | 1 |