Papers by Lei Jin
Copied to clipboard
| Challenge: | Existing methods aim to fully utilize the dynamic conversation context to enhance the semantic association between the user query and FAQ questions, but they are limited by noise and e.g., users may click questions they don't like, leading to inaccurate semantics modeling. |
| Approach: | They propose to introduce tags of FAQ questions to reduce noise in the conversation context and integrate them into a reinforcement learning framework to minimize the negative impact of irrelevant information. |
| Outcome: | The proposed method can eliminate irrelevant information and minimize negative impact of irrelevant information in the dynamic conversation context. |
Copied to clipboard
| Challenge: | Recent advances have extended DPO to multimodal scenarios, achieving strong performance. |
| Approach: | They propose to use a sentence-level preference optimization technique to optimize individual sentences for more precise preference optimization without additional models or parameters. |
| Outcome: | Experiments show that Adaptive Sentence-level Preference Optimization significantly improves the alignment of multimodal models. |
Copied to clipboard
| Challenge: | Existing solutions to task-oriented dialogue systems follow pipeline designs which introduces complexity and fragility. |
| Approach: | They propose a novel sequence-to-sequence (seq2sequ) model which tracks dialogue believes and a two stage copynet instantiation which emonstrates good scalability. |
| Outcome: | The proposed framework outperforms state-of-the-art pipeline-based methods on large datasets and retains satisfactory entity match rate on out-of vocabulary (OOV) cases where pipeline-designed competitors totally fail. |
Copied to clipboard
| Challenge: | Large language models exhibit significant performance discrepancies between high- and low-resource languages. |
| Approach: | They present an open-source multilingual LLM with 8 billion parameters and a multilingual instruction dataset. |
| Outcome: | The proposed model achieves consistent multilingual representations across languages. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on simple image-text interactions, overlooking complex visual formats like charts. |
| Approach: | They propose a semi-automatic framework for generating evaluation samples through multi-modal keypoint extraction, knowledge graph construction, and qa pair synthesis. |
| Outcome: | The proposed framework generates 4,738 question-answering pairs across 8 domains from real-world documents. |
Copied to clipboard
| Challenge: | Code large language models (codeLLMs) focus on synthesizing the correct code snippet, ignoring the alignment with human preferences. |
| Approach: | They propose a benchmark code-based on 40 categories and 44 programming languages to emulate real-world coding tasks. |
| Outcome: | The proposed benchmarks show that open-source code LLMs perform better than open-sourced ones. |
Copied to clipboard
| Challenge: | Current research treats personality recognition as a classification task, failing to reveal the supporting evidence for the recognized personality. |
| Approach: | They propose a task that aims to reveal the reasoning process as supporting evidence of the personality trait. |
| Outcome: | The proposed task reveals the reasoning process as supporting evidence of the personality trait. |
Copied to clipboard
| Challenge: | Existing knowledge probing studies focus on evaluating factual knowledge of pre-trained language models (PLMs) but ignore conceptual knowledge. |
| Approach: | They evaluate conceptual knowledge of pre-trained language models by annotating 24k data instances covering 393 concepts. |
| Outcome: | The proposed tasks evaluate pre-trained language models' conceptual knowledge of entities, learn conceptual properties, and conceptualize entities in contexts. |
Copied to clipboard
| Challenge: | Existing methods for addressing ambiguities in conversational search systems are one-size-fits-all and struggle to achieve effective domain transferability. |
| Approach: | They propose a method to provide search engines with strategies regarding when to ask clarification questions in a post-hoc manner. |
| Outcome: | The proposed method improves search performance 10% on four unseen domains. |
Copied to clipboard
| Challenge: | Existing approaches to query–document relevance assessment are limited . ambiguous user intent and asymmetric relevance are challenges for RAG platforms . |
| Approach: | They propose a decomposed reasoning model for relevance assessment that decomposes query intent into intent inference and evidence grounding. |
| Outcome: | The proposed model outperforms strong baselines on offline benchmarks and achieves significant gains in large-scale online A/B testing. |
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: | In-context learning of large-language models has achieved remarkable success in the field of natural language processing . however, the single-step chain-of-thought prompting approach faces challenges such as attention diffusion and inadequate performance in complex tasks like text-to-SQL. |
| Approach: | They propose a workflow paradigm method to enhance the attention and problem-solving scope of large-language models through decomposition. |
| Outcome: | The proposed method outperforms existing methods on three datasets and improves the upper limit of LLM-based approaches. |
Copied to clipboard
| Challenge: | Existing efforts to improve reasoning efficiency of large language models focus on modifying the reinforcement learning reward, such as adding length penalties. |
| Approach: | They propose a training framework that elicits efficient reasoning through reasoning vectors and a framework that allows the model to generate high-quality responses during reinforcement learning. |
| Outcome: | The proposed framework reduces reasoning length by 30% while maintaining stability, while retaining high accuracy. |
Copied to clipboard
| Challenge: | Extensive experiments on multi-lingual datasets show that our method significantly outperforms multiple baselines and can robustly handle negative transfer. |
| Approach: | They propose to transfer semantic knowledge from rich-resourced languages to low-resource languages by using multilingual transfer learning. |
| Outcome: | The proposed model outperforms baselines and can handle negative transfer. |
Copied to clipboard
| Challenge: | Abstractive and extractive methods are used to condense long text into concise summaries while retaining essential information. |
| Approach: | They propose to use paper structure to extract paper summaries from long text . they provide a large-scale dataset of COVID-19-related papers . |
| Outcome: | The proposed framework generates more comprehensive and valuable summaries compared to previous work on COVID-19-related papers. |
Copied to clipboard
| Challenge: | Sentence embedding models are typically trained using contrastive learning (CL) using human annotations directly or by repurposing other annotated datasets. |
| Approach: | They propose to use generative language models to generate CL data using annotated data. |
| Outcome: | The proposed method outperforms the previous best unsupervised method by 1.8 points and SimCSE, a strong supervised baseline by 0.3 points on the semantic text similarity (STS) benchmark. |
Copied to clipboard
| Challenge: | Empirical studies demonstrate that Araida reduces human correction labor by 11.02% compared to vanilla interactive data annotation methods. |
| Approach: | They propose an analogical reasoning-based approach that enhances automatic annotation accuracy in the interactive data annotation setting and reduces the need for human corrections. |
| Outcome: | Empirical studies show that Araida reduces human correction labor by 11.02% compared to vanilla interactive data annotation methods. |
Copied to clipboard
| Challenge: | Existing models for temporal knowledge graph reasoning suffer from low training efficiency and insufficient generalization ability. |
| Approach: | They propose a temporal knowledge graph reasoning approach that uses multilayer perceptron to model the structural dependencies of events and adopts a fixed-frequency strategy to incorporate historical frequency during inference. |
| Outcome: | The proposed model achieves state-of-the-art performance with faster convergence speed and better generalization ability. |
Copied to clipboard
| Challenge: | Randomly concatenating data points can lead to cross-contamination due to the significant difference in their subject matter. |
| Approach: | They propose a method that randomly concatenates data of varying lengths until reaching the designed maximum length to optimize context length and reduce padding. |
| Outcome: | The proposed method significantly improves performance on GSM8K and HumanEval, and also improves fairness and accuracy by 15%. |
Copied to clipboard
| Challenge: | Existing unified structured data question answering methods rely on a set of predefined functions, which restricts their ability to perform complex reasoning beyond these predefined operations. |
| Approach: | They propose a novel adaptive code-driven framework that generates code-based reasoning operations based on a question. |
| Outcome: | The proposed framework improves on multiple structured datasets on real-world scenarios. |
Copied to clipboard
| Challenge: | Existing methods for event prediction are incomplete and noisy. |
| Approach: | They propose to use news-related event schemas to extract newsworthy events . they build a demo website and include a video demonstrating the framework . |
| Outcome: | The proposed framework can be applied to a wide variety of newsworthy scenarios. |
Copied to clipboard
| Challenge: | Existing methods for identifying semantic type of entities are incomplete even in large knowledge bases. |
| Approach: | They propose an attributed and predictive entity embedding method which can fully utilize various kinds of information comprehensively. |
| Outcome: | Experiments on two real DBpedia datasets show that the proposed method outperforms 8 state-of-the-art methods with 4.0% improvement in Mi-F1 and 5.2% improvement in Ma-F1. |
Copied to clipboard
| Challenge: | Existing evaluation methods are inadequate to evaluate large language models (LLMs). |
| Approach: | They propose a fine-grained generative LLM evaluator with instance-level customazable evaluation criteria that can be used to evaluate large language models. |
| Outcome: | The proposed model outperforms existing LLM evaluators and instruction-tuned LLMs on multiple benchmarks and sets new SOTA results. |
Copied to clipboard
| Challenge: | Large language models have achieved remarkable success across a wide range of tasks, yet their performance remains heavily biased toward high-resource languages. |
| Approach: | They propose a pipeline for advancing Tibetan language modeling through multilingual continual pre-training with Tibetan, Chinese, and English. |
| Outcome: | The proposed model outperforms open-source and Tibetan-focused models on diverse tasks. |
Copied to clipboard
| Challenge: | Large language models excel on a variety of reasoning benchmarks, but struggle to generalize to unseen questions due to over-reliance on memorized training examples. |
| Approach: | They propose to identify a set of linear features in the model’s residual stream that govern the balance between genuine reasoning and memory recall. |
| Outcome: | The proposed model can be manipulated to activate the most relevant problem-solving capabilities during answer generation. |
Copied to clipboard
| Challenge: | Large language models are used to meet user information needs, but their effectiveness in dealing with user queries that contain various types of ambiguity remains unknown. |
| Approach: | They propose a benchmark for evaluating large language models using a well-organized taxonomy. |
| Outcome: | The proposed model is based on a well-organized taxonomy and compares it with other models. |
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: | Existing methods for forcing alignment are language-specific and prone to temporal shifts. |
| Approach: | They propose a slot-filling paradigm that uses time indices to predict slot positions. |
| Outcome: | The proposed method reduces accumulated temporal shifts by 69% compared with prior methods. |
Copied to clipboard
| Challenge: | Currently, long-context language models are limited by the lack of a rigorous evaluation framework for long code understanding. |
| Approach: | They propose to use a long code understanding benchmark LongCodeU to evaluate LCLMs' long code comprehension ability for practical applications. |
| Outcome: | The proposed benchmarks show that current LCLMs are limited in their long code understanding ability, particularly when the long code length is greater than 32K, falling far short of their claimed 128K to 1M context windows. |
Copied to clipboard
| Challenge: | Large language models exhibit limitations when handling complex mathematical reasoning and logical inference tasks. |
| Approach: | They propose a sparsification strategy to reduce token costs within Multi-agent Debate (MAD) this strategy minimizes ineffective exchanges of information and unproductive discussions among agents . |
| Outcome: | The proposed approach reduces token costs by up to 94.5% while maintaining performance degradation below 2.0%. |
Copied to clipboard
| Challenge: | Recent advances have improved the accuracy of medical visual question answering (Med-VQA) however, the high stakes nature of the medical domain has precipitated a shift towards interpretability and transparency of reasoning processes. |
| Approach: | They propose a reinforcement learning from verifiable rewards framework that rewards internal consistency and logical coherence. |
| Outcome: | The proposed framework rewards internal consistency and logical coherence, and is highly versatile, the authors show. |
Copied to clipboard
| Challenge: | Existing LoRA methods assume that experts operate independently, leading to unstable routing, expert dominance. |
| Approach: | They propose a communication-aware MoELoRA framework that relaxes this assumption by introducing expert-level communication prior to routing. |
| Outcome: | The proposed framework outperforms vanilla LoRA and MoELoRA on diverse language understanding tasks while maintaining expert dominance. |
Copied to clipboard
| Challenge: | Multimodal speech synthesis is a key challenge due to the scarcity of datasets that pair audio with corresponding video. |
| Approach: | They propose a method that incorporates modality alignment during the pre-training phase on multimodal datasets and freezes the video modality extraction component and the encoder module within the pretrained weights. |
| Outcome: | The proposed method achieves a reduced word error rate (WER) of 31.73%, surpassing the previous best of 33.9% with single-modality audio. |
Copied to clipboard
| Challenge: | Existing methods for inferring the fine-grained type of an entity from knowledge base are incomplete and lack type information. |
| Approach: | They propose a novel Deep Learning architecture to infer the fine-grained type of an entity from a knowledge base. |
| Outcome: | The proposed method significantly outperforms four state-of-the-art methods on two large-scale datasets. |
Copied to clipboard
| Challenge: | Recent advances in visual-language pre-trained (VLP) models have greatly improved cross-modal retrieval performance . however, the fine-grained interactions between objects from different modalities are far from well-established . e-commerce domain lacks sufficient training data and fine-granular cross-modulal knowledge . |
| Approach: | They propose a visual-language pre-trained (VLP) image-text retrieval model that integrates cross-modal knowledge into the model to improve performance. |
| Outcome: | The proposed model improves performance on e-commerce image-text retrieval task by a large margin. |
Copied to clipboard
| Challenge: | Existing prompt-learning-based methods concatenate in-context examples only at the input layer, limiting the model’s ability to capture abstract semantic cues necessary for identifying complex causal relationships. |
| Approach: | They propose a model that injects in-context examples into the deeper layer of a pre-trained language model (PLM) this model leverages hierarchical semantic representations formed in deeper layers, thereby enhancing its capacity to learn high-level causal abstractions. |
| Outcome: | The proposed model improves on two widely used datasets and shows that it can learn high-level causal abstractions. |
Copied to clipboard
| Challenge: | Existing methods for machine reading comprehension of user manuals have trouble answering complex questions. |
| Approach: | They propose a knowing-how & knowing-that task that requires the model to answer factoid-style, procedure-style and inconsistent questions about user manuals. |
| Outcome: | The proposed model can answer factoid-style, procedure-style and inconsistent questions about user manuals. |
Copied to clipboard
| Challenge: | Recent advances in large multimodal models have encouraged the development of large multi-modal models . however, it is unclear how to extend these models to the more complex video domain . |
| Approach: | They propose a visual instruction tuning framework to address temporal video-language tasks . they collect a dataset and fine-tune the framework on instruction-following data . |
| Outcome: | The proposed model can perform better on established temporal video-language tasks without training objectives and intensive pre-training. |
Copied to clipboard
| Challenge: | Existing knowledge base question answering systems that parse natural language questions into knowledge oriented program language (KoPL) . |
| Approach: | They propose a knowledge base question answering system that integrates human into the loop to edit and debug queries. |
| Outcome: | The proposed system can debug and edit knowledge base questions on a million-entity-level . it provides auto-completion for its knowledge base schema and user interaction can fix a large portion of wrong KoPL programs to acquire the correct answer. |
Copied to clipboard
| Challenge: | Current solutions don't fit the online custom service scenarios well due to the lack of attention to user questions and possible responses. |
| Approach: | They propose to build a clue-guided assistant for customer service representations (CSRs) that can provide accurate responses and explicitly show explainable paths about how to arrive at these responses. |
| Outcome: | The proposed assistant can reduce CSRs' reading burden and keep high service quality, in particular with >35% decrease in time spent and keeping a >0.75 ICC score. |
Copied to clipboard
| Challenge: | Recent studies have focused on building dynamic benchmarks to address data contamination issues. |
| Approach: | They propose a method for identifying shortcut neurons through comparative and causal analysis to suppress shortcut neurons. |
| Outcome: | The proposed method overestimates contaminated models and is highly generalizable across benchmarks and hyperparameter settings. |
Copied to clipboard
| Challenge: | Existing methods for translating collaborative information into textual prompts or injecting pre-trained embeddings into the LLM treat structural information as static input and fail to capture high-order relational dependencies. |
| Approach: | They propose a framework that generalizes low-rank adaptation from independent to structure-aware propagation by embedding a trainable graph message-passing network within the low-ranked adaptation pathway. |
| Outcome: | Experiments on multiple benchmarks show that GraphLoRA outperforms state-of-the-art recommendation methods and achieves superior generalization. |
Copied to clipboard
| Challenge: | Entity linking models have been successful in capturing semantic features, but the NIL prediction problem has not been addressed. |
| Approach: | They propose an entity linking dataset that categorizes mentions linking to NIL into Missing Entity and Non-Entity Phrases. |
| Outcome: | The proposed dataset categorizes mentions linking to NIL into Missing Entity and Non-Entity Phrase categories and ensures the presence of mentions by human annotation and entity masking. |