Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tailin Liu

dblp:12/9709 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0003-2508-9446ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
Language models and text generation · 67% Question answering and dialogue systems · 33%
Theoretical computer science
1 paper
Quantum computing and quantum information · 77% Coding theory · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model
1.012026
REAP: Enhancing RAG with Recursive Evaluation and Adaptive Planning for Multi-Hop Question Answering · AAAI 2026
Natural language and speech › Question answering and dialogue systems › reasoning-based question answering
multi-hop question answering
1.012026
REAP: Enhancing RAG with Recursive Evaluation and Adaptive Planning for Multi-Hop Question Answering · AAAI 2026
Natural language and speech › Language models and text generation
retrieval-augmented generation
1.012026
REAP: Enhancing RAG with Recursive Evaluation and Adaptive Planning for Multi-Hop Question Answering · AAAI 2026
Quantum computing and quantum information
quantum error correction
0.112005
Construction of nonbinary quantum cyclic codes by using graph method · Sci. China Ser. F Inf. Sci. 2005
Coding theory › error-correcting codes › q-ary codes
nonbinary codes
0.012005
Construction of nonbinary quantum cyclic codes by using graph method · Sci. China Ser. F Inf. Sci. 2005

Methods — techniques the papers use, named apart from their topics

recursive evaluation · 1.0multi-task fine-tuning · 1.0adaptive planning · 1.0graph methods · 0.1
YearPublicationVenuePosition
2026 REAP: Enhancing RAG with Recursive Evaluation and Adaptive Planning for Multi-Hop Question Answering
abstract
Retrieval-augmented generation (RAG) has been extensively employed to mitigate hallucinations in large language models (LLMs). However, existing methods for multi-hop reasoning tasks often lack global planning, increasing the risk of falling into local reasoning impasses. Insufficient exploitation of retrieved content and the neglect of latent clues fail to ensure the accuracy of reasoning outcomes. To overcome these limitations, we propose **R**ecursive **E**valuation and **A**daptive **P**lanning (REAP), whose core idea is to explicitly maintain structured sub-tasks and facts related to the current task through the Sub-task Planner (SP) and Fact Extractor (FE) modules. SP maintains a global perspective, guiding the overall reasoning direction and evaluating the task state based on the outcomes of FE, enabling dynamic optimization of the task-solving trajectory. FE performs fine-grained analysis over retrieved content to extract reliable answers and clues. These two modules incrementally enrich a logically coherent representation of global knowledge, enhancing the reliability and the traceability of the reasoning process. Furthermore, we propose a unified task paradigm design that enables effective multi-task fine-tuning, significantly enhancing SP's performance on complex, data-scarce tasks. We conduct extensive experiments on multiple public multi-hop datasets, and the results demonstrate that our method significantly outperforms existing RAG methods in both in-domain and out-of-domain settings, validating its effectiveness in complex multi-hop reasoning tasks.
Haojie Zhou, Wanting Hong, Tailin Liu
AAAI4
2005 Constructions of Almost Resilient Functions
Pinhui Ke, Tailin Liu, Qiaoyan Wen
CANS2
2005 Construction of nonbinary quantum cyclic codes by using graph method
Tailin Liu, Qiaoyan Wen
Sci. China Ser. F Inf. Sci.1