Papers by Yuan Wu
Copied to clipboard
| Challenge: | Existing data selection techniques are designed for small data pools, a study finds . filtering data by token length is an efficient method for improving results . |
| Approach: | They use self-scoring methods that do not rely on external help to perform fine-tuning . they also find that filtering data by token length offers a stable and efficient method . |
| Outcome: | The proposed methods outperform random selection on large datasets on large data pools. |
Copied to clipboard
| Challenge: | PropGenie is a multi-agent framework based on large language models (LLMs) it provides comprehensive real estate assistance in real-world scenarios . |
| Approach: | They propose a multi-agent framework based on large language models to deliver comprehensive real estate assistance in real-world scenarios. |
| Outcome: | The proposed framework outperforms a general-purpose LLM and a domain-specific chatbot in real-world scenarios. |
Copied to clipboard
| Challenge: | Out-of-distribution (OOD) detection is a fundamental task vexing real-world applications . fine-tuning based methods require storing fine- tuned models for each scenario . |
| Approach: | They propose an unsupervised prefix-tuning based OOD detection framework called PTO . they propose to take advantage of optional training data labels and targeted OOD data . |
| Outcome: | The proposed framework performs better than existing methods under a wide range of metrics, detection settings, and OOD types. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are transforming healthcare through their ability to understand and assist with medical tasks. |
| Approach: | They analyze system profiles, clinical planning, medical reasoning frameworks, and external capacity enhancement. |
| Outcome: | The findings highlight the future directions in medical reasoning, physical system integration, and training simulations. |
Copied to clipboard
| Challenge: | Existing datasets for human-like dialogue tasks are deficient due to the complexity of human conversations. |
| Approach: | They construct a large-scale Chinese E-commerce conversation corpus with 1 million dialogues, 20 million utterances, and 150 million words. |
| Outcome: | The proposed dataset includes 1 million multi-turn dialogues, 20 million utterances, and 150 million words. |
Copied to clipboard
| Challenge: | Existing top-k attention methods struggle to strike a balance between efficiency and accuracy. |
| Approach: | They propose a top-k attention approach that integrates low-overhead techniques into the Top-k Attention process to achieve 7.2 speedup compared to vanilla full attention. |
| Outcome: | The proposed approach achieves 7.2 speedup compared to current top-k attention methods while maintaining model accuracy. |
Copied to clipboard
| Challenge: | Existing methods encode the triples of entities as embeddings and learn to align the embeddables, which prevents the direct interaction between the original information of the cross-KG entities. |
| Approach: | They propose to transform the triples into unified textual sequences and model the EA task as a bi-directional textual entailment task between the sequences of cross-KG entities. |
| Outcome: | The proposed approach outperforms the state-of-the-art methods on five cross-lingual datasets and allows the mutual enhancement of the heterogeneous information. |
Copied to clipboard
| Challenge: | Extensive experiments on three multi-turn agent task datasets confirm the effectiveness and superiority of the DMPO loss function. |
| Approach: | They propose a novel loss function for multi-turn agent tasks that replaces the policy constraint with the state-action occupancy measure constraint and adds length normalization to the Bradley-Terry model. |
| Outcome: | Experiments on three multi-turn agent task datasets confirm the effectiveness and superiority of the proposed loss function. |
Copied to clipboard
| Challenge: | Adaptive group-wise gradient clipping (AGGC) is a new approach to stabilize training of Large Language Models. |
| Approach: | They propose a method to stabilize gradient clipping by partitioning parameters into groups based on functional types and a time-dependent scheduling mechanism to balance exploration and convergence. |
| Outcome: | The proposed algorithm outperforms standard LoRA and achieves 72.93% accuracy . it can be integrated into existing pipelines with negligible overhead. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks focus on isolated question-answering tasks that may not capture the essential aspects of strategic reasoning. |
| Approach: | They evaluate 13 large language models across over 800 games in chess . they use a chessian-based framework to test strategic reasoning and pattern recognition . |
| Outcome: | The proposed framework improves performance and basic understanding of large language models. |
Copied to clipboard
| Challenge: | Existing studies have indicated that major life events can greatly impact individuals’ mental health, but shedding its light on social media data is challenging due to the complexity and ambiguity nature of life events. |
| Approach: | They propose to extract life events mentioned in posts on social media to uncover a social media event dataset which includes 12 major life event categories that are likely to occur in everyday life. |
| Outcome: | The proposed dataset includes 12 life event categories that are likely to occur in everyday life and is human-annotated under iterative procedure and boasts a high level of quality. |
Copied to clipboard
| Challenge: | Existing models of robustness evaluation are incomprehensive, impractical, and invalid . |
| Approach: | They propose a framework for automatic robustness evaluation that shifts towards model-centric evaluation to further exploit the advantages of adversarial attacks. |
| Outcome: | The proposed framework is based on a model-centric evaluation protocol and a robustness evaluation protocol. |
Copied to clipboard
| Challenge: | Music information retrieval (MIR) is a field that aims at developing computational tools for processing, organizing, and accessing music data. |
| Approach: | They propose a framework that aligns music modalities with multilingual text in a shared representation space. |
| Outcome: | Experiments show CLaMP 3 performs state-of-the-art on multiple MIR tasks . it surpasses baselines and shows excellent generalization in multimodal and multilingual contexts . |
Copied to clipboard
| Challenge: | Existing studies focus on identifying entities' relations from the semantics of dialogues-they utilize either the attention mechanism or a refined token graph to locate informative words. |
| Approach: | They propose a sequential structure prediction task to incrementally parse SocAoG for dynamic inference upon any incoming utterance. |
| Outcome: | Empirical results show that the proposed model infers social relations more accurately than the state-of-the-art methods. |
Copied to clipboard
| Challenge: | Recent methods to discover evidence for explainable claim verification are nontransparent and unexplained. |
| Approach: | They propose a Decision Tree-based Co-Attention model to discover evidence for explainable claim verification using neural networks. |
| Outcome: | The proposed model boosts the F1-score by more than 3.11%, 2.41% on two public datasets. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been recognized for their impressive capabilities in natural language processing (NLP). |
| Approach: | They propose a method to enhance the multilingual performance of Large Language Models by aggregating knowledge from diverse languages. |
| Outcome: | The proposed method reduces the performance disparity across languages and offers valuable insights for further exploration. |
Copied to clipboard
| Challenge: | Sub-Slot based task-oriented dialogs provide slot values segment by segment over multiple turns. |
| Approach: | They define a task called Sub-Slot based Task-Oriented Dialog (SSTOD) they build a Chinese dialog dataset SSD for boosting research on SSTOD. |
| Outcome: | The proposed task is called Sub-Slot based Task-Oriented Dialog (SSTOD) it includes 40K dialogs and 500K utterances from Chinese names, phone numbers, ID numbers and license plate numbers . the dataset is well annotated with sub-slot values, slot values, dialog states and actions . |
Copied to clipboard
| Challenge: | Existing interpretation methods only support tasks with specific inputs, limiting their practical applications. |
| Approach: | They propose an extensible module that matches different input data with interpretation methods and consolidates the interpreting outputs. |
| Outcome: | The proposed module can match different input data with interpretation methods and consolidate the interpreting outputs. |
Copied to clipboard
| Challenge: | Existing approaches for personalizing large language models require modifying parameters. |
| Approach: | They propose a lightweight approach to personalizing large language models via retrieval augmentation . relevance serves as an unreliable proxy for utility, they argue . |
| Outcome: | The proposed framework outperforms strong heuristic and retrieval-augmented baselines on nine personalization tasks. |
Copied to clipboard
| Challenge: | Existing multilingual understanding models are not capable of generating high-quality text compared with decoder-based causal language models. |
| Approach: | They propose a method to adapt a multilingual encoder to a language generator with a small number of additional parameters. |
| Outcome: | The proposed approach outperforms initialization-based methods with 9.4 BLEU on machine translation, 8.1 Rouge-L on question generation, and 5.5 METEOR on story generation. |
Copied to clipboard
| Challenge: | Current methods for conversational understanding rely on static ontologies, limiting their ability to handle new and unforeseen user needs. |
| Approach: | They propose to review the state-of-the-art techniques in OnExp for conversational understanding and highlight emerging frontiers . they categorize existing literature into three main areas: (1) New Intent Discovery, (2) New Slot-Value Discovery, and (3) Joint OnExp. |
| Outcome: | The proposed methods highlight several emerging frontiers in OnExp to improve agent performance in real-world scenarios and discuss their corresponding challenges. |
Copied to clipboard
| Challenge: | achieving data-efficient post-training of Large Language Models is a key research question. |
| Approach: | They propose a taxonomy of data-efficient LLM post-training methods from a data-centric perspective. |
| Outcome: | The proposed methods cover data selection, data quality enhancement, synthetic data generation, data distillation and compression, and self-evolving data ecosystems. |
Copied to clipboard
| Challenge: | Natural language to SQL (NL2SQL) is an intuitive interface for querying structured data . but real user questions are noisy, ambiguous, and weakly grounded to database semantics. |
| Approach: | They propose an agentic feedback-driven NL2SQL framework that bridges natural language and SQL via Gold Query. |
| Outcome: | The proposed framework outperforms strong prompting and agentic baselines on spider, BIRD, and three robustness variants on NL2SQL. |
Copied to clipboard
| Challenge: | Large vision-language models have demonstrated strong capabilities in open-world visual understanding, but it is not clear how they address demographic biases in real life. |
| Approach: | They propose a method to assess visual fairness in LVLMs by question-answering/classification tasks. |
| Outcome: | The proposed approach improves transparency and offers a scalable solution for fairness mitigation. |
Copied to clipboard
| Challenge: | Existing methods for improving large language models have focused on improving model responses rather than judgment capabilities, resulting in rapid saturation during iterative training. |
| Approach: | They propose an iterative Meta-Rewarding step where the model judges its own judgements and uses that feedback to refine its judgment skills. |
| Outcome: | The proposed model improves Llama-3-8B-Instruct from 22.9% to 39.4% on AlpacaEval 2 and 20.6% to 29.1% on Arena-Hard. |
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 self-supervised methods in natural language processing rely on augmentation rules to generate contrastive samples. |
| Approach: | They propose a hierarchy-aware information lossless contrastive learning scheme that uses syntactic information reserved in the input sample and fused during the learning process. |
| Outcome: | The proposed learning scheme is superior to existing methods in hierarchical text classification . the proposed learning system is based on a structure encoder and a text encoder . |
Copied to clipboard
| Challenge: | Jailbreak attacks exploit vulnerabilities in large language models to induce undesirable behavior . existing defenses cannot dynamically adjust representations based on harmfulness of queries . |
| Approach: | They propose a representation-aware representation method that shields LLMs from jailbreak attacks . SafeInt relocates jailbreak-related representations into the rejection region . |
| Outcome: | The proposed method outperforms baseline defenses while maintaining utility . it relocates jailbreak-related representations into the rejection region . |
Copied to clipboard
| Challenge: | Existing supervised fine-tuning methods struggle to generalize across document types, leading to poor performance. |
| Approach: | They propose layoutRL, a reinforcement learning framework that optimizes layout understanding through composite rewards integrating normalized edit distance, paragraph count accuracy, and reading order preservation. |
| Outcome: | The proposed model outperforms specialized document parsing systems and general-purpose vision-language models on a broad range of document types, languages, and structural complexities. |
Copied to clipboard
| Challenge: | Cross-modal retrieval is essential for interpreting cultural heritage data, but its effectiveness is limited by incomplete or inconsistent textual descriptions. |
| Approach: | They propose a data augmentation framework that enhances cross-modal retrieval performance by improving the completeness and consistency of LLM-generated descriptions. |
| Outcome: | The proposed framework improves cross-modal retrieval performance by improving completeness and consistency of LLM-generated descriptions. |
Copied to clipboard
| Challenge: | Large language model agents have enabled GUI-based automation, but their deployment is limited by noisy data, poor generalization, and lack of support for non-English GUIs. |
| Approach: | They propose an 8B-parameter GUI agent built for robust and efficient on-device GUI interaction. |
| Outcome: | The proposed GUI agent achieves promising performance on five public benchmarks and proposed Chinese benchmark CAGUI. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been significantly improved by instruction fine-tuning, but still lack transparency and the ability to utilize up-to-date knowledge and information. |
| Approach: | They propose a search-augmented instruction learning model which grounds the language generation and instruction following abilities on complex search results generated by in-house and external search engines. |
| Outcome: | The proposed model outperforms plain LLMs on zero-shot language tasks and can generate both natural and programming languages following natural language guidance and requests. |
Copied to clipboard
| Challenge: | Large Language Models struggle to adapt content to users with differing cognitive capacities, leading to cognitive misalignment. |
| Approach: | They propose a cognitive-level alignment framework that aligns both knowledge complexity and presentation style with user cognition. |
| Outcome: | The proposed framework aligns knowledge complexity and presentation style with user cognition. |
Copied to clipboard
| Challenge: | Efficient data selection is crucial to accelerate the pretraining of language models . limited research has addressed the inherent conflicts between data selection methods . |
| Approach: | They propose a multi-actor collaborative data selection mechanism that prioritizes data based on its specific criterion and updates prioritization rules using the current state of the model. |
| Outcome: | The proposed model accelerates convergence in LM pretraining and achieves an average relative performance gain of 10.5% across multiple language model benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for multimodal entity linking rely on textual context for disambiguation . textual contextual information alone fails to resolve ambiguity, leading to unreliable disambiguations in weak contexts. |
| Approach: | They propose a two-stage multimodal entity linking framework called ThinkLinker . they propose fusion mechanism to model joint dependencies among features . |
| Outcome: | The proposed framework outperforms state-of-the-art models on public benchmark datasets. |
Copied to clipboard
| Challenge: | Existing approaches for heterophilic graphs overlook rich textual data associated with nodes, which could unlock deeper insights into their heterophilistic contexts. |
| Approach: | They propose a two-stage framework to enhance node classification on heterophilic graphs by leveraging open-world knowledge encoded by large language models. |
| Outcome: | The proposed framework can be used to better characterize heterophilic graphs, where neighboring nodes often exhibit different labels. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown significant potential in assisting peer review, but current methods struggle to generate thorough and insightful reviews while maintaining efficiency. |
| Approach: | They propose a framework that models paper review as a hierarchical and bidirectional question-answering process. |
| Outcome: | The proposed framework outperforms baselines on full review generation and actionable feedback comments generation tasks while reducing LLM token usage by up to 80% compared to computationally intensive approaches. |
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: | Large Language Models (LLMs) based agents suffer from brittle procedural memory that is manually engineered or entangled in static parameters. |
| Approach: | They propose a procedural-memory repository that distills past agent trajectories into fine-grained, step-by-step instructions and higher-level, script-like abstractions. |
| Outcome: | The proposed repository can be used to improve agents' performance on travelplanner and Alfworld. |
Copied to clipboard
| Challenge: | OpenAI introduces deliberative alignment (DA) to enhance safety of its o-series models, but effectiveness of this approach in open-source LLMs is understudied. |
| Approach: | They propose a case-augmented deliberative alignment method for large language models . they propose to use reinforcement learning on self-generated safety reasoning chains . |
| Outcome: | The proposed method avoids narrowly enumerated rules and allows broader adaptability. |
Copied to clipboard
| Challenge: | Using Sequence-to-Sequence models for dialogue state tracking remains an understudied topic. |
| Approach: | They propose to use a pre-training objective and a dialogue context representation to investigate this problem. |
| Outcome: | The proposed model is more effective than auto-regressive language modeling, the authors show . the proposed model may have a hard time recovering from earlier mistakes, they say . |
Copied to clipboard
| Challenge: | Existing methods for rumor detection on social media focus on static graphs, ignoring dynamic and incremental propagation . rumour detection on the social media platform is crucial to mitigating harmful effects of rumors. |
| Approach: | They propose a sliding window and memory-augmented attention model for rumor detection . they use a dynamic propagation graph and memory to capture the long-term dependency . |
| Outcome: | The proposed model is compared with the state-of-the-art models on two public datasets. |
Copied to clipboard
| Challenge: | Existing methods for offsite-tuning of large language models require high computational costs and lack theoretical analysis. |
| Approach: | They propose an offsite-tuning approach that selectively applies compression techniques such as rank compression and channel pruning to preserve the gradients of fine-tuned adapters while ensuring privacy. |
| Outcome: | The proposed method surpasses existing OT methods in privacy protection and model performance. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown great potential to enhance Natural Language Processing (NLP) models in areas such as predictive accuracy, fairness, robustness, and explainability. |
| Approach: | They evaluate or improve generative Large Language Models from a causal perspective in areas such as reasoning capacity, fairness and safety issues, explainability, and handling multimodality. |
| Outcome: | The proposed models can be used to perform causal relationship discovery and causal effect estimation tasks. |
Copied to clipboard
| Challenge: | Existing NMT models are shallow in comparison to convolutional models used for both text and vision tasks. |
| Approach: | They propose to modify the attention mechanism to ease the optimization of deeper models by a simple modification to the seq2seq with attention paradigm. |
| Outcome: | The proposed model achieves consistent gains of 0.7-1.1 BLEU on the benchmark WMT’14 English-German and WMT'15 Czech-English tasks. |
Copied to clipboard
| Challenge: | Existing datasets and benchmarks focus only on patents or cover limited aspects of the IP field, lacking alignment with real-world scenarios. |
| Approach: | They propose a bilingual IP task taxonomy and a large-scale bilingual benchmark to evaluate LLMs in real-world IP practice. |
| Outcome: | The proposed model achieves only 75.8% accuracy, indicating room for improvement . open-source IP and law-oriented models lag behind closed-source general-purpose models . |
Copied to clipboard
| Challenge: | Current music information retrieval systems struggle to meet linguistic diversity challenges . current systems struggle with text queries in non-English languages . |
| Approach: | They propose a music information retrieval system that supports both ABC notation and MIDI . CLaMP 2 includes a multilingual text encoder and a multiple-modal music encoder . |
| Outcome: | The proposed system achieves state-of-the-art results in multilingual semantic search and music classification across modalities. |
Copied to clipboard
| Challenge: | Existing evaluation benchmarks focus on fine-grained constraint satisfaction and domain-specific capability assessment, yet overlook the crucial structural dependencies between dialogue turns that distinguish multi-turn from single-turn interactions. |
| Approach: | They propose a multi-turn instruction following benchmark with structural flow modeling that defines an innovative structural flow framework with six fundamental inter-turn relationships. |
| Outcome: | The proposed model is based on a framework with six fundamental inter-turn relationships and is able to analyze and generate specific dialogue flows tailored to specific scenarios. |
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: | Existing benchmarks focus on narrow tasks and leave a fundamental question unanswered . Existing models only focus on specific tasks, requiring rigorous reasoning and knowledge . |
| Approach: | They propose a benchmark to connect theoretical foundations with practical business knowledge and applications. |
| Outcome: | The benchmark systematically evaluates both open-source and commercial LLMs . it reveals how theoretical knowledge translates into practical performance in business . |
Copied to clipboard
| Challenge: | Language Models (LMs) play a pivotal role in extracting structured information from unstructured text. |
| Approach: | They propose to reformulate the task to be entity-centric, enabling the use of diverse metrics that can provide more insights from various perspectives. |
| Outcome: | The proposed model outperforms baselines and human evaluations on the extracted entities. |
Copied to clipboard
| Challenge: | Recent studies have focused on integrating protein-related knowledge into large language models through continued pretraining and multi-modal alignment. |
| Approach: | They propose a retrieval-enhanced method which significantly outperforms fine-tuned LLMs for protein-to-text generation and shows accuracy and efficiency in training-free scenarios. |
| Outcome: | The proposed method significantly outperforms fine-tuned LLMs for protein-to-text generation and shows accuracy and efficiency in training-free scenarios. |
Copied to clipboard
| Challenge: | a framework for model merging is proposed without additional training . task vectors from fine-tuned models exhibit a limited number of dominant singular values . |
| Approach: | They propose a framework for model merging based on low-rank estimation of task vectors without access to the base model. |
| Outcome: | The proposed framework improves models without additional training without additional inputs. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are computationally intensive due to their O(n3) time complexity with Singular Value Decomposition (SVD). |
| Approach: | They propose a metric to quantify the data compression proficiency of large language models and a convex approximation of matrix rank to capture both predictive discriminability and diversity. |
| Outcome: | The proposed model achieves speeds 8 to 24 times faster than Matrix Entropy for the CEREBRAS-GPT model as models increase from 111M to 6.7B . |
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 Large Language Models struggle to reason systematically under cost constraints . Existing approaches lack the knowledge-reasoning capability to reason under cost . |
| Approach: | They propose a knowledge-enhanced framework that leverages large language models to construct MDKGs . they propose three collaborative agents that handle language understanding and generation . |
| Outcome: | GraphDx improves diagnostic success rates from 50–68% to 79–93% while reducing test costs by 20–54%. |
Copied to clipboard
| Challenge: | Recent work has leveraged natural language descriptions of schema elements to enable universal dialogue systems; however, descriptions only indirectly convey schema semantics. |
| Approach: | They propose to use schema-guided modeling to prompt seq2seq models with a labeled example dialogue to show schema semantics rather than tell them. |
| Outcome: | The proposed model outperforms models using short examples as schema representations on two popular dialogue state tracking benchmarks. |
Copied to clipboard
| Challenge: | a rapid proliferation of large language models (LLMs) generate text that increasingly resembles human writing . this makes it difficult to capture subtle cues that distinguish AI-generated content from human-written content . |
| Approach: | They propose a framework that disentangles AI-detection semantics from generator-aware artifacts by latent encoding and perturbation-based regularization. |
| Outcome: | The proposed framework disentangles AI-detection semantics from generator-aware artifacts on 20 representative LLMs across 7 categories. |
Copied to clipboard
| Challenge: | Existing methods for surfacing symbolic reasoning capabilities are limited to narrow tasks . arithmetic computations are unnatural to perform in pure language space, and hence present difficulties for LLMs. |
| Approach: | They propose a natural language embedded program framework for solving symbolic reasoning tasks. |
| Outcome: | The proposed framework improves on strong baselines across math and symbolic reasoning, text classification, question answering, and instruction following tasks. |
Copied to clipboard
| Challenge: | Existing methods to measure instance difficulty use generalization and threshold-tuning . a new approach to learn to exit is based on hash functions to assign tokens to a fixed exiting layer. |
| Approach: | They propose a Hash-based Early Exiting approach that replaces learn-to-exit modules with hash functions to assign each token to a fixed exiting layer. |
| Outcome: | The proposed approach improves on learning to exit and predicting instance difficulty. |
Copied to clipboard
| Challenge: | Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task. |
| Approach: | They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5. |
| Outcome: | The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers. |
Copied to clipboard
| Challenge: | Existing studies focus on injecting noises into the input sequence, but feasibility of injecting them into the decoding sequence remains an open question. |
| Approach: | They propose a pre-training paradigm that integrates knowledge-enhanced decoding with noises in the prefix to strengthen the representation learning of entities that span over multiple input tokens. |
| Outcome: | The proposed model achieves state-of-the-art results on two knowledge-driven data-to-text generation tasks with up to 2% BLEU gains. |
Copied to clipboard
| Challenge: | Existing methods to extract relational facts from open domain corpora are time-consuming and human-intensive. |
| Approach: | They propose a framework to learn similarity metrics of relations from labeled data . they propose to transfer relational knowledge to identify novel relations in unlabeled data. |
| Outcome: | Experiments on two real-world datasets show that the proposed framework improves compared with state-of-the-art methods. |
Copied to clipboard
| Challenge: | Critic-free reinforcement learning with verifiable rewards (RLVR) is a practical paradigm for aligning Large Language Models. |
| Approach: | They propose a framework that stabilizes advantage estimation by combining prompt-local on-policy statistics with semantic-cluster-conditioned historical moments. |
| Outcome: | Experiments show that RLVR improves training stability and performance compared to critic-based methods . compared with other approaches, RL VR improves in cold-start regimes with binary verifiers . |
Copied to clipboard
| Challenge: | Existing evaluations of large language models fail to reflect fine-grained capabilities . existing benchmarks are manually curated or domain-generic, limiting scalability and alignment with real use cases. |
| Approach: | They propose a framework that allows custom construction of benchmarks from large-scale scientific data to evaluate application-specific scientific capabilities in LLMs. |
| Outcome: | The proposed framework reveals fine-grained differences in scientific capabilities that standard benchmarks overlook . it allows custom construction of benchmarks from large-scale scientific data to evaluate application-specific capabilities in LLMs. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) show strong performance on English tasks, but their performance in other languages is limited. |
| Approach: | They conducted an exhaustive analysis of the multilingual capability of LLMs by examining the performance gap before and after embedding fine-tuning across 101 languages. |
| Outcome: | The proposed model improves on the attributes of four quadrants in the model and provides actionable and efficient guidelines for tuning these languages. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can simulate non-native-like English use observed in human second language (L2) learners interfered with by their native first language (N1) knowledge. |
| Approach: | They use large language models to simulate non-native-like English use observed in human second language (L2) learners, and then compare their outputs to real L2 learner data. |
| Outcome: | The proposed models replicate L1-dependent patterns observed in human second language (L2) learners, with distinct influences from various languages. |
Copied to clipboard
| Challenge: | Chinese idioms are hard to understand by children and non-native speakers due to their non-compositionality and metaphorical meaning. |
| Approach: | They propose a task to rephrase idiom-containing sentences to non-idiomatic ones under the premise of preserving the original sentence’s meaning. |
| Outcome: | The proposed method has better performance than baselines based on the established dataset. |
Copied to clipboard
| Challenge: | In math reasoning with large language models, fine-tuning data augmentation by query evolution and diverse reasoning paths is empirically verified effective. |
| Approach: | They propose to fine-tune data augmentation by query evolution and diverse reasoning paths. |
| Outcome: | The proposed model achieves new state-of-the-art on GSM8K and MATH. |
Copied to clipboard
| Challenge: | Recent studies have shown that Large Language Models (LLMs) are more efficient in natural language understanding tasks. |
| Approach: | They evaluate large language models (LLMs) using a TREC Fair Ranking dataset . they assess fairness from both user and content perspectives . |
| Outcome: | The proposed model outperforms the existing models in the fair ranking task. |
Copied to clipboard
| Challenge: | Existing methods for visual storytelling suffer from low inference speed and are not well-suited for synthetic scenes. |
| Approach: | They propose a diffusion-based system that generates visual descriptions as a single conditional denoising process. |
| Outcome: | The proposed system improves inter-sentence coherence and image-to-text fidelity. |
Copied to clipboard
| Challenge: | Recent Audio Large Language Models (AudioLLMs) excel at reasoning tasks, but struggle at elementary auditory perception. |
| Approach: | They propose a framework that organizes audio information into three explicit components in a unified JSON format. |
| Outcome: | The proposed framework boosts fine-grained perception by 10.9% on MMSU over state-of-the-art models while preserving robust reasoning capabilities. |
Copied to clipboard
| Challenge: | Existing methods for detecting rumors on social media focus on coarse-grained temporal information and ignore fine-grain temporal dynamics. |
| Approach: | They propose a fine-grained dynamic graph neural network model which incorporates fine-grain temporal information into a unified framework for rumor detection. |
| Outcome: | The proposed model improves on three public real-world datasets. |
Copied to clipboard
| Challenge: | Existing measurement scales require extensive manual labor and require extensive validation and validation. |
| Approach: | They propose a multi-agent framework that automates scale development by leveraging collaborative AI agents. |
| Outcome: | The proposed framework automates scale development while maintaining rigorous quality standards. |
Copied to clipboard
| Challenge: | Current approaches to news writing rely on superficially retrieved information and oversimplified knowledge enumeration resulting in shallow, repetitive, and unordered outputs. |
| Approach: | They propose an LLM-based multi-agent controllable news writing framework called CtrlNews . they propose a fine-grained viewpoint control mechanism to regulate bias, emotion, and exaggeration attributes. |
| Outcome: | The proposed framework simulates expert questioning through automated role assignment and question generation followed by a three-layer hierarchical gravitational graph iteratively refined via expansion-reflection cycles. |
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 approaches to Knowledge Graph Question Answering (KGQA) use Retrieval-Augmented Generation (RAG) but subgraph selection process is non-differentiable, preventing end-to-end training of the retriever and the generator. |
| Approach: | They propose a Differentiable RAG approach that optimizes the retriever and the generator for KGQA. |
| Outcome: | The proposed approach outperforms state-of-the-art approaches on WebQSP and CWQ. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have limitations when it comes to comprehending and expressing world knowledge that extends beyond the boundaries of natural language. |
| Approach: | They propose a model that integrates symbolic data into LLM training without loss of generality ability. |
| Outcome: | The proposed model performs better on symbol- and NL-centric tasks. |
Copied to clipboard
| Challenge: | Existing studies constructing direct interactions between the claim and each single user response to capture evidence have shown remarkable success in interpretable claim verification. |
| Approach: | They propose a Dual-view model based on the views of Collective and Individual Cognition (CICD) that captures word-level semantics based . on individual cognition, they adjust the proportion between them to generate global evidence. |
| Outcome: | The proposed model is based on the views of collective and individual cognition and achieves state-of-the-art performance on three benchmark datasets. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) adapts large language models by training only a small fraction of parameters, but as the rank of the low-rank matrices increases, LoRA exhibits an unstable “double descent” phenomenon, which delays convergence and impairs generalization by causing instability due to the attraction to sharp local minima. |
| Approach: | They propose a framework that incorporates Momentum-Guided Perturbation Optimization (MGPO) MGPO stabilizes training dynamics by mitigating double descent phenomenon and guiding weight perturbations using momentum vectors from the optimizer’s state. |
| Outcome: | The proposed framework improves performance on natural language understanding benchmarks and shows that it improves convergence and generalization. |
Copied to clipboard
| Challenge: | Prior work has focused on the ability of Large Language Models to **identify** or **classify** fallacies, but their robustness against these fallacias in persuasive contexts remains largely unexplored. |
| Approach: | They propose a new metric to assess LLM robustness against fallacies by pairing factual questions with fallacious arguments and developing a multi-round debate framework to assess model resilience. |
| Outcome: | The proposed metric disentangles robustness from a model’s knowledge limitations and demonstrates unique vulnerability profiles across models. |
Copied to clipboard
| Challenge: | Existing general-domain benchmarks do not capture complexity of real-world judicial cognition and decision-making. |
| Approach: | They propose a benchmark specifically designed to evaluate LLM Agents in the legal domain. |
| Outcome: | The proposed benchmark includes 17 corpora from real-world legal scenarios and provides 37 tools for interacting with external knowledge. |
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 studies on the effectiveness of the Retentive Networks have not yet been conducted. |
| Approach: | They propose a retention mechanism that integrates the inductive bias of recurrent neural networks with the parallelizable training advantages of attention-based models. |
| Outcome: | The proposed retention mechanism combines the inductive bias of recurrent neural networks with the parallelizable training advantages of attention-based models. |
Copied to clipboard
| Challenge: | Existing prompt engineering techniques are limited to producing single flow instructions, struggling with handling diverse patterns. |
| Approach: | They propose an automatic prompt optimization method that iteratively develops a multi-branched prompt using failure cases as feedback. |
| Outcome: | The proposed method achieves the best results across five tasks and demonstrates significant optimization efficiency due to adoption of a minimal search strategy. |
Copied to clipboard
| Challenge: | Long-context Multimodal Large Language Models (MLLMs) require substantial computational resources for inference . the growth of their multimodal Key-Value (KV) cache challenges memory and time efficiency. |
| Approach: | They propose a fine-tuning-free approach that efficiently reduces the multimodal KV cache size while maintaining performance comparable to a full cache. |
| Outcome: | The proposed method reduces the multimodal KV cache size while maintaining performance comparable to a full cache. |
Copied to clipboard
| Challenge: | Existing studies on K-LLMs systems focus on declarative knowledge and procedural knowledge (rules) . |
| Approach: | They propose to build a toolkit that supports comprehensive heterogeneous knowledge collaborative enhancement for Large Language Models (LLMs). |
| Outcome: | The proposed toolkit provides unified knowledge integration and joint knowledge retrieval methods to achieve more comprehensive heterogeneous knowledge collaborative enhancement. |
Copied to clipboard
| Challenge: | State-of-the-art guard models rely on terminal-layer representations and overlook safety-relevant features encoded across internal layers. |
| Approach: | They propose a lightweight guard model that harnesses safety neurons from LLM internals without modifying the underlying model. |
| Outcome: | The proposed model outperforms open-source guard models across multiple benchmarks while using 250 fewer trainable parameters. |
Copied to clipboard
| Challenge: | Existing VQA models rely on the superficial correlation between question type and frequent answers to make predictions, without really understanding the input. |
| Approach: | They propose a training framework that explicitly encourages the VQA model to distinguish between superficially similar instances. |
| Outcome: | The proposed framework achieves state-of-the-art performance on VQA-CP v2 . it explicitly encourages the model to distinguish between the superficially similar instances . |
Copied to clipboard
| Challenge: | Existing taxonomies are unable to maintain coverage due to the rising of new concepts . TEMP uses pre-trained contextual encoders to predict the position of new ideas . |
| Approach: | They propose a self-supervised taxonomy expansion method that ranks taxonomies by ranking them . they use pre-trained contextual encoders to train the model with dynamic margin loss . |
| Outcome: | The proposed method outperforms state-of-the-art taxonomy expansion methods by 14.3% and 15.8% on public benchmarks. |
Copied to clipboard
| Challenge: | Existing Chinese preference datasets suffer from limited scale, restricted domain coverage, and insufficiently rigorous data validation. |
| Approach: | They propose an LLM-based data annotation pipeline with no human intervention to annotate Chinese preference datasets. |
| Outcome: | The proposed pipeline outperforms existing Chinese preference datasets on AlignBench and Chinese Reward Benchmark. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks focus on superficial text differences and fail to align with human judgment. |
| Approach: | They propose a new method to evaluate the performance of Large Language Models (LLMs) by calculating probability discrepancies between original response generation and revised versions of LLMs. |
| Outcome: | The proposed method eliminates the need for training an additional evaluation model or relying on external proprietary models such as GPT-4 as a judger. |
Copied to clipboard
| Challenge: | Existing multilingual NMT approaches do not utilize the abundance of monolingual data, especially in low-resource languages. |
| Approach: | They propose to combine monolingual data with self-supervision to pre-train translation models and fine-tune on small amounts of supervised data. |
| Outcome: | The proposed approach improves translation quality of low-resource languages and zero-shot translation quality. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is a parameter-efficient fine-tuning method for large language models. |
| Approach: | They propose a drop-in extension that reparameterizes a rank-rtot update as a sum of K *static* low-rank experts. |
| Outcome: | Experiments on reasoning and knowledge-intensive benchmarks show consistent gains over matched-budget LoRA. |
Copied to clipboard
| Challenge: | Personalized Federated RAG framework enables efficient collaborative fine-tuning of embedding models . depth-adaptive tieered Embedding (DATE) architecture is tailored for local data and training results of each client. |
| Approach: | a new Personalized Federated RAG framework is proposed for large language models . the framework enables efficient collaborative fine-tuning of embedding models based on common knowledge . |
| Outcome: | a novel Personalized Federated RAG framework is proposed for large language models . the framework enables efficient collaborative fine-tuning of embedding models based on common knowledge . |
Copied to clipboard
| Challenge: | Recent advances in Multimodal Large Language Models (MLLMs) have led to extensive evaluations on Chinese cultural benchmarks. |
| Approach: | They construct a large-scale benchmark comprising 486 images and 22,970 QA pairs to evaluate MLLMs' cultural understanding. |
| Outcome: | The proposed benchmark incorporates three task formats to evaluate MLLMs’ cultural understanding: Question Answering with Text Description, Multi-turn Dialogue, and Question Answers with Choices. |
Copied to clipboard
| Challenge: | Existing studies assess LLMs’ reasoning ability in ideal settings, ignoring their vulnerabilities when faced with flawed premises. |
| Approach: | They propose to evaluate LLMs' ability to proactively identify and articulate errors in input premises. |
| Outcome: | The proposed model enables LLMs to proactively identify and articulate errors in input premises. |
Copied to clipboard
| Challenge: | Existing coreference resolution models suffer from mention proposal. |
| Approach: | They propose a query-based span prediction task that can retrieve mentions left out at the mention proposal stage. |
| Outcome: | The proposed model can retrieve mentions left out at the mention proposal stage and improve generalization capability using existing question answering datasets. |
Copied to clipboard
| Challenge: | Existing approaches to optimize large language models with external tools are limited. |
| Approach: | They propose a dual-path framework for dynamic tool usage in cross-domain complex reasoning . they exploit empirical priors for domain-specific alignment and RL-based multi-step routing . |
| Outcome: | The proposed framework outperforms closed-source models and existing methods on in-distribution and out-of-distortion tasks. |
Copied to clipboard
| Challenge: | a new model for speech processing and reasoning uses curated data instead of text. |
| Approach: | They extend the instruction-tuned Llama-2 model with end-to-end speech processing and reasoning abilities without using any carefully curated paired data. |
| Outcome: | The proposed model outperforms or outperfects existing models on synthesized and recorded speech QA tests. |
Copied to clipboard
| Challenge: | Existing methods focus on graph representation learning, but decoding is a key part of the process. |
| Approach: | They propose an EA Decoding Algorithm via Third-order Tensor Isomorphism (DATTI) they combine two sets of isomorphic equations to enhance the decoding process . |
| Outcome: | The proposed algorithm can deliver significant performance improvements even on the most advanced methods while the extra required time is less than 3 seconds. |
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 task vector-based model merging methods apply uniform coefficients across all parameters, overlooking varying parameter importance both within and across tasks. |
| Approach: | They propose a sensitivity-guided coefficient adjustment method that optimizes existing model merging techniques by operating at both task-specific and cross-task levels. |
| Outcome: | The proposed method outperforms existing model merging techniques on mistral 7B and LLaMA2 7B/13B models and enables them to outperformed specialized models. |
Copied to clipboard
| Challenge: | Modern NLP workflows require different models for generation and embedding tasks. |
| Approach: | They propose a method that transforms an LLM into a Uni-Directional Masked Auto-Encoder. |
| Outcome: | The proposed method achieves state-of-the-art under unsupervised conditions with merely 100 training steps. |
Copied to clipboard
| Challenge: | Existing approaches to training document conversion models with manual annotation are costly and time-consuming, and training student models by distilling outputs from teacher models can significantly limit their performance in real-world applications. |
| Approach: | They propose a fully automated framework for constructing high-quality document extraction datasets and models capable of handling diverse document formats and layouts. |
| Outcome: | The proposed model outperforms existing models and improves on annotated documents. |
Copied to clipboard
| Challenge: | Large Language Models exhibit strong implicit personalization ability, but most approaches treat this behavior as a black box. |
| Approach: | They propose a mechanistic interpretation perspective and propose 'sparse' set of Preference Heads . they compute a Preference Contribution Score for each attention head and compare their predictions . |
| Outcome: | The proposed framework computes a Preference Contribution Score (PCS) for each attention head and measures its causal impact on user aligned outputs. |
Copied to clipboard
| Challenge: | Existing datasets for Chinese instruction tuning are not well-aligned with Chinese users’ interaction patterns. |
| Approach: | They propose to use Chinese instruction tuning datasets to improve instruction fine-tuning for Chinese users. |
| Outcome: | The proposed dataset shows that Chinese models achieve competitive performance in diverse benchmarks. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) demonstrate excellent abilities for understanding visual information, but the hallucination remains a challenging problem. |
| Approach: | They propose a training-free approach to enhance vision attention sinks to facilitate convergence of the image token attention sink within shallow layers. |
| Outcome: | The proposed approach improves the convergence of the image token attention sink within shallow layers and strengthens the layer’s focus on the image itself. |
Copied to clipboard
| Challenge: | Using Large Language Models (LLMs)-based agents can enhance their understanding of environments and tasks. |
| Approach: | They propose a framework that allows agents to synthesize possible scenarios with multi-step action invocation within the action space and perform Monte Carlo Tree Search exploration to refine their action knowledge in the current environment. |
| Outcome: | The proposed framework synthesizes possible scenarios with multi-step action invocation within the action space and performs Monte Carlo Tree Search exploration to refine action knowledge in the current environment. |
Copied to clipboard
| Challenge: | a neuro-symbolic approach allows zero-shot adaptation to unseen tasks and domains . a neural LM keeps track of events that occur during a conversation and a symbolic program implements dialog policy is executed to recommend actions. |
| Approach: | They propose an end-to-end, zero-shot task-oriented dialog system . it is designed to adapt to unseen tasks or domains without prior training . |
| Outcome: | The proposed system can be programmed to adapt to unseen tasks without training . it reduces data collection and training requirements for enabling new TOD 1 16189 tasks . |
Copied to clipboard
| Challenge: | Large language models (LLMs) are highly sensitive to prompts, but most automatic prompt optimization methods assume access to ground-truth references that are costly to obtain. |
| Approach: | They propose a sample-efficient framework for label-free prompt optimization based on pairwise preference feedback from an LLM judge. |
| Outcome: | Experiments on BIG-bench Hard and MS MARCO show that the proposed framework identifies stronger prompts than label-free baselines while offering favorable quality–cost trade-offs. |
Copied to clipboard
| Challenge: | Recent studies have shown that multi-task instruction tuning after pre-training greatly improves the model’s robustness and transfer ability, which is crucial for building a high-quality dialog system. |
| Approach: | They propose to use Task-aware Automatic Prompt generation (TAP) to automatically generate high-quality prompts from 15 dialog-related tasks. |
| Outcome: | The proposed model is robust to input prompts and capable of various dialog-related tasks. |
Copied to clipboard
| Challenge: | Relevance modeling between queries and items is a key component of commercial search engines. |
| Approach: | They propose a framework for continual pre-training of LLMs to enhance domain knowledge . they employ queries and multi-field item to jointly pre-train for enhancing domain knowledge. |
| Outcome: | The proposed model achieves convincing performance compared to strong baselines. |
Copied to clipboard
| Challenge: | Open Domain Multi-Hop Question Answering (ODMHQA) is one of the most challenging tasks in Natural Language Processing (NLP) |
| Approach: | They propose a mechanism that leverages the intrinsic capabilities of Large Language Models to judge whether the generated answers are off-topic. |
| Outcome: | The proposed method reduces the occurrence of off-topic answers by nearly 13%, improving the performance in Exact Match (EM) by nearly 3% compared to the baseline method without the Dr3 mechanism. |
Copied to clipboard
| Challenge: | Recent advances in Large Reasoning Models (LLMs) provide a zero-shot alternative via explicit, long chain-of-thought reasoning. |
| Approach: | They propose a GNN-free approach that reformulates graph tasks as textual reasoning problems solved by LRMs. |
| Outcome: | The proposed approach outperforms state-of-the-art baselines in zero-shot settings, producing interpretable and effective predictions. |
Copied to clipboard
| Challenge: | Large Multimodal Models (LMMs) exhibit impressive cross-modal understanding and reasoning abilities, but many benchmarks suffer from systematic biases. |
| Approach: | They propose a benchmark to avoid Type-I errors by creating one perception question and one knowledge anchor question through a meticulous annotation process. |
| Outcome: | The proposed benchmark avoids Type-I errors while maintaining reliability of MCQ evaluations. |
Copied to clipboard
| Challenge: | Existing approaches to textual robustness evaluation focus on slightly modifying the input data, which maintains the original meaning and results in a different prediction. |
| Approach: | They propose a multilingual robustness evaluation toolkit for NLP that integrates universal text transformations, task-specific transformations and adversarial attack. |
| Outcome: | The toolkit includes universal text transformation, task-specific transformation, adversarial attack, subpopulation, and their combinations to provide comprehensive robustness analyses. |
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: | Low-Rank Adaptation (LoRA) improves performance in multi-task learning by diversifying the head matrices through Multi-Head Dropout and Multi-head Random Initialization. |
| Approach: | They propose a low-rank adaptive approach to fine-tune large language models by approximating weight updates through low-ranked matrices. |
| Outcome: | The proposed approach improves performance in multi-task learning while reducing memory usage and training time. |
Copied to clipboard
| Challenge: | Existing methods for named entity recognition are unsatisfactory for recognizing entities in limited or ambiguous sentence-level contexts. |
| Approach: | They propose a framework to incorporate multi-level contexts for named entity recognition using TagLM as a baseline model and an auxiliary task to mine word-level contextual information. |
| Outcome: | The proposed framework is based on a set of sentence-level contexts and a document-level task to mine word-level contextual information. |
Copied to clipboard
| Challenge: | Parameter-efficient fine-tuning is essential for adapting large language models (LLMs). However, LoRA suffers from slow convergence and some recent LoRA variants, such as PiSSA, rely on Singular Value Decomposition (SVD) for initialization. |
| Approach: | They propose to introduce a small intermediate matrix between the low-rank matrices (A) and (B) and propose NyströmLoRA (NLoRA) which leverages Nyström-based initialization for SLoRA to improve its effectiveness and efficiency. |
| Outcome: | The proposed approach improves on 5 natural language generation tasks and 8 natural language understanding tasks with minimal parameter overhead. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities across a wide spectrum of tasks, but performance and reliability in certain specialized domains still fall short of expectations. |
| Approach: | They propose a unified generalist framework that facilitates seamless integration of multiple expert LLMs. |
| Outcome: | The proposed framework outperforms existing multi-LLM collaboration paradigms across six diverse expert domains. |
Copied to clipboard
| Challenge: | Existing methods for detecting fake news use shared features as complementarity features without selection. |
| Approach: | They propose a sifted multi-task learning method with a selected sharing layer for fake news detection. |
| Outcome: | The proposed method boosts the F1-score by more than 0.87%, 1.31% on two public and widely used competition datasets. |