Papers by Ting Xiao
Copied to clipboard
| Challenge: | Existing models for abductive reasoning based on formal logic lack commonsense knowledge and effective reasoning mechanism. |
| Approach: | They propose a narrative text-based abductive reasoning task NLI with a latent variable to capture commonsense knowledge from event graph for guiding the abductive reasoning task. |
| Outcome: | The proposed model outperforms baseline methods on the abductive reasoning task. |
Copied to clipboard
| Challenge: | Existing methods fine-tune pre-trained models on cognitive data, ignoring the semantic gap between texts and cognitive signals. |
| Approach: | They propose a framework that can induce fine-grained cognitive features from cognitive data and incorporate them into pre-trained language models by adaptively adjusting the weight of cognitive features for different NLP tasks. |
| Outcome: | The proposed framework can induce fine-grained cognitive features from cognitive data and incorporate them into BERT by adaptively adjusting weight of cognitive features for different NLP tasks. |
Copied to clipboard
| Challenge: | Existing methods to learn event representations from text lack commonsense knowledge about the intents and emotions of event participants. |
| Approach: | They propose to leverage external commonsense knowledge about the intent and sentiment of the event to learn distributed representations for structured events from text. |
| Outcome: | The proposed model improves on hard similarity tasks and yields more precise inferences on subsequent events under given contexts. |
Copied to clipboard
| Challenge: | Causal chain reasoning models suffer from two main transitive problems: threshold effect and scene drift. |
| Approach: | They propose a framework that uses exogenous variables to represent causal pairs and estimates the threshold and scene contradictions using structural causal recurrent neural networks. |
| Outcome: | The proposed framework outperforms baselines on Chinese and English CCR datasets. |
Copied to clipboard
| Challenge: | Existing studies show that large language models (LLMs) are often prone to stance homogeneity and human preference biases when faced with conflicting perspectives. |
| Approach: | They propose a novel two-stage training framework to address stance homogeneity bias and human preference bias by generating multi-model discussion datasets and optimizing reinforcement learning from human feedback to align with discussion correctness. |
| Outcome: | The proposed framework reduces stance homogeneity bias and human preference bias and improves generalization capabilities on non-discussion scenarios and out-of-domain datasets. |
Copied to clipboard
| Challenge: | Automated Essay Assessment (AEA) aims to judge students’ writing proficiency in an automatic way. |
| Approach: | They propose to use Chinese AEA system IFlyEssayAssess to evaluate essays written by native Chinese students from primary and junior schools. |
| Outcome: | The proposed system provides application services for essay scoring, review generation, recommendation, and explainable analytical visualization. |
Copied to clipboard
| Challenge: | Recent studies provide large language models with textual task-solving experiences via prompts to improve their performance. |
| Approach: | They propose to use prompts to provide LLMs with textual task-solving experiences during their inference stage. |
| Outcome: | The proposed framework improves the performance of large language models on 13 datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have achieved significant performance in various natural language reasoning tasks, but struggle with performing first-order logic reasoning over formal logical theories expressed in natural language. |
| Approach: | They propose a framework which introduces the paradigm of resolution refutation to solve first-order logic reasoning problems by extending reasoning rules and employing the principle of proof by contradiction. |
| Outcome: | The proposed framework outperforms existing models while maintaining performance in simple scenarios. |
Copied to clipboard
| Challenge: | Existing data arbitration strategies for large language model training rely on surface-level heuristics that fail to diagnose intrinsic learning needs. |
| Approach: | They propose a framework that arbitrates data based on its degree of cognitive conflict with the model's existing knowledge. |
| Outcome: | Extensive experiments on WebShop and ALFWorld show that PRISM outperforms state-of-the-art hybrid methods while reducing computational costs by up to 3.22 . |
Copied to clipboard
| Challenge: | Existing methods for selecting training data from general datasets fail to account for the joint distribution of instructions, resulting in inefficient learning and suboptimal knowledge transfer. |
| Approach: | They propose a method that constructs a mixed gradient-based instruction graph to capture the joint distribution and interdependencies among instructions. |
| Outcome: | The proposed method outperforms existing methods on domain adaptation tasks and in complex, data-scarce scenarios. |
Copied to clipboard
| Challenge: | Existing studies focus on inconsistency issues within a single LLM, while we explore the inter-consistencies among multiple LLMs for collaboration. |
| Approach: | They propose a formal debate framework to examine whether LLMs can collaborate effectively to achieve a consensus for a shared goal. |
| Outcome: | The proposed framework enables LLMs to achieve consensus in three real-world debate scenarios with real-time scenarios aligned to the LLM's goals. |
Copied to clipboard
| Challenge: | Experimental results demonstrate that our models achieve over 7% performance improvement compared to both SFT and RL-with-SFT models under the same experimental settings. |
| Approach: | They propose a dynamic generalization-guided reward design for rule-based RL that shifts rewards from exploratory to exploitative tool-use patterns. |
| Outcome: | The proposed model achieves over 7% performance improvement compared to SFT and RL-with-SFT models under the same experimental settings. |
Copied to clipboard
| Challenge: | Existing work on tree structures uses syntactic parsers or Treebank annotations to perform target-dependent classifications. |
| Approach: | They propose a reinforcement learning based approach which automatically induces target-specific sentence representations over tree structures. |
| Outcome: | The proposed model gives superior performance on two benchmark tasks compared to previous work on parsed trees . |
Copied to clipboard
| Challenge: | Large language models (LLMs) suffer from severe hallucination issues due to the knowledge misalignment between the pre-training stage and the supervised fine-tuning stage. |
| Approach: | They propose a training objective with an abstention mechanism that selectively rejects tokens that misalign with the desired knowledge distribution via a special [REJ] token. |
| Outcome: | The proposed model selectively rejects tokens that misalign with the desired knowledge distribution via a special [REJ] token. |
Copied to clipboard
| Challenge: | Group-Relative Policy Optimization (GRPO) has emerged as an efficient paradigm for aligning Large Language Models (LLMs), but its efficacy is confined to domains with verifiable ground truths. |
| Approach: | They propose a meta-cognitive orchestration layer that treats reward scalarization as a dynamic latent policy, leveraging the model’s terminal hidden states as 'a semantic bottleneck' . Across seven benchmarks, MAESTRO consistently outperforms single-reward and static multi-objective baselines while preserving the efficiency advantages of GRPO. |
| Outcome: | The proposed model outperforms single-reward and static multi-objective baselines while preserving efficiency advantages. |
Copied to clipboard
| Challenge: | Recent speech foundation models excel at multilingual automatic speech recognition (ASR) for high-resource languages, but their performance drops substantially on low-resourced languages due to the limited data availability. |
| Approach: | They propose a Depth-Aware Model Adaptation framework that allocates adaptation capacity according to each layer’s role. |
| Outcome: | The proposed framework matches or surpasses state-of-the-art accuracy with 80% fewer trainable parameters and achieves 29% error reduction under extreme data scarcity. |
Copied to clipboard
| Challenge: | Simile is a special type of metaphor, where comparators such as like and as are used to compare two objects. |
| Approach: | They propose a neural network framework for simile sentence classification, simile component extraction and language modeling. |
| Outcome: | The proposed framework outperforms rule-based and feature-based approaches in simile sentence classification and simile component extraction tasks. |
Copied to clipboard
| Challenge: | Existing causal reasoning models only learn to induce empirical causal patterns that are predictive to the label, while human beings seek for deep and conceptual understanding of the causality to explain the observed causal facts. |
| Approach: | They present a human-annotated CAusal REasoning dataset with conceptual explanations of the causality. |
| Outcome: | The presented dataset shows that human-annotated explanations can be useful for promoting the accuracy and stability of causal reasoning models. |
Copied to clipboard
| Challenge: | Recent studies show remarkable success in end-to-end task-oriented dialog systems . however, most models rely on large training data, which is difficult to scalable for new domains with limited labeled data. |
| Approach: | They propose a shared-private network which exploits the relevance between the target domain and each domain. |
| Outcome: | The proposed model outperforms existing methods on multi-domain dialogue by 13.9% on average. |
Copied to clipboard
| Challenge: | Existing methods to verify factuality of claims do not provide sufficient evidence for explainable fact-checking systems. |
| Approach: | They propose a method to automatically retrieve and summarize evidence from the Web and a novel multilingual explainable fact-checking dataset on the Russia-Ukraine conflict in 2022. |
| Outcome: | The proposed method can retrieve and summarize evidence from the Web and generate explanations in 16 languages. |
Copied to clipboard
| Challenge: | Existing arguments generation methods often overlook connections between opinions . Existing methods struggle with providing compelling proof . |
| Approach: | They propose a two-stage framework for argumentative essay generation with a focus on logical enhancement. |
| Outcome: | The proposed framework generates argumentative essays with better logical validity and persuasiveness than baseline models. |
Copied to clipboard
| Challenge: | Existing reading comprehension datasets are mostly in English . MRC is a new field of research that aims to comprehend the context of articles and answer the questions based on them. |
| Approach: | They propose a Span-Extraction dataset for Chinese machine reading comprehension to add language diversities to existing reading comprehension datasets. |
| Outcome: | The proposed dataset is composed of 20,000 real questions annotated on Wikipedia paragraphs by human experts. |
Copied to clipboard
| Challenge: | Existing approaches to generating entailment trees lack logical consistency . static reward structures or intricate dependencies within multi-step reasoning are often ignored . |
| Approach: | They propose a method that integrates natural logic principles into reinforcement learning to guide entailment tree generation. |
| Outcome: | Experiments on EntailmentBank show that the proposed method improves interpretability and generalization. |
Copied to clipboard
| Challenge: | Existing approaches focus on merging language models tuned on single objectives . existing approaches ignore the impacts of competing objectives on model tuning . |
| Approach: | They propose a model merging approach that seeks a series of backbone models and merges them according to user preferences. |
| Outcome: | The proposed approach exhibits strong controllability and Pareto optimality in controllable multi-objective generation. |
Copied to clipboard
| Challenge: | Existing causal datasets focus on the commonsense domain, but LLMs perform poorly when answering complex questions. |
| Approach: | They propose a multidisciplinary causal evaluation benchmark to assess LLMs' knowledge and skills. |
| Outcome: | The proposed model improves in domain specialization, structural diversity, and task complexity. |
Copied to clipboard
| Challenge: | Large-scale contexts hinder LLMs’ reasoning abilities while moderate contexts perform better for LLM. |
| Approach: | They propose a semantic-propagation collaboration-base framework that integrates small language models with LLMs for effective rumor detection. |
| Outcome: | The proposed framework bridges the gap between LLMs and LLM in facing long, structured data and offers a novel solution for rumor detection on social media. |
Copied to clipboard
| Challenge: | Existing approaches to provide LLMs with textual task-solving experience rely on manual efforts to acquire and apply such experience for each task. |
| Approach: | They propose a lifelong autonomous experiential learning framework based on LLMs that learns and accumulates experience through experience transfer and induction. |
| Outcome: | The proposed framework performs reliably in each intermediate step and improves GPT-3.5 and GPT-4 on widely used NLP datasets. |
Copied to clipboard
| Challenge: | Existing question answering models are based on textual entailment tasks . prior work has focused on QA on premise-based questions . |
| Approach: | They propose a neural-symbolic QA approach that integrates natural logic reasoning within deep learning architectures towards developing effective question answering models. |
| Outcome: | The proposed model outperforms previous work on multiple-choice science questions . it integrates natural logic reasoning within deep learning architectures to build proof paths . |
Copied to clipboard
| Challenge: | Existing joint models for multi-intent SLU only consider intent detection while ignoring slot filling task. |
| Approach: | They propose a non-autoregressive model for joint multiple intent detection and slot filling . their framework is 11.5 times faster than existing joint models . |
| Outcome: | The proposed model is 11.5 times faster than existing models and is faster than current models. |
Copied to clipboard
| Challenge: | Recent work considers learning dense representations for news titles and abstracts . text representations can address the sparsity of discrete indicators in statistical models . |
| Approach: | They propose to use news abstracts to combine the most informative sentences in news content to learn dense representations for text elements. |
| Outcome: | The proposed model can be used to estimate abnormal returns of companies when compared to titles and abstracts. |
Copied to clipboard
| Challenge: | Existing studies have suggested that the composition of the pretraining corpus exerts a significant impact upon the performance of LLMs. |
| Approach: | They analyze the impact of 48 datasets from 5 major categories of pretraining data of Large Language Models and measure their impacts on LLMs using benchmarks about nine major categories. |
| Outcome: | The proposed analysis provides insights into the organization of data to support more efficient pretraining of Large Language Models. |
Copied to clipboard
| Challenge: | Currently, LLMs learn in a data-driven schema while the instructions about complex tasks are both scarce and hard to collect or construct. |
| Approach: | They employ a gradient-based method to dissect the process that the Supervised Fine-tuning Process (SFT) adapts LLMs to downstream tasks via the perspective of attention patterns. |
| Outcome: | The proposed method dissects the process that the SFT process adapts LLMs to downstream tasks via the perspective of attention patterns. |
Copied to clipboard
| Challenge: | Existing methods to evaluate ChatGPT's causal reasoning abilities are based on pre-trained language models, but they rely on supervised training. |
| Approach: | They conduct the first comprehensive evaluation of ChatGPT’s causal reasoning capabilities using four state-of-the-art (STA) simulations. |
| Outcome: | The proposed model is not a good causal reasoner, but a great causal interpreter. |
Copied to clipboard
| Challenge: | Existing approaches to debiase Natural Language Understanding models use dataset biases instead of learning the intended task. |
| Approach: | They propose a debiasing framework that detects and purifies dataset biases using information entropy. |
| Outcome: | The proposed framework improves the stability of performance on out-of-distribution datasets for a set of widely adopted NLU models. |
Copied to clipboard
| Challenge: | Existing work infers the causation between events based on knowledge from annotated causal event pairs, but additional evidence information is unexploited. |
| Approach: | They propose an Event graph knowledge enhanced explainable CAusal Reasoning framework that acquires additional evidence information from a large-scale causal event graph as logical rules for causal reasoning. |
| Outcome: | The proposed framework outperforms state-of-the-art methods in human evaluation and in animal models. |
Copied to clipboard
| Challenge: | Existing works focus on complex tasks like math and code, while complex commonsense reasoning remains underexplored due to its uncertainty and lack of structure. |
| Approach: | They propose to build a benchmark for large language models based on complex commonsense reasoning based upon causal event graphs and causal theory. |
| Outcome: | The proposed benchmark combines a complex commonsense reasoning benchmark with a detective story to achieve a more challenging subset. |
Copied to clipboard
| Challenge: | Existing work to mitigate the effect of noisy labels is limited to specific tasks or training procedures, making it hard to be widely used. |
| Approach: | They propose a stochastic tailor-made gradient noise to mitigate the effect of noisy labels by introducing benign noise into stochistic gradient descent. |
| Outcome: | The proposed method can be used to discriminate correct samples from incorrect ones and boost existing training methods. |
Copied to clipboard
| Challenge: | RankDyna is a matrix decomposition method that can be used to compress Transformer-based language models. |
| Approach: | They propose a matrix decomposition method that enables dynamic rank resource allocation . they say it can outperform current SOTA methods under various parameter budget levels . |
| Outcome: | The proposed method outperforms current SOTA methods under various budget levels . the proposed method is more efficient with higher compression rates . |
Copied to clipboard
| Challenge: | Large-scale datasets in the real world often contain label noise, which can cause model overfitting and degrade generalization. |
| Approach: | They propose to use label noise to imitate human errors in annotations . they use a noisy label noise benchmark to evaluate their methods . |
| Outcome: | The proposed benchmarks are different from data with heterogeneous label noises in the real world. |
Copied to clipboard
| Challenge: | Understanding event and event-centered commonsense reasoning is crucial for natural language processing (NLP). |
| Approach: | They propose a If-Then commonsense reasoning dataset Atomic and an RNN-based Seq2Seq model to facilitate this. |
| Outcome: | The proposed model improves the accuracy and diversity of inferences compared with baseline methods. |
Copied to clipboard
| Challenge: | Existing benchmarks for large language models are constrained to datasets where each sample is manually injected with only one type of bias. |
| Approach: | They propose a multi-bias benchmark where each sample contains multiple types of biases. |
| Outcome: | The proposed benchmark shows that existing LLMs and debiasing methods perform poorly on this benchmark, highlighting the challenge of eliminating compounded biases. |
Copied to clipboard
| Challenge: | Synthesizing tool-use data through real-world simulations is effective for enhancing large language models (LLMs) however, training gains decay as synthetic data increases, and the model struggles to benefit from more synthetic data. |
| Approach: | They propose an iterative reinforced fine-tuning strategy to improve LLMs with external tools to augment their capabilities. |
| Outcome: | The proposed method achieves 13.11% better performance than the same-size base model and outperforms larger open-source and closed-source models. |
Copied to clipboard
| Challenge: | Existing models focus on the single intent scenario, ignoring the fine-grained multiple intents information integration for token-level slot prediction. |
| Approach: | They propose an Adaptive Graph-Interactive Framework for joint multiple intent detection and slot filling . they propose an intent-slot graph interaction layer to model the strong correlation between the slot and intents . |
| Outcome: | The proposed framework improves on three multi-intent datasets and new state-of-the-art performance on single-intention datasets. |
Copied to clipboard
| Challenge: | Story generation is a challenging problem in artificial intelligence (AI) . previous work focused on learning statistical models of event sequences from large-scale text corpora . |
| Approach: | They propose to use adversarial training to generate reasonable story endings . their model includes a generator that defines the policy of generating a story ending . |
| Outcome: | The proposed model achieves better performance on the task of Story Cloze Test with an accuracy of 62.6% compared with state-of-the-art baseline methods. |
Copied to clipboard
| Challenge: | Existing methods for RRG rely on supervised fine-tuning based on data pairs of radiological images and corresponding radiologist-annotated reports. |
| Approach: | They propose a method that performs supervised fine-tuning on data pairs of radiological images and corresponding radiologist-annotated reports. |
| Outcome: | The proposed method surpasses existing methods and achieves state-of-the-art performance across multiple evaluation metrics. |
Copied to clipboard
| Challenge: | Existing methods to predict subsequent events use sparsity of event graph to improve performance. |
| Approach: | They propose to automatically build event graph using a BERT model by adding a structured variable to the model to learn to predict event connections. |
| Outcome: | The proposed model outperforms state-of-the-art models on two event prediction tasks. |
Copied to clipboard
| Challenge: | Existing methods for parameter-efficient fine-tuning are limited by computational and storage requirements. |
| Approach: | They propose a budget-guided iterative search strategy to disentangle binary module and rank dimension search spaces and early selection strategies based on parameter budgets. |
| Outcome: | The proposed method significantly improves search efficiency on public benchmarks. |
Copied to clipboard
| Challenge: | Instruction Following (IF) is a core capability of LLMs, requiring strict adherence to diverse constraints. |
| Approach: | They propose a framework that uses tiny language models to evaluate instruction following . they propose to use a set of specialized tiny language model to provide rewards for soft constraints. |
| Outcome: | The proposed framework outperforms baseline models by 12% and speeds up training time by 3. |
Copied to clipboard
| Challenge: | IRNet synthesizes SQL queries in an end-to-end manner, but it yields unsatisfactory performance on public benchmarks. |
| Approach: | They propose a neural approach called IRNet for complex and cross-domain Text-to-SQL. |
| Outcome: | IRNet achieves 46.7% accuracy on the Spider benchmark, a 19.5% improvement over state-of-the-art approaches. |