Papers by Jiawei Chen
Copied to clipboard
| Challenge: | Existing top-k attention methods struggle to strike a balance between efficiency and accuracy. |
| Approach: | They propose a top-k attention approach that integrates low-overhead techniques into the Top-k Attention process to achieve 7.2 speedup compared to vanilla full attention. |
| Outcome: | The proposed approach achieves 7.2 speedup compared to current top-k attention methods while maintaining model accuracy. |
Copied to clipboard
| Challenge: | Existing methods to recognize entities in text are limited by the diversity of entity types and the lack of high-quality annotations. |
| Approach: | They propose an in-context learning-based NER approach that can inject in-const NER ability into PLMs and recognize entities of novel types on-the-fly using only a few demonstrative instances. |
| Outcome: | The proposed method outperforms the PLMs+fine-tuning counterparts on 4 few-shot NER datasets and significantly outperformed the Plms+initialized extractors. |
Copied to clipboard
| Challenge: | Admin (Adaptive model initialization) is more stable, converges faster, and leads to better performance. |
| Approach: | They propose a model initialization algorithm to stabilize early training and unleash its full potential in the late stage. |
| Outcome: | The proposed model initialization method stabilizes early training and unleashes full potential in late stage. |
Copied to clipboard
| Challenge: | Existing methods to detect large language models (LLMs) generated for plagiarism use paraphrases to rewrite them to evade detection. |
| Approach: | They propose a training-free method that effectively fools text detectors using off-the-shelf LLMs by rewriting them to evade detection. |
| Outcome: | The proposed method deceives text detectors using off-the-shelf LLMs by rewriting them to produce human-like sentences that are less discernible by detectors. |
Copied to clipboard
| Challenge: | Recent attempts to learn static representations of entities and references ignore their dynamic properties. |
| Approach: | They propose to learn static representations of entities and references ignoring their dynamic properties . a neighbor encoder learns entities' roles while a query-aware aggregator learns references' contributions . |
| Outcome: | The proposed approach achieves state-of-the-art results with different few-shot sizes. |
Copied to clipboard
| Challenge: | Recent LLM-based search agents often concatenate the full interaction history into the context, producing long and noisy inputs and increasing compute cost and memory overhead. |
| Approach: | They propose an agent framework that maintains a compact memory during multi-turn interactions. |
| Outcome: | The proposed framework outperforms strong history-concatenation (ReAct-style) baselines on a range of public datasets while maintaining nearly constant token counts across multi-turn interactions. |
Copied to clipboard
| Challenge: | Existing surveys on scientific LLMs focus on one or two fields or a single modality. |
| Approach: | They survey 260 scientific LLMs and examine their architectures and pre-training techniques . they also discuss commonalities and differences between LLM architectures . |
| Outcome: | The proposed model architectures and evaluation techniques are used to improve scientific discovery. |
Copied to clipboard
| Challenge: | Existing benchmarks for analyzing the performance of Large Language Models (LLMs) focus on single knowledge updates and fact recall, but do not consider how these updates affect downstream reasoning. |
| Approach: | They propose a benchmark to study how LLMs propagate new knowledge when it conflicts with the model's parametric knowledge. |
| Outcome: | The proposed benchmark compared models with no updated facts to show that the new methods worsen performance and improve reasoning performance. |
Copied to clipboard
| Challenge: | Large Language Model (LLM) agents are reshaping the industrial landscape, but tasks differ widely, making them labor-intensive to build. |
| Approach: | They propose an experience-driven framework for the automatic creation of domain agents . they leverage agent interaction histories to provide rich concrete signals on success or failure . |
| Outcome: | The proposed framework outperforms human-designed agents and existing methods in experiments across diverse domains. |
Copied to clipboard
| Challenge: | Few-shot named entity recognition (NER) aims to identify entities of target types with limited number of illustrative instances. |
| Approach: | They propose a superposition concept discriminator which solves the intrinsic generalization problem by an active learning paradigm. |
| Outcome: | The proposed model significantly improves few-shot named entity recognition (FS-NER) with minimal additional efforts. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) often hallucinate due to two relevant phenomena: massive activation phenomenon and positional information decay. |
| Approach: | They propose a token-level intervention strategy that dynamically suppresses irrelevant visual tokens while preserving key contextual signals. |
| Outcome: | Experiments show that TokenTruth significantly improves factual consistency across MLLMs on standard image understanding benchmarks. |
Copied to clipboard
| Challenge: | Retrieval-augmented diffusion models (RDMs) have been developed to enhance performance with reduced parameters. |
| Approach: | They propose to integrate retrieval-augmented diffusion models with Retrieval-augmented generation (RAG) that enhances performance with reduced parameters. |
| Outcome: | The proposed framework achieves outstanding attack effects while maintaining benign utility. |
Copied to clipboard
| Challenge: | Existing methods to build named entity recognition systems with limited labeled data are lacking. |
| Approach: | They propose three orthogonal schemes to build named entity recognition systems when labeled data is limited. |
| Outcome: | The proposed NER systems outperform existing methods on few-shot and training-free settings. |
Copied to clipboard
| Challenge: | Existing methods for dynamic web navigation rely on greedy strategies or value estimation, struggle to achieve effective backtracking and are heavily dependent on proprietary models. |
| Approach: | They propose a cognitive multi-agent collaboration framework that enhances cyberspace exploration capability through In-Context Exploration. |
| Outcome: | The proposed framework surpasses the proprietary model Claude-3.5 Sonnet on the WebArena benchmark. |
Copied to clipboard
| Challenge: | Existing approaches to end-to-end speech translation (E2E) models only allow one way knowledge transfer, which is limited by the performance of the teacher model. |
| Approach: | They propose a one-way knowledge transfer paradigm where the MT and ST models are collaboratively trained and considered as peers rather than teacher/student. |
| Outcome: | The proposed model improves the performance of end-to-end speech translation (ST) task by combining knowledge from two models with peer models. |
Copied to clipboard
| Challenge: | Existing few-shot named entity recognition (NER) models capture information from limited instances while transferring useful knowledge from external resources. |
| Approach: | They propose a self-describing mechanism for few-shot NER which can universally describe mentions using concepts and automatically map novel entity types to concepts. |
| Outcome: | The proposed model can universally describe mentions using concepts and automatically map novel entity types to concepts and adaptively recognize entities on-demand. |
Copied to clipboard
| Challenge: | Existing instruction data synthesis methods focus on single-turn instructions and neglect cross-turn coherence, resulting in context drift and reduced task completion rates. |
| Approach: | They propose a framework that constrains multi-turn instruction synthesis by explicitly modeling human conversational intent. |
| Outcome: | The proposed framework outperforms existing models trained on single-turn and multi-turn instruction datasets. |
Copied to clipboard
| Challenge: | Recent supervised ED approaches have achieved promising performance but require large number of manually annotated event data. |
| Approach: | They propose to overfit the trigger confounder of the context and the result . they propose to intervene on the context via backdoor adjustment during training . |
| Outcome: | The proposed method significantly improves the FSED on ACE05 and MAVEN datasets. |
Copied to clipboard
| Challenge: | Pre-trained language models have shown remarkable memory formation, but vanilla networks without pre-training suffer catastrophic forgetting problem. |
| Approach: | They conduct experiments to investigate the retentive-forgetful contradiction between vanilla and pre-trained language models by controlling the target knowledge types, learning strategies and learning schedules. |
| Outcome: | The results show that pre-trained language models are forgetful and pre-training leads to retentive models . |
Copied to clipboard
| Challenge: | We present a new information extraction system that can construct temporal event graphs from news documents. |
| Approach: | They propose a temporal event graph extraction system that can extract news documents . they extend the system from sentence-level event extraction to cross-document cross-media event extraction . |
| Outcome: | The proposed system can extract temporal event graphs from news documents in multiple languages and multiple data modalities. |
Copied to clipboard
| Challenge: | Existing methods for drafting Large Language Models require additional modules to be trained, which can be challenging to implement and ensure compatibility across various LLMs. |
| Approach: | They propose an in-context layer-skipping strategy for self-speculative decoding that uses a plug-and-play mechanism to skip intermediate layers of the verify model to construct a compressed draft model. |
| Outcome: | The proposed method achieves a speedup of 1.3 1.7 on LLaMA3 series models without altering the original distribution of the generated text. |
Copied to clipboard
| Challenge: | Current instruction-tuning datasets focus on simplistic visual question answering tasks, and provide phrase-level answers without any intermediate rationales. |
| Approach: | They propose to use open-source multimodal large language models to train MLLMs on a dataset with 12M instruction-response pairs to elicit CoT reasoning. |
| Outcome: | The proposed model achieves state-of-the-art performance on benchmarks such as MathVerse, MMMU-Pro, and MuirBench, and gains improvements of up to 4% on non-reasoning-based benchmarks. |
Copied to clipboard
| Challenge: | Abstractive conversation summarization systems rely on large-scale annotated summaries, but collecting and annotating these conversations can be time-consuming and labor-intensive. |
| Approach: | They propose a method for generating diverse and high-quality pairs of conversations and summaries by extracting conversation structures and organizing meaningful conversation snippets. |
| Outcome: | The proposed method outperforms baseline methods on SAMSum and DialogSum datasets and achieves a 10% increase in ROUGE scores with limited data. |
Copied to clipboard
| Challenge: | Large language models face inherent performance bottlenecks under parameter constraints . challenging tokens induce abrupt gradient spikes across layers, exposing stress points . |
| Approach: | They propose an inner thinking transformer that reimagines layer computations as implicit thinking steps. |
| Outcome: | Empirical results show that ITT outperforms Transformer/Loop variants in 11 benchmarks. |
Copied to clipboard
| Challenge: | Text-to-audio (T2A) models still struggle to satisfy human preferences for prompt-following and acoustic quality when generating complex multi-event audio. |
| Approach: | They propose to use AI feedback learning to enhance basic capabilities of text-to-audio models . they use a large audio preference dataset to evaluate the model's capabilities . |
| Outcome: | The proposed model improves in simple and complex scenarios with AI feedback learning. |
Copied to clipboard
| Challenge: | Current methods for editing personality traits in large language models can change personalities but reduce performance. |
| Approach: | They propose a novel paradigm for personality editing that locates and edits LLM neurons and enables competitive personality control at inference time. |
| Outcome: | Experiments on LLaMA-3-8B-Instruct and Qwen2.5-7B-instruct show that the proposed approach can improve performance and improve performance. |
Copied to clipboard
| Challenge: | Existing detectors rely on stylistic cues to distinguish between surface-level language refinement and genuine content generation. |
| Approach: | They propose a content-based detection paradigm to detect substantive AI-generation . they propose 'CoCoDet' detector that can detect surface-level language refinement . |
| Outcome: | The proposed detector achieves a macro F1 score of 98.24% on permissible machine-polished reviews and maintains 3.89% false positive rate on real-world reviews. |
Copied to clipboard
| Challenge: | Existing jailbreak research exhibits limitations in universality, validity, and efficiency . Existing methods for jailbreaking LLMs have limited validity and effectiveness . |
| Approach: | They propose a black-box approach that uses wordplay-guided mapping rule sampling to create universal adversarial prompts. |
| Outcome: | The proposed method efficiently identifies security vulnerabilities across various LLMs, achieving an average success rate of over 80% with fewer than 10 queries. |
Copied to clipboard
| Challenge: | Large language models exhibit pronounced WEIRD cultural bias, marginalizing diverse viewpoints and posing challenges for reconciling diverse populations with varying cultural backgrounds and value systems. |
| Approach: | They propose a framework for cross-cultural fairness using a Nash Equilibrium . they propose equilibriums that iteratively propose and refine natural-language guidelines . |
| Outcome: | The proposed framework generates higher-quality and more balanced consensus . it finetunes diverse LLM architectures with negotiation data, reducing cultural distances by 95.53%. |
Copied to clipboard
| Challenge: | Existing methods for chain-of-thought distillation suffer from a distribution mismatch between teacher-generated training trajectories and the student model's own generative distribution. |
| Approach: | They propose a framework that shifts the training paradigm from passive imitation to active trajectory exploration by allowing students to sample their own answer paths. |
| Outcome: | The proposed method outperforms standard CoT distillation baselines while mitigating mode collapse and preserving semantic diversity. |
Copied to clipboard
| Challenge: | Existing methods for hallucination detection tend to decompose text into isolated statements, unable to understand contextual semantics. |
| Approach: | They propose a framework to leverage self-generated thoughts derived from prior statements as catalysts to elicit the expression of intrinsic knowledge and understand contextual semantics. |
| Outcome: | The proposed framework enables self-elicitation to elicit expressions of knowledge and understand semantics. |
Copied to clipboard
| Challenge: | Existing methods only conduct network growth in a single dimension, but compound growth operators are beneficial for multiple dimensions. |
| Approach: | They propose a method to train BERT progressively using a Transformer model and explore alternative growth operators in each dimension via controlled comparison. |
| Outcome: | The proposed method speeds up BERT pre-training by 73.6% and 82.2% for the base and large models respectively while achieving comparable performances. |
Copied to clipboard
| Challenge: | Large Reasoning Models (LRMs) have emerged as a powerful advancement in multi-step reasoning tasks, but they introduce safety and reliability risks, such as CoT-hijacking and prompt-induced inefficiencies. |
| Approach: | They propose a unified benchmark to assess the trustworthiness of Large Reasoning Models. |
| Outcome: | The proposed benchmark evaluates truthfulness, safety and efficiency on 26 models. |
Copied to clipboard
| Challenge: | Empirical evaluations on state-of-the-art MLLMs reveal a significant performance gap . ML models lack the fine-grained cross-modal reasoning required to bridge visual discontinuities. |
| Approach: | They propose a benchmark that renders fragmented documents directly from Markdown to facilitate evaluation of VRDU tasks. |
| Outcome: | The proposed benchmark renders fragmented documents directly from Markdown. |
Copied to clipboard
| Challenge: | Recent large language model-based AD research offers new avenues to address this challenge. |
| Approach: | They propose a small language model (SLM) for high-level semantic reasoning and schedule generation, while an inner loop performs low-level, high-frequency schedule execution and vehicle control. |
| Outcome: | The proposed framework improves instruction completion rates while maintaining high safety and compliance relative to multiple baselines. |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) integrates knowledge from tables with an external knowledge base to improve the answer relevance and accuracy. |
| Approach: | They propose a table-corpora-aware RAG framework called T-RAG to integrate external knowledge into Large Language Models (LLMs) they then develop a multi-table question answering benchmark called MultiTableQA which spans 3 different task types, 57,193 tables, and 23,758 questions in total. |
| Outcome: | The proposed framework achieves state-of-the-art accuracy, recall, and runtime performance, with improvements of up to 9.4%. |
Copied to clipboard
| Challenge: | Existing approaches to answer open-domain questions use sparse representations and sparsity. |
| Approach: | They propose a method which augments a query by generating relevant contexts from heuristically discovered contexts without external supervision. |
| Outcome: | The proposed approach outperforms state-of-the-art dense retrieval methods on natural questions and triviaQA datasets. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) generate plausible but factually incorrect outputs, posing serious risks to patient safety and clinical decision-making. |
| Approach: | They propose a benchmark for medical hallucination detection using 10,000 question-answer pairs derived from PubMedQA. |
| Outcome: | The proposed model achieves an F1 score as low as 0.625 for detecting 'hard' category hallucinations. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have remarkable reasoning capabilities in complex tasks such as mathematics and coding. |
| Approach: | They propose an entropy-modulation method that adaptively reweighs tokens based on theoretically-estimated entropic variations. |
| Outcome: | The proposed method outperforms state-of-the-art methods in six mathematical reasoning and three coding benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for mental health risk assessment rely on subjective textual records . however, these uncertainties can cause inconsistent and unreliable predictions . |
| Approach: | They propose a method that integrates objective behavior data alongside subjective mental records for robust mental health risk assessment. |
| Outcome: | The proposed approach achieves significant improvements over general LLMs. |
Copied to clipboard
| Challenge: | Existing studies focus on enhancing token-level interactions, but lack sufficient modeling of discourse structure information. |
| Approach: | They propose to use a discourse structure called "thread" to enhance token interaction among different utterances. |
| Outcome: | The proposed model achieves state-of-the-art on two datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly pivotal in a wide range of tasks . however, the resources required for training these models necessitate efficient solutions . |
| Approach: | They propose a library that facilitates collaborative training of large language models . they use 3D parallelism, parameter-efficient fine-tuning methods and optimizers . |
| Outcome: | The proposed library has proven superior training efficiency in comparison with prevalent solutions in pre-training and fine-tuning scenarios. |
Copied to clipboard
| Challenge: | Existing methods to jailbreak Large Language Models (LLMs) exploited internal properties or capabilities of the model, such as optimization-based jailbreak methods and methods that leveraged the model’s context-learning abilities. |
| Approach: | They propose a new method which injects jailbreak information into user prompts and induces the model to generate harmful content. |
| Outcome: | The proposed method achieves near 100% success rates on open-source models while incurring lower time costs compared to previous methods. |
Copied to clipboard
| Challenge: | Experimental results show that our method outperforms full-model tuning in few-shot abstractive summarization tasks. |
| Approach: | They propose a soft prompts architecture with prompt pre-training and prompt fine-tuning paradigm to support few-shot abstractive summarization. |
| Outcome: | The proposed model outperforms Prompt Tuning and Profix-Tuning on CNN/DailyMail and XSum datasets and outperfies Profix Tuning by a large margin. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) demonstrate excellent abilities for understanding visual information, but the hallucination remains a challenging problem. |
| Approach: | They propose a training-free approach to enhance vision attention sinks to facilitate convergence of the image token attention sink within shallow layers. |
| Outcome: | The proposed approach improves the convergence of the image token attention sink within shallow layers and strengthens the layer’s focus on the image itself. |
Copied to clipboard
| Challenge: | Existing semantic similarity methods struggle to accurately identify semantically equivalent steps in domain-specific contexts like mathematical reasoning. |
| Approach: | They propose a simple yet effective approach that identifies and prunes semantically equivalent actions during LLM reasoning search. |
| Outcome: | The proposed approach reduces token consumption while improving reasoning efficiency and accuracy on Qwen2.5-Math-7B-Instruct on GSM8K. |
Copied to clipboard
| Challenge: | Existing studies develop effective pseudo-labeling methods, but they struggle with unlabeled data that have imbalanced classes mismatched with the labeled data. |
| Approach: | They propose to use pseudo-labeling to train text classification models with few labeled data and massive unlabeled data. |
| Outcome: | Empirical results show that the proposed model outperforms state-of-the-art methods on 3 common benchmarks. |
Copied to clipboard
| Challenge: | Existing methods to detect harmful outputs from prefill-level lacks utilization of the model’s decoding outputs, leading to relatively lower effectiveness and robustness. |
| Approach: | They propose a robust decoding mechanism that corrects harmful queries directly rather than rejecting them outright. |
| Outcome: | The proposed model improves model security without compromising reasoning speed. |
Copied to clipboard
| Challenge: | Existing defense methods are insufficient to address in-context reward hacking (ICRH), where LLMs iteratively optimize their behavior to maximize proxy objectives, resulting in harmful side effects. |
| Approach: | They propose a framework that reduces in-context reward hacking (ICRH) through repeated interactions with the environment. |
| Outcome: | The proposed framework reduces ICRH without model fine-tuning while maintaining task performance. |
Copied to clipboard
| Challenge: | Emergent abilities of large language models (LLMs) have advanced their application in autonomous vehicle research. |
| Approach: | They propose a framework that leverages LLMs’ built-in extrapolation capabilities for vehicle trajectory prediction, enabling them to understand traffic agents' behavior and interactions over time. |
| Outcome: | The proposed framework enables off-the-shelf, frozen LLMs to achieve competitive trajectory prediction performance with qualitative analyses revealing their enhanced understanding of complex, multi-agent traffic scenarios. |
Copied to clipboard
| Challenge: | Existing methods for pretraining data mixing for large language models neglect significant inter-domain overlaps and commonalities, failing to control the global diversity of the constructed training dataset. |
| Approach: | They propose a sample-wise data mixture approach that performs global cross-domain sampling by systematically evaluating the quality and diversity of each sample. |
| Outcome: | The proposed method exceeds existing domain-based methods in multiple downstream tasks and perplexity assessments. |
Copied to clipboard
| Challenge: | Existing methods focus on transferring teacher-generated rationales to student models, but do not explore teachers’ dynamic attention towards critical information during reasoning. |
| Approach: | They propose a method that transfers the teacher’s stepwise attention on key information to the student model and a Mixture of Layers module that allows dynamic alignment between the teacher and student. |
| Outcome: | The proposed framework achieves consistent performance improvements across multiple mathematical and commonsense reasoning datasets. |
Copied to clipboard
| Challenge: | Existing methods to train dense passage retrieval have a large data gap between upstream and downstream relevance. |
| Approach: | They propose a method to pre-train the dense retriever with the text relevance induced by hyperlinks within Web documents. |
| Outcome: | The proposed method outperforms existing methods under different scenarios and in the open-domain question answering domain. |
Copied to clipboard
| Challenge: | Current open-domain question answering systems follow a Retriever-Reader architecture . current systems do not use a reranker, which reranked passages based on top predictions of the reader . |
| Approach: | They propose a reader-guIDEd reranking method that reranked passages based on top predictions . they show that RIDER achieves 10 to 20 absolute gains in top-1 retrieval accuracy . |
| Outcome: | The proposed method achieves 10 to 20 gains in top-1 retrieval accuracy and 1 to 4 Exact Match gains without training. |