Papers by Chao Jiang
Copied to clipboard
| Challenge: | Existing methods to answer complex questions require reasoning over knowledge graphs (KGs) state-of-the-art methods constrain retrieved knowledge in local subgraphs and discard more diverse triplets that are disconnected but useful for question answering. |
| Approach: | They propose a method to retrieve the most relevant triplets from KGs and then rerank them, which are then concatenated with questions to be fed into language models. |
| Outcome: | The proposed method outperforms state-of-the-art methods on commonsenseQA and OpenbookQA datasets with 4.6% absolute accuracy. |
Copied to clipboard
| Challenge: | Existing MRC models are unable to integrate general knowledge with human knowledge. |
| Approach: | They propose a data enrichment method which uses WordNet to extract inter-word semantic connections as general knowledge from each given passage-question pair. |
| Outcome: | The proposed model outperforms state-of-the-art models and is robust to noise. |
Copied to clipboard
| Challenge: | Modern recommender systems aim to understand user-item relationships through past interactions, but their effectiveness is limited when handling sparse data or zero-shot scenarios. |
| Approach: | They propose a model-agnostic recommendation instruction-tuning paradigm that integrates large language models with collaborative filtering. |
| Outcome: | The proposed model-agnostic recommendation instruction-tuning paradigm improves performance across various settings and plug-and-play compatibility with state-of-the-art recommender systems. |
Copied to clipboard
| Challenge: | Existing benchmarks primarily evaluate planning and execution success, overlooking the self-reflective dimension of tool use. |
| Approach: | They propose a benchmark to assess LLMs’ self-reflective reasoning in tool-augmented multi-turn dialogues. |
| Outcome: | The proposed benchmark covers 10 domains with 88 distinct APIs and 968 annotated dialogues, systematically injecting diverse error types arising from both user and assistant behavior. |
Copied to clipboard
| Challenge: | Existing jailbreaking methods generate harmful and unethical content when subjected to jailbreaking attacks. |
| Approach: | They propose a black-box jailbreaking method with optimizable suffixes that translate jailbreaking objectives into natural language instructions. |
| Outcome: | The proposed method outperforms existing methods by 2.4 times in the ASR of three open-source LLMs and GPT-3.5-Turbo. |
Copied to clipboard
| Challenge: | Existing approaches fail in cold-start and cross-domain scenarios where new users or items lack sufficient interaction history. |
| Approach: | They propose a foundation model for sequential recommendation that achieves genuine zero-shot generalization capabilities by deriving item representations exclusively from textual features. |
| Outcome: | The proposed model achieves zero-shot generalization capabilities in cold-start and cross-domain scenarios. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been used for general-purpose interfaces across multiple tasks and languages. |
| Approach: | They propose to use large language models as a general-purpose interface across multiple tasks and languages. |
| Outcome: | The proposed model performs better on 200K hours of 6-language data for voice generation applications. |
Copied to clipboard
| Challenge: | Existing methods for learning continual tasks do not cache history data, which makes the problem more challenging. |
| Approach: | They propose a method that allocates a small portion of private parameters and learns them with a shared pre-trained model. |
| Outcome: | The proposed method is comparable to existing methods and comparable to those using historical data. |
Copied to clipboard
| Challenge: | Pre-trained language models suffer from severe miscalibration for both in-distribution and out-of-difference data due to over-parameterization. |
| Approach: | They propose a regularized method to improve in-distribution and out-of-distance calibrations by using on-manifold regularization and off-manfold regularisation. |
| Outcome: | The proposed method outperforms existing methods for text classification in terms of expectation calibration error, misclassification detection, and OOD detection on six datasets. |
Copied to clipboard
| Challenge: | a new CLTL model is proposed to facilitate cross-linguistic transfer learning between distant languages . a key to CLTL is to learn a shared representation space for the given source-target language pair. |
| Approach: | They propose a new CLTL model that integrates machine translation with MT . they use an unannotated data technique to make use of the model's pre-training and fine-tuning . |
| Outcome: | The proposed model achieves better CLTL performance than the baseline model without more annotated data. |
Copied to clipboard
| Challenge: | Existing LLMs often rely on complex prompting or extensive fine-tuning to introduce new capabilities while preserving strong generalizability. |
| Approach: | They propose a large-scale pre-training corpus to enhance LLM agents' capabilities . they use 103B agent-specific data encompassing 76,537 APIs . |
| Outcome: | The proposed training corpus outperforms open-source LLMs and commercial LLM agents on three agent benchmarks. |
Copied to clipboard
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
Copied to clipboard
| Challenge: | Existing methods for AVE are limited on rare attributes due to poor generalization ability. |
| Approach: | They propose to leverage pretraining and transfer learning to address weaknesses in existing methods. |
| Outcome: | The proposed method achieves new state-of-the-art performance without pretraining on rare attributes with limited training resources. |
Copied to clipboard
| Challenge: | Speculative decoding (SD) is a powerful and efficient way to accelerate autoregressive generation. |
| Approach: | They propose a training-free framework that recovers valid tokens discarded by standard verification . they use online correction memory and Semantic Consistency Gating to analyze rejections . |
| Outcome: | The proposed framework outperforms existing methods and achieves peak throughput speedup of 2.33x. |
Copied to clipboard
| Challenge: | Recent approaches to fine-tuning of large language models suffer from task interference and catastrophic forgetting. |
| Approach: | They propose a fine-tuning framework that adapts isolation decisions based on online estimates of parameter importance. |
| Outcome: | The proposed framework reduces interference and forgetting while releasing outdated parameters to recover plasticity. |
Copied to clipboard
| Challenge: | drafting method statements is labor-intensive and time-consuming . traditional methods involve using static templates filled in manually by engineers . |
| Approach: | They propose a framework that automates method statement generation by using multi-agent collaboration. |
| Outcome: | The proposed framework achieves 4.38 ContentScore, excelling in specialization, completeness, organization, and clarity. |
Copied to clipboard
| Challenge: | Existing Twitter-based paraphrase datasets lack quality definitions for identification and generation tasks. |
| Approach: | They propose to use two separate definitions of paraphrase for identification and generation tasks in existing Twitter-based paraphrase datasets. |
| Outcome: | The proposed model achieves state-of-the-art performance of 84.2 F1 for automatic paraphrase identification compared to other models fine-tuned on other corpora such as Quora, MSCOCO, and ParaNMT. |
Copied to clipboard
| Challenge: | Incomplete learning is widespread and heterogeneous in large language models . authors identify five recurrent sources of incomplete learning: missing prerequisite knowledge, conflicts between SFT supervision and pre-training knowledge, internal inconsistencies within SFT data, left-side forgetting during sequential fine-tuning, and insufficient optimization for rare or complex patterns. |
| Approach: | They propose a diagnostic-first framework that maps incomplete learning to causes . they identify five recurrent sources of incomplete learning: missing prerequisite knowledge, conflicts between supervision and pre-training knowledge, internal inconsistencies, left-side forgetting during sequential fine-tuning, and insufficient optimization for rare or complex patterns. |
| Outcome: | The proposed framework maps incomplete learning to causes using observable training and inference signals. |
Copied to clipboard
| Challenge: | Large language models demonstrate remarkable zero-shot generalization, but adapting to downstream tasks requires continual fine-tuning. |
| Approach: | They propose a method that incrementally constructs a pool of frozen, task-specific LoRA experts. |
| Outcome: | The proposed approach outperforms state-of-the-art methods in task-free and blurred-boundary settings. |
Copied to clipboard
| Challenge: | Existing Best-of-N decoding methods often lead to incorrect solutions . a novel method is proposed to help large language models identify and revise incorrect steps in their generated reasoning paths. |
| Approach: | They propose a method that helps large language models identify and revise incorrect steps in their generated reasoning paths. |
| Outcome: | The proposed method outperforms the state-of-the-art Best-ofN decoding method by +2.4 and reduces token consumption by 77.8%. |
Copied to clipboard
| Challenge: | Existing benchmarks lack comprehensive evaluations, particularly in multi-level reasoning, making it difficult to identify model limitations. |
| Approach: | They propose to use Agri-CM3 to assess multi-level reasoning in agricultural management by integrating multiple data modalities. |
| Outcome: | The Agri-CM3 benchmark includes 3,939 images and 15,901 multi-level multiple-choice questions with detailed explanations. |
Copied to clipboard
| Challenge: | Recent studies show that LLM-based agents exhibit superior moral and emotional language performance compared to humans, raising expectations for their deployment in persuasive tasks. |
| Approach: | They propose a framework for generating persuasive multi-turn dialogues via agent self-play using user agents designed to simulate diverse persona-driven behaviors, a Dialog Agent executing task-oriented persuasion strategies and an Optimization Agent evaluating and refining dialogue outcomes. |
| Outcome: | The proposed framework significantly improved the persuasion capacity of small LLMs, increasing the organic traffic conversion rate by 22.4% (from 1.83% to 2.24%) . |
Copied to clipboard
| Challenge: | Emoticons are widely used in digital communication to convey affective intent, yet their safety implications for Large Language Models (LLMs) remain largely unexplored. |
| Approach: | They propose to use ASCII-based emoticons to perform unintended actions in large language models (LLMs) This vulnerability is pervasive, with an average confusion ratio exceeding 38%, and 90% of confused responses yield 'silent failures' authors call on the community to recognize this emerging vulnerability and develop effective mitigation methods to uphold the safety and reliability of human-LLM interactions. |
| Outcome: | The proposed framework exploits emoticon semantic confusion in six LLMs and demonstrates that existing prompt-based mitigations are ineffective. |
Copied to clipboard
| Challenge: | Text simplification systems are based on the quality and quantity of complex-simple sentence pairs extracted by aligning sentences between parallel articles. |
| Approach: | They propose a neural CRF alignment model which leverages the sequential nature of sentences in parallel documents and utilizes a sentence pair model to capture semantic similarity. |
| Outcome: | The proposed model outperforms previous work on monolingual sentence alignment task by more than 5 points in F1. |
Copied to clipboard
| Challenge: | Existing approaches to generating reward models rely on voting-based mechanisms to evaluate CoT outputs. |
| Approach: | They propose an efficient generative reward modeling framework grounded in model-internal uncertainty. |
| Outcome: | The proposed framework reduces inference cost while improving answer accuracy. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have shown an unprecedented ability across various language tasks. |
| Approach: | They propose to use prompts and LoRA fine-tuning to improve slot filling robustness . they propose a linearised knowledge injection scheme to integrate dynamic external knowledge into LLMs. |
| Outcome: | The proposed model improves slot filling with noisy ASR transcriptions with 6.7% and 17.6% absolute SLU-F1 improvements compared to a fully fine-tuned Flan-T5-XL model. |
Copied to clipboard
| Challenge: | Recent studies have shown that by curating high quality and diverse instruction tuning datasets, we can significantly improve instruction-following capabilities. |
| Approach: | They propose an algorithm to control diversity and quality of instruction tuning datasets and validate it. |
| Outcome: | The proposed algorithm significantly improves worst and average case performance on large scale instruction tuning datasets. |
Copied to clipboard
| Challenge: | Experimental results show that our proposed model outperforms all previous approaches for monolingual word alignment. |
| Approach: | They propose a neural semi-Markov CRF alignment model which unifies word and phrase alignments through variable-length spans. |
| Outcome: | The proposed model outperforms existing models on in-domain and out-of-domain evaluations and a QA-based benchmark with human annotations. |
Copied to clipboard
| Challenge: | a new computational framework is developed to study text revision in scientific writing . authors propose a method to extract revision at document-, sentence-, and word-levels . |
| Approach: | They propose a computational framework for studying text revision in scientific writing . arXivEdits is an annotated corpus of 751 full papers from arX . authors propose to use sentence alignment, fine-grained edits and intents to extract revision . |
| Outcome: | The proposed framework can be used to study revision in scientific writing. |
Copied to clipboard
| Challenge: | Existing AVR benchmarks focus on single-step reasoning, emphasizing the end result but neglecting the multi-stage nature of reasoning process. |
| Approach: | They propose a multi-stage AVR benchmark based on RAVEN to assess reasoning across varying levels of complexity. |
| Outcome: | The proposed metric considers the correctness of intermediate steps in addition to the final outcomes. |
Copied to clipboard
| Challenge: | Existing pre-trained language models are not well-explored and are not reproducible in the literature. |
| Approach: | They propose to improve existing Arabic language pre-trained language models using a more methodical approach. |
| Outcome: | The proposed models outperform existing models on ALUE, a leaderboard-powered benchmark for Arabic NLU and NLG tasks. |
Copied to clipboard
| Challenge: | Existing approaches to align large language models with human preferences are noisy and varying in importance of preference samples. |
| Approach: | a new method enhances reward modeling by learning to dynamically weigh preference data. |
| Outcome: | a new method improves the performance of large language models with human preferences . it initializes data importance and iteratively refines them to maximize validation performance. |
Copied to clipboard
| Challenge: | UrbanLLM is a fine-tuned large language model designed to tackle diverse urban problems. |
| Approach: | They propose a fine-tuned large language model to tackle diverse urban problems . UrbanLLM decomposes urban-related queries into manageable sub-tasks . |
| Outcome: | The proposed model outperforms existing models in urban planning and management tasks. |
Copied to clipboard
| Challenge: | Existing approaches to learn word embedding on a corpus with only a few million tokens are limited to low-resource languages. |
| Approach: | They propose to use a sparse co-occurrence matrix to factorize the co-existence matrix and validate the proposed approaches in four different languages. |
| Outcome: | The proposed model is validated in four different languages. |
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods restrict entities on hyper-ellipsoid surfaces, resulting in suboptimal knowledge graph completion. |
| Approach: | They propose a score function that leverages relation-specific translations between head and tail entities to relax constraints on hyper-ellipsoid surfaces. |
| Outcome: | The proposed method achieves state-of-the-art performance on link prediction and generalizes well to datasets in different domains and scales. |
Copied to clipboard
| Challenge: | Fine-tuned pre-trained language models (LMs) have enormous success in many natural language processing tasks, but they still require excessive labeled data in the fine-tuning stage. |
| Approach: | They propose a framework to enable fine-tuning pre-trained language models with weak supervision without any labeled data. |
| Outcome: | The proposed framework outperforms the strongest baseline and achieves competitive performance with fully-supervised fine-tuning methods. |
Copied to clipboard
| Challenge: | Recent advances in multimodal large language models (MLLMs) focus on visual abilities, but audio is essential for video understanding. |
| Approach: | They propose an audio-centric video understanding benchmark to evaluate video comprehension capabilities of multimodal LLMs with a particular focus on auditory information. |
| Outcome: | The proposed video understanding benchmarks evaluate video comprehension capabilities of multimodal models with a particular focus on auditory information. |
Copied to clipboard
| Challenge: | Current Text-to-SQL reasoning models lack integrated execution feedback during generation. |
| Approach: | They propose a text-to-SQL framework that interacts with the SQL execution engine during decoding and dynamically adjusts reasoning based on execution feedback. |
| Outcome: | The proposed framework achieves 89.1% accuracy on Spider and 65.3% on BIRD at the 7B scale. |
Copied to clipboard
| Challenge: | Using fine-grained readability measures is the first step towards making medical texts more accessible. |
| Approach: | They propose a dataset MedReadMe which measures sentences and complex spans with an annotation tool. |
| Outcome: | The proposed dataset covers 650 linguistic features and additional complex span features, and is compared against state-of-the-art methods using large language models. |
Copied to clipboard
| Challenge: | Existing methods for learning complex sentences with multiple aspects are ill-equipped to learn complex sentences . |
| Approach: | They propose a mutual enhanced transformation network for the ABSA task . it improves representation learning of the aspect with contextual semantic features . |
| Outcome: | The proposed model improves representation learning of the aspect with contextual semantic features, giving the aspect more abundant information. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) have made rapid progress in perception and alignment, but their reasoning ability often lags behind strong text-only LLMs. |
| Approach: | They propose a method that transfers reasoning knowledge in the gradient space while preserving multimodal alignment. |
| Outcome: | Experiments on multimodal reasoning benchmarks show that DRIFT outperforms naive merging and standard SFT. |
Copied to clipboard
| Challenge: | Existing work on court view generation from fact descriptions has improved the working efficiency of legal assistant systems. |
| Approach: | They propose to decode court views conditioned on encoded charge labels from the fact description in a criminal case to improve interpretability of charge prediction systems. |
| Outcome: | The proposed model can generate court views conditioned on encoded charge labels. |
Copied to clipboard
| Challenge: | Existing methods to correct reasoning without external feedback have not been used in large language models. |
| Approach: | They propose an iterative verify-then-correct framework to progressively identify and correct (probably) false responses, named ProCo. |
| Outcome: | The proposed method improves the accuracy of LLMs on three reasoning tasks. |
Copied to clipboard
| Challenge: | Existing persona-based dialogue models generate personalized responses using predefined persona information, but they lack personality. |
| Approach: | They propose a persona-based dual Alternating Learning Network that generates personalized responses using predefined persona information. |
| Outcome: | The proposed method produces more personalized responses than baseline methods. |
Copied to clipboard
| Challenge: | Existing methods for evaluating expressive speech focus on word accuracy, naturalness, signal quality, or emotional intensity at the utterance level. |
| Approach: | They propose a framework for Evaluating Expressive Appropriateness in speech that assesses whether a speech sample aligns with the underlying communicative intent implied by its discourse-level narrative context. |
| Outcome: | The proposed framework outperforms existing speech evaluation and analysis systems on a human-annotated test set. |
Copied to clipboard
| Challenge: | Existing methods for self-training are interpreted as teacher-student frameworks, where the teacher generates pseudo-labels and the student makes predictions. |
| Approach: | They propose a differentiable self-training method that treats teacher-student as a Stackelberg game where a leader is always in a more advantageous position than a follower. |
| Outcome: | The proposed model outperforms existing methods on semi- and weakly-supervised learning tasks on semi and weak supervised tasks. |
Copied to clipboard
| Challenge: | Existing query rewriting models ignore user history behaviors and consider only the instant search query, which is often a short string offering limited information about the true shopping intent. |
| Approach: | They propose an end-to-end context-aware query rewriting model that takes search context into account and builds a session graph using the history search queries and their contained words. |
| Outcome: | The proposed model outperforms state-of-the-art models under various metrics. |
Copied to clipboard
| Challenge: | Existing studies treat charge prediction as a text classification problem, but in the field of justice, every decision may be a matter of life and death. |
| Approach: | They propose to extract readable rationales from text and then create a rationale augmented classification model to enhance the prediction accuracy. |
| Outcome: | The proposed system can extract readable rationales in a high consistency with manual annotation and is comparable with the attention model in prediction accuracy. |
Copied to clipboard
| Challenge: | Existing approaches to augment large language models with external knowledge suffer from a lack of calibration regarding the model’s knowledge boundary. |
| Approach: | They propose a reinforcement learning framework that explicitly aligns retrieval decisions with quantified knowledge states. |
| Outcome: | The proposed framework outperforms strong baselines while exhibiting reduced hallucination rates. |
Copied to clipboard
| Challenge: | Mobile GUI agents face a critical dilemma: on-device models (4B or smaller) lack sufficient performance, while capable models are either too large for mobile deployment or prohibitively costly. |
| Approach: | They propose a mobile GUI agent system that leverages device-cloud collaboration to tap cost-efficiency of on-device models and high capability of cloud models. |
| Outcome: | The proposed system matches or nears larger models with reduced cloud costs on mobile platforms. |
Copied to clipboard
| Challenge: | Existing studies on large-scale labeled support sets are not feasible in practical scenarios. |
| Approach: | They introduce a language model-based determinant point process that considers uncertainty and diversity of unlabeled instances for optimal selection. |
| Outcome: | The proposed method can effectively select canonical examples on 9 NLU and 2 Generation datasets. |
Copied to clipboard
| Challenge: | Existing CoT prompting methods elicited multi-step reasoning abilities of large language models (LLMs) but they were seriously confused by the irrelevant conditions, resulting in low accuracy. |
| Approach: | They propose a method that instructs large language models to identify and ignore irrelevant conditions and prompts them to verify the irrelevant conditions. |
| Outcome: | The proposed approach outperforms existing methods on MWPs with GPT-3.5-Turbo and I3C-Select. |
Copied to clipboard
| Challenge: | Existing approaches to improve cross-lingual transfer performance are based on word alignment, but no empirical studies have evaluated their effectiveness or limitations. |
| Approach: | They propose a mark-then-translate method that integrates translation and projection by inserting special markers around the labeled spans in the original sentence. |
| Outcome: | The proposed method outperforms word alignment-based methods in 57 languages and three tasks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have emerged as the new recommendation engines, surpassing traditional methods in both capability and scope, particularly in code generation. |
| Approach: | They propose to use a dataset to investigate a new type of bias in Large Language Models for code generation, provider bias, to determine whether the model favors specific providers. |
| Outcome: | The proposed model favors services from Google and Amazon, but without explicit directives, and can modify input code to incorporate their preferred providers without user requests. |
Copied to clipboard
| Challenge: | CRST retrieves tweets containing arguments for controversial topics from Twitter. |
| Approach: | They propose a system that retrieves tweets containing claims for a given topic from Twitter. |
| Outcome: | The proposed system outperforms existing claims retrieval and argument mining systems. |
Copied to clipboard
| Challenge: | Using a simplified version of GRU, we replace the GRUs at the middle layers of hierarchical recurrent models with Fixed-size Ordinally-Forgetting Encoding (FOFE). |
| Approach: | They propose to make the lower layers simpler than the upper ones to simplify two typical hierarchical recurrent models, namely Hierarchical Recurrent Encoder-Decoder (HRED) and R-NET, whose basic building block is GRU. |
| Outcome: | The proposed models contain less trainable parameters, consume less training time, and achieve slightly better performance than baseline models. |