Demo Data from EDBT 2026 / reviewers in the wild / expert
Yisong Miao
dblp:256/9192
· DBLP profile ↗
6ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0009-8098-1489ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
3 papers |
Information extraction and text analysis · 36% Language models and text generation · 27% Trustworthy machine learning · 26% | |
| Databases, data mining, and information retrieval
2 papers |
Recommender systems · 80% Knowledge graphs · 20% |
Topics — the 13 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
circuit discovery |
0.9 | 1 | 2025 | Discursive Circuits: How Do Language Models Understand Discourse Relations? · EMNLP 2025 |
Machine learning › Trustworthy machine learning
language model interpretability |
0.9 | 1 | 2025 | Discursive Circuits: How Do Language Models Understand Discourse Relations? · EMNLP 2025 |
Recommender systems › interactive recommendation
conversational recommendation |
0.9 | 2 | 2020 | Estimation-Action-Reflection: Towards Deep Interaction Between Conversational and Recommender Systems · WSDM 2020 Interactive Path Reasoning on Graph for Conversational Recommendation · KDD 2020 |
Natural language and speech › Information extraction and text analysis › discourse analysis
discourse relation recognition |
0.8 | 1 | 2024 | Discursive Socratic Questioning: Evaluating the Faithfulness of Language Models' Understanding of Discourse Relations · ACL (1) 2024 |
Natural language and speech › Language models and text generation › evaluation of language models
faithfulness evaluation |
0.8 | 1 | 2024 | Discursive Socratic Questioning: Evaluating the Faithfulness of Language Models' Understanding of Discourse Relations · ACL (1) 2024 |
Natural language and speech › Question answering and dialogue systems
question-answering-based evaluation |
0.8 | 1 | 2024 | Discursive Socratic Questioning: Evaluating the Faithfulness of Language Models' Understanding of Discourse Relations · ACL (1) 2024 |
Natural language and speech › Language models and text generation › text evaluation
coherence modeling |
0.5 | 1 | 2021 | Have We Solved The Hard Problem? It's Not Easy! Contextual Lexical Contrast as a Means to Probe Neural Coherence · AAAI 2021 |
Natural language and speech › Language models and text generation › text representation
contextualized word embeddings |
0.5 | 1 | 2021 | Have We Solved The Hard Problem? It's Not Easy! Contextual Lexical Contrast as a Means to Probe Neural Coherence · AAAI 2021 |
Natural language and speech › Information extraction and text analysis › discourse analysis › discourse coherence
lexical cohesion |
0.5 | 1 | 2021 | Have We Solved The Hard Problem? It's Not Easy! Contextual Lexical Contrast as a Means to Probe Neural Coherence · AAAI 2021 |
Recommender systems
graph-based recommendation |
0.4 | 1 | 2020 | Interactive Path Reasoning on Graph for Conversational Recommendation · KDD 2020 |
Knowledge graphs › knowledge graph reasoning
path-based reasoning |
0.4 | 1 | 2020 | Interactive Path Reasoning on Graph for Conversational Recommendation · KDD 2020 |
Recommender systems › user modeling
user preference estimation |
0.4 | 1 | 2020 | Estimation-Action-Reflection: Towards Deep Interaction Between Conversational and Recommender Systems · WSDM 2020 |
Natural language and speech › Information extraction and text analysis › discourse analysis › discourse processing
discourse interpretation |
0.2 | 1 | 2024 | Discursive Socratic Questioning: Evaluating the Faithfulness of Language Models' Understanding of Discourse Relations · ACL (1) 2024 |
Methods — techniques the papers use, named apart from their topics
sparse computational graph · 0.9activation patching · 0.9in-context learning · 0.8counterfactual questioning · 0.8static embeddings · 0.5contextual embeddings · 0.5benchmarking · 0.5reinforcement learning · 0.4predictive modeling · 0.4graph path reasoning · 0.4dialogue policy learning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Discursive Circuits: How Do Language Models Understand Discourse Relations?abstractWhich components in transformer language models are responsible for discourse understanding?We hypothesize that sparse computational graphs, termed as discursive circuits, control how models process discourse relations.Unlike simpler tasks, discourse relations involve longer spans and complex reasoning.To make circuit discovery feasible, we introduce a task called Completion under Discourse Relation (CUDR), where a model completes a discourse given a specified relation.To support this task, we construct a corpus of minimal contrastive pairs tailored for activation patching in circuit discovery.Experiments show that sparse circuits (≈ 0.2% of a full GPT-2 model) recover discourse understanding in the English PDTB-based CUDR task.These circuits generalize well to unseen discourse frameworks such as RST and SDRT.Further analysis shows lower layers capture linguistic features such as lexical semantics and coreference, while upper layers encode discourse-level abstractions.Feature utility is consistent across frameworks (e.g., coreference supports Expansion-like relations).Input: dori = (Arg1, Arg2, R, Conn) d cf = (Arg1, Arg ′ 2 , R ′ , Conn ′ ) CUDR Task (Original): Please finish the discourse by choosing one of the two options: Arg2 or Arg ′ 2 To complete: Arg1, Conn Correct answer: Arg2, Incorrect answer: Arg ′ 2 Example: Please finish the discourse by choosing one of the two options: "he goes to the canteen" or "the canteen is closed" To complete: [Bob is hungry]Arg 1 [so]Conn ⇒ [he goes to the canteen]Arg 2 CUDR Task (Counterfactual): Please finish the discourse by choosing one of the two options: Arg2 or Arg ′ 2 To complete: Arg1, Conn ′ Correct answer: Arg ′2 , Incorrect answer: Arg2 Example: Please finish the discourse by choosing one of the two options: "he goes to the canteen" or "the canteen is closed" Yisong Miao, Min-Yen Kan |
EMNLP | 1 |
| 2024 | Discursive Socratic Questioning: Evaluating the Faithfulness of Language Models' Understanding of Discourse RelationsabstractWhile large language models have significantly enhanced the effectiveness of discourse relation classifications, it remains unclear whether their comprehension is faithful and reliable.We provide DISQ, a new method for evaluating the faithfulness of understanding discourse based on question answering.We first employ incontext learning to annotate the reasoning for discourse comprehension, based on the connections among key events within the discourse.Following this, DISQ interrogates the model with a sequence of questions to assess its grasp of core event relations, its resilience to counterfactual queries, as well as its consistency to its previous responses.We then evaluate language models with different architectural designs using DISQ, finding: (1) DISQ presents a significant challenge for all models, with the top-performing GPT model attaining only 41% of the ideal performance in PDTB; (2) DISQ is robust to domain shifts and paraphrase variations; (3) Open-source models generally lag behind their closed-source GPT counterparts, with notable exceptions being those enhanced with chat and code/math features; (4) Our analysis validates the effectiveness of explicitly signalled discourse connectives, the role of contextual information, and the benefits of using historical QA data. Discourse relation: Contingency.Cause.ResultIs "they keep changing their prices" a reason for "it's very frustrating"?Model's Answer: True Is "they keep changing their prices" contrasted with "it's very frustrating"?Is "it's very frustrating" the result of "they keep changing their prices"?🤖 Targeted Score = 1 Counterfactual Score = 0 Consistency Score = 0Arg2: It's very frustrating.Arg1: When I want to buy, they run from you --they keep changing their prices. Yisong Miao, Hongfu Liu 0002, Wenqiang Lei, Nancy F. Chen, Min-Yen Kan |
ACL (1) | 1 |
| 2024 | The ELCo Dataset: Bridging Emoji and Lexical CompositionabstractCan emojis be composed to convey intricate meanings like English phrases? As a pioneering study, we present the Emoji-Lexical Composition (ELCo) dataset, a new resource that offers parallel annotations of emoji sequences corresponding to English phrases. Our dataset contains 1,655 instances, spanning 209 diverse concepts from tangible ones like “right man” (✔️👨) to abstract ones such as “full attention” (🧐✍️, illustrating a metaphoric composition of a focusing face and writing hand). ELCo enables the analysis of the patterns shared between emoji and lexical composition. Through a corpus study, we discovered that simple strategies like direct representation and reduplication are sufficient for conveying certain concepts, but a richer, metaphorical strategy is essential for expressing more abstract ideas. We further introduce an evaluative task, Emoji-based Textual Entailment (EmoTE), to assess the proficiency of NLP models in comprehending emoji compositions. Our findings reveals the challenge of understanding emoji composition in a zero-shot setting for current models, including ChatGPT. Our analysis indicates that the intricacy of metaphorical compositions contributes to this challenge. Encouragingly, models show marked improvement when fine-tuned on the ELCo dataset, with larger models excelling in deciphering nuanced metaphorical compositions. Zi Yun Yang, Yisong Miao |
LREC/COLING | 3 |
| 2021 | Have We Solved The Hard Problem? It's Not Easy! Contextual Lexical Contrast as a Means to Probe Neural CoherenceabstractLexical cohesion is a fundamental mechanism for text which requires a pair of words to be interpreted as a certain type of lexical relation (e.g., similarity) to understand a coherent context; we refer to such relations as the contextual lexical relation. However, work on lexical cohesion has not modeled context comprehensively in considering lexical relations due to the lack of linguistic resources. In this paper, we take initial steps to address contextual lexical relations by focusing on the contrast relation, as it is a well-known relation though it is more subtle and relatively less resourced. We present a corpus named Cont 2 Lex to make Contextual Lexical Contrast Recognition a computationally feasible task. We benchmark this task with widely-adopted semantic representations; we discover that contextual embeddings (e.g. BERT) generally outperform static embeddings (e.g. Glove), but barely go beyond 70% in accuracy performance. In addition, we find that all embeddings perform better when CLC occurs within the same sentence, suggesting possible limitations of current computational coherence models. Another intriguing discovery is the improvement of BERT in CLC is largely attributed to its modeling of CLC word pairs co-occurring with other word repetitions. Such observations imply that the progress made in lexical coherence modeling remains relatively primitive even for semantic representations such as BERT that have been empowering numerous standard NLP tasks to approach human benchmarks. Through presenting our corpus and benchmark, we attempt to seed initial discussions and endeavors in advancing semantic representations from modeling syntactic and semantic levels to coherence and discourse levels. Wenqiang Lei, Yisong Miao, Runpeng Xie, Bonnie L. Webber, Meichun Liu, Tat-Seng Chua, Nancy F. Chen |
AAAI | 2 |
| 2020 | Interactive Path Reasoning on Graph for Conversational RecommendationabstractTraditional recommendation systems estimate user preference on items from past interaction history, thus suffering from the limitations of obtaining fine-grained and dynamic user preference. Conversational recommendation system (CRS) brings revolutions to those limitations by enabling the system to directly ask users about their preferred attributes on items. However, existing CRS methods do not make full use of such advantage --- they only use the attribute feedback in rather implicit ways such as updating the latent user representation. In this paper, we propose Conversational Path Reasoning (CPR), a generic framework that models conversational recommendation as an interactive path reasoning problem on a graph. It walks through the attribute vertices by following user feedback, utilizing the user preferred attributes in an explicit way. By leveraging on the graph structure, CPR is able to prune off many irrelevant candidate attributes, leading to a better chance of hitting user-preferred attributes. To demonstrate how CPR works, we propose a simple yet effective instantiation named SCPR (Simple CPR). We perform empirical studies on the multi-round conversational recommendation scenario, the most realistic CRS setting so far that considers multiple rounds of asking attributes and recommending items. Through extensive experiments on two datasets Yelp and LastFM, we validate the effectiveness of our SCPR, which significantly outperforms the state-of-the-art CRS methods EAR and CRM. In particular, we find that the more attributes there are, the more advantages our method can achieve. Wenqiang Lei, Gangyi Zhang, Xiangnan He 0001, Yisong Miao, Xiang Wang 0010, Liang Chen 0001, Tat-Seng Chua |
KDD | 4 |
| 2020 | Estimation-Action-Reflection: Towards Deep Interaction Between Conversational and Recommender SystemsabstractRecommender systems are embracing conversational technologies to obtain user preferences dynamically, and to overcome inherent limitations of their static models. A successful Conversational Recommender System (CRS) requires proper handling of interactions between conversation and recommendation. We argue that three fundamental problems need to be solved: 1) what questions to ask regarding item attributes, 2) when to recommend items, and 3) how to adapt to the users' online feedback. To the best of our knowledge, there lacks a unified framework that addresses these problems. In this work, we fill this missing interaction framework gap by proposing a new CRS framework named Estimation"Action" Reflection, or EAR, which consists of three stages to better converse with users. (1) Estimation, which builds predictive models to estimate user preference on both items and item attributes; (2) Action, which learns a dialogue policy to determine whether to ask attributes or recommend items, based on Estimation stage and conversation history; and (3) Reflection, which updates the recommender model when a user rejects the recommendations made by the Action stage. We present two conversation scenarios on binary and enumerated questions, and conduct extensive experiments on two datasets from Yelp and LastFM, for each scenario, respectively. Our experiments demonstrate significant improvements over the state-of-the-art method CRM [32], corresponding to fewer conversation turns and a higher level of recommendation hits. Wenqiang Lei, Xiangnan He 0001, Yisong Miao, Qingyun Wu, Richang Hong, Min-Yen Kan, Tat-Seng Chua |
WSDM | 3 |