Papers by Ke Xu
Copied to clipboard
| Challenge: | Extensive experiments on large-scale mathematical reasoning and out-of-distribution tasks demonstrate the effectiveness and generalization of the proposed method. |
| Approach: | They propose a method that quantifies novelty across the outcome space and semantic process space by using reward or solution divergence. |
| Outcome: | Experiments on Qwen2.5-Math-7B demonstrate the proposed method is general and efficient. |
Copied to clipboard
| Challenge: | Recent research attempts to extend unsupervised question answering to settings with few or no labeled data available. |
| Approach: | They propose two approaches to improve unsupervised question answering . first, they harvest lexically and syntactically divergent Wikipedia questions to automatically construct a corpus of question-answer pairs . second, they take advantage of the QA model to extract more appropriate answers . |
| Outcome: | The proposed approach outperforms previous unsupervised approaches by a large margin and is competitive with early supervised models. |
Copied to clipboard
| Challenge: | Existing balancing strategies focus on constraining the final distribution of expert usage, but overlook the routing decisions made at each layer. |
| Approach: | They propose a three-stage framework that leverages process-level rewards to guide balanced expert routing. |
| Outcome: | Extensive experiments show that LayerMoE improves the performance of state-of-the-art LoRA-MoA baselines, yielding an average accuracy gain of 1.39%. |
Copied to clipboard
| Challenge: | Existing methods to encode and match entity pairs have only a few observed reference entity pairs. |
| Approach: | They propose a model that infers and leverages paths that can expressively encode the relation of two entities. |
| Outcome: | The proposed model outperforms the state-of-the-art models by 11.2– 14.2% in terms of Hits@1. |
Copied to clipboard
| Challenge: | Typical approaches to training large language models rely on limited contrasting patterns . contrasting data is limited and models are susceptible to harmful response tendencies . |
| Approach: | They propose a framework that integrates contrasting patterns across the prompt, model, and pipeline levels. |
| Outcome: | The proposed framework outperforms existing methods in the comparison of RQ1 and RQ2 . the proposed framework significantly outperformed existing methods, leading to more comprehensive alignment. |
Copied to clipboard
| Challenge: | Using deep neural networks to find codes is difficult . we present a dataset that includes 20,604 labels for natural language queries and codes . |
| Approach: | They introduce a contrastive learning method to enhance text-code matching . they find that CoSQA improves the accuracy of code question answering by 5.1% . |
| Outcome: | The proposed method improves the accuracy of code question answering by 5.1% and improves by 10.5% on a CodeBERT model. |
Copied to clipboard
| Challenge: | Quantization has shown promise for Large Language Models, but current methods require lengthy training to alleviate quantization loss. |
| Approach: | They propose to decouple weights and incorporate Low-Rank adapters to reduce weight sharing . they validate the approach on LLaMA2 families and Mistral on downstream evaluation . |
| Outcome: | The proposed approach shows high performance while reducing deployment time faced with multiple scenarios. |
Copied to clipboard
| Challenge: | Existing evaluations of commonsense for large language models focus on downstream knowledge tasks, failing to probe whether LLMs truly understand and utilize knowledge or merely memorize it. |
| Approach: | They propose to automatically construct a large benchmark named CoCo which measures LLMs’ knowledge memorization, comprehension, and application and examines the consistency between these tasks. |
| Outcome: | The proposed benchmark systematically assesses LLMs’ knowledge memorization, comprehension, and application and examines the consistency between these tasks. |
Copied to clipboard
| Challenge: | Existing methods for constructing new datasets rely on timestamps or simple templates that do not accurately reflect the real world. |
| Approach: | They propose a knowledge dataset construction approach that simulates biological evolution using knowledge graphs to generate synthetic entities with diverse attributes. |
| Outcome: | The proposed framework outperforms knowledge augmentation methods by 3.3%-38%. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have impressive capabilities across various domains, including role-playing, creative writing, mathematical reasoning, and coding. |
| Approach: | They propose two methods to improve the model’s adherence to length constraints and copy-paste accuracy without compromising response quality. |
| Outcome: | The proposed methods improve the model’s adherence to length constraints and copy-paste accuracy without compromising response quality. |
Copied to clipboard
| Challenge: | Recent rise of conversational applications has promoted the development of conversation KBQA (ConvKBQA). |
| Approach: | They propose a framework to produce a full-fledged rewritten question based on conversation history and then reason the answer by existing single-turn KBQA models. |
| Outcome: | The proposed framework produces a full-fledged rewritten question based on the conversation history and reasoned the answer by existing single-turn KBQA models. |
Copied to clipboard
| Challenge: | Existing methods for detecting rumors on social media neglect the temporal aspect of rumor propagation. |
| Approach: | They propose a method that incorporates temporal information by building a weighted propagation tree and a coding tree. |
| Outcome: | The proposed approach preserves essential structure of rumor propagation while reducing noise. |
Copied to clipboard
| Challenge: | Recent studies on compression of pretrained language models usually use preserved accuracy as the metric for evaluation. |
| Approach: | They propose two new metrics that measure how closely a compressed model mimics the original model. |
| Outcome: | The proposed metrics measure how closely a compressed model (i.e., student) mimics the original model (e.g., teacher). |
Copied to clipboard
| Challenge: | Auto-regressive decoding is a memory-bound job, meaning decoding performance is limited by the bandwidth rather than the computational capabilities of the GPU. |
| Approach: | They propose a framework that supports lossless weight-only quantization inference and validate it on Qwen and LLaMA Models. |
| Outcome: | The proposed framework achieves the highest efficiency with lossless accuracy on Qwen and LLaMA Models across various modalities. |
Copied to clipboard
| Challenge: | Existing experience replay methods for RLVR ignore sample inefficiency . expensive reasoning trajectories are discarded immediately after a single gradient update . |
| Approach: | They propose a method to replay failure trajectories to improve model refinement . they propose 'nexGRPO' which employs mid-confidence gating to filter invalid noise and saturated errors. |
| Outcome: | The proposed model outperforms strong baaselines and achieves improved out-of-distribution generalization. |
Copied to clipboard
| Challenge: | Cant is important for understanding advertising, comedies and dogwhistle politics . currently, there are very few resources available for the research of cant . |
| Approach: | They propose a large and diverse dataset for creating and understanding cant from a computational linguistics perspective. |
| Outcome: | The proposed dataset can be used to test word embedding similarity and pretrained language models. |
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: | Existing benchmarks fail to adequately evaluate the proficiency of Large Language Models (LLMs) Existing standards do not cover the skills needed to evaluate LLMs in scientific literature analysis. |
| Approach: | They propose a benchmark to evaluate the proficiency of large language models in scientific literature analysis. |
| Outcome: | SciAssess evaluates 11 LLMs on multiple tasks across scientific fields. |
Copied to clipboard
| Challenge: | Large language models (LLMs) exhibit prompt leakage vulnerabilities, raising intellectual property and confidentiality concerns. |
| Approach: | They use probing techniques to capture LLMs’ intent-related internal representations and show that they internalize prompt leakage intents in their hidden states before generating tokens. |
| Outcome: | The proposed probes achieve 90%+ AUROC across all tested models, even when applied to new system prompts and attacks. |
Copied to clipboard
| Challenge: | Existing prompting methods that require white-box access to the model or substantial training fail to simultaneously lessen toxicity and bias. |
| Approach: | They propose a strategy that encourages LLMs to integrate diverse human perspectives and self-regulate their responses by incorporating diverse human viewpoints. |
| Outcome: | The proposed approach can significantly diminish toxicity (up to 89%) and bias (up 73%) in LLMs’ responses. |
Copied to clipboard
| Challenge: | Recent work on applying large language models (LMs) achieves impressive performance in many NLP applications. |
| Approach: | They propose to continuously post-train an LM with unlabeled domains to expand its knowledge without forgetting previous skills. |
| Outcome: | The proposed system improves few-shot end-task learning in these domains. |
Copied to clipboard
| Challenge: | Existing algorithms for collaborative filtering are limited by their computational demands and latency. |
| Approach: | They propose a framework to integrate pre-trained LLM embeddings into CF models through selective initialization strategies. |
| Outcome: | The proposed framework improves recommendation performance while maintaining low computational costs. |
Copied to clipboard
| Challenge: | Knowledge distillation (KD) compresses large language models into lightweight versions called student models. |
| Approach: | They propose to align the entire feature dynamics between teacher and student models by using two additional loss terms to achieve this. |
| Outcome: | The proposed method matches the entire feature dynamics between teacher and student models rather than just the final states. |
Copied to clipboard
| Challenge: | Large Audio-Language Models (LALMs) have recently unlocked audio dialogue capabilities, enabling direct spoken exchanges with humans. |
| Approach: | They propose to evaluate LALMs' open-ended audio dialogue ability in 3 general scenarios, 12 skills, 9 multilingual languages, and 4 categories of ambiguity handling. |
| Outcome: | The proposed benchmark assesses the open-ended audio dialogue ability for LALMs in 3 general scenarios, 12 skills, 9 multilingual languages, and 4 categories of ambiguity handling. |
Copied to clipboard
| Challenge: | Existing methods for streaming video understanding are query-agnostic and implicitly model video evidence. |
| Approach: | They propose a framework that establishes explicit, structured alignment between the accumulated video evidence and the query’s expected response conditions via scene graphs. |
| Outcome: | The proposed model achieves more interpretable and accurate response timing decisions on both proactive and reactive tasks. |
Copied to clipboard
| Challenge: | Large language models face persistent challenges when handling long-context tasks . existing methods that reduce input have the risk of discarding key information . |
| Approach: | To address this issue, we propose a multi-agent reasoning framework called Tree of Agents . the framework segments input into chunks processed by independent agents . |
| Outcome: | The proposed model outperforms baseline models on long-context tasks. |
Copied to clipboard
| Challenge: | Effective evaluation of alignment for emerging Chinese LLMs is still significantly lacking, calling for real-scenario grounded, open-ended, challenging and automatic evaluations tailored for alignment. |
| Approach: | They propose a multi-dimensional benchmark for evaluating LLMs’ alignment in Chinese with 8 main categories, 683 real-scenario rooted queries and corresponding human verified references. |
| Outcome: | The benchmark uses a human-in-the-loop data curation pipeline, 683 real-scenario rooted queries and human verified references. |
Copied to clipboard
| Challenge: | Existing datasets on bias evaluation for large language models focus on English and North American culture and are limited to one task. |
| Approach: | They propose to evaluate Chinese language models' biases from multiple perspectives using a multi-task Chinese Bias Evaluation Benchmark. |
| Outcome: | The proposed model covers 12, 82 subcategories and 5 evaluation tasks covering a wide range of categories and content diversity. |
Copied to clipboard
| Challenge: | Existing studies have focused on continual learning of aspect sentiment classification (ASC) tasks in domain incremental learning (DIL) |
| Approach: | They propose a continual learning method that learns a sequence of tasks incrementally . they propose CLASSIC, which uses a domain incremental learning setting . |
| Outcome: | The proposed model is highly effective in a domain incremental learning setting. |
Copied to clipboard
| Challenge: | Existing non-factuality detection methods require response generation, which incurs significant computational overhead. |
| Approach: | They propose a lightweight model called Factuality Lens which effectively probes hidden representations of fact-seeking questions for the NFP task. |
| Outcome: | The proposed model is able to probe hidden representations of fact-seeking questions and reduce development costs. |
Copied to clipboard
| Challenge: | Existing knowledge distillation methods for BERT implicitly learn discriminative student features by mimicking the teacher features. |
| Approach: | They propose a new knowledge distillation approach called adaptive contrastive knowledge distilling for BERT compression using hidden state features in BERT as explicit supervision to learn discriminative student features. |
| Outcome: | The proposed approach improves on multiple natural language processing tasks. |
Copied to clipboard
| Challenge: | Experiments on GPT and other 23 LLMs indicate that tokens widely exist while GPT’s vocabulary behaves the worst: more than 23% long Chinese tokens (i.e., a token with more than two Chinese characters) are either porn or online gambling. |
| Approach: | They propose to locate Polluted Chinese (PoC) tokens in LLMs and build a PoC token detector to label them in vocabularies by considering each token’s semantics and related contents from the search engines. |
| Outcome: | The proposed method predicts that the ratio of “*” related webpages in GPT-4o's training data is around 0.5%. |
Copied to clipboard
| Challenge: | Existing methods for Zero-shot Relational Learning depend on external knowledge, resulting in increased annotation costs and limited practical applicability. |
| Approach: | They propose a structure-aware paradigm that performs ZRL without external knowledge . it leverages intrinsic structural patterns in KGs to bridge semantic correlations for new relations with existing ones. |
| Outcome: | The proposed paradigm achieves 10.66% improvement in MRR while reducing annotation costs and enhancing practical applicability on three real-world benchmarks. |
Copied to clipboard
| Challenge: | Existing knowledge distillation methods investigate divergence measures but fail to deliver effective supervision when few distribution overlap exists between teacher and student. |
| Approach: | They propose a knowledge distillation method that exploits the Sinkhorn distance to ensure a nuanced assessment of the disparity between teacher and student distributions. |
| Outcome: | The proposed method outperforms state-of-the-art methods on all kinds of LLMs with encoder-only, encoder decoder, and decoded architectures. |
Copied to clipboard
| Challenge: | Existing methods to generate error-corrected sentence pairs for improving grammatical error correction are not available. |
| Approach: | They propose a method to generate error-corrected sentence pairs for improving grammatical error correction based on machine translation models of different qualities . |
| Outcome: | The proposed method can generate multiple error-corrected sentence pairs from Chinese to English text. |
Copied to clipboard
| Challenge: | Text classification is a primary task in natural language processing (NLP). |
| Approach: | They propose a graph neural network (HINT) that makes full use of hierarchical information contained in the text for the task of text classification. |
| Outcome: | The proposed method outperforms the state-of-the-art methods on popular benchmarks while having a simple structure and few parameters. |
Copied to clipboard
| Challenge: | Recent studies show that LLMs’ intrinsic self-correction fails without oracle labels as feedback. |
| Approach: | They propose to use one simple task and three complex tasks with state-of-the-art LLMs like ChatGPT, Llama, and DeepSeek to interpret LLM's intrinsic self-correction. |
| Outcome: | The proposed methods reveal the dark side of LLMs’ intrinsic self-correction for different tasks, especially for those failure cases. |
Copied to clipboard
| Challenge: | Existing models lack multimodal understanding capabilities, resulting in closed-source model that does not support multimodal interleaved sequences. |
| Approach: | They propose a foundation model built on multimodal tokens capable of understanding and generating speech, text, images, and videos in an end-to-end, autoregressive manner. |
| Outcome: | The proposed model is able to understand speech, text, images, and videos in an end-to-end, autoregressive manner. |
Copied to clipboard
| Challenge: | Recent studies have shown that the fine-tuning process improves performance on downstream tasks. |
| Approach: | They propose two new pre-training tasks to improve the model performance on downstream tasks. |
| Outcome: | The proposed model achieves state-of-the-art on a wide array of NLP tasks. |
Copied to clipboard
| Challenge: | Existing text infilling objectives for pretrained language models require self-supervision by masking out tokens or spans in text. |
| Approach: | They propose to extend text infilling to a self-supervised sequence-to-sequence (Seq2Sequen) task. |
| Outcome: | The proposed task improves the model's performance on various natural language generation tasks. |
Copied to clipboard
| Challenge: | Existing methods do not differentiate question difficulty when designing prompting methods for them. |
| Approach: | They propose an adaptive method to improve large language models for reasoning problems by measuring question difficulty and tailoring demonstration set construction and difficulty-adapted retrieval strategies. |
| Outcome: | The proposed method shows an absolute improvement of up to 5.5% on arithmetic reasoning, 7.4% on symbolic reasoning, and 2.3% on commonsense reasoning. |
Copied to clipboard
| Challenge: | High-quality data in training proactive dialogue agents is scarce, despite fine-tuning and reinforcement learning . a recent study has shown that the effectiveness of supervised fine-touring is limited by the lack of high-quality, domain-specific training data. |
| Approach: | They propose a framework for training recruitment proactive dialogue agents using a high-fidelity user simulator and a multi-dimensional evaluation framework based on Chain-of-Intention. |
| Outcome: | The proposed framework outperforms existing simulator-based data selection strategies in a real-world recruitment scenario. |
Copied to clipboard
| Challenge: | Existing studies on continual learning of a sequence of aspect sentiment classification tasks have not addressed these issues. |
| Approach: | They propose a capsule network based model called B-CL to address these issues . it uses continual learning adapters and capsule networks to encourage knowledge transfer . |
| Outcome: | The proposed model improves the performance on both the new task and the old tasks via forward and backward knowledge transfer. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable linguistic capabilities across tasks . however, there is a growing concern about their potential to perpetuate social biases . |
| Approach: | They evaluate LLMs across gender, racial, and religious bias types . they also explore cross-bias and multiple-biases attacks . |
| Outcome: | The proposed models are more susceptible to gender bias attacks than racial or religious biases. |
Copied to clipboard
| Challenge: | Existing methods for detoxification of toxic comments are limited by overcorrection and data scarcity . experimental results show that DID outperforms existing methods on academic data and an industrial platform . |
| Approach: | They propose a paradigm that adaptively conducts filtering or paraphrasing for each toxic comment based on its detoxifiability . they propose 'detoxifiabilities-aware detoxification' that can be trained to filter or paraphrase toxic comments based upon their detoxifikatability based only on detoxificable comments . |
| Outcome: | Experimental results show that DID outperforms existing methods on academic and industrial data. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have paved the way for complex tasks such as role-playing. |
| Approach: | They propose a framework to benchmark, elicit, and enhance role-playing abilities in Large Language Models. |
| Outcome: | The proposed framework improves role-playing abilities with 168,093 samples. |
Copied to clipboard
| Challenge: | Large language models extract useful information from conversation history to enhance the response in long-term conversations. |
| Approach: | They propose a Fragment-then-Compose framework to optimize memory utilization for long-term open-domain conversation. |
| Outcome: | The proposed framework can be used to extract useful information from conversation history . it can be adapted to different situations and improve response generation . |
Copied to clipboard
| Challenge: | DropHead is a structured dropout method for regularizing multi-head attention . DropHed drops entire attention heads during training to prevent overfitting . |
| Approach: | They propose a structured dropout method specifically designed for regularizing multi-head attention mechanism . DropHead drops entire attention heads during training to prevent overfitting . |
| Outcome: | The proposed method can improve transformer models by 0.9 BLEU score on translation task and around 1.0 accuracy for various text classification tasks. |
Copied to clipboard
| Challenge: | Prior studies have shown that EaaS can be prone to model extraction attacks, however, this concern could be mitigated by adding backdoor watermarks to the text embeddings. |
| Approach: | They propose a new method that removes backdoor watermarks while maintaining the high utility of embeddings. |
| Outcome: | The proposed approach increases the stealthiness of watermarks and has been empirically shown to be effective against CSE attacks. |
Copied to clipboard
| Challenge: | Recent studies show that attention-based models benefit from more focused attention over local regions. |
| Approach: | They propose a syntax-aware local attention which restrains attention over syntactically relevant words. |
| Outcome: | The proposed model performs better on all benchmark datasets, including sentence classification and sequence labeling tasks. |
Copied to clipboard
| Challenge: | Existing algorithms for supervised fine-tuning and reinforcement learning from human feedback (RLHF) do not constrain how hidden states move from a user prompt to an answer. |
| Approach: | They propose a topology-enhanced alignment framework that regularizes these trajectories using 0-dimensional persistent homology. |
| Outcome: | The proposed framework regularizes semantic trajectory in hidden space using 0-dimensional persistent homology. |
Copied to clipboard
| Challenge: | Experimental results show that ELECTRA pretrains a discriminator to detect replaced tokens . despite compelling performance, there is no direct feedback loop from discriminator and generator to generator, making replacements biased to correct tokens. |
| Approach: | They propose to augment sampling with a hardness prediction mechanism to encourage the discriminator to learn what it has not acquired. |
| Outcome: | The proposed method improves ELECTRA pre-training on various downstream tasks. |
Copied to clipboard
| Challenge: | Existing methods for relational triple extraction (RTE) are unnatural and recast RTE tasks to text-to-text prompting formats. |
| Approach: | They propose a tabular prompting for RTE which frames RTE task into a table generation task and propose an instructive in-context learning which only selects and annotates samples considering triple semantics in massive unlabeled samples. |
| Outcome: | The proposed prompting for RTE with TableIE achieves state-of-the-art performance compared to other methods . the proposed prompts are based on off-the shelf LLMs and are scalable to multiple scenarios . |
Copied to clipboard
| Challenge: | Automated interaction with graphical user interfaces (GUIs) is central to general artificial intelligence, but remains challenging within Super App ecosystems. |
| Approach: | They propose a framework synergizing autonomous data synthesis with dual-agent co-evolution . GUI0 establishes a domain-aware foundation model via synthesized corpora and employs curriculum-driven reinforcement learning . |
| Outcome: | The proposed framework outperforms Gemini-2.5-Pro and Claude-4-Sonnet in the SuperAPP benchmark and has universal efficacy across base models. |
Copied to clipboard
| Challenge: | Language model pre-training, such as BERT, has achieved strong performance in many NLP tasks. |
| Approach: | They propose to visualize loss landscapes and optimization trajectories of fine-tuning BERT on specific datasets. |
| Outcome: | The proposed model improves performance and generalization capability across tasks. |
Copied to clipboard
| Challenge: | Existing knowledge editing methods rely on strict orthogonal projection to preserve previously edited knowledge, but this constraint limits gradient expressiveness, resulting in degradation of model generalization and overall performance as the number of edits increases. |
| Approach: | They propose a method that leverages Singular Value Decomposition to identify critical gradient subspaces and introduces a dual mechanism comprising "accumulated importance" and "projection importance" |
| Outcome: | Extensive experiments on five mainstream LLMs show that the proposed method achieves an average comprehensive performance improvement of 10.36% and effectively maintains the model’s general capabilities on downstream tasks. |
Copied to clipboard
| Challenge: | Existing DA-training methods do not explicitly identify what knowledge should be preserved and what should be changed by the domain corpus. |
| Approach: | They propose to use an unlabeled corpus of aparticular domain to train a pre-trained general-purpose language model to adapt the LM so that end-tasks in the domain can give improved performances. |
| Outcome: | The proposed method improves the performance of pre-trained general-purpose language models by contrasting the representations of the general and the full (both general and domain knowledge) to learn an integrated representation with both general and specific knowledge. |
Copied to clipboard
| Challenge: | Current research focuses on the general news or financial domains, with relatively few studies for military domain. |
| Approach: | They propose to annotate Chinese military news events from documents using a schema for the military domain. |
| Outcome: | The proposed dataset is large-scale, document-level open-source for the military domain . it contains 17,000 documents and 29,223 events, which are all manually annotated . |
Copied to clipboard
| Challenge: | Existing dual-encoder methods in HTC achieve weak performance gains with huge memory overheads and their structure encoders heavily rely on domain knowledge. |
| Approach: | They propose a hierarchy-aware tree isomorphism network to enhance the text representations with only syntactic information of the label hierarchy. |
| Outcome: | The proposed model could boost the performance of hierarchical text classification without prior statistics or label semantics without prior data. |
Copied to clipboard
| Challenge: | Existing approaches to lexical substitution tend to overlook good substitute candidates that are not the synonyms of the target words in the lexicals and fail to take into account the substitution’s influence on the global context of the sentence. |
| Approach: | They propose an end-to-end BERT-based lexical substitution approach which proposes and validates substitute candidates without using annotated data or manually curated resources. |
| Outcome: | The proposed approach performs well in proposing and ranking substitute candidates, achieving the state-of-the-art results in both LS07 and LS14 benchmarks. |
Copied to clipboard
| Challenge: | Existing models with no effective open category data during training are limited by the lack of effective open categories data during the training stage. |
| Approach: | They propose an approach to generate effective open category samples in the training stage and without requiring prior knowledge or external datasets. |
| Outcome: | The proposed approach generates effective synthetic open category samples in the training stage and without requiring any prior knowledge or external datasets. |
Copied to clipboard
| Challenge: | Local sequence transduction tasks involve massive overlapping between source and target sequences . experimental results show that Pseudo-Bidirectional Decoding improves performance of standard seq2seq models. |
| Approach: | They propose a simple but versatile approach for local sequence transduction tasks . they propose to copy source tokens to decoder as pseudo future context . |
| Outcome: | The proposed approach improves the performance of standard seq2seq models on LST tasks. |
Copied to clipboard
| Challenge: | Existing parallel code localization agents suffer from a 34.9% redundant tool invocation rate . specialized localization agent that operate as dedicated search components is needed to achieve high localization accuracy. |
| Approach: | They propose a parallel code localization system that reframes parallel code execution as a quality–efficiency co-optimization problem. |
| Outcome: | The proposed method matches SOTA performance while being 93.6% faster. |