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.

Yuting Song

dblp:186/2780 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Learning paradigms · 67% Question answering and dialogue systems · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
continual learning
1.012026
R-Tuning: Wavelet-Decomposed Replay and Semantic Alignment for Continual Adaptation of Pretrained Time-Series Models · AAAI 2026
Natural language and speech › Question answering and dialogue systems
medical dialogue systems
1.012026
Note2Chat: Improving LLMs for Multi-Turn Clinical History Taking Using Medical Notes · AAAI 2026
Machine learning › Learning paradigms › continual learning
rehearsal-based continual learning
1.012026
R-Tuning: Wavelet-Decomposed Replay and Semantic Alignment for Continual Adaptation of Pretrained Time-Series Models · AAAI 2026
Medical and health informatics
clinical decision support
1.012026
Note2Chat: Improving LLMs for Multi-Turn Clinical History Taking Using Medical Notes · AAAI 2026
Medical and health informatics › clinical diagnosis
diagnostic reasoning
1.012026
Note2Chat: Improving LLMs for Multi-Turn Clinical History Taking Using Medical Notes · AAAI 2026

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

supervised fine-tuning · 2.0simulated data augmentation · 2.0preference learning · 2.0decision tree-guided data generation · 2.0wavelet decomposition · 1.0latent consistency constraint · 1.0knowledge distillation · 1.0
YearPublicationVenuePosition
2026 R-Tuning: Wavelet-Decomposed Replay and Semantic Alignment for Continual Adaptation of Pretrained Time-Series Models
abstract
Pre-trained models have demonstrated exceptional generalization capabilities in time-series forecasting; however, adapting them to evolving data distributions remains a significant challenge. A key hurdle lies in accessing the original training data, as fine-tuning solely on new data often leads to catastrophic forgetting. To address this issue, we propose Replay Tuning (R-Tuning), a novel framework designed for the continual adaptation of pre-trained time-series models. R-Tuning constructs a unified latent space that captures both prior and current task knowledge through a frequency-aware replay strategy. Specifically, it augments model-generated samples via wavelet-based decomposition across multiple frequency bands, generating trend-preserving and fusion-enhanced variants to improve representation diversity and replay efficiency. To further reduce reliance on synthetic samples, R-Tuning introduces a latent consistency constraint that aligns new representations with the prior task space. This constraint guides joint optimization within a compact and semantically coherent latent space, ensuring robust knowledge retention and adaptation. Extensive experimental results demonstrate the superiority of R-Tuning, which reduces MAE and MSE by up to 46.9% and 46.8%, respectively, on new tasks, while preserving prior knowledge with gains of up to 5.7% and 6.0% on old tasks. Notably, under few-shot settings, R-Tuning outperforms all state-of-the-art baselines even when synthetic proxy samples account for only 5% of the new task dataset.
Tianyi Yin, Jingwei Wang 0001, Chenze Wang, Han Wang 0047, Jiexuan Cai, Min Liu 0002, Yuting Song, Weiming Shen 0001
AAAI9
2026 Note2Chat: Improving LLMs for Multi-Turn Clinical History Taking Using Medical Notes
abstract
Effective clinical history taking is a foundational yet underexplored component of clinical reasoning. While large language models (LLMs) have shown promise on static benchmarks, they often fall short in dynamic, multi-turn diagnostic settings that require iterative questioning and hypothesis refinement. To address this gap, we propose Note2Chat, a note-driven framework that trains LLMs to conduct structured history taking and diagnosis by learning from widely available medical notes. Instead of relying on scarce and sensitive dialogue data, we convert real-world medical notes into high-quality doctor-patient dialogues using a decision tree-guided generation and refinement pipeline. We then propose a three-stage fine-tuning strategy combining supervised learning, simulated data augmentation, and preference learning. Furthermore, we propose a novel single-turn reasoning paradigm that reframes history taking as a sequence of single-turn reasoning problems. This design enhances interpretability and enables local supervision, dynamic adaptation, and greater sample efficiency. Experimental results show that our method substantially improves clinical reasoning, achieving gains of +16.9 F1 and +21.0 Top-1 diagnostic accuracy over GPT-4o.
Yang Zhou 0017, Zhenting Sheng, Mingrui Tan, Yuting Song, Jun Zhou 0014, Yu Heng Kwan, Lian Leng Low, Yang Bai 0011, Yong Liu 0026
AAAI4
2024 Harnessing the Power of Large Language Model for Uncertainty Aware Graph Processing
abstract
Handling graph data is one of the most difficult tasks. Traditional techniques, such as those based on geometry and matrix factorization, rely on assumptions about the data relations that become inadequate when handling large and complex graph data. On the other hand, deep learning approaches demonstrate promising results in handling large graph data, but they often fall short of providing interpretable explanations. To equip the graph processing with both high accuracy and explainability, we introduce a novel approach that harnesses the power of a large language model (LLM), enhanced by an uncertainty-aware module to provide a confidence score on the generated answer. We experiment with our approach on two graph processing tasks: few-shot knowledge graph completion and graph classification. Our results demonstrate that through parameter efficient fine-tuning, the LLM surpasses state-of-the-art algorithms by a substantial margin across ten diverse benchmark datasets. Moreover, to address the challenge of explainability, we propose an uncertainty estimation based on perturbation, along with a calibration scheme to quantify the confidence scores of the generated answers. Our confidence measure achieves an AUC of 0.8 or higher on seven out of the ten datasets in predicting the correctness of the answer generated by LLM.
Yiming Qian, Yuting Song, Hai Jin 0001, Chen Yu 0003
LREC/COLING3
2022 Unbiased feature generating for generalized zero-shot learning
Chang Niu, Junyuan Shang, Junchu Huang, Junmei Yang, Yuting Song, Zhiheng Zhou 0001, Guoxu Zhou
J. Vis. Commun. Image Represent.5
2017 Cross-Language Record Linkage Across Humanities Collections Using Metadata Similarities Among Languages
Yuting Song
TPDL1