Papers by Wei Zheng
Copied to clipboard
| Challenge: | Existing studies on hate speech detection have failed to answer this question. |
| Approach: | They propose a dataset for testing the behaviors of automated content moderators against content policies. |
| Outcome: | The proposed dataset includes hateful and non-hateful examples matching the 41 community standards guideline policies of Facebook. |
Copied to clipboard
| Challenge: | Large language models have created significant safety concerns . factuality ability is crucial in determining whether they can be deployed and applied safely and compliantly within specific regions. |
| Approach: | They propose a benchmark to evaluate the factuality of large language models in China . they evaluate the models' ability to provide accurate and reliable information . |
| Outcome: | The proposed benchmark evaluates the factuality abilities of existing LLMs and compares them to LLM abilities. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are currently used to evaluate scientific papers by assigning an absolute score to each paper independently. |
| Approach: | They propose a comparison-native framework for paper evaluation that integrates comparison into both data construction and model learning. |
| Outcome: | The proposed framework achieves an average relative improvement of 21.8% over the strong baseline DeepReview-14B, while exhibiting robust generalization to five previously unseen datasets. |
Copied to clipboard
| Challenge: | Personalized Large Language Models (PLLMs) aim to align outputs with individual user preferences . current methods of fine-tuning a separate module for each user are unscalable . |
| Approach: | They propose a Merge-then-Adapt framework for Personalized Large Language Models . they construct a shared Meta-LoRA bank and propose an Adaptive LoRA Fusion stage . |
| Outcome: | The proposed framework outperforms existing SOTA methods on the LaMP benchmark. |
Copied to clipboard
| Challenge: | Multiple choice questions (MCQs) are crucial for deep thinking and knowledge integration in education. |
| Approach: | They propose a cross-modal options synthesis framework for generating MCQs with visual options. |
| Outcome: | The proposed framework produces a plausible and visually similar answer and distractor . it also includes a discrimination module to identify content suitable for visual options . |
Copied to clipboard
| Challenge: | Existing safety benchmarks fail to provide reliable assessments due to limited risk coverage, insufficient scale and the oversight of complex modality combinations. |
| Approach: | They propose a framework that covers 61 risk categories across four modality interactions to address this gap. |
| Outcome: | The proposed framework covers 61 risk categories across four distinct modality interactions. |
Copied to clipboard
| Challenge: | Recent studies show that supervised fine-tuning (SFT) is a common approach for reasoning in large language models. |
| Approach: | They propose to use supervised fine-tuning (SFT) on chain-of-thought trajectories demonstrations . they find that incorporating negative traxories yields substantial OOD generalization gains . |
| Outcome: | The proposed scheme yields 5.51% OOD gain over positive-only training. |
Copied to clipboard
| Challenge: | Existing methods to gauge model’s uncertainty through self-consistency in responses to the target query are misleading: an LLM may confidently provide an incorrect answer to a target query, yet give a confident and accurate answer to that same query when answering a knowledge-preserving perturbation of the query. |
| Approach: | They propose a method that uses multi-agent interaction to estimate black-box LLMs' uncertainty. |
| Outcome: | The proposed method outperforms existing self-consistency based methods and improves hallucination detection. |
Copied to clipboard
| Challenge: | Existing approaches to replicate AI research are limited by insufficient background knowledge and the limitations of retrieval-augmented generation methods. |
| Approach: | They propose a pluggable, paper-centric knowledge base that integrates code snippets and technical insights extracted from scientific literature into a verifiable, executable representation. |
| Outcome: | The proposed knowledge base shows significant performance gains on paperBench when integrated into three agent frameworks with two different LLMs. |
Copied to clipboard
| Challenge: | Humor enriches our daily lives and appears in many forms, from jokes and cartoons to comedies and viral videos. |
| Approach: | They introduce a video humor understanding benchmark to test their ability to understand humor from visual cues. |
| Outcome: | The proposed video humor understanding benchmark is based on a collection of short videos . it features rich annotations and a study of environmental sound that can enhance humor . |
Copied to clipboard
| Challenge: | Existing approaches to cross-lingual phrase retrieval learn word or sentence representations in word or sentences. |
| Approach: | They propose a cross-lingual phrase retrieval model that extracts phrase representations from unlabeled example sentences. |
| Outcome: | The proposed model outperforms state-of-the-art methods on a large-scale cross-lingual phrase retrieval dataset, showing it can perform in an unseen language pair during training. |
Copied to clipboard
| Challenge: | ELECTRA-style tasks are used to pretrain cross-lingual models for NLP tasks . masked language modeling tasks require massive computation resources, rendering such models quite expensive . |
| Approach: | They propose to use ELECTRA-style tasks to pre-train a cross-lingual language model . they propose to pretrain the model on multilingual and parallel corpora . |
| Outcome: | The proposed model outperforms baseline models on cross-lingual understanding tasks with much less computation cost. |
Copied to clipboard
| Challenge: | Experimental results show that, as the instruction data increases, LoRAMoE can significantly improve the ability to process downstream tasks, while maintaining the world knowledge stored in the LLM. |
| Approach: | They propose a framework that introduces several low-rank adapters and integrates them by using a router network to freeze the backbone model and force a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks. |
| Outcome: | The proposed framework freezes the backbone model and forces a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks, to alleviate world knowledge forgetting. |
Copied to clipboard
| Challenge: | Existing event extraction methods are limited to extract event arguments within the sentence scope. |
| Approach: | They propose a model which generates an entity-based directed acyclic graph to fulfill document-level EE effectively. |
| Outcome: | The proposed model can generate entity-based directed acyclic graph to fulfill document-level EE effectively. |
Copied to clipboard
| Challenge: | Existing frameworks that increase context window do not guarantee robust performance across long input tasks. |
| Approach: | They propose a framework that enables language models to handle extended inputs within limited context windows efficiently. |
| Outcome: | The framework improves performance on long-document question-answering and Needle-in-a-Haystack tasks. |
Copied to clipboard
| Challenge: | a paper focuses on automatically generating the text of an ad to capture user interest for achieving higher click-through rate. |
| Approach: | They propose a CTR-driven advertising text generation approach to generate ad texts based on user reviews. |
| Outcome: | The proposed approach outperforms existing approaches on industrial datasets and on large-scale unpaired reviews. |
Copied to clipboard
| Challenge: | Empirical results show that iterAlign improves truthfulness, helpfulness, harmlessness and honesty, improving the LLM alignment by up to 13.5% in harmlessness. |
| Approach: | They propose a data-driven constitution discovery and self-alignment framework called IterAlign to overcome these drawbacks by leveraging red teaming to uncover weaknesses of an LLM. |
| Outcome: | Empirical results show that iterAlign improves truthfulness, helpfulness, harmlessness and honesty by up to 13.5%. |
Copied to clipboard
| Challenge: | Large language models have mastered syntax-level code generation, but complex algorithmic reasoning remains a challenge. |
| Approach: | They propose a recurrent inductive bias that aligns with the recursive nature of programming logic. |
| Outcome: | The proposed model achieves comparable performance to standard dense models with more parameters. |
Copied to clipboard
| Challenge: | Currently, vision-language models excel in many downstream tasks but struggle with spatial reasoning, which is crucial for navigation and interaction with physical environments. |
| Approach: | They propose a framework that generates synthetic data to provide targeted supervision for VLMs across these basic spatial capabilities. |
| Outcome: | The proposed framework disentangles 2D spatial reasoning into three core components: direction comprehension, distance estimation, and localization. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) excel in various domains but face challenges when applied to data science workflows due to their complex, multi-stage nature. |
| Approach: | They propose a hierarchical graph-based agent that represents complexity and a progressive strategy for step-by-step verification, refinement, and consistent context management. |
| Outcome: | The proposed agent surpasses state-of-the-art baselines on the MATH dataset and performs better on InfiAgent-DABench. |
Copied to clipboard
| Challenge: | Existing approaches to Automated Essay Scoring (AES) treat scoring and feedback as separate components, resulting in fragmentation. |
| Approach: | They propose a psychometrically-aware framework that integrates diagnostic assessment with instructional scaffolding through a shared latent ability representation. |
| Outcome: | The proposed framework integrates diagnostic assessment with instructional scaffolding through a shared latent ability representation. |
Copied to clipboard
| Challenge: | Existing models require a more expressive vocabulary to represent all languages . however, increasing the vocabulary size significantly slows down the pre-training speed . |
| Approach: | They propose an algorithm VoCap to determine the desired vocabulary capacity of each language. |
| Outcome: | The proposed algorithm improves cross-lingual model pre-training while reducing side effects of increasing vocabulary size. |
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: | Recent advances in Vision-Language Models (VLMs) have enabled mobile agents to perceive and interact with real-world mobile environments based on human instructions. |
| Approach: | They propose a vision-language model that actively seeks human confirmation at critical decision points and a model inspired by reinforcement learning. |
| Outcome: | The proposed model achieves an improvement of 46.8% in inquiry success rate and the best overall success rate among existing baselines on InquireBench. |
Copied to clipboard
| Challenge: | Low-rank adaptation and its mixture-of-experts (MOE) methods are highly effective but introduce significant latency in multi-tenant settings due to the LoRA modules and MOE routers added to multiple linear modules. |
| Approach: | They propose a low-rank adaptation variant that considers each LoRA module as an expert and employs a prompt-aware routing mechanism. |
| Outcome: | Extensive analysis on commonsense reasoning tasks and math reasoning tasks show that MiLoRA outperforms strong PEFT baselines with comparable tunable parameter budgets. |
Copied to clipboard
| Challenge: | Existing methods to predict missing facts in knowledge graphs are limited in language alignment . SS-AGA uses seed alignment as an edge type to fuses all KGs as a whole graph . |
| Approach: | They propose a self-supervised adaptive graph alignment method that fuses all KGs as a whole graph by regarding alignment as 'a new edge type' they propose SS-AGA method that uses relation-aware attention weights to capture potential alignment pairs in a new paradigm. |
| Outcome: | The proposed method can predict missing facts in a knowledge graph (KG) but language alignment is scarce and new alignment identification is noisy. |
Copied to clipboard
| Challenge: | Massive Open Online Courses (MOOCs) have experienced a rapid development since 2012 . many MOOC platforms have been launched, including Coursera1 , edX2 , and Udacity3 etc. |
| Approach: | They present a personal knowledge assistant system called MAssistant for MOOC learners . MAsistants has a large-scale concept graph built from open data . it also provides a browser extension which interacts with users during video lectures . |
| Outcome: | The proposed system helps users trace the concepts they have learned in MOOCs, and to build their own concept graphs. |
Copied to clipboard
| Challenge: | Existing approaches to improve contextual faithfulness treat the LLM as a black box, generating responses that are inconsistent with the provided context. |
| Approach: | They propose a framework for faithful RAG that operates in three stages: (i) fine-grained knowledge pruning to filter irrelevant context, (ii) latent conflict probing to identify hard conflicts in the model’s latent space, and (iv) conflict-aware attention to modulate attention heads toward faithful context integration. |
| Outcome: | Experiments show that ProbeRAG significantly improves both accuracy and contextual faithfulness. |
Copied to clipboard
| Challenge: | Recent work has demonstrated the power of large language models in recalling knowledge and reasoning. |
| Approach: | They propose to erase shortcut neurons to mitigate the associated risks . 20% of the failures are attributed to shortcuts, they find . |
| Outcome: | The proposed approach reduces failures in multi-hop knowledge editing caused by shortcuts by 20% . |
Copied to clipboard
| Challenge: | Structured pruning is a feasible solution for end-side LLM deployment . however, achieving a high compression ratio for scaled-up LLMs remains a challenge . |
| Approach: | They propose a task-agnostic structured pruning approach coupled with a compact Transformer architecture to prune LLMs into an intra-module low-rank architecture. |
| Outcome: | The proposed approach reduces transitional activations inside multi-head attention (MHA) and multi-layer perceptron (MLP) modules while preserving inter-module activations sensitive to perturbations. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are promising foundations to build generally-capable agents . however, the community lacks a unified interactive framework that covers diverse environments for comprehensive evaluation of agents. |
| Approach: | They propose a framework that features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction. |
| Outcome: | The proposed framework features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction. |
Copied to clipboard
| Challenge: | Existing approaches to represent knowledge in the low-dimensional space are to leverage large-scale unsupervised text corpus to train fixed or contextual representations. |
| Approach: | They propose to leverage large-scale unsupervised text corpus to train fixed or contextual language representations and to express knowledge into a knowledge graph (KG) they incorporate distributional representations of a KG onto the representations from pre-trained language models, via simply concatenation or multi-head attention. |
| Outcome: | The proposed models outperform the other models on the COIN: COmmonsense INference in Natural Language Processing (COIN) Workshop datasets. |
Copied to clipboard
| Challenge: | Existing models lack cultural alignment across modalities and languages . a new framework to assess cultural awareness across linguistics and languages is needed . |
| Approach: | They propose a framework that integrates tri-modally aligned cultural benchmarks and a five-dimensional evaluation protocol to assess cross-country awareness disparities. |
| Outcome: | The proposed framework assesses cultural awareness disparities across modalities and languages . it is the first dataset aligned at the input level across text, image, and speech . |
Copied to clipboard
| Challenge: | Existing models for large vision language models do not fully reflect their knowledge capacity and reliability, resulting in erroneous outputs that do not align with the image content or provide answers lacking knowledge evidence. |
| Approach: | They propose a Chinese-based benchmark for visual factuality across 8 major topics and 56 subtopics and a multi-hop question construction. |
| Outcome: | The proposed model decouples visual factuality into two parts: seeing the world and discovering knowledge. |
Copied to clipboard
| Challenge: | Sentiment analysis is a key task in e-commerce to detect fine-to-coarse sentiment polarities. |
| Approach: | They propose to use a large-scale Chinese restaurant review dataset ASAP to investigate the sentiment polarities underlying user reviews. |
| Outcome: | The proposed model outperforms state-of-the-art models on both tasks. |
Copied to clipboard
| Challenge: | Existing scaling of language models is expensive and requires significant computational costs. |
| Approach: | They propose a method that substantially improves existing language models and their scaling curves with a relatively tiny amount of extra compute. |
| Outcome: | The proposed method significantly improves existing language models and their scaling curves with a relatively tiny amount of extra compute. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) have achieved remarkable performance gains across numerous downstream tasks in natural language understanding. |
| Approach: | They propose a Chinese pre-trained language model that implicitly encodes words into characters . they propose 'contrastive learning over word' and 'character' representations to improve learning . |
| Outcome: | The proposed model can encode words into fine-grained representations without modification of production pipelines. |
Copied to clipboard
| Challenge: | Existing work mitigates memory overhead by offloading or compressing the Key-Value cache. |
| Approach: | They propose a method that integrates quantization and offloading into a generative large language model by using a hybrid compression method. |
| Outcome: | The proposed method outperforms the state-of-the-art in long-context evaluations. |
Copied to clipboard
| Challenge: | Existing solutions for visual document understanding lack granularity of document textlines. |
| Approach: | They propose a supervised pre-training program to leverage structural knowledge nested in document textlines to achieve fine-grained alignment between visual regions and texts. |
| Outcome: | The proposed system performs better on various VDU tasks in English and Chinese. |
Copied to clipboard
| Challenge: | Open domain question answering systems often rely on information retrieved from large collections of text to answer questions. |
| Approach: | They evaluate and benchmark three powerful Large Language Models with a dataset . they find that 25% of unambiguous open domain questions can lead to conflicting contexts . |
| Outcome: | The proposed model can't be used to answer questions with conflicting contexts . it can be fine tuned to provide richer information into the model's training . |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have advanced legal intelligence, but the scarcity of scenario data impedes the progress toward interactive legal scenarios. |
| Approach: | They propose a Multi-agent Legal Simulation Driver to generate synthetic data by simulating interactive legal scenarios. |
| Outcome: | The proposed framework ensures consistency of legal attributes between participants and introduces a supervisory mechanism to align participants’ characters and behaviors as well as addressing distractions. |
Copied to clipboard
| Challenge: | a recent study shows that humans are not supervised by the natural language inference . |
| Approach: | They propose to solve the natural language inference problem via task-agnostic multimodal pretraining. |
| Outcome: | The proposed network outperforms fully-supervised BiLSTM and BiLS+ELMO on plain text inference datasets. |
Copied to clipboard
| Challenge: | Existing benchmarks for legal intelligence are limited to static evaluation paradigms or simplified scenarios. |
| Approach: | They introduce J1-ENVS, the first interactive and dynamic legal environment tailored for LLM-based agents. |
| Outcome: | The proposed framework assesses task performance and procedural compliance across legal proficiency levels. |
Copied to clipboard
| Challenge: | Existing methods for multimodal sarcasm detection neglect high-order relationships and underestimate high-frequency messages. |
| Approach: | They propose a Dual Graph-based Learning Framework to capture inter-modal inconsistencies . they propose combining a hypergraph and a vanilla graph to achieve enhanced propagation . |
| Outcome: | The proposed model outperforms existing state-of-the-art methods on two benchmark datasets. |
Copied to clipboard
| Challenge: | Existing methods to translate sentences to other languages using heuristics are challenging. |
| Approach: | They propose a model that learns hierarchical weights for different sets of labels and applies them to other languages to translate them. |
| Outcome: | The proposed model can translate English datasets to other languages and obtain different sets of labels again using heuristics. |
Copied to clipboard
| Challenge: | Existing systems for conversational recommender systems (CRS) have strong results in movies, but games present distinct challenges . MATCHA framework provides specialized agents for intent parsing, tool-augmented retrieval, multi-LLM ranking, and stronger safety. |
| Approach: | They propose a framework for conversational recommender systems that assigns specialized agents for intent parsing, tool-augmented retrieval, multi-LLM ranking and risk control. |
| Outcome: | MATCHA outperforms baselines on real user request dataset, improves Hit@5 by 20%, reduces popularity bias by 24%, and achieves 97.9% adversarial defense. |
Copied to clipboard
| Challenge: | Recent studies have shown that adversarial examples can be easily fooled by adversarially perturbed examples. |
| Approach: | They propose a pluggable defense module PlugAT to provide robust predictions by adding a few trainable parameters to the model inputs while keeping the original model frozen. |
| Outcome: | The proposed model improves robustness over several strong baselines whilst training only 9.1% parameters. |
Copied to clipboard
| Challenge: | Existing approaches to condensing textual information into concise and structured tables are limited in their applicability in broader contexts. |
| Approach: | They propose a benchmark dataset for generating summary tables of competitions based on real-time commentary texts that incorporates large-scale textual information into concise and structured tables. |
| Outcome: | The proposed method exhibits strong generalization abilities, surpassing previous approaches on several other text-to-table datasets. |
Copied to clipboard
| Challenge: | Existing studies have shown that adversarial samples are more vulnerable than normal ones to textual adversarials. |
| Approach: | They propose a simple and effective sharpness-based detector that can distinguish adversarial samples by maximizing the loss increment within the region where the inference sample is located. |
| Outcome: | The proposed method outperforms previous detection methods by large margins on three text classification tasks. |
Copied to clipboard
| Challenge: | Existing methods for commonsense question generation produce shallow questions that can be answered by simple word matching. |
| Approach: | They propose a task of commonsense question generation that aims to yield deep-level questions from the text. |
| Outcome: | The proposed model can yield deep-level and to-the-point questions from the text. |
Copied to clipboard
| Challenge: | Existing approaches to planning involve implicit planning or introduce explicit planners without systematically optimizing the planning stage. |
| Approach: | They propose an end-to-end RL framework that enhances the planning capabilities of deep research agents. |
| Outcome: | Experiments show that DeepPlanner improves planning quality and achieves state-of-the-art results under a lower training budget. |
Copied to clipboard
| Challenge: | Recent studies show the effectiveness of retrieval augmentation in many generative NLP tasks. |
| Approach: | They investigate retrieval settings from the input and label distribution views . they further augment document-level EAE with pseudo demonstrations sampled from event semantic regions . |
| Outcome: | The proposed methods can augment document-level EAE with pseudo demonstrations . the methods can be used in generative NLP tasks such as dialogue response generation . |
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 methods for predicting inter-task transferability are sparse and task-specific. |
| Approach: | They propose a method that uses connectivity patterns of neurons as a unique identifier associated with a task. |
| Outcome: | The proposed method outperforms baselines in predicting inter-task transferability across data regimes and transfer settings while keeping high efficiency in computation and storage. |
Copied to clipboard
| Challenge: | Reinforcement Learning from Human Feedback (RLHF) is a method for aligning language models with human values. |
| Approach: | They propose a method that automatically adjusts reward modeling based on data quality . they use preference data to train a reward model that is more aligned with human values . |
| Outcome: | The proposed method stabilizes reward model training and significantly improves alignment performance on human preference datasets. |
Copied to clipboard
| Challenge: | Recent studies have demonstrated remarkable performance on few-shot Named Entity Recognition tasks due to the high cost of obtaining high-quality labeled data. |
| Approach: | They propose to decompose the task into entity span detection and entity type classification using a type-independent entity span detector and then classify the detected spans based on their types. |
| Outcome: | The proposed method consistently yields improvements over two baseline approaches. |
Copied to clipboard
| Challenge: | Existing knowledge graph construction frameworks require predefined schemas, limiting their scalability and domain coverage. |
| Approach: | They propose a framework for fully autonomous knowledge graph construction that eliminates the need for predefined schemas. |
| Outcome: | The proposed framework outperforms state-of-the-art models on multi-hop QA tasks and enhances LLM factuality. |
Copied to clipboard
| Challenge: | Existing methods for enhancing the performance of large language models require expensive manual annotations. |
| Approach: | They propose an offline direct preference optimization method that collects preference pairs through iterative sampling and execution feedback to improve model confidence. |
| Outcome: | The proposed method improves performance on three reasoning tasks and shows a 3.6% improvement over the standard method. |
Copied to clipboard
| Challenge: | Existing EE research uses the role-averaged evaluation metric, but it is misleading to downstream applications. |
| Approach: | They propose two new evaluation metrics that explicitly penalize wrongly identified event arguments. |
| Outcome: | The proposed evaluation metrics improve the initial evaluation by 10% . the proposed training scheme is better than the existing one, the authors show . |
Copied to clipboard
| Challenge: | Existing methods for labeling relational facts require significant expert labor to write relation-specific patterns, which makes them too sophisticated to generalize quickly. |
| Approach: | They propose a neural pattern diagnosis framework that can summarize and refine relation-specific patterns with human experts in the loop. |
| Outcome: | The proposed framework can summarize and refine high-quality relational patterns from noise data with human experts in the loop. |
Copied to clipboard
| Challenge: | Prior work on temporal language change observed degradation when finetuning on older text and evaluating on newer data and named entities. |
| Approach: | They construct a benchmark to evaluate LLMs’ ability to generalize to neologisms with various natural language understanding tasks and model perplexity. |
| Outcome: | The proposed model performs better in downstream tasks and with later knowledge cutoff dates than models with earlier knowledge cut off dates. |
Copied to clipboard
| Challenge: | Existing methods for generating complex instructions are resource-intensive and lack diversity. |
| Approach: | They propose a framework to generate complex instructions with constraints using a document-generated initial instruction and an iterative refinement framework to incorporate LLM-as-judge guidance. |
| Outcome: | The proposed framework significantly outperforms existing methods for generating complex instructions, and outperformed existing methods. |
Copied to clipboard
| Challenge: | Sequence labeling aims to predict fine-grained sequences of labels for text, but lack of token-level annotated data hinders the effectiveness of supervised methods. |
| Approach: | They propose a Meta Teacher-Student (MetaTS) Network to alleviate data scarcity by leveraging large multilingual unlabeled data. |
| Outcome: | The proposed meta learning method alleviates data scarcity by leveraging large multilingual unlabeled data. |
Copied to clipboard
| Challenge: | Recent studies have shown that pre-trained language models contain smaller matching subnetworks that are not robust to adversarial examples. |
| Approach: | They propose a method to find robust tickets hidden in pre-trained language models by learning binary weight masks and an adversarial loss objective to guide the search. |
| Outcome: | The proposed method improves on previous work on adversarial robustness evaluation. |
Copied to clipboard
| Challenge: | Rapid advances in Large Language Models have spurred demand for processing extended context sequences . however, performance degradation due to sequence lengths out-of-distribution and excessively long inference times are limiting LLMs in long-context scenarios. |
| Approach: | They propose a training-free method for efficient and accurate long-context inference . they selectively involves a few critical KV cache tokens in attention calculation . |
| Outcome: | The proposed method speeds up attention computation and accelerates inference time while reducing selection overhead. |
Copied to clipboard
| Challenge: | Existing preference optimization methods such as DPO and KTO are inherently derived from PPO, requiring a reference model that adds GPU memory resources and relies heavily on abundant preference data. |
| Approach: | They propose an algorithm that leverages the average likelihood of model responses to fit the reward function and maximizes the utilization of preference data. |
| Outcome: | The proposed algorithm outperforms DPO, ORPO, and SimPO on MT-Bench and Arena-Hard. |
Copied to clipboard
| Challenge: | Recent advances in GPT-4V have demonstrated remarkable multi-modal capabilities in processing image inputs and following open-ended instructions. |
| Approach: | They propose a plug-and-play technique to enhance multi-modal LLMs . they propose 'lynx' to train multi-modal LLM models . |
| Outcome: | The proposed training strategy improves understanding accuracy and instruction-following proficiency of multi-modal models. |
Copied to clipboard
| Challenge: | Existing structure modeling approaches fail to capture the author’s rhetorical intent and reasoning process. |
| Approach: | They propose a Question-Focus discourse structuring framework that explicitly models the underlying argumentative flow by anchoring each argumentative unit to a guiding question and a set of attentional foci. |
| Outcome: | The proposed framework outperforms baseline models and curated models on an argument reconstruction task in Chinese think-tank articles and claims coverage. |
Copied to clipboard
| Challenge: | Existing parallel tokenization methods suffer from inconsistent results due to boundary artifacts that occur after merging. |
| Approach: | They propose a Lossless Parallel Tokenization framework that ensures output identical to standard sequential tokenization. |
| Outcome: | The proposed method achieves significant speedup while guaranteeing lossless tokenization. |
Copied to clipboard
| Challenge: | Social graphs provide high-quality supervision signals that encode local interactions and global network structure, yet they remain underutilized for LLM training. |
| Approach: | They propose a general LLM-based social graph simulation framework that leverages graph data as supervision for LLM training. |
| Outcome: | The proposed framework improves micro-level alignment by 6.1% on three real-world networks compared to the strongest baseline. |
Copied to clipboard
| Challenge: | Existing learning-to-route methods suffer from the routing fluctuation issue . with the model scale growing, training speed will go slower and memory requirements are heavy . |
| Approach: | They propose a Mixture-of-Experts technique that can scale up the model size of Transformers with an affordable computational overhead. |
| Outcome: | The proposed method outperforms existing learning-to-route methods on language modeling and multilingual machine translation. |
Copied to clipboard
| Challenge: | supervised fine-tuning (SFT) is a technique used to enhance multiple abilities in large language models. |
| Approach: | They propose to study the interplay of data composition between mathematical reasoning, code generation, and general human-aligning abilities during supervised fine-tuning. |
| Outcome: | The proposed model improves math reasoning and code generation with increasing data amount . the proposed model size and SFT strategies can be used to learn multiple skills with different scaling patterns. |
Copied to clipboard
| Challenge: | Existing graph-based methods focus only on relations between objects in an image and neglect the importance of syntactic dependency relations between words. |
| Approach: | They propose a dual channel graph convolutional network to capture relations between objects in an image and syntactic dependency relations between words in a question. |
| Outcome: | The proposed model achieves comparable performance with the state-of-the-art approaches. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly deployed as agents that invoke external tools through structured function calls. |
| Approach: | They introduce a diagnostic benchmark and conduct a systematic evaluation of multilingual tool calling across Chinese, Hindi, and the low-resource language Igbo. |
| Outcome: | The proposed benchmarks show that multilingual tool calling fails despite correct intent understanding and tool selection. |
Copied to clipboard
| Challenge: | Existing schema linking methods are not able to handle complex SQL queries. |
| Approach: | They propose a new algorithm that transforms SQL queries into grammatically verifiable sub-queries which are arranged sequentially to reflect single-hop reasoning steps. |
| Outcome: | The proposed algorithm achieves significant performance gains on the BIRD dataset and surpasses schema linking methods at comparable or better cost. |
Copied to clipboard
| Challenge: | Natural language is the de facto communication medium for LLM-based agents, but it presents a fundamental constraint . natural language downsampling limits the depth and nuance of information that can be transmitted . et al.: inter-agent latent space communication is a promising paradigm for solving complex tasks . |
| Approach: | They propose a paradigm that leverages the last hidden states of an LLM as a representation of its thought for direct communication. |
| Outcome: | The proposed paradigm outperforms fine-tuned chain-of-thought prompting and single-agent baselines even across heterogeneous models. |
Copied to clipboard
| Challenge: | Large language models are prone to contextual hallucination, generating information that is either unsubstantiated or contradictory to the given context. |
| Approach: | They propose a dataset specifically designed for long-context hallucination detection. |
| Outcome: | The proposed architecture outperforms existing models while providing faster inference. |
Copied to clipboard
| Challenge: | Existing methods for empathetic response generation ignore hierarchical relationships between different factors, leading to a weak ability of empathy modeling. |
| Approach: | They propose a multi-factor hierarchical framework for empathetic response generation which models the above three key factors in a hierarchically structured way. |
| Outcome: | The proposed model generates more empathetic responses than previous methods. |
Copied to clipboard
| Challenge: | In the age of mobile internet, personal information is constantly being generated on smartphones. |
| Approach: | They propose a novel task of crafting personalized agents powered by large language models that leverage a user's smartphone memories to enhance downstream applications with LLM capabilities. |
| Outcome: | The proposed approach improves 10% over the best existing approach on a real-world dataset and improves usability. |
Copied to clipboard
| Challenge: | Existing methods for document-level event extraction struggle due to two intrinsic challenges: nested arguments and multiple events. |
| Approach: | They propose a role-interactive multi-event head attention network to solve two challenges . they map different events to multiple subspaces and then determine whether the current event exists . |
| Outcome: | The proposed model improves on two widely used DEE datasets on the Internet. |
Copied to clipboard
| Challenge: | Existing methods for domain adaptation of abstractive dialogue summarization lack generalization ability on new domains. |
| Approach: | They propose a domain-oriented prefix-tuning model that uses a prefix module to alleviate domain entanglement and discrete prompts to guide the model to focus on key contents of dialogues. |
| Outcome: | The proposed model can be generalized to two multi-domain dialogue summarization datasets. |
Copied to clipboard
| Challenge: | Existing Large Language Model (LLM)-based mobile agents follow explicit user instructions without personalized needs. |
| Approach: | They propose a user preference learning strategy enhanced with a Personal Reward Model to improve personalization performance. |
| Outcome: | The proposed agent achieves state-of-the-art performance while maintaining competitive instruction execution performance. |
Copied to clipboard
| Challenge: | Multi-hop question answering is a challenging task that requires capturing information from multiple positions in multiple documents. |
| Approach: | They propose a framework for integrating text-based and triple-based paradigms that incorporates structured knowledge into large-scale question answering. |
| Outcome: | The proposed framework improves multi-hop question answering by incorporating structured knowledge into the models. |
Copied to clipboard
| Challenge: | Existing methods for lifelong model editing suffer from limitations in usability, such as requiring additional training corpora or lacking support for reversible and detachable edits. |
| Approach: | They propose a plug-and-play method for knowledge retrieval and storage, i.e., Layer-Level Prompting, which enables seamless and efficient lifelong model editing. |
| Outcome: | The proposed method outperforms existing methods on question answering and hallucination benchmarks across different LLMs. |
Copied to clipboard
| Challenge: | Existing methods for OOD detection are based on labeled in-domain data . detecting out-of-domain (OOD) or unknown intents is challenging . |
| Approach: | They propose a novel reassigned contrastive learning method to discriminate IND intents for over-confident OOD and an adaptive class-dependent local threshold mechanism to separate similar IND and OOD intents. |
| Outcome: | The proposed method is effective for both aspects of overconfidence issues. |
Copied to clipboard
| Challenge: | Existing research on reinforcement learning for LLMs under data scarcity has not been unified. |
| Approach: | They propose a top-up hierarchical framework built around three complementary perspectives: data-centric, training-centric and framework-centric. |
| Outcome: | The proposed framework provides a clear conceptual foundation for understanding the design space of data-efficient RL for large language models and to guide researchers working in this emerging area. |
Copied to clipboard
| Challenge: | Existing external memory systems for LLMs have low online overhead but are unstable in accumulating latency over long interactions. |
| Approach: | They propose a lightweight memory system for better agent memory driven by Small Language Models . lightmem modularizes memory retrieval, writing, and long-term consolidation . they show consistent gains across model scales and high efficiency . |
| Outcome: | The proposed system improves agent memory but has low latency and low online overhead . it separates online processing from offline consolidation to enable efficient memory invocation . the proposed system achieves an average F1 improvement of 2.5 over A-MEM on LoCoMo . |
Copied to clipboard
| Challenge: | Prior work assigns supervision based on outcome rewards or external reward models, but ignores environment observations, a critical source of learning. |
| Approach: | They propose a supervision-based agentic reinforcement learning system that integrates environment observations as an explicit supervision signal. |
| Outcome: | The proposed model improves performance on reasoning and deep research tasks while reducing erroneous and inefficient tool usage. |
Copied to clipboard
| Challenge: | Existing methods for mental health risk assessment rely on subjective textual records . however, these uncertainties can cause inconsistent and unreliable predictions . |
| Approach: | They propose a method that integrates objective behavior data alongside subjective mental records for robust mental health risk assessment. |
| Outcome: | The proposed approach achieves significant improvements over general LLMs. |
Copied to clipboard
| Challenge: | Recent work on Chain-of-Thought prompting imposes substantial computational overhead . lack of supervision obscures the analyzability of the latent reasoning chain. |
| Approach: | They propose a framework to render latent reasoning chain into images, making latent rationale explicit and traceable. |
| Outcome: | The proposed framework achieves 3-4 token compression and substantial inference acceleration compared to explicit CoT prompting. |
Copied to clipboard
| Challenge: | Existing methods to extract aspects and sentiments are limited due to lack of annotated sequence data. |
| Approach: | They propose a Selective Adversarial Learning method to align latent correlation vectors . they propose tagging a set of aspect boundary tags and sentiment tags to create a joint label space . |
| Outcome: | The proposed method can learn weights for words to achieve fine-grained adaptation. |
Copied to clipboard
| Challenge: | Existing studies fine-tune discriminative models on specific defined intent classes, preventing them from being directly adopted to new intent domains. |
| Approach: | They propose to use a pre-trained generative intent model to detect new intents from different domains with no parameter updates. |
| Outcome: | The proposed model outperforms baselines that need further fine-tuning or domain-specific samples. |
Copied to clipboard
| Challenge: | Existing benchmarks for MU are limited by a lack of image diversity and coarse-grained unlearning targets. |
| Approach: | They propose a benchmark to evaluate misinformation unlearning in MLLMs . OFFSIDE supports advanced unlearning targets such as fine-grained unlearning and visual rumor removal. |
| Outcome: | OFFSIDE supports advanced unlearning targets, such as fine-grained unlearning and visual rumor removal. |
Copied to clipboard
| Challenge: | Existing reward models concatenate contexts and responses, but they often ignore crucial segments of the context that are important for evaluating the response quality. |
| Approach: | They propose a reward model that evaluates the response quality based on a given context and assigns a rewards reward. |
| Outcome: | The proposed framework significantly improves preference modeling by increasing attention to relevant information within the context and achieves better generalizability. |
Copied to clipboard
| Challenge: | Reply suggestion models help users process emails and chats faster. |
| Approach: | They present a multilingual reply suggestion dataset with ten languages . they build a generation model and a retrieval model as baselines for MRS . |
| Outcome: | The proposed model complements existing benchmarks for cross-lingual generalization . the model has different strengths in the English monolingual setting and requires different strategies to generalize across languages. |
Copied to clipboard
| Challenge: | Jailbreak attacks craft specific prompts or append adversarial suffixes to prompts, thereby inducing language models to generate harmful or unethical content and bypassing the model’s safety guardrails. |
| Approach: | They propose a Monte Carlo Tree Search (MCTS) based Prompt Auto-generation (MPA) method to generate adversarial suffixes for valid jailbreak attacks. |
| Outcome: | The proposed method outperforms existing methods on open-source and closed-source models and shows that it can generate harmful responses. |
Copied to clipboard
| Challenge: | Existing methods to compress the KV cache of large language models are expensive and limited in their context window and cost. |
| Approach: | They propose a method to expand the context window and reduce memory footprint by compressing the KV cache of large language models. |
| Outcome: | The proposed method can reduce memory footprint and expand context window of large language models without training. |
Copied to clipboard
| Challenge: | Existing OCR-free approaches to document visual question answering are brittle and passive. |
| Approach: | They propose an OCR-free agentic framework that casts multi-page DocVQA as sequential evidence aggregation. |
| Outcome: | The proposed framework outperforms open-source and proprietary models in five benchmarks and improves out-of-domain performance by 47.9% over baseline. |
Copied to clipboard
| Challenge: | Recent advances in machine learning (MU) have enabled the selective removal of private or sensitive information encoded within deep neural networks. |
| Approach: | They propose to "reformulate" the task of multimodal MU in the era of MLLMs by preserving only the visual patterns associated with a given entity while preserving the corresponding textual knowledge. |
| Outcome: | The proposed method surpasses baselines that finetuned MLLMs with VQA data directly through Gradient Ascent (GA) or Negative Preference Optimization (NPO), across all evaluation dimensions. |
Copied to clipboard
| Challenge: | Existing pre-trained vision-language models suffer from inefficiency and linguistic signal overwhelmed by long visual sequences in cross-modal alignment. |
| Approach: | They propose a vision-language foundation model with cross-modal skip-connections that can be pre-trained end-to-end on large-scale image-text pairs with both discriminative and generative objectives. |
| Outcome: | The proposed model achieves state-of-the-art results on a wide range of vision-language downstream tasks, including image captioning, image-text retrieval, visual grounding and visual question answering. |
Copied to clipboard
| Challenge: | Root cause analysis (RCA) in Micro-services architectures with escalating complexity is challenging due to fault propagation and circular dependencies among nodes. |
| Approach: | They propose a framework where multiple agents follow Agent Workflow and collaborate in blockchain-inspired voting to ensure the reliability of root cause analysis. |
| Outcome: | The proposed framework reduces the number of steps and standardizes task processing through Agent Workflow. |
Copied to clipboard
| Challenge: | Existing methods for Few-Shot Text Classification are limited by their global knowledge-shared mechanisms. |
| Approach: | They propose a self-supervised hierarchical task clustering method to address task heterogeneity . they use prior knowledge from historical tasks to leverage prior knowledge . |
| Outcome: | The proposed method can learn a classifier efficiently with few examples . it disentangles the underlying relations between tasks to improve interpretability . |
Copied to clipboard
| Challenge: | Existing quantization methods for large language models suffer performance degradation at ultra-low bit-widths due to key cache outliers. |
| Approach: | They propose a vector quantization method that suppresses outliers in the key cache and reduces memory access overhead. |
| Outcome: | The proposed method outperforms baseline quantization methods across long-context understanding and mathematical reasoning tasks while minimizing memory access overhead. |
Copied to clipboard
| Challenge: | Existing reasoning models are limited by inefficiency and computational redundancy . PRISM-MCTS integrates a process reward model with a dynamic shared memory . |
| Approach: | They propose a reasoning framework that integrates a process reward model with a dynamic shared memory. |
| Outcome: | PRISM-MCTS integrates a process reward model with a dynamic shared memory . it halves trajectory requirements on GPQA while surpassing MCTS-RAG and Search-o1 . |
Copied to clipboard
| Challenge: | Existing methods to improve NAT model's performance but do not fully utilize it. |
| Approach: | They propose a non-autoregressive translation method which can obtain high-quality translations while maintaining the inference speed of NAT models. |
| Outcome: | The proposed method outperforms the autoregressive translation model on three translation tasks with 7.6 speedup. |
Copied to clipboard
| Challenge: | Experimental results show that consistency regularization improves cross-lingual fine-tuning . pre-trained cross-linguistic models can transfer task-specific supervision from one language to the other . |
| Approach: | They propose to improve cross-lingual fine-tuning with consistency regularization . they use example consistency regularized to penalize prediction sensitivity to four types of data augmentations . |
| Outcome: | The proposed method improves cross-lingual fine-tuning across tasks . it can be generalized to other target languages without additional training . |
Copied to clipboard
| Challenge: | Special attention is paid to the cross-modal misalignment in text-image datasets which may mislead the learning. |
| Approach: | They propose a multimodal back-translation method which uses diffusion-based generative models for pseudo-paralleled pairs and a divergence estimator to construct a high-resource corpora as a bridge for low-ressource learners. |
| Outcome: | The proposed method outperforms 14 state-of-the-art methods in both entity and relation extraction tasks. |
Copied to clipboard
| Challenge: | Experimental results show that denoising word alignment improves cross-lingual transferability . most applications and resources are still English-centric, making non-English users hard to access. |
| Approach: | They propose to denoise word alignment as a cross-lingual pre-training task . they first self-label word alignments for parallel sentences and then mask tokens . |
| Outcome: | The proposed model improves cross-lingual transferability on token-level tasks, especially on question answering, and structured prediction. |
Copied to clipboard
| Challenge: | Existing pruning and quantization algorithms could compress LLMs to 4 bits without retraining. |
| Approach: | They propose a method to prune models using a minimal set of critical weights . they compare the method to a 2:4 structured sparsity method . |
| Outcome: | The proposed method outperforms other methods on LLAMA2 and OPT models while maintaining the efficiency of the compression. |
Copied to clipboard
| Challenge: | Recent studies on fine-grained intent detection have focused on collecting large-scale and high-quality samples via crowdsourcing resulting in data scarcity. |
| Approach: | They propose an iterative differential generation framework with contrastive feedback to generate high-quality pseudo samples and accurately capture the crucial nuances in target class distribution. |
| Outcome: | The proposed framework generates high-quality pseudo samples and captures crucial nuances in target class distribution. |
Copied to clipboard
| Challenge: | Recent studies have proposed tool learning, which augments LLMs with external tools. |
| Approach: | They propose an adaptive and hierarchy-aware reranking method to refine retrieval results by truncating the retrieval result related to seen and unseen tools at different positions. |
| Outcome: | The proposed method improves retrieval results, leading to better execution results generated by the LLM. |
Copied to clipboard
| Challenge: | Existing methods for retrieving relevant memories from an external database are coarse-grained and can cause noise and focus on crucial memories. |
| Approach: | They propose a multiple partition paradigm for RAG where each database partition serves as a basic unit for execution. |
| Outcome: | The proposed framework outperforms baseline methods on three language generation tasks on seven datasets. |
Copied to clipboard
| Challenge: | Experimental results prove that language models can learn from human feedback better, irrespective of sequence length . emergence of length bias often induces the model to favor longer outputs . |
| Approach: | They propose to separate reward modeling from the influence of sequence length by using the Product-of-Experts technique. |
| Outcome: | The proposed approach shows that language models perform better regardless of sequence length . the main expert is focused on understanding human intents, while the biased expert targets the identification and capture of length bias. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly being applied in education, showing significant potential in personalized instruction, student feedback, and intelligent tutoring systems (ITSs). |
| Approach: | They propose a dataset specifically designed to evaluate LLMs’ ability to generate high-quality hints for Math Word Problems. |
| Outcome: | The proposed dataset shows that LLMs can generate more accurate and contextually appropriate educational hints for math word problems without offering direct answers. |
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: | Large language models (LLMs) have achieved remarkable performance on various NLP tasks, yet their potential in more challenging task like finance, has not been fully explored. |
| Approach: | They propose a benchmark to assess the financial knowledge of large language models (LLMs) in China. |
| Outcome: | The proposed benchmark is the most comprehensive evaluation benchmark to date for LLMs in finance. |
Copied to clipboard
| Challenge: | Existing models fail to capture and model customer intention effectively because of insufficient information exploitation and only apparent information like descriptions and titles are used. |
| Approach: | They propose to exploit existing session data to capture and model intention in E-commerce product purchase sessions using a multimodal benchmark. |
| Outcome: | The proposed framework can bridge the gap between intention understanding in simplified research cases like co-buy intention and more complex yet practical scenarios like session history. |
Copied to clipboard
| Challenge: | examining the behaviors of Large Language Models as artificial social actors is underexplored, especially in unverifiable scenarios where conventional benchmarking has little to help improve their abilities. |
| Approach: | They propose a method to collect, compare, and reason about human and LLMs' decisions in an unverifiable scenario and use it to examine their behaviors. |
| Outcome: | The proposed method compared human and LLM decisions in an unverifiable scenario on GitHub and found that proprietary LLMs behave more like humans than open-source LLM systems. |
Copied to clipboard
| Challenge: | Existing methods for automated feature generation rely on predefined operator libraries and do not incorporate feature semantics, limiting their ability to produce high-quality features. |
| Approach: | They propose a Memory-Augmented LLM-based Multi-Agent System (MALMAS) that decomposes the generation process into agents with distinct responsibilities. |
| Outcome: | The proposed method extracts informative features from raw tabular data without manual intervention and is crucial for accurate, generalizable machine learning. |
Copied to clipboard
| Challenge: | Existing approaches to vision-and-language pretraining (VLP) lack effectiveness and efficiency in downstream multimodal tasks. |
| Approach: | They propose a flexible vision-and-language pre-training model by incorporating cross-modal fusions into a dual-encoder architecture and a cross-module knowledge transfer strategy to guide the training process. |
| Outcome: | The proposed model is well-equipped with effectiveness and efficiency compared with other strong VLP models. |
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 RAG systems require uploading local documents to the cloud, resulting in inference latency and poor generalization on out-of-distribution (OOD) inputs. |
| Approach: | They propose a generalizable knowledge-distilled parametric RAG model aligned with standard RAG in document structure and parameter activation. |
| Outcome: | The proposed model outperforms baselines in accuracy and generalizes well on out-of-distribution (OOD) data. |
Copied to clipboard
| Challenge: | Graph neural networks excel at anomaly detection, but exhibit vulnerability to attacks . novel mechanism for graph adversarial training designed to bolster anomaly detectors . |
| Approach: | They propose a mechanism for graph adversarial training to bolster anomaly detection systems against potential poisoning attacks. |
| Outcome: | The proposed method bolsters GNN-based anomaly detection systems against poisoning attacks. |
Copied to clipboard
| Challenge: | Presently, graph-based recommendations are limited by session dependencies and data sparsity in real-world scenarios. |
| Approach: | They propose a method which uses multi-collaborative self-supervised learning in hypergraph neural networks to model item transitions and to mitigate the challenges of data sparsity. |
| Outcome: | The proposed method outperforms existing methods in a number of domains and consistently outperformed existing methods. |
Copied to clipboard
| Challenge: | Existing mPLM-based methods focus on designing costly model pre-training while ignoring equally crucial downstream adaptation. |
| Approach: | They propose a meta graph learning method that extracts meta-knowledge from historical CLT experiences to learn to cross-lingual transfer. |
| Outcome: | The proposed method can learn to cross-lingual transfer by extracting meta-knowledge from historical CLT experiences (tasks) it can also capture intrinsic language relationships to explicitly guide cross-linguistic transfer. |
Copied to clipboard
| Challenge: | Developing monolingual large Pre-trained Language Models (PLMs) is shown to be very successful in handling different tasks in Natural Language Processing (NLP). |
| Approach: | They present AraMUS, the largest Arabic PLM with 11B parameters trained on 529GB of high-quality Arabic textual data. |
| Outcome: | The proposed model achieves state-of-the-art performance on a diverse set of Arabic classification and generative tasks. |
Copied to clipboard
| Challenge: | Existing corpora focus on misinformation spreading within western countries. |
| Approach: | They present a new corpus of tweets annotated with stance towards 250 misinformation claims. |
| Outcome: | The proposed method achieves 53.1 F1 on Hindi and 50.4 F1 in Arabic without any target-language fine-tuning. |
Copied to clipboard
| Challenge: | Existing approaches to training agents for visual-language models trap them in local optima, hindering exploration and error correction with the environment. |
| Approach: | They propose a hierarchical training recipe that bridges atomic action execution and strategic task completion. |
| Outcome: | The proposed training recipe bridges atomic action execution and strategic task completion. |