Papers by Lei Wei
Copied to clipboard
| Challenge: | Large language models (LLMs) have been studied for their ability to store and utilize positive knowledge. |
| Approach: | They propose to use a constrained keywords-to-sentence generation task and a Boolean question answering task to probe large language models on negative commonsense knowledge. |
| Outcome: | The proposed tasks show that LLMs fail to generate valid sentences grounded in negative commonsense knowledge, yet they can correctly answer yes-or-no questions. |
Copied to clipboard
| Challenge: | Existing benchmarks focus more on end-to-end performance, but neglect the underlying principles of knowledge acquisition and generalization. |
| Approach: | They propose a benchmark specifically designed to explore the problem-solving principles by decomposing 6.5K visual math problems into 10.9K step-level questions for evaluation. |
| Outcome: | The proposed benchmark covers 6.5K visual math problems and 10.9K step-level questions spanning 5 layers of knowledge granularity and 67 hierarchical knowledge concepts. |
Copied to clipboard
| Challenge: | Existing attempts to generate similes as context-free tasks are not suitable for simile generation . however, simile generated under such settings might be undesirable, we argue . |
| Approach: | They propose a model to generate a simile with multiple simile elements . they propose to use a vehicle retrieval module to obtain the explicable comparison . |
| Outcome: | The proposed model can generate a simile with multiple simile elements, e.g., context and vehicle. |
Copied to clipboard
| Challenge: | Existing inference frameworks for natural language processing are not the best choice for online service of sequence processing problems. |
| Approach: | They propose a highly efficient inference library for Transformer models that includes GPU optimization techniques to streamline computation and reduce memory footprint. |
| Outcome: | The proposed library achieves 14x speedup compared with TensorFlow and 1.4x speed up compared to a concurrent CUDA implementation. |
Copied to clipboard
| Challenge: | ESGenius is a comprehensive benchmark for evaluating Large Language Models on ESG and sustainability knowledge. |
| Approach: | They introduce ESGenius, a benchmark for evaluating and enhancing ESG proficiency . they use a rigorous two-stage evaluation protocol and a repository of foundational frameworks . |
| Outcome: | ESGenius is a benchmark for evaluating and enhancing the proficiency of Large Language Models (LLMs) in ESG and sustainability-focused question answering. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown nearly saturated performance on many NLP tasks. |
| Approach: | They construct multiple sensitive factors time QA which encompasses three temporal factors . they test current mainstream LLMs with different parameter sizes . |
| Outcome: | The proposed model incorporates three temporal factors with 2,853 samples . the results show that LLMs fall behind smaller models on these factors . |
Copied to clipboard
| Challenge: | Existing methods for integrating knowledge graphs rely on entity and relation embeddings . Fig. 1 shows how to decode knowledge graph in under 6 seconds . |
| Approach: | They propose a framework that only utilizes entity embeddings to decode knowledge graphs. |
| Outcome: | The proposed framework reconstructs KG representation by maximizing smoothness of entity embeddings. |
Copied to clipboard
| Challenge: | Mental health disorders represent a burgeoning global public health challenge . lack of ecological validity and fine-grained diagnostic supervision limits their utility . |
| Approach: | They propose a medical-specialized LLM trained to internalize clinical reasoning process through supervised trajectory construction and curriculum-based reinforcement learning. |
| Outcome: | The proposed model achieves state-of-the-art with only 14B parameters, establishing a clinically grounded framework for reliable psychiatric diagnosis. |
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: | Knowledge graphs are incomplete with many facts missing, causing performance bottlenecks in many applications. |
| Approach: | They propose a general multi-hop reasoning task that can be formulated as a search process and can be extended to long-distance reasoning scenarios. |
| Outcome: | The proposed model improves on baselines in short and long distance reasoning scenarios. |
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: | Existing pre-trained models target one document format at a time, making it difficult to combine knowledge from multiple document formats. |
| Approach: | They propose a unified pre-trained model which deals with different document formats in a single model. |
| Outcome: | The proposed model achieves comparable or even better performance on a variety of downstream tasks compared with the individual pre-trained models. |
Copied to clipboard
| Challenge: | Existing techniques for table detection and recognition are limited to document types and layouts. |
| Approach: | They propose to build a table detection and recognition dataset with weak supervision from Word and Latex documents on the internet. |
| Outcome: | The proposed dataset contains 417K high quality labeled tables and is publicly available. |
Copied to clipboard
| Challenge: | Existing approaches to detect suicidal ideation on social media are limited to a small group of people. |
| Approach: | They propose to use tree holes to embed words into microblogs to strengthen the sensibility of suicide-related lexicons and to use a two-layered attention mechanism to grasp intermittently changing points from individual's open blog streams. |
| Outcome: | The proposed approach can achieve over 91% accuracy with the use of suicide-oriented word embeddings and attention on a large-scale well-labelled suicide data set. |
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 benchmarks to test word analogy do not reveal the underneath process of analogical reasoning of neural models. |
| Approach: | They propose an explanation benchmark for analogical reasoning using a Civil Service exam . they use a free-text explanation scheme to explain whether an analogy should be drawn . |
| Outcome: | The proposed benchmark is very challenging for state-of-the-art models, it is found. |
Copied to clipboard
| Challenge: | Large language models are increasingly employed to empower autonomous agents to simulate human behavior. |
| Approach: | They propose to evaluate LLM-driven agents through multi-turn interactions using a bottom-up approach to create diverse social scenarios constructed from extensive scripts. |
| Outcome: | The proposed model evaluates LLM-driven agents through multi-turn interactions emphasizing goal completion and implicit reasoning. |
Copied to clipboard
| Challenge: | Existing methods for rumor resolution ignore local interactions during the message diffusion which is important for the identification of rumors. |
| Approach: | They propose to model confrontation and reciprocity between message pairs via discrete variational autoencoders which effectively reflects the diversified opinion interactivity. |
| Outcome: | Experiments on a PHEME dataset show that the proposed model achieves higher accuracy than existing methods. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have significantly impacted various domains, especially through organized LLM-driven autonomous agents. |
| Approach: | They propose a framework that enables orchestrated teams to jointly propose various task-oriented solutions and interact with their insights in a self-independence while cross-team collaboration environment for superior solutions generation. |
| Outcome: | Experiments show that the framework can generate better software quality compared to state-of-the-art frameworks. |
Copied to clipboard
| Challenge: | Experimental results show that unified model outperforms other models that treat encoding and matching separately. |
| Approach: | They evaluate a unified model with Transformer layers for machine reading comprehension . they find that the model learns different modeling strategies compared with previous models . |
| Outcome: | The unified model outperforms models with Transformer layers on the machine reading comprehension task. |
Copied to clipboard
| Challenge: | Large language models (LLMs) exhibit remarkable capabilities across many tasks, but face critical challenges in the CSC scenario: (1) poor generalization to rare entities in open-domain searches; and (2) failure to adapt to temporal entity variations due to static parameters, resulting in serious over-correction issues. |
| Approach: | They propose a Chinese Spelling Check system with RAG and multi-task learning that integrates dynamic knowledge retrieval and entity-centric RAG to address rare entities. |
| Outcome: | The proposed system outperforms existing baselines in the CSC task and achieves a maximum improvement of +9.92% on the search scenario benchmark and +3.2% on the general-domain dataset. |
Copied to clipboard
| Challenge: | Entropy-Guided Stepwise Scaling (EGSS) is a novel TTS framework for software engineering tasks. |
| Approach: | They propose an entropy-guided stepwise scaling framework that balances efficiency and effectiveness through entropic-guide encoding and robust test-suite augmentation. |
| Outcome: | EGSS boosts performance by 5–10% across all evaluated models, and reduces inference-time token usage by over 28% . compared to existing methods, EGS reduces token usage and reduce inference time by over 20% . |
Copied to clipboard
| Challenge: | Existing methods for large language models focus on post-training stage or inference time, while few tackle the source of toxicity, namely, the dataset itself. |
| Approach: | They propose to localize and rewrite toxic spans in raw corpora with SoCD, which guides an LLM to localized and preserving semantics while preserving toxicity. |
| Outcome: | The proposed method reduces TP from 0.42 to 0.18 and Expected Maximum Toxicity (EMT) from 0.43 to 0.20 on three LLMs. |
Copied to clipboard
| Challenge: | Existing structural bias adapters for aspect sentiment triplet extraction are under-confident . a large-scale dataset for ASTE shows the adapter is effective and efficient to a larger scale. |
| Approach: | They propose to use a structural adapter to integrate structural bias into pretrained language models . they propose to add a relative position structure in place of the syntactic dependency structure . |
| Outcome: | The proposed adapter achieves state-of-the-art performance over strong baselines, but with a light parameter demand and low latency. |
Copied to clipboard
| Challenge: | Existing work on math word problem solvers replace real numbers with symbolic placeholders to focus on logic reasoning. |
| Approach: | They propose to inject numerical properties into symbolic placeholders with contextualized representation learning schema to solve number representation dilemma. |
| Outcome: | The proposed model can solve MWP problems on English and Chinese benchmarks. |
Copied to clipboard
| Challenge: | Existing research on multimodal pre-training for visually rich document understanding tasks has focused on the English domain while neglecting the importance of multilingual generalization. |
| Approach: | They propose a multimodal pre-trained model for multilingual document understanding which bridges the language barriers for visually rich document understanding. |
| Outcome: | The proposed model outperforms existing cross-lingual pre-trained models on the XFUND dataset on visual document understanding tasks. |
Copied to clipboard
| Challenge: | Existing studies rely on roll call data to estimate political preference of legislators. |
| Approach: | They propose to integrate voting behavior and public statements on Twitter to jointly model legislators. |
| Outcome: | The proposed model improves on the task of roll call vote prediction . it also shows that the model captures nuances in statements . |
Copied to clipboard
| Challenge: | Existing studies focus on fusing different features but ignore the challenge of modality heterogeneity. |
| Approach: | They propose a text-guided fusion module with novel Sparse-Attention to reduce the negative impacts of redundant visual elements and a sentiment-based congruity constraint task to calibrate the feature shift in the representation space. |
| Outcome: | The proposed model is competitive against existing methods and achieves state-of-the-art results on two public benchmark datasets. |
Copied to clipboard
| Challenge: | Sentiment analysis is a key task in e-commerce to detect fine-to-coarse sentiment polarities. |
| Approach: | They propose to use a large-scale Chinese restaurant review dataset ASAP to investigate the sentiment polarities underlying user reviews. |
| Outcome: | The proposed model outperforms state-of-the-art models on both tasks. |
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 Open IE systems are built on hand-crafted patterns from syntactic parsing, yet they face errors in propagation and compounding at each stage. |
| Approach: | They propose a neural Open IE approach with an encoder-decoder framework . they propose to learn highly confident arguments and relation tuples bootstrapped from a state-of-the-art Open ie system. |
| Outcome: | The proposed approach outperforms baseline methods while maintaining comparable computational efficiency. |
Copied to clipboard
| Challenge: | Existing work on slot filling uses labeled data from source domains to train a model for target domains. |
| Approach: | They propose a model-agnostic Slot Transferability Measure (STM) to evaluate the transferability from a source slot to a target slot. |
| Outcome: | The proposed method outperforms state-of-the-art models on multiple datasets and models. |
Copied to clipboard
| Challenge: | Social graphs are mathematical structures stem from pairwise interactions between entities through nodes and edges. |
| Approach: | They propose a framework for dynamic, text-attributed social graph generation that simulates the temporal node and edge generation processes for zero-shot social graphs. |
| Outcome: | The proposed framework improves macroscopic graph structure metrics by 11% . the proposed model can generate graphs with up to 100,000 nodes or 10 million edges . |
Copied to clipboard
| Challenge: | Existing approaches to dialogue systems are labor-intensive and difficult to scale up. |
| Approach: | They propose a Retrieval-Enhanced Adversarial Training method for neural response generation that leverages an adversarial training paradigm while taking advantage of N-best response candidates from a retrieval-based system to construct the discriminator. |
| Outcome: | The proposed method outperforms the vanilla Seq2Seq model and conventional adversarial training approach on a large scale dataset. |
Copied to clipboard
| Challenge: | Existing models for word-level autocompletion (WLAC) only use human typed sequences as prefixes in decoding module. |
| Approach: | They propose a novel iterative nonautoregressive instruct generation model for WLAC task . it uses human typed sequences and iterating decoding with subwords to fully utilize input information. |
| Outcome: | The proposed model is more competent in dealing with low-frequency words, and achieves state-of-the-art results on the WMT22 and benchmark datasets. |
Copied to clipboard
| Challenge: | Existing studies focus on improving fusion strategies and modeling modality-to-label dependencies, but they overlook the impact of aleatoric uncertainty, which is inherent noise in multimodal data. |
| Approach: | They propose a latent emotional distribution decomposition with uncertainty perception framework to model aleatoric uncertainty in multimodal data. |
| Outcome: | The proposed framework achieves state-of-the-art performance on the CMU-MOSEI and M3ED datasets, highlighting the importance of uncertainty modeling in MMER. |
Copied to clipboard
| Challenge: | Existing reasoning methods for sparse KGs are incomplete and lack of evidential paths to target entities makes multi-hop reasoning difficult. |
| Approach: | They propose a multi-hop reasoning model over sparse KGs to solve this problem . they use latent prediction of embedding-based models to make the model perform more potential path search over sparses . |
| Outcome: | The proposed method outperforms state-of-the-art models on five datasets from Freebase, NELL and Wikidata. |
Copied to clipboard
| Challenge: | Existing pre-training tasks for text and layout are effective in visually-rich document understanding tasks. |
| Approach: | They propose to combine pre-training tasks with a multi-modal model to model interaction between text, layout and image in a single multi-module framework. |
| Outcome: | The proposed model outperforms LayoutLM by a large margin on visual-rich document understanding tasks. |
Copied to clipboard
| Challenge: | Existing dense retrieval systems suffer from typoed queries due to mistyping or phonetic typing errors. |
| Approach: | They propose a method that incorporates the spelling correction objective into the DR model and a prompt-based augmentation technique to enhance the alignment of the typoed query and its original query. |
| Outcome: | The proposed model outperforms existing typos-aware training approaches and sophisticated training advanced retrievers. |
Copied to clipboard
| Challenge: | Existing methods for reading order detection are too laborious to annotate large datasets. |
| Approach: | They propose to use a large-scale dataset to annotate reading order information for document images . they use XML metadata to capture the reading order of WORD documents . |
| Outcome: | The proposed model performs almost perfectly in reading order detection and improves both open-source and commercial OCR engines in ordering text lines in their results. |
Copied to clipboard
| Challenge: | Existing approaches for document layout analysis are based on rule-based or machine learning methods that ignore textual information. |
| Approach: | They present a benchmark document layout analysis dataset using a computer vision model . they build strong baselines and manually split train/dev/test sets for evaluation . |
| Outcome: | The proposed model trains on DocBank accurately recognize layout information for a variety of documents. |
Copied to clipboard
| Challenge: | Text2Sql is a task that translates natural language questions and database schemas into SQL queries. |
| Approach: | They employ pure fine-tuning strategy to reduce redundancy by using only 53% of the baseline prompt length to fine- tune the model. |
| Outcome: | The model outperforms the baseline model by 8.2% and 8.6% in Test-suite accuracy (TS) and exact-set-match accuracy (EM) under the most refined Spider dev set of prompts, the model achieves 73.5% and 75.4%, respectively, approaching state-of-the-art (SOTA) levels. |
Copied to clipboard
| Challenge: | Earlier efforts in text modeling have achieved limited success on word meanings . convolutional neural networks (CNNs) are used to model higher level concepts and facts in texts . |
| Approach: | They propose three strategies to stabilize dynamic routing process to alleviate disturbance of noise capsules. |
| Outcome: | The proposed methods achieve state-of-the-art on 4 out of 6 datasets . they show that capsule networks exhibit significant improvement over baseline methods . |
Copied to clipboard
| Challenge: | Existing methods for enhancing the performance of large language models require expensive manual annotations. |
| Approach: | They propose an offline direct preference optimization method that collects preference pairs through iterative sampling and execution feedback to improve model confidence. |
| Outcome: | The proposed method improves performance on three reasoning tasks and shows a 3.6% improvement over the standard method. |
Copied to clipboard
| Challenge: | Pre-Trained Models (PTMs) have reshaped the development of natural language processing (NLP) but it is not easy to obtain high-performing PTMs without a large amount of labeled training data and deploy them online with fast inference speed. |
| Approach: | They propose to make it easy to build NLP applications with knowledge-enhanced pre-training and knowledge distillation. |
| Outcome: | EasyNLP supports a comprehensive suite of NLP algorithms and features knowledge-enhanced pre-training, knowledge distillation and few-shot learning functionalities. |
Copied to clipboard
| Challenge: | Multiple-choice question datasets like Massive Multitask Language Understanding (MMLU) have inevitably led to benchmark contamination, resulting in unreliable evaluation. |
| Approach: | They propose a contamination-free MCQ benchmark called MMLU-CF which reassesses LLMs’ understanding of world knowledge by averting both unintentional and malicious data contamination. |
| Outcome: | The proposed MMLU-CF reassesses LLMs’ understanding of world knowledge by averting both unintentional and malicious data contamination. |
Copied to clipboard
| Challenge: | Prompt tuning learns soft prompts to condition pre-trained Language Models for performing downstream tasks in a parameter-efficient manner. |
| Approach: | They propose a Prompt tuning model with an eXtremely small scale that learns soft prompts to condition the frozen Pre-trained Language Models for performing downstream tasks in a parameter-efficient manner. |
| Outcome: | The proposed model outperforms the vanilla Prompt-Tuning and can significantly improve across tasks and model scales. |
Copied to clipboard
| Challenge: | Large Language Model (LLM) agents struggle with ultra-long-horizon tasks requiring hundreds or thousands of interaction steps. |
| Approach: | They propose a framework that reconceptualizes context management as a Next Step Prediction problem. |
| Outcome: | The proposed framework improves task success rates and robust cross-lingual performance. |
Copied to clipboard
| Challenge: | Existing approaches to answer selection are limited in domains with limited labeled data. |
| Approach: | They propose a Knowledge-aware Attentive Network framework for cross-domain answer selection that uses the knowledge base as a bridge to enable knowledge transfer from the source domain to the target domain. |
| Outcome: | The proposed model outperforms strong competitors by a noticeable margin in cross-domain answer selection. |
Copied to clipboard
| Challenge: | Existing literature on dialog memory systems is inconsistent on their effectiveness . empirical findings on graph structures are difficult to attribute to specific design choices . |
| Approach: | They propose a framework that decomposes dialog memory systems into core components . they conduct stage-wise experiments on LongMemEval and HaluMeM, and compare implementation details . |
| Outcome: | The proposed framework compares graph-based and non-graph memory architectures on long-term dialog memory systems. |
Copied to clipboard
| Challenge: | Recent studies show that fine-tuning with benign data can compromise safety of aligned LLMs. |
| Approach: | They propose a Layer-Aware Representation Filtering method that detects safety-degrading layers within the LLM and leverages their representations to detect them. |
| Outcome: | The proposed method can detect safety-degrading features in benign data and remove them from the model. |
Copied to clipboard
| Challenge: | Existing approaches to text clustering fine-tune pre-trained models have been limited. |
| Approach: | They propose a method to fine-tune pre-trained models unsupervisedly for text clustering by learning text representations and cluster assignments using a clustering oriented loss. |
| Outcome: | The proposed model outperforms baseline methods and achieves state-of-the-art results on three text clustering datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) provide powerful text generation capabilities, but accessing sensitive user inputs raises privacy concerns. |
| Approach: | They propose a privacy-preserving collaborative inference framework that combines large language models with small language models inside TEE to preserve privacy. |
| Outcome: | Experiments show that CoTrust outperforms unconstrained LLMs on multiple question answering and summarization benchmarks while maintaining strong privacy protection. |
Copied to clipboard
| Challenge: | Existing benchmarks evaluate contextual causal reasoning in fragmented settings, failing to ensure context consistency or cover the full causal hierarchy. |
| Approach: | They use a unified context to benchmark large language models' contextual causal reasoning skills. |
| Outcome: | The proposed benchmarks show that LLMs are susceptible to distraction by irrelevant but factually correct information at lower level of causality. |
Copied to clipboard
| Challenge: | Existing methods for distantly supervised relation extraction suffer from noisy labeling problem, which can severely degrade its performance. |
| Approach: | They propose a framework for distantly supervised relation extraction that leverages text corpus and knowledge graph and a cooperative module involving their mutual learning. |
| Outcome: | The proposed method reduces the noisy labels and achieves substantial improvement over the state-of-the-art methods. |
Copied to clipboard
| Challenge: | Mainstream methods that ignore the diversity among keyphrases or weakly capture the relation between tasks implicitly ignore keyphrase diversity. |
| Approach: | They propose a novel end-to-end learning framework that jointly learns to extract and generate keyphrases by exploiting latent semantic relation between extraction and generation. |
| Outcome: | The proposed approach outperforms mainstream methods on a benchmarked document on keyphrase prediction. |
Copied to clipboard
| Challenge: | Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning. |
| Approach: | They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking. |
| Outcome: | The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup. |
Copied to clipboard
| Challenge: | Existing text-to-SQL models treat schema linking as a minor component . Existing solutions treat schema as merely a string component based on string matching . |
| Approach: | They build a schema linking corpus based on a Spider text-to-SQL dataset . they find schema linking is the crux for the current text- to-Sql task . |
| Outcome: | The proposed model performs well on the Spider text-to-SQL dataset despite its simplicity. |
Copied to clipboard
| Challenge: | Existing methods for storytelling lack coherence and consistency, compromising the overall storytelling experience. |
| Approach: | They propose a novel approach that improves the coherence and consistency of automatically generated stories by managing plot nodes and enabling dynamic interactions between different parts of the story. |
| Outcome: | The proposed approach outperforms existing methods in 84.33% of the trials. |
Copied to clipboard
| Challenge: | Recent advances in language models have demonstrated strong capabilities in semantic understanding and contextual modeling. |
| Approach: | They propose a LLaMA-based language model that incentivizes generalization capabilities for speech enhancement. |
| Outcome: | The proposed language model outperforms prior task-specific discriminative and generative models in acoustic enhancement tasks. |
Copied to clipboard
| Challenge: | Current methods focus on detecting and removing duplicates, which risks the loss of valuable information and neglects the varying degrees of duplication. |
| Approach: | They propose a method that maintains dataset integrity while selectively reducing the sampling weight of data with high commonness. |
| Outcome: | The proposed method significantly improves training efficiency on deduplicated datasets and improves downstream accuracy by 1.77%. |
Copied to clipboard
| Challenge: | Recent advances in process reward models (PRMs) have demonstrated remarkable improvements in the reasoning capabilities of large language models (LLMs). |
| Approach: | They evaluate state-of-the-art generative PRMs on table question answering from answer and step perspectives and compare their results to previous studies. |
| Outcome: | The proposed model can aid solution selection but struggle to generalize to out-of-domain data. |
Copied to clipboard
| Challenge: | Existing research on reinforcement learning for LLMs under data scarcity has not been unified. |
| Approach: | They propose a top-up hierarchical framework built around three complementary perspectives: data-centric, training-centric and framework-centric. |
| Outcome: | The proposed framework provides a clear conceptual foundation for understanding the design space of data-efficient RL for large language models and to guide researchers working in this emerging area. |
Copied to clipboard
| Challenge: | Existing question answering systems use a retriever-reader framework to answer multi-hop questions . existing models lack retrieval, selector, and reasoner capabilities . |
| Approach: | They propose a three-stage text tableQA framework which comprises of retriever, selector, and reasoner. |
| Outcome: | The proposed framework outperforms baseline methods in the few-shot setting and ranks first on the HybridQA leaderboard. |
Copied to clipboard
| Challenge: | Prior work assigns supervision based on outcome rewards or external reward models, but ignores environment observations, a critical source of learning. |
| Approach: | They propose a supervision-based agentic reinforcement learning system that integrates environment observations as an explicit supervision signal. |
| Outcome: | The proposed model improves performance on reasoning and deep research tasks while reducing erroneous and inefficient tool usage. |
Copied to clipboard
| Challenge: | Chart question answering (CQA) is a multimodal task for evaluating the reasoning capabilities of vision-language models. |
| Approach: | They propose a chart question answering benchmark that incorporates multilingual contexts and supports open-domain textual outputs. |
| Outcome: | The proposed framework outperforms the previous three common CQA paradigms: instruction-following, OCR-enhanced, and chain-of-thought. |
Copied to clipboard
| Challenge: | Existing knowledge bases focus on static entities such as people, locations and organizations. |
| Approach: | They propose a new knowledge base resource called EventWiki which concentrates on major events . they show that EventWiki is a very useful resource for information extraction regarding events in NLP . |
| Outcome: | The proposed resource is the first knowledge base resource of major events. |
Copied to clipboard
| Challenge: | a novel information network decipherment paradigm is proposed for fine-grained coordinated cross-lingual text stream alignment. |
| Approach: | They propose to use Burst Information Networks as media to represent text streams . they propose a simple yet effective information network decipherment algorithm with diverse clues . |
| Outcome: | The proposed approach outperforms existing approaches on bilingual lexicon extraction from coordinated text streams and can harvest high-quality alignments from large amounts of streaming data for endless language knowledge mining. |
Copied to clipboard
| Challenge: | Current error-handling works are performed in a passive manner, with explicit error- handling instructions. |
| Approach: | They propose a new benchmark to analyze LLMs' performance on a mis-prompt benchmark and a dataset to promote further research. |
| Outcome: | The proposed benchmark shows that current LLMs show poor performance on proactive error handling, and that SFT improves on error handling instances. |
Copied to clipboard
| Challenge: | Existing research on Event-Event Causal Relation Extraction (ECRE) has highlighted the lack of document-level modeling and causal hallucinations. |
| Approach: | They propose a Knowledge-guided binary Question Answering method with event structures for ECRE that utilizes cross-task knowledge in IE. |
| Outcome: | The proposed method achieves state-of-the-art on the MECI and MAVEN-ERE datasets. |
Copied to clipboard
| Challenge: | Existing models rely on a quadratic computation to generate long texts . current models impose limitations on the length of text inputs . |
| Approach: | They propose a semantic compression method that extends the context window of large language models . the method reduces the semantic redundancy of long inputs before passing them to the LLMs . |
| Outcome: | The proposed method extends the context window of large language models across tasks . it exhibits consistent fluency in text generation while reducing associated computational overhead. |
Copied to clipboard
| Challenge: | Existing layout-based pre-training approaches are not easy to apply to VRDU tasks. |
| Approach: | They propose to use markup languages as the backbone for document understanding tasks where text and markup information are jointly pre-trained. |
| Outcome: | The proposed model outperforms existing models on document understanding tasks. |
Copied to clipboard
| Challenge: | DA-Code is a code generation benchmark designed to assess LLMs on agent-based data science tasks. |
| Approach: | They propose a code generation benchmark specifically designed for LLMs on agent-based data science tasks. |
| Outcome: | The benchmark performs better than existing frameworks, but lacks accuracy . it is based on real-world data, and includes examples that cover a wide range of tasks . |
Copied to clipboard
| Challenge: | Large language models (LLMs) have revolutionized various domains with their remarkable capabilities, but their massive parameter sizes pose significant challenges for fine-tuning and inference. |
| Approach: | They propose a Bayesian Knowledge Distillation framework for compact Large Language Models in resource-constrained fine-tuning scenarios that employs Logits Dual-Scaling, Knowledge Alignment Module, and Bayes Distillations Optimization. |
| Outcome: | The proposed framework outperforms baseline methods on various state-of-the-art LLMs, including LLaMA, Qwen2, Bloom, and Vicuna. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have revolutionized open-domain dialogue agents but face challenges in multi-character role-playing (MCRP) scenarios. |
| Approach: | They propose a framework for efficient multi-character role-playing that employs a dynamic low-rank adapter strategy and distinct LoRA blocks for each character. |
| Outcome: | Neeko employs a dynamic low-rank adapter (LoRA) strategy, enabling it to adapt seamlessly to diverse characters. |
Copied to clipboard
| Challenge: | Emotional Quotient (EQ) has emerged as a competency for seamless human-AI integration. |
| Approach: | They propose a framework for a closed-loop EQ evaluation using a PACE taxonomy to define four dimensions of LLM EQ. |
| Outcome: | The proposed framework achieves high alignment of 89.31% with human preferences while maintaining robust consistency of 83.6%. |
Copied to clipboard
| Challenge: | Prompt-tuning has shown appealing performance in few-shot classification . however, it is less promising in long-tailed classification due to long tail . |
| Approach: | They propose to use prompt-tuning to make pretrained language models at least good long-tailed learners by bridging the gap between prompt- and commonly used finetun. |
| Outcome: | The proposed method makes pretrained language models at least good long-tailed learners, bridging the gap between prompt-tuning and finetunation. |
Copied to clipboard
| Challenge: | Existing methods for rumor resolution ignore intrinsic propagation mechanisms of rumors and present poor adaptive ability when unprecedented news emerges. |
| Approach: | They propose to identify triggering posts and exploit their characteristics to facilitate rumor verification. |
| Outcome: | The proposed model and scheme exploits rumor diffusion patterns and linguistic features to facilitate verification. |
Copied to clipboard
| Challenge: | Existing methods for task-oriented dialogue clustering are difficult to apply directly due to inherent differences between them. |
| Approach: | They propose a Dialogue Task Clustering Network model for task-oriented clustering . they use context-aware utterance representations and cross-dialogue utterrance cluster representations . |
| Outcome: | The proposed model outperforms baselines on three public datasets on all metrics. |
Copied to clipboard
| Challenge: | Current document image parsing solutions rely on specialized models or generate content autoregressively. |
| Approach: | They propose a multimodal document image parsing model that integrates specialized models with autogeneous content generation. |
| Outcome: | The proposed model achieves state-of-the-art performance across diverse page-level and element-level settings while ensuring superior efficiency. |
Copied to clipboard
| Challenge: | Existing pruning strategies struggle to enhance robustness against adversarial attacks when continually increasing model sparsity and require a retraining process. |
| Approach: | They propose a pruning strategy that replicates embedding space and feature space of dense language models and aims to conserve more pre-trained knowledge during the pruning process. |
| Outcome: | The proposed pruning strategy replicates embedding space and feature space of dense language models, aiming to conserve more pre-trained knowledge during the pruning process. |
Copied to clipboard
| Challenge: | Existing methods for Knowledge-Based Visual Question Answering lack multimodal retrieval . large language models (LLMs) have demonstrated remarkable generalization and reasoning capabilities in text-based systems. |
| Approach: | They propose a multimodal vision-language retrieval-augmented generation system that harmonizes multiple modalities and modality to enhance retrieval. |
| Outcome: | The proposed system achieves state-of-the-art retrieval performance and competitive answers on InfoSeek and Encyclopedic-VQA benchmarks. |