Demo Data from EDBT 2026 / reviewers in the wild / expert
Shudong Liu 0004
dblp:03/500-4
· DBLP profile ↗
6ranked-venue papers
3as first author
6since 2021 · last 2025
0009-0007-5180-9503ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-author · 5 since 2021Graphics, 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
4 papers |
Language models and text generation · 55% Trustworthy machine learning · 13% Reinforcement learning · 13% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
mathematical reasoning |
0.9 | 1 | 2025 | Is Your Model Really A Good Math Reasoner? Evaluating Mathematical Reasoning with Checklist · ICLR 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.9 | 1 | 2025 | Is Your Model Really A Good Math Reasoner? Evaluating Mathematical Reasoning with Checklist · ICLR 2025 |
Machine learning › Reinforcement learning › generalization in reinforcement learning
task generalization |
0.9 | 1 | 2025 | Is Your Model Really A Good Math Reasoner? Evaluating Mathematical Reasoning with Checklist · ICLR 2025 |
Natural language and speech › Language models and text generation
instruction tuning |
0.8 | 1 | 2024 | Can LLMs Learn Uncertainty on Their Own? Expressing Uncertainty Effectively in A Self-Training Manner · EMNLP 2024 |
Natural language and speech › Language models and text generation › language model analysis
uncertainty expression |
0.8 | 1 | 2024 | Can LLMs Learn Uncertainty on Their Own? Expressing Uncertainty Effectively in A Self-Training Manner · EMNLP 2024 |
Natural language and speech › Language models and text generation › text summarization
abstractive summarization |
0.7 | 1 | 2023 | Can LMs Generalize to Future Data? An Empirical Analysis on Text Summarization · EMNLP 2023 |
Machine learning › Transfer learning and domain adaptation
cross-lingual transfer |
0.7 | 1 | 2023 | kNN-TL: k-Nearest-Neighbor Transfer Learning for Low-Resource Neural Machine Translation · ACL (1) 2023 |
Natural language and speech › Machine translation › low-resource machine translation
low-resource neural machine translation |
0.7 | 1 | 2023 | kNN-TL: k-Nearest-Neighbor Transfer Learning for Low-Resource Neural Machine Translation · ACL (1) 2023 |
Natural language and speech › Language models and text generation
text summarization |
0.7 | 1 | 2023 | Can LMs Generalize to Future Data? An Empirical Analysis on Text Summarization · EMNLP 2023 |
Methods — techniques the papers use, named apart from their topics
checklist-based evaluation · 0.9automatic checklist generation · 0.9self-training · 0.8instruction tuning · 0.8neural machine translation · 0.7k-nearest neighbors · 0.7human evaluation · 0.7benchmark construction · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Is Your Model Really A Good Math Reasoner? Evaluating Mathematical Reasoning with ChecklistabstractExceptional mathematical reasoning ability is one of the key features that demonstrate the power of large language models (LLMs). How to comprehensively define and evaluate the mathematical abilities of LLMs, and even reflect the user experience in real-world scenarios, has emerged as a critical issue. Current benchmarks predominantly concentrate on problem-solving capabilities, presenting a substantial risk of model overfitting and fails to accurately measure the genuine mathematical reasoning abilities. In this paper, we argue that if a model really understands a problem, it should be robustly and readily applied across a diverse array of tasks. To this end, we introduce MathCheck, a well-designed checklist for testing task generalization and reasoning robustness, as well as an automatic tool to generate checklists efficiently. MathCheck includes multiple mathematical reasoning tasks and robustness tests to facilitate a comprehensive evaluation of both mathematical reasoning ability and behavior testing. Utilizing MathCheck, we develop MathCheck-GSM and MathCheck-GEO to assess mathematical textual reasoning and multi-modal reasoning capabilities, respectively, serving as upgraded versions of benchmarks including GSM8k, GeoQA, UniGeo, and Geometry3K. We adopt MathCheck-GSM and MathCheck-GEO to evaluate over 26 LLMs and 17 multi-modal LLMs, assessing their comprehensive mathematical reasoning abilities. Our results demonstrate that while frontier LLMs like GPT-4o continue to excel in various abilities on the checklist, many other model families exhibit a significant decline. Further experiments indicate that, compared to traditional math benchmarks, MathCheck better reflects true mathematical abilities and represents mathematical intelligence more linearly, thereby supporting our design. Using MathCheck, we can also efficiently conduct informative behavior analysis to deeply investigate models. Finally, we show that our proposed checklist paradigm can easily extend to other reasoning tasks for their comprehensive evaluation. Shudong Liu 0004, Maizhen Ning, Wei Liu 0131, Jindong Wang 0001, Derek F. Wong, Xiaowei Huang 0001, Qiufeng Wang 0001, Kaizhu Huang |
ICLR | 2 |
| 2024 | Can LLMs Learn Uncertainty on Their Own? Expressing Uncertainty Effectively in A Self-Training MannerabstractLarge language models (LLMs) often exhibit excessive, random, and uninformative uncertainty, rendering them unsuitable for decisionmaking in human-computer interactions.In this paper, we aim to instigate a heightened awareness of self-uncertainty in LLMs, enabling them to express uncertainty more effectively.To accomplish this, we propose an uncertainty-aware instruction tuning (UaIT) method, aligning LLMs' perception with the probabilistic uncertainty of the generation.We conducted experiments using LLaMA2 and Mistral on multiple free-form QA tasks.Experimental results revealed a surprising 45.2% improvement in the effectiveness of uncertainty expression by LLMs, accompanied by reasonably good out-of-domain generalization capabilities.Moreover, this uncertainty expression can serve as a valuable real-time basis for human decision-making, e.g., retrieving external documents and incorporating stronger LLMs 1 . Shudong Liu 0004, Zhaocong Li, Xuebo Liu 0002, Runzhe Zhan, Derek F. Wong, Lidia S. Chao, Min Zhang 0005 |
EMNLP | 1 |
| 2023 | kNN-TL: k-Nearest-Neighbor Transfer Learning for Low-Resource Neural Machine TranslationabstractShudong Liu, Xuebo Liu, Derek F. Wong, Zhaocong Li, Wenxiang Jiao, Lidia S. Chao, Min Zhang. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023. Shudong Liu 0004, Xuebo Liu 0002, Derek F. Wong, Zhaocong Li, Wenxiang Jiao, Lidia S. Chao, Min Zhang 0005 |
ACL (1) | 1 |
| 2023 | Can LMs Generalize to Future Data? An Empirical Analysis on Text SummarizationabstractRecent pre-trained language models (PLMs) achieve promising results in existing abstractive summarization datasets.However, existing summarization benchmarks overlap in time with the standard pre-training corpora and finetuning datasets.Hence, the strong performance of PLMs may rely on the parametric knowledge that is memorized during pre-training and fine-tuning.Moreover, the knowledge memorized by PLMs may quickly become outdated, which affects the generalization performance of PLMs on future data.In this work, we propose TEMPOSUM, a novel benchmark that contains data samples from 2010 to 2022, to understand the temporal generalization ability of abstractive summarization models.Through extensive human evaluation, we show that parametric knowledge stored in summarization models significantly affects the faithfulness of the generated summaries on future data.Moreover, existing faithfulness enhancement methods cannot reliably improve the faithfulness of summarization models on future data.Finally, we discuss several recommendations to the research community on how to evaluate and improve the temporal generalization capability of text summarization models. 1 Chi Seng Cheang, Hou Pong Chan, Derek F. Wong, Xuebo Liu 0002, Zhaocong Li, Shudong Liu 0004, Lidia S. Chao |
EMNLP | 7 |
| 2022 | A Graph Attention Interactive Refine Framework with Contextual Regularization for Jointing Intent Detection and Slot FillingabstractIntent detection and slot filling are two important tasks for spoken language understanding. Considering the close relation between them, most existing methods joint them by sharing parameters or establishing explicit connection between them for potentially benefiting each other. However, most of them only consider single directional connection and ignore their cross-impact between them. Moreover, these joint methods treat the predicted labels as the gold labels, which may cause error propagation. In this paper, we propose a two-stage Graph Attention Interactive Refine (GAIR) framework. In stage one, the basic SLU model predicts the coarse intent and slots. In stage two, we select the top-k candidate labels from stage one and construct a graph to make full advantage of intent and slot filling information. By constructing such graph, our framework can establish a bidirectional connection between two tasks and refine the coarse result, which can better take full use of cross-impact between two tasks. Moreover, contextual regularization is introduced for better alleviating error propagation. Experiments on two datasets show that our model achieves the state-of-the-arts performance. Zhanbiao Zhu, Peijie Huang, Shudong Liu 0004, Leyi Lao |
ICASSP | 4 |
| 2021 | Cross-domain Slot Filling with Distinct Slot Entity and Type Prediction
Shudong Liu 0004, Peijie Huang, Zhanbiao Zhu, Hualin Zhang, Jianying Tan |
NLPCC (1) | 1 |