Papers by Bowen Li
Copied to clipboard
| Challenge: | Existing approaches to analyze syntactic knowledge of pre-trained language models have been limited. |
| Approach: | They propose an unsupervised method that extracts constituency trees from PLM attention heads. |
| Outcome: | The proposed method outperforms existing approaches if no development set is present. |
Copied to clipboard
| Challenge: | Text embedding models are used for various natural language processing tasks such as sentiment analysis, text clustering, and content-based information retrieval. |
| Approach: | They propose a synthesis framework that leverages large language models to generate diverse negative samples with varying levels of similarity with the query. |
| Outcome: | The proposed framework achieves state-of-the-art performance surpassing existing synthesis strategies with synthetic data and when combined with public retrieval datasets. |
Copied to clipboard
| Challenge: | Existing methods fine-tune pre-trained models on cognitive data, ignoring the semantic gap between texts and cognitive signals. |
| Approach: | They propose a framework that can induce fine-grained cognitive features from cognitive data and incorporate them into pre-trained language models by adaptively adjusting the weight of cognitive features for different NLP tasks. |
| Outcome: | The proposed framework can induce fine-grained cognitive features from cognitive data and incorporate them into BERT by adaptively adjusting weight of cognitive features for different NLP tasks. |
Copied to clipboard
| Challenge: | Existing benchmarks for Large Language Models (LLMs) follow the data distribution of pre-training data. |
| Approach: | They propose a benchmark ConvRe focusing on converse relations which contains 17 relations and 1240 triples extracted from popular knowledge graph completion datasets. |
| Outcome: | The proposed benchmark focuses on converse relations, which contains 17 relations and 1240 triples extracted from popular knowledge graph completion datasets. |
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: | Large Vision-Language Models are hindered by a systemic efficiency barrier known as visual token dominance. |
| Approach: | They propose a systematic taxonomy of efficiency techniques structured around the inference lifecycle . they examine visual encoding, prefilling, and decoding to understand bottlenecks . |
| Outcome: | The proposed techniques reveal how upstream decisions dictate downstream bottlenecks . the proposed techniques include hybrid compression and modality-aware decoding . |
Copied to clipboard
| Challenge: | Existing approaches to reinforcement learning are decoupled from structured search due to limited trajectory diversity. |
| Approach: | They propose a unified RL framework that integrates multiple agents within a shared tree-structured search environment. |
| Outcome: | Experiments show that MARS2 improves performance across diverse model combinations and training settings. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) driven by In-Context Learning (ICL) have improved performance of text-to-SQL. |
| Approach: | They propose a strategy to mitigate hallucinations in large language models driven by In-Context Learning (ICL) they propose TA-SQL, a text-to-Sql framework that encourages LLMs to take advantage of similar tasks rather than starting from scratch. |
| Outcome: | The proposed framework improves the performance of the GPT-4 model by 21.23% on BIRD dev. |
Copied to clipboard
| Challenge: | Existing automated review systems struggle with factual accuracy, rating consistency, and analytical depth. |
| Approach: | They propose a framework for generating comprehensive and factually grounded scientific paper reviews using supervised fine-tuning and reinforcement learning. |
| Outcome: | The proposed framework outperforms existing methods on ICLR 2025 papers. |
Copied to clipboard
| Challenge: | Current training recipes often rely on datasets dominated by short annotations with limited rationales, hindering the models' ability to generalize to tasks requiring comprehensive reasoning. |
| Approach: | They propose a two-stage post-training strategy that augments short answers with CoT reasoning generated by GPT-4o, enhancing the VLM's CoT capabilities through fine-tuning. |
| Outcome: | The proposed strategy enhances the model's CoT capabilities through fine-tuning and reinforcement learning. |
Copied to clipboard
| Challenge: | Existing methods for extracting complete (binary) parses from pre-trained language models are expensive and time-consuming. |
| Approach: | They propose a chart-based method and an effective top-K ensemble technique to extractbinary parses from PLMs. |
| Outcome: | The proposed method can induce non-trivial parses for sentences from nine languages in an integrated and language-agnostic manner, and is robust to cross-lingual transfer. |
Copied to clipboard
| Challenge: | LLM-based agents for machine learning engineering rely on tree search to rank candidates. |
| Approach: | They propose an LLM-based agent that operationalizes gradient-based optimization. |
| Outcome: | The proposed agent achieves a state-of-the-art 35.1% any-medal rate on MLE-Bench with a limited budget on a single GPU. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) represent significant strides toward artificial general intelligence (AGI). |
| Approach: | They introduce OpenHuEval, the first benchmark for LLMs focusing on the Hungarian language and specifics. |
| Outcome: | The framework reveals intrinsic patterns and mechanisms of LLMs in non-English languages, with Hungarian serving as an example. |
Copied to clipboard
| Challenge: | Existing text-guided image editing methods rely on end-to-end pixel-level inpainting paradigm . existing models lack such intermediate representations and Reasoning-then-action process . |
| Approach: | They propose a "Decompose-then-Action" paradigm that revisits image editing as an actionable interaction process within a structured environment. |
| Outcome: | The proposed paradigm outperforms existing methods in compositional editing tasks. |
Copied to clipboard
| Challenge: | Existing studies highlight that dependency-related issues cause over 40% of observed runtime errors on the generated repository. |
| Approach: | They propose a large-scale benchmark and evaluation framework specifically designed to assess LLMs’ capability on dependency inference. |
| Outcome: | The proposed model achieves only a 48% execution pass rate on Python, indicating room for improvement. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated significant advancements in various fields, notably in Role-Playing Conversational Agents (RPCAs). |
| Approach: | They propose an Anchoring-Guidance Fine-Tuning Framework to integrate relevant expert knowledge into RPCAs' training process to mitigate this issue. |
| Outcome: | The proposed framework significantly improves the RPCAs’ performance in handling role-specific professional queries while preserving their robust role-playing abilities. |
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: | Large language models (LLMs) have been a success in the wide range of natural language understanding and reasoning tasks. |
| Approach: | They propose a training method to improve general and reversal reasoning abilities by using a reversed dataset. |
| Outcome: | The proposed method improves general and reversal reasoning abilities and alleviates the reverse curse. |
Copied to clipboard
| Challenge: | Traditional mixture-of-experts (MoE) networks impose an expert capacity constraint to ensure GPU-friendly computation. |
| Approach: | They propose a routing paradigm that dynamically allocates input tokens to top-k experts through differentiable sparse transformations, enabling scalable model capacity while preserving computational efficiency. |
| Outcome: | The proposed model achieves lower training losses and higher evaluation scores at equivalent FLOPs compared to constrained and unconstrained baselines. |
Copied to clipboard
| Challenge: | Story visualization aims to generate sequence of images to narrate each sentence in a multi-sentence story . current methods face semantic misalignment because of their fixed architecture and diversity of input modalities . |
| Approach: | They propose to use a GAN-based generative model to match semantic levels between text and image representations to solve the semantic misalignment problem. |
| Outcome: | Experiments show that the proposed approach improves image quality and story consistency compared with state-of-the-art methods. |
Copied to clipboard
| Challenge: | Extensive experiments show that STAR outperforms previous pre-training methods and ranks first on the leaderboard . text-to-SQL parsing aims to translate natural language (NL) questions into executable SQL queries . |
| Approach: | They propose a SQL guided pre-training framework STAR for context-dependent text-to-SQL parsing . they propose two objectives that explore context-dependence of NL utterances and SQL queries . |
| Outcome: | The proposed framework outperforms existing methods on two downstream benchmarks and ranks first on the leaderboard. |
Copied to clipboard
| Challenge: | Existing neural relation extraction models are limited by entity type and textual context. |
| Approach: | They propose a novel RAtionale Graph to organize co-occurrence constraints among entity types, triggers and relations in a holistic graph view. |
| Outcome: | The proposed method outperforms baselines significantly and achieves state-of-the-art performance on document-level and sentence-level RE benchmarks. |
Copied to clipboard
| Challenge: | Existing benchmarks for algorithmic reasoning fail to answer a critical question: do LRMs master algorithmic thinking? Empirical evaluations on leading LRM models reveal substantial performance heterogeneity, while models perform well on non-optimized tasks, accuracy drops sharply to around 49% on globally optimized algorithms. |
| Approach: | They propose an algorithm-centric benchmark that evaluates large reasoning models under an algorithmic paradigm. |
| Outcome: | Empirical evaluations on leading LRMs reveal substantial performance heterogeneity . models perform well on non-optimized tasks, accuracy drops sharply to around 49% . |
Copied to clipboard
| Challenge: | Existing methods to learn languages only focus on supervised learning, and unlabeled data is underexplored. |
| Approach: | They propose a semi-supervised lifelong language learning setting where a model learns sequentially arriving language tasks with both labeled and unlabeled data. |
| Outcome: | The proposed model outperforms baseline models on various language tasks and is effective and superior to existing models. |
Copied to clipboard
| Challenge: | Privacy-sensitive users require deploying large language models within their own infrastructure (on-premises) vulnerabilities in local environments can lead to unauthorized access and potential model theft. |
| Approach: | They propose a framework that secures a few bottom layers in a secure environment . they propose metric to optimize trade-off between protection and customization flexibility . |
| Outcome: | The proposed framework outperforms baselines on five models with 1.3B to 70B parameters. |
Copied to clipboard
| Challenge: | Existing approaches to integrate the recommendation function and dialog generation function smoothly are lacking. |
| Approach: | They propose to integrate dialog context for recommendation and dialog generation better using a pre-trained language model and an item metadata encoder to integrate the recommendation and dialogue generation. |
| Outcome: | The proposed architecture improves the integration of recommendation and dialog generation functions. |
Copied to clipboard
| Challenge: | Existing pre-trained language models are not explicitly aware of domain-specific knowledge, which is essential for downstream tasks in many domains, such as tasks in e-commerce scenarios. |
| Approach: | They propose a knowledge-injected pre-trained language model that can be transferred to both natural language understanding and generation tasks. |
| Outcome: | The proposed model significantly outperforms baselines across the board in e-commerce scenarios. |
Copied to clipboard
| Challenge: | Existing studies suggest key phrase selection is essential for question generation, yet it is difficult to connect disjointed phrases into meaningful questions, especially for long context. |
| Approach: | They propose a QG framework that uses multi-level content planning to generate questions from a given context and an answer. |
| Outcome: | The proposed framework outperforms baselines on two popular QG datasets. |
Copied to clipboard
| Challenge: | Existing models that require task labels or performance trade-offs are susceptible to catastrophic forgetting. |
| Approach: | They propose a representation-aware model merging framework for continual learning without access to historical data. |
| Outcome: | The proposed framework outperforms baselines in knowledge retention and generalization across five NLP tasks and multiple continual learning scenarios. |
Copied to clipboard
| Challenge: | Large Language Models excel in code generation benchmarks, but these benchmarks focus on single-file scenarios with constrained context scope. |
| Approach: | They propose an open-source framework to effectively resolve GitHub issues using a code file retrieval module and a model-based code editing module. |
| Outcome: | The proposed approach achieves state-of-the-art performance on two GitHub benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for efficient reasoning focus on reducing the number of model parameters or shortening the chain-of-thought length. |
| Approach: | They propose a speculative chain-of-thought (SCoT) method to reduce reasoning latency by accelerating average reasoning speed through large and small model collaboration. |
| Outcome: | The proposed method reduces reasoning latency by 48%66% and 21%49% on GSM8K, MATH, GaoKao, CollegeMath and Olympiad datasets. |
Copied to clipboard
| Challenge: | Despite efforts to improve ASR robustness, errors from pipeline approaches can lead to error propagation. |
| Approach: | They propose a framework for improving ASR robustness in SLU by using mutual learning and large-margin contrastive learning. |
| Outcome: | The proposed framework outperforms existing models and achieves new state-of-the-art performance on three datasets. |
Copied to clipboard
| Challenge: | Recent AI methods have shown promise in tasks such as hypothesis generation and experimental design, but they fail to replicate the collaborative nature of real-world scientific practices. |
| Approach: | They propose a virtual scientific system that mimics the collaborative nature of scientific research by organizing a team of agents to generate, evaluate, and refine research ideas. |
| Outcome: | The proposed system outperforms the state-of-the-art method in producing new scientific ideas and offers valuable insights to guide future research. |
Copied to clipboard
| Challenge: | Existing benchmarks for large language models (LLMs) are coarse, single-dimensional metrics and do not explicitly assess fine-grained legal reasoning. |
| Approach: | They propose a Practical Law Benchmark to evaluate large language models in real-world legal practice scenarios. |
| Outcome: | The proposed model is based on 850 questions and 13 scenarios with expert-designed evaluation rubrics. |
Copied to clipboard
| Challenge: | Existing methods for enhancing text or data are limited by lack of logical connections between generated texts and training data. |
| Approach: | They propose an encoder-decoder data augmentation framework that combines large language models and chain-of-thought prompting to summarize texts into target-specific if-then rationales, establishing logical relationships. |
| Outcome: | The proposed framework significantly improves over state-of-the-art methods on benchmark datasets while enabling interpretable rationale-based learning. |
Copied to clipboard
| Challenge: | despite its efficiency, Sentence-BERT ignores the progressive nature of semantic relationships, despite a promising approach . contrastive learning methods have improved performance on renowned STS benchmarks, but they fail to leverage fine-grained information. |
| Approach: | They propose a regression framework that categorizes text pairs as either semantically similar or dissimilar . they propose two loss functions: Translated ReLU and Smooth K2 Loss to bridge this gap . |
| Outcome: | The proposed method achieves convincing performance across seven established STS benchmarks. |
Copied to clipboard
| Challenge: | Existing approaches to answer complex questions are limited to text or structured data. |
| Approach: | They propose a paradigm that transforms images and tables into unified language representations to simplify QA problems. |
| Outcome: | The proposed framework outperforms existing methods on two datasets and the WebQA leaderboard. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) are hindered by the rapid growth of key–value (KV) caches. |
| Approach: | They propose a hybrid KV cache compression framework that reduces KV memory by 7.9 and speeds up decoding by 1.52. |
| Outcome: | Experiments on 11 multimodal benchmarks show that HYBRIDKV cuts KV cache memory by 7.9 and speeds up decoding by 1.52. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated an impressive capability known as In-context Learning (ICL), which enables them to acquire knowledge from textual demonstrations without the need for parameter updates. |
| Approach: | They propose to use model’s previously predicted historical samples as demonstrations for subsequent ones to improve model’ s performance. |
| Outcome: | The proposed method significantly outperforms the previous method and its predecessors in terms of inference cost and time. |
Copied to clipboard
| Challenge: | Large Reasoning Models (LRMs) have demonstrated remarkable capabilities in complex reasoning through long chain-of-thought, yet they struggle with precise computations and algorithmic operations. |
| Approach: | They propose a training-free approach that activates LRMs’ latent tool-use capabilities through artificial hints and a framework that enables models to learn effective tool utilization through diverse hint patterns and rejection-based data synthesis. |
| Outcome: | Experiments show that START significantly improves state-of-the-art LRMs across challenging benchmarks, including competition-level mathematics (AMC23: 95.0%, AIME24: 75.6%) and graduate-level science questions (GPQA: 64.6%). |
Copied to clipboard
| Challenge: | Experimental results show that pre-trained Chinese language models ignore linguistics knowledge to learn representations. |
| Approach: | They propose a task-free enhancement module to integrate linguistics knowledge into Chinese pre-trained language models. |
| Outcome: | The proposed model improves Chinese pre-trained language models on 6 tasks with 10 benchmark datasets. |
Copied to clipboard
| Challenge: | Existing benchmark-based evaluations cannot accurately reflect the performance of real-world applications. |
| Approach: | They propose a reliable strategy for domains to choose more robust LLMs for real-world applications. |
| Outcome: | The proposed strategy addresses the challenges faced by domains to choose more robust LLMs for real-world applications. |
Copied to clipboard
| Challenge: | Existing soft prompt methods focus on designing the input-independent prompts that steer the model to fit the domain of the new dataset. |
| Approach: | They propose a multi-level prompt tuning method that utilizes prompts at task-specific, domain-specific and context-specific levels to enhance the comprehension of input semantics. |
| Outcome: | The proposed method improves on 12 benchmarks on various QA formats and achieves an average improvement of 1.94% over the state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing methods of text detoxification fail to achieve a decent balance between effectiveness and generation quality. |
| Approach: | They propose a text detoxification framework that pays attention to both context and detoxification process. |
| Outcome: | Experiments on various LLMs show that the proposed framework can yield the best performance compared to baselines. |
Copied to clipboard
| Challenge: | Existing methods that learn from multiple semantically-equivalent questions are limited to one-to-one mapping . |
| Approach: | They propose a constraint to explore the underlying complementary semantic information among multiple semantically-equivalent questions and learn robust feature representations with reduced spurious associations. |
| Outcome: | The proposed method outperforms strong competitors and achieves state-of-the-art results on five benchmark datasets. |
Copied to clipboard
| Challenge: | Abstractive summarization models have been widely used to extract words from source into summary, but how to ensure that important words in source are copied remains a challenge. |
| Approach: | They propose a Transformer-based model to enhance copy mechanism by identifying the importance of each source word based on the degree centrality. |
| Outcome: | The proposed model outperforms baseline methods on CNN/Daily Mail and Gigaword datasets. |
Copied to clipboard
| Challenge: | Existing benchmarks for RPCA evaluation are lacking for dialogues . authors introduce specialized judging LLM for automatic RPca evaluation . compelling role-playing agent is expected to lead to more in-depth conversations . |
| Approach: | They propose a benchmark to assess the effectiveness of RPCA interactions using dialogues . they introduce a specialized judging LLM tailored for automatic RPca evaluation . |
| Outcome: | The proposed benchmark focuses on assessing particular dimensions at different stages of a conversation, facilitated through interactions conducted by annotators. |
Copied to clipboard
| Challenge: | Unsupervised parsing is a form of reinforcement learning that improves syntactic structures but lacks interpretability due to its lack of ad hoc heuristics. |
| Approach: | They propose an unsupervised approach that transfers syntactic knowledge to a Tree-LSTM model with discrete parsing actions. |
| Outcome: | The proposed model outperforms existing models on the All Natural Language Inference dataset and achieves a new state of the art in terms of parsing F-score. |
Copied to clipboard
| Challenge: | FlagEvalMM is an evaluation framework designed to assess multimodal models . it is designed to be used for vision-language understanding and generation tasks . |
| Approach: | They propose an evaluation framework that decouples model inference from evaluation through an independent evaluation service. |
| Outcome: | The evaluation framework offers accurate and efficient insights into model strengths and limitations. |
Copied to clipboard
| Challenge: | Existing approaches to lifelong learning (LL) models require access to task identities in the testing phase or cannot handle samples from unseen tasks. |
| Approach: | They propose a dynamic architecture-based lifelong learning model that tries to learn a sequence of tasks with a prompt-enhanced language model. |
| Outcome: | The proposed model outperforms state-of-the-art models in handling unseen tasks and focuses on task-level prompts to capture knowledge from different granularities. |
Copied to clipboard
| Challenge: | Vision-Language Models (VLMs) lack visual-aware tutorial retrieval and historical visual context curation and pruning. |
| Approach: | They propose a framework that integrates an orchestrator and a Reflection-Memory Agent for robust automation. |
| Outcome: | Experimental results show that OS-Symphony delivers substantial performance gains across model scales. |
Copied to clipboard
| Challenge: | Neural Response Generators (NRGs) use persona information of users to perform personalized conversations . current studies focus on incorporating explicit meta-data of user profiles or character descriptions to generate persona-aware responses. |
| Approach: | They propose to use persona information of users in Neural Response Generators to perform personalized conversations. |
| Outcome: | The proposed method improves persona-aware response generation and the metrics are reasonable to evaluate them. |
Copied to clipboard
| Challenge: | Current temporal reasoning datasets are limited to questions about single or isolated events, falling short in mirroring the realistic temporal characteristics involving concurrent nature and intricate temporal interconnections. |
| Approach: | They propose a co-temporal Question Answering benchmark that contains four co-time scenarios with 4,748 samples for evaluating the co-timing abilities of large language models. |
| Outcome: | The proposed benchmarks show that current LLMs struggle on CoTempQA tasks even when enhanced with Chain of Thought methodologies. |
Copied to clipboard
| Challenge: | Existing methods assume that events appear in sentences without overlaps . overlapping event extraction is a challenging task in natural language understanding . |
| Approach: | They propose a joint learning framework with cascade decoding for overlapping event extraction . they sequentially perform type detection, trigger extraction and argument extraction based on the specific former prediction . |
| Outcome: | The proposed framework improves on a public event extraction benchmark . it sequentially performs type detection, trigger extraction and argument extraction . |
Copied to clipboard
| Challenge: | Textual frequency is a topic of understudied research, but its relevance to Large Language Models is not well understood. |
| Approach: | They propose a framework to estimate textual data frequency using a paraphraser and a textual distillation method to refine LLMs. |
| Outcome: | The proposed framework can be used to estimate sentence-level frequency with word-level frequencies. |
Copied to clipboard
| Challenge: | Existing algorithms for post-training large datasets are requiring a large computational effort. |
| Approach: | They propose to model the changes at logits level during post-training using a separate neural network . they demonstrate that the value network can be seamlessly integrated with another pre-trained model . |
| Outcome: | The proposed model can be integrated with another pre-trained model during inference, enabling similar capability enhancements. |
Copied to clipboard
| Challenge: | Existing methods for document-grounded dialogue (DocGD) rely on general pre-trained language models without a tailored pre-training approach that explicitly captures causal relationships. |
| Approach: | They propose a causally-complete dataset construction strategy for developing million-scale DocGD pre-training corpora and a perturbation-based strategy to capture causality. |
| Outcome: | The proposed strategy yields significant and consistent improvements in fully-supervised, low-resource, few-shot, and zero-shot settings. |
Copied to clipboard
| Challenge: | Existing methods to solve cross-domain task-oriented dialogues are brittle when cross- domain constraints are not directly grounded in surface text or require commonsense inference. |
| Approach: | They propose a framework that makes LLM-derived constraint reasoning usable for RL. |
| Outcome: | Experiments show that the proposed framework outperforms single-model baselines on long-horizon tasks. |
Copied to clipboard
| Challenge: | a new benchmark for goal-oriented dialog evaluation is needed to address the problem of knowledge sources, noisy user expressions, and the shortage of annotated data. |
| Approach: | They propose a Chinese benchmark for goal-oriented dialog evaluation that uses dialog sessions and 574,949 dialog turns to bridge the gap between academic benchmarks and spoken dialog scenarios. |
| Outcome: | The proposed benchmark contains 96,763 dialog sessions and 574,949 dialog turns totally. |
Copied to clipboard
| Challenge: | Open Information Extraction (OpenIE) models are evaluated on in-domain test sets aside from the training corpus, which violates the initial task principle of domain-independence. |
| Approach: | They propose to generalize OpenIE over unseen target domains with different data distributions from source training domains. |
| Outcome: | The proposed method beats the previous methods in both in- and out-of-domain settings by 6.0% in F1 score absolutely. |
Copied to clipboard
| Challenge: | Existing approaches to learn better unsupervised sentence representations have been successful . over-smoothing problem in unsupervised sentences reduces the capacity of powerful PLMs . |
| Approach: | They propose a method to solve the over-smoothing problem in unsupervised sentence representations by combining negatives from PLMs intermediate layers. |
| Outcome: | The proposed method improves on different strong baselines on Semantic Textual Similarity and Transfer datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) can reveal toxic or offensive content inadvertently or intentionally. |
| Approach: | They propose to control the diversity of both sides according to the number of samples for fine-tuning, which can directly reflect their impact. |
| Outcome: | The proposed approach improves the performance of large language models after fine-tuning. |
Copied to clipboard
| Challenge: | Existing benchmarks focused on simplified or isolated aspects of coding, ignoring the full spectrum of programming challenges. |
| Approach: | They propose a case study that examines the performance of large language models across the entire software development lifecycle with four programming languages, multiple domains, and carefully designed and verified metrics for each task. |
| Outcome: | The proposed model performs across the entire software development lifecycle, including design, environment setup, implementation, acceptance testing, and unit testing. |
Copied to clipboard
| Challenge: | Existing methods for conversational KBQA assume the independence of utterances and model them in isolation. |
| Approach: | They propose a History Semantic Graph Enhanced KBQA model that models long-range semantic dependencies in conversation history while maintaining low computational cost. |
| Outcome: | The proposed model outperforms baselines on a widely used question type dataset. |
Copied to clipboard
| Challenge: | Existing approaches to building generalizable verifiable data are task-specific and lack a principled, universal evaluator of verifikatability. |
| Approach: | They propose a task-agnostic, strategy-guided, executably-checkable data synthesis framework that synthesizes problems, diverse candidate solutions and verification artifacts from a single source. |
| Outcome: | The proposed framework synthesizes problems, candidates, and verification artifacts from human-annotated and strategy-induced checks and iteratively discovers strategies. |
Copied to clipboard
| Challenge: | e-commerce product summarization requires consistency between product attributes and summary . inconsistent product summaries can mislead users and decrease public credibility . |
| Approach: | They propose a model to generate e-commerce product summaries with product attributes . they encode product attribute table and constrain attribute words to be presented only through copying . |
| Outcome: | The proposed model significantly improves the faithfulness of e-commerce product summarization tasks. |
Copied to clipboard
| Challenge: | Existing state-of-the-art event coreference resolution systems rely on spurious and spurious associations in the input mention pair text. |
| Approach: | They propose a rationale-centric counterfactual data augmentation method that leverages the debiasing capability of counterfact data haussed by LLM-in-the-loop to mitigate spurious association while emphasizing causation. |
| Outcome: | The proposed method achieves state-of-the-art on three popular cross-document benchmarks and demonstrates robustness in out-of domain scenarios. |
Copied to clipboard
| Challenge: | Existing methods for IE are task-specific, resulting in specialized and isolated approaches for different tasks. |
| Approach: | They propose a method to retrieve task-specific knowledge from pretrained language models to enhance universal IE by using a Meta-Pretraining Algorithm. |
| Outcome: | The proposed method achieves the new state-of-the-art on 4 IE tasks, 12 datasets under fully-supervised, low-resource and few-shot scenarios. |
Copied to clipboard
| Challenge: | Existing question generation systems focus on the internal knowledge within the textual passage or the semantic word space for diverse content planning. Existing solutions focus on relying on the knowledge of the text and the semantic words, but have not considered the potential of external knowledge for expression diversity. |
| Approach: | They propose a framework for Retrieval-Augmented Style Transfer that utilizes the style of diverse templates for question generation. |
| Outcome: | The proposed framework outperforms baselines on diversity while being comparable in terms of consistency scores. |
Copied to clipboard
| Challenge: | a new evaluation platform for large language models and text-driven AIGCs is available for free. |
| Approach: | They propose an evaluation platform for side-by-side comparisons of large language models and text-driven AIGC systems. |
| Outcome: | a new evaluation platform for large language models and text-driven AIGC systems is available for free . the platform is more focused on the Chinese language and more models developed by Chinese institutes . |
Copied to clipboard
| Challenge: | Existing approaches to self-correct text-to-SQL fail to demonstrate underlying reasoning path . authors propose **SHARE**, a self-revolution assistant for text-based error correction . |
| Approach: | They propose a "SHARE" assistant that enables LLMs to perform more precise error localization and efficient correction. |
| Outcome: | The proposed assistant performs more precise error localization and efficient correction for monolithic SQL queries. |
Copied to clipboard
| Challenge: | Existing studies suggest augmenting LLMs with external text corpora to alleviate hallucination problems. |
| Approach: | They propose to augment large language models with text units retrieved from external knowledge corpora to alleviate the issue. |
| Outcome: | The proposed framework outperforms baselines on GRBench with three LLMs and shows that iterative reasoning outperformed the baselines. |
Copied to clipboard
| Challenge: | Existing methods for transferring knowledge from BERT into a model with large parameters are not efficient due to their large-scale and high computational cost. |
| Approach: | They propose a sentence representation approximating oriented distillation framework that can distill pre-trained BERT into a simple LSTM based model without specifying tasks. |
| Outcome: | The proposed model outperforms other distillation methods and larger models on multiple NLP tasks with efficiency well-improved. |
Copied to clipboard
| Challenge: | Semantic Textual Similarity (STS) is a key indicator of the encoding capabilities of embedding models. |
| Approach: | They propose to use Pearson’s correlation coefficient as a loss function to refine model performance beyond contrastive learning to achieve a Spearman’s ceiling. |
| Outcome: | The proposed method surpasses state-of-the-art strategies with minimal amount of fine-grained annotated samples. |
Copied to clipboard
| Challenge: | stance detection studies focus on evaluating stances within individual instances, hindering progress of conversational stance analysis. |
| Approach: | They propose a multi-turn conversation stance detection dataset that encompasses multiple targets for conversational stance detector. |
| Outcome: | The proposed dataset encompasses multiple targets for conversational stance detection. |
Copied to clipboard
| Challenge: | under the pandemic of COVID-19, people experiencing COVI D19-related symptoms have a pressing need to consult doctors. |
| Approach: | They develop a medical dialog system that can provide COVID19-related consultations . they use two dialog datasets containing conversations between doctors and patients . |
| Outcome: | The proposed system can provide COVID19-related consultations, but is too small compared with general-domain dialog datasets. |
Copied to clipboard
| Challenge: | Text-to-SQL parsers must be generalizable and robust against input perturbations. |
| Approach: | They propose a novel framework to learn text-to-SQL parsing in stages to improve parser's ability to acquire general SQL knowledge instead of capturing spurious patterns. |
| Outcome: | The proposed framework achieves state-of-the-art performance on the Spider, SParC, and CoSQL datasets. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) models are constrained by a pre-defined label set and require extensive human annotations, which limits their flexibility and adaptability to unseen tasks. |
| Approach: | They propose a Generative NER system that shows improved zero-shot performance across unseen entity domains by introducing contextual information and delineating label boundaries. |
| Outcome: | The proposed model outperforms state-of-the-art methods in zero-shot evaluation. |
Copied to clipboard
| Challenge: | Decentralized LLM training leverages dispersed resources at varying scales. |
| Approach: | They propose a resource-driven paradigm that leverages dispersed resources across clusters, datacenters and even regions. |
| Outcome: | The proposed model scales are 175 billion to 660 billion parameters, and the exponential growth in computational requirements poses significant challenges. |
Copied to clipboard
| Challenge: | ChatGPT and GPT-4 are commercial large language models (LLMs) however, they may produce vague responses or incorrect answers in certain specialized domains. |
| Approach: | They propose a token compression scheme that uses summarization and semantic compression to reduce the token size of LLMs. |
| Outcome: | The proposed method reduces token size by doing summarization and semantic compression while reducing token size with only 1.6% accuracy drop. |
Copied to clipboard
| Challenge: | In this paper, we introduce FITAnnotator, a generic web-based tool for efficient text annotation. |
| Approach: | They propose a generic web-based tool for efficient text annotation. |
| Outcome: | The proposed tool is based on a fully modular architecture and provides three kinds of interfaces to annotate instances, evaluate annotation quality and manage the annotation task for annotators, reviewers and managers. |
Copied to clipboard
| Challenge: | Existing noise learning methods for text classification are underdeveloped . authors propose a noise learning benchmark for text classification . |
| Approach: | They propose to use four state-of-the-art methods of noise learning from the image domain to classify text. |
| Outcome: | The proposed benchmark of noise learning for text classification is based on four methods and five noise modes. |
Copied to clipboard
| Challenge: | In the real world, product attribute values are incomplete and vary over time, which hinders practical applications. |
| Approach: | They propose a multimodal method to jointly predict product attributes and extract values from product images using multimodal product information. |
| Outcome: | The proposed method can predict product attributes and extract values from product images with the help of product images. |
Copied to clipboard
| Challenge: | Pre-trained Chinese language models take character as the basic unit and learn representation according to character’s external contexts, ignoring the semantics expressed in the word, which is the smallest meaningful utterance in Chinese. |
| Approach: | They propose to pool character-level attention to the word level and propose to alleviate the potential issue of segmentation error propagation by multi-source information fusion. |
| Outcome: | The proposed approach improves on five Chinese NLP benchmark tasks against BERT, ERNIE and BERT-wwm. |
Copied to clipboard
| Challenge: | Existing methods focus on extracting relations from single sentence . document-level relation extraction requires a comprehension of the whole document . |
| Approach: | They propose a graph-based model with Dual-tier Heterogeneous Graph (DHG) for document-level relation extraction. |
| Outcome: | The proposed model achieves state-of-the-art performance on two widely used datasets. |
Copied to clipboard
| Challenge: | Graph Neural Networks (GNNs) with CLIP pipeline are difficult because of the scarcity of labeled data and text supervision, different levels of downstream tasks, and conceptual gaps between domains. |
| Approach: | They propose a multi-modal prompt learning paradigm to adapt pre-trained GNNs to downstream tasks with weak text supervision. |
| Outcome: | The proposed model can generalize graphs to unseen classes with weak text supervision. |
Copied to clipboard
| Challenge: | Existing graph-based encoders for text-to-SQL do not model the syntax of natural language questions. |
| Approach: | They propose to inject Syntax to question-Schema graph encoder for text-to-SQL parsers and employ the decoupling constraint to induce diverse relational edge embedding. |
| Outcome: | The proposed approach outperforms all existing methods when pre-training models are used, resulting in a performance ranks first on the Spider leaderboard. |
Copied to clipboard
| Challenge: | Recent studies show that explicitly modeling the input graph structure can significantly improve the performance. |
| Approach: | They propose a structure-aware cross-attention mechanism to re-encode the graph representation conditioning on the newly generated context at each decoding step. |
| Outcome: | The proposed model improves performance on two graph-to-text datasets with only minor increase on computational cost. |
Copied to clipboard
| Challenge: | Existing methods for abstractive summarization use encoder-decoder attention, but this leads to incomplete copying. |
| Approach: | They propose a copying scheme that takes advantage of prior copying distributions and explicitly encourages the model to copy the input word that is relevant to the previously copied one. |
| Outcome: | The proposed scheme achieves state-of-the-art on summarization benchmarks . it takes advantage of prior copying distributions and explicitly encourages copying . |
Copied to clipboard
| Challenge: | Existing state space models (SSMs) address non-uniform sampling, but their recursive structures impede efficient SSM computation via convolution. |
| Approach: | They propose a plug-and-play mechanism to solve the Non-Stable State problem by adjusting input sequences with early memories. |
| Outcome: | The proposed method overcomes the non-uniform sample processing problem . it can achieve Sampling Step Adaptation (SSA) by adjusting input sequences with early memories. |
Copied to clipboard
| Challenge: | Existing prompting methods for Large Language Models (LLMs) suffer from excessive token usage and limited generalisability across diverse reasoning tasks. |
| Approach: | They propose an Adaptive Causal Prompting with Sketch-of-Thought framework that leverages structural causal models to infer the causal effect of a query on its answer. |
| Outcome: | The proposed framework outperforms existing prompting baselines in terms of accuracy, robustness, and computational efficiency. |
Copied to clipboard
| Challenge: | a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented. |
| Approach: | They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs). |
| Outcome: | The proposed library is based on extensive experiments in a variety of evaluation settings. |
Copied to clipboard
| Challenge: | Recent research has demonstrated that Large Language Models (LLMs) can enhance their capabilities by utilizing external tools. |
| Approach: | They propose a runnable evaluation system consisting of 73 API tools and an annotation system for 314 tool-use dialogues with 753 API calls. |
| Outcome: | The proposed benchmark assesses the effectiveness of existing LLMs by analyzing 314 tool-use dialogues with 753 API calls. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated impressive performance in various natural language processing tasks. |
| Approach: | They propose a benchmark for the evaluation of large language models in the IP domain . they also propose supervised multilingual large language model called MoZi . |
| Outcome: | The proposed model outperforms four well-known LLMs on the MoZIP benchmark . the most powerful ChatGPT does not reach the passing level . |
Copied to clipboard
| Challenge: | Existing studies of stance detection focus on learning stance information about specific targets from context, but in real-world scenarios, we usually have a certain understanding of a target when we express our stance on it. |
| Approach: | They propose to take the background knowledge of the target into account for better stance detection by categorizing it into episodic and discourse knowledge categories and a heuristic retrieval algorithm based on the topic to retrieve the Wikipedia documents relevant to the sample. |
| Outcome: | The proposed framework achieves state-of-the-art on four benchmark datasets showing that the proposed framework is able to detect stances in-target and zero-shot scenarios. |
Copied to clipboard
| Challenge: | Existing preference-based methods for medical large vision-Language Models face limitations in medical settings . existing methods are limited by overfitting to superficial cues and pseudo convergence of the preference signal. |
| Approach: | They propose a framework that enables evidence-aware and adaptive preference learning for Med-LVLMs. |
| Outcome: | The proposed framework improves evidence-aware and adaptive preference learning for Med-LVLMs. |
Copied to clipboard
| Challenge: | Existing approaches to mitigate knowledge conflict by comparing two knowledge sources can overwhelm LLMs with extraneous or lengthy contexts. |
| Approach: | They propose a framework that decomposes knowledge into fine-grained comparisons . they propose 'Micro-Act' framework that allows for reasoning beyond the superficial context . |
| Outcome: | The proposed framework achieves significant increase in QA accuracy over state-of-the-art baselines on five benchmark datasets. |
Copied to clipboard
| Challenge: | Existing methods for extracting structured data from unstructured texts neglect unique features of the biomedical literature, such as ambiguous entities and nested proper nouns. |
| Approach: | They propose a model that leverages sentence-level relation classification before entity extraction to tackle entity ambiguity. |
| Outcome: | The proposed model outperforms baselines in both NER and RE tasks and has competitive performance compared to the state-of-the-art fine-tuned baselines for RE. |
Copied to clipboard
| Challenge: | SALAD-Bench is a safety benchmark specifically designed for LLMs . it provides a robust source for evaluating both attack and defense algorithms . |
| Approach: | They propose a hierarchical safety benchmark specifically designed for LLMs . it uses a taxonomy of questions spanning three levels and a robust taxonomies based on a QA pair . |
| Outcome: | The proposed safety benchmark shows that LLMs are resilient against emerging threats and the effectiveness of contemporary defense methods. |
Copied to clipboard
| Challenge: | Extensive research has highlighted the importance of data complexity as a crucial metric, but the impact of complexity remains relatively unexplored. |
| Approach: | They propose to add a specified number of nodes to instructions’ semantic trees to enhance the instruction complexity in a controllable manner. |
| Outcome: | The proposed approach outperforms diverse yet complex instructions under the same token budget and can control the difficulty level of modified instructions. |
Copied to clipboard
| Challenge: | Existing methods for stance detection are struggling to cope with the data across targets. |
| Approach: | They propose a model that uses external knowledge as a bridge to enable knowledge transfer across different targets. |
| Outcome: | The proposed model outperforms existing methods on a large real-world dataset. |
Copied to clipboard
| Challenge: | Existing joint models only use training procedure to determine the implicit correlation between intents and slots. |
| Approach: | They propose to make full use of the statistical co-occurrence frequency between intents and slots as prior knowledge to enhance joint multiple intent detection and slot filling. |
| Outcome: | The proposed model outperforms state-of-the-art models on two public multi-intent datasets. |
Copied to clipboard
| Challenge: | Existing alignment methods fail to adapt to the diversity of preferences and regulatory standards. |
| Approach: | They propose a method for prioritizing rules over user instructions to minimize misalignments in Large Language Models. |
| Outcome: | The proposed approach minimizes misalignments and adapts smoothly to various unseen rules, ensuring they are shielded from hijacking and that the model responds appropriately. |