Papers by Hao Zhao
Copied to clipboard
| Challenge: | Large language models (LLMs) are trained on vast corpora that contain substantial knowledge but their outputs often contain confidently stated inaccuracies. |
| Approach: | They propose to encode truthfulness as a distinct linear feature, termed the "truth direction", which can classify truthfulness reliably. |
| Outcome: | The proposed model can generalize to logical transformations, question-answering tasks, in-context learning, and external knowledge sources. |
Copied to clipboard
| Challenge: | Existing approaches to RAG neglect system state variables, resulting in poor performance and erroneous knowledge accumulation. |
| Approach: | They propose a framework that incorporates a Turing Complete System to manage state variables and manage retrieval halting. |
| Outcome: | The proposed framework improves on seven real-world healthcare datasets and shows that it is more accurate than existing methods. |
Copied to clipboard
| Challenge: | Existing studies focus on language-agnostic settings, neglecting the inherently multilingual nature of modern software development. |
| Approach: | They propose a proportion-dependent scaling law that prioritizes high-utility languages . they propose PLs to have varying effects during pre-training that affect model performance . |
| Outcome: | The proposed scaling law is based on 1000+ experiments across multiple languages and models. |
Copied to clipboard
| Challenge: | Existing methods for event detection require predefined schemas, but manual defining is expensive and labor-intensive. |
| Approach: | They propose a task to achieve event clustering, hierarchy expansion and type naming . they propose 'neighbor Contrastive Clustering' module and a Hierarchy-Aware Linking module . |
| Outcome: | The proposed method outperforms baseline methods on three datasets. |
Copied to clipboard
| Challenge: | Adapter-tuning is a paradigm that transfers a pretrained language model to downstream tasks . Previously proposed adapters are all feed-forward neural networks . |
| Approach: | They propose to use tiny-attention attention with extremely small per-head dimensionality as adapters to modify hidden states at each position . they propose to average multiple attention heads' weights during deployment to reduce its inference computation cost. |
| Outcome: | The proposed adapter outperforms other adapter-tuning methods on the GLUE benchmark . it uses attention with extremely small per-head dimensionality to modify hidden states . |
Copied to clipboard
| Challenge: | Existing approaches to mathematical reasoning rely on static heuristics or pre-determined reasoning strategies. |
| Approach: | They propose an adaptive framework that integrates fuzzy theory into LLM-based mathematical reasoning. |
| Outcome: | The proposed framework outperforms state-of-the-art models while offering effective and interpretable diagnostics of intermediate problem-solving states. |
Copied to clipboard
| Challenge: | Existing methods for detecting multimedia fake news have demonstrated excellent results . however, addressing event-level inconsistency and learning from poor-quality news remains a challenge . |
| Approach: | They propose an Event-diven fake news detection framework that integrates visual manipulation, textual emotion and multimodal inconsistency at event-level for fake news identification. |
| Outcome: | The proposed framework performs well on three large-scale fake news detection benchmarks. |
Copied to clipboard
| Challenge: | Existing open-source models often yield only marginal overall improvements, possibly due to an overemphasis on mathematical reasoning at the expense of broader capabilities. |
| Approach: | They evaluate 12 multimodal tasks using 14 non-reasoning models and 8 reasoning models. |
| Outcome: | The proposed method is effective in multimodal reasoning tasks, the authors show . they show that it lacks the ability to maintain deep visual introspection throughout the reasoning process. |
Copied to clipboard
| Challenge: | extending grouping-based methods to agentic reasoning presents unique challenges . frequent environment interactions and tool invocations render intra-group advantage estimation unstable . |
| Approach: | They propose a grouping-based method that uses a single round of rollouts to stabilize advantage estimation. |
| Outcome: | a new RL framework outperforms grouping-based methods in retrieval tasks and advanced mathematical reasoning benchmarks. |
Copied to clipboard
| Challenge: | Existing models for multiparty dialogue question answering (QA) do not consider logical inference relations in multiparty dialogs, leading to suboptimal performance. |
| Approach: | They propose a memory network with logical inference for extractive QA in multiparty dialogues. |
| Outcome: | The proposed model achieves state-of-the-art on Molweni and FriendsQA benchmarks. |
Copied to clipboard
| Challenge: | Existing languages have syntactic representations of code to improve code intelligence, but they are difficult to learn from code. |
| Approach: | They propose to embed dynamic information of programs revealed by their test cases into feature representations of code as complements. |
| Outcome: | The proposed method yields 6%/19% mAP improvements over its masked language modeling counterparts. |
Copied to clipboard
| Challenge: | Recent research in mechanistic interpretability has revealed that Large Language models contain disentangled, human-understandable components. |
| Approach: | They propose a framework that first identifies causal task features through frequency recall and interventional filtering, then selects “Feature-Resonant Data” that maximally activates task features for fine-tuning. |
| Outcome: | The proposed framework outperforms existing models on mathematical reasoning, summarization, and translation tasks while using only 50% of the data. |
Copied to clipboard
| Challenge: | Existing benchmarks are poorly aligned with real-world code repositories and are insufficient to evaluate the coding abilities of Large Language Models (LLMs). |
| Approach: | They propose a repository-level benchmark named DevEval to evaluate LLMs' coding abilities in real-world code repositories. |
| Outcome: | The proposed benchmarks show that the LLMs perform better in real-world code repositories than existing benchmarks. |
Copied to clipboard
| Challenge: | Recent methods to discover evidence for explainable claim verification are nontransparent and unexplained. |
| Approach: | They propose a Decision Tree-based Co-Attention model to discover evidence for explainable claim verification using neural networks. |
| Outcome: | The proposed model boosts the F1-score by more than 3.11%, 2.41% on two public datasets. |
Copied to clipboard
| Challenge: | Rather than pursuing the reachless SOTA accuracy, researchers are focusing on model efficiency and usability. |
| Approach: | They propose an evaluation and a public leaderboard for efficient NLP models that depicts the Pareto Frontier for various language understanding tasks. |
| Outcome: | The proposed model outperforms or performs on par with SOTA compressed and early exiting models. |
Copied to clipboard
| Challenge: | Existing Large Language Models (LLMs) mainly address isolated tasks such as emotion analysis or stance detection. |
| Approach: | They propose a large-scale model that combines large-level annotations with hyperbolic space to model human cognitive states. |
| Outcome: | The proposed model outperforms baseline models on cognitive dimensions on single dimension tasks while retaining strong hierarchical structure. |
Copied to clipboard
| Challenge: | Recent advances have enabled Large Language Models (LLMs) to potentially exhibit reasoning capabilities, but complex logical reasoning remains a challenge. |
| Approach: | They propose a novel language model that internalizes and emulates the reasoning processes of logical solvers and avoids parsing errors by learning strict adherence to solver syntax and grammar. |
| Outcome: | The proposed model outperforms state-of-the-art solver-augmented language models and few-shot prompting methods on public deductive reasoning benchmarks. |
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) prompting and large language models (LLMs) have shown great potential in improving performance on challenging reasoning tasks. |
| Approach: | They propose a new metric which extends the concept of pointwise V-information to black-box models and quantifies label-relevant new information introduced by CoT prompting. |
| Outcome: | The proposed metric extends the concept of pointwise V-information to black-box models, quantifying label-relevant new information introduced by CoT prompting beyond pre-existing label information. |
Copied to clipboard
| Challenge: | Pre-trained speech Transformers in speech translation systems have facilitated state-of-the-art (SotA) results, but their computational cost is high. |
| Approach: | They propose a Reducer Adaptor block that could be seamlessly integrated within any Transformer-based speech encoding architecture. |
| Outcome: | The proposed Reducer Adaptor block outperforms the existing SotA architecture by an average of 0.68 BLEU score on 8 language pairs from Must-C. |
Copied to clipboard
| Challenge: | End-to-end automatic speech recognition systems struggle to recognize rare name entities such as personal names, organizations and terminologies that are not frequently encountered in the training data. |
| Approach: | They propose a convolutional neural network-based ASR system that performs open-vocabulary keyword-spotting before the decoder to match the features between the entities and the utterances. |
| Outcome: | The proposed system significantly improves mixed-error-rate (MER) and entity recall compared to the original Whisper model on three internal datasets and two publicly available datasets. |
Copied to clipboard
| Challenge: | Existing multi agent frameworks for large language models are brittle on code generation tasks. |
| Approach: | They propose a framework that brings pair programming to autonomous LLM collaboration. |
| Outcome: | Using PairCoder, large language models achieve better results on code generation tasks and reduce token usage by 40% to 70% on eight representative backbones. |
Copied to clipboard
| Challenge: | Existing work on integrating audio encoders with large language models (LLMs) has focused on semantic understanding tasks, but different tasks may require distinct features that emphasize either semantic or acoustic aspects. |
| Approach: | They propose to use a prompt-aware mixture to enhance the Speech LLM that uses multiple audio encoders to extract different features based on the prompt. |
| Outcome: | The proposed approach outperforms all single-encoder Speech LLMs on ASR, speaker number verification, and AC tasks. |
Copied to clipboard
| Challenge: | Existing medical reasoning datasets are limited in scale and typically rely on incomplete data. |
| Approach: | They propose to use ReasonMed to train medical reasoning models using a multi-agent generation, verification, and refinement pipeline. |
| Outcome: | The largest medical reasoning dataset to date surpasses the prior best sub-10B models by 4.17% and even exceeds LLaMA3.1-70B on PubMedQA by 4.60%. |
Copied to clipboard
| Challenge: | Text-Centric Visual Question Answering (TEC-VQA) is a text-centric visual task understanding tool. |
| Approach: | They introduce a benchmark that features human expert annotations across 9 languages . they prioritize the text in question-answer pairs while disregarding visual text in images . |
| Outcome: | The proposed benchmarks prioritize the text in question-answer pairs while disregarding visual text in images. |
Copied to clipboard
| Challenge: | Existing methods for enhancing performance through increased use of expert knowledge often result in diminishing sparsity during expert selection. |
| Approach: | They propose a framework that integrates the computational processes of MoE with the concept of knowledge transferring in multi-task learning. |
| Outcome: | The proposed framework outperforms existing methods under identical conditions concerning the number of experts. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is one of the most fundamental tasks in natural language processing. |
| Approach: | They propose a method which introduces a Named Entity Head (NEH) prediction task to SpanNER and performs multi-task learning together with task of span classification. |
| Outcome: | The proposed method improves the robustness of SpanNER in low resource scenarios on the CoNLL03, Few-NERD, GENIA and ACE05 benchmark datasets. |
Copied to clipboard
| Challenge: | Long-context inference is crucial for advancing large language models, but its prefill speed remains a bottleneck. |
| Approach: | They propose an efficient long-context inference framework that leverages multi-host approximate attention to enhance prefill speed. |
| Outcome: | The proposed framework achieves speedups of 9.2, 4.2, and 1.6 without any degradation in performance. |
Copied to clipboard
| Challenge: | Existing methods for query expansion lack corpus-specific knowledge and cost. |
| Approach: | They propose a query-query-document generation method that leverages large language models for mutual verification to produce diverse sub-queries and corresponding documents. |
| Outcome: | The proposed method is fully zero-shot and extensive experiments on three public benchmark datasets demonstrate its effectiveness over existing methods. |
Copied to clipboard
| Challenge: | Existing approaches for optimizing domain-level sampling strategies struggle with maintaining intra-domain consistency and accurately measuring domain impact. |
| Approach: | They propose to use a Fisher-Information Matrix-guided metric to measure domain impact to ensure intra-domain consistency and accuracy. |
| Outcome: | The proposed model achieves 3.4% higher average performance while maintaining comparable training efficiency. |
Copied to clipboard
| Challenge: | Existing methods for embedding knowledge graphs implicitly memorize relation rules to infer missing links, but they are difficult to memorize due to the inherent deficiencies of such implicit memorization strategy. |
| Approach: | They propose a vertical learning paradigm that allows to explicitly copy target information from related factual triples for more accurate prediction. |
| Outcome: | The proposed model improves generalization ability and makes distant link prediction significantly easier. |
Copied to clipboard
| Challenge: | Existing prompting methods struggle with complex tasks and reasoning stability, limiting their practical deployment. |
| Approach: | They propose a framework that adaptively balances reasoning accuracy and computational efficiency by employing a lightweight Derailer mechanism to assess reasoning stability and selectively triggers an advanced Rerailer verification process only when necessary. |
| Outcome: | The proposed framework achieves significant accuracy improvements (8-11%) while maintaining 2-3 times better efficiency than existing verification methods. |
Copied to clipboard
| Challenge: | a new study proposes a conversational search system that integrates product attributes and dialog with search . but it faces two real world challenges: imperfect product schema/knowledge and lack of training dialog data . |
| Approach: | They propose an end-to-end conversational search system that integrates search with text . they propose an utterance transfer approach that generates dialogue utterations from other domains . |
| Outcome: | The proposed system outperforms the best tested baseline in a conversational search dataset for online shopping. |
Copied to clipboard
| Challenge: | Existing multimodal machine translation methods often extract visual features using pre-trained models while learning text features from scratch, leading to representation imbalance. |
| Approach: | They propose a cross-modal VQA-augmented multimodal machine translation method . it aligns image-source text pairs and image-question text pairs through dual-text contrastive learning . |
| Outcome: | The proposed method outperforms state-of-the-art methods on multiple evaluation metrics. |
Copied to clipboard
| Challenge: | Existing knowledge-based VQA benchmarks focus on coarse-grained categories and simple reasoning over single entities. |
| Approach: | They propose a knowledge-based Visual Question Answering benchmark to enhance multimodality evaluation. |
| Outcome: | The proposed benchmark improves evaluation of multimodal large language models in fine-grained multimodal entity understanding and complex multihop reasoning. |
Copied to clipboard
| Challenge: | prevailing methods for machine translation are often hindered by misleading reward signals. |
| Approach: | They propose a framework that aligns large language models to human preferences . they propose 'M2PO' to correct the bias towards partial errors . |
| Outcome: | The proposed framework outperforms open-source models and achieves parity with proprietary models. |
Copied to clipboard
| Challenge: | Experience-driven self-evolution has emerged as a promising paradigm for improving the autonomy of large language model agents, yet its reliance on self-curated experience introduces underexplored safety risks. |
| Approach: | They investigate how experience accumulation and utilization in self-evolving agents affect safety performance across web-based and embodied environments. |
| Outcome: | The findings expose inherent limitations of current self-evolving agents and call for more principled strategies to ensure safe and reliable adaptation. |
Copied to clipboard
| Challenge: | Existing studies employ autoregressive translation (AT) methods to encode sentences . however, the AT methods struggle with error accumulation when the length of sentences increases. |
| Approach: | They propose a context-aware non-autoregressive framework with the sentence-aligned connectionist temporal classification loss for document-level neural machine translation. |
| Outcome: | The proposed framework achieves 46X speedup on three benchmarks compared to strong baselines. |
Copied to clipboard
| Challenge: | Existing approaches to integrate lexical knowledge into deep learning models are limited by large-scale dynamic lexicons. |
| Approach: | They propose a plug-in lexicon incorporation approach for BERT based sequence labeling tasks . they adopt word-agnostic tag embeddings to avoid re-training the representation . |
| Outcome: | The proposed framework achieves new SOTA even with large scale lexicons, the authors show . they adopt word-agnostic tag embeddings to avoid re-training the representation . |
Copied to clipboard
| Challenge: | Existing methods to learn adaptive retrieval for noisy documents lack prior filtering and may lead to the loss of crucial information. |
| Approach: | They propose a method to improve retrieval performance without prior filtering . they use LLMs self-generated synthetic data as training data without manual annotation . |
| Outcome: | The proposed method performs positive document mining based on factual consistency and uses LLMs self-generated synthetic data as training data without manual annotation. |
Copied to clipboard
| Challenge: | Existing methods for logical reasoning with large language models suffer from insufficient rule semantic grounding and weak rule application mechanisms. |
| Approach: | They propose a theory-of-mind driven neuro-symbolic reasoning framework that integrates natural language and symbolic representations throughout the reasoning process. |
| Outcome: | The proposed model surpasses state-of-the-art models in reasoning accuracy and flexibility. |
Copied to clipboard
| Challenge: | Existing slot filling models memorize inherent patterns of entities and contexts from training data. |
| Approach: | They propose a perturbed semantic structure awareness transferring method for slot filling models . they use two MLM-based training strategies to learn contextual semantic structure and word distribution . |
| Outcome: | The proposed method outperforms existing methods and gains strong generalization while preventing model from memorizing inherent patterns of entities and contexts. |
Copied to clipboard
| Challenge: | Existing research on personalized LLM agents focuses on the effectiveness of personalized responses. |
| Approach: | They propose a benchmark to quantify intent legitimation in personalized interactions . they propose 'detection-reflection' method that detects intent legititimation from internal representation space . |
| Outcome: | The proposed method reduces safety degradation by using internal representation space. |
Copied to clipboard
| Challenge: | Prior work focused on data preprocessing, focusing on filtering and cleaning data . a study aimed to improve fine-grained scheduling of data order in epochs . |
| Approach: | They propose a fine-grained scheduling method of data order in epochs to fill this gap . they define data difficulty based on relevance between data and model . |
| Outcome: | The proposed method improves on pre-training and small-scale fine-tuning experiments 2.4% over baselines. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly important for their intelligence evaluation. |
| Approach: | They propose a game theory-based evaluation platform that measures LLMs’ decision-making strategies and social behaviors in classic game-theoretic settings. |
| Outcome: | The proposed system cross-evaluates 15 leading LLMs using leaderboard rankings and scoring mechanisms. |
Copied to clipboard
| Challenge: | Simple question answering over knowledge bases is one of the most important natural language processing tasks. |
| Approach: | They propose to conduct pattern extraction and entity linking first and put forward pattern revising procedure to mitigate the error propagation problem. |
| Outcome: | The proposed method outperforms the current state-of-the-art in this task by an absolute large margin. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been successful in understanding language and processing text, but their cost prohibits their practical applications. |
| Approach: | They propose a multi-agent collaboration method that breaks down lengthy documents into smaller, more manageable chunks and organizes the member agents to read their assigned chunks. |
| Outcome: | The proposed method achieves 16.42% and 1.63% accuracy gains over existing models on single-hop and multi-hop QA settings. |
Copied to clipboard
| Challenge: | Existing methods for instruction data selection have limitations such as relying on fragile external APIs, being affected by biases in GPT models, or reducing the diversity of the selected instruction dataset. |
| Approach: | They propose an industrial-friendly, expert-aligned and diversity-preserved instruction data selection method: Clustering and Ranking (CaR). |
| Outcome: | The proposed method outperforms Alpaca's existing methods by 32.1% in GPT-4 evaluations. |
Copied to clipboard
| Challenge: | Existing models for multimodal sentiment analysis are limited in their capacity to be deployed in the real world. |
| Approach: | They propose a model that can dynamically refine erroneous sentiment words by leveraging multimodal sentiment clues. |
| Outcome: | The proposed model surpasses the state-of-the-art models on three datasets. |
Copied to clipboard
| Challenge: | Existing models for emotion understanding do not capture fundamental features of synthesized speech. |
| Approach: | They evaluate emotion recognition models on synthesized speech using SER models and generative models. |
| Outcome: | The proposed model can't generalize to synthesized speech because of speech token prediction . generative models tend to infer emotion from textual semantics while ignoring paralinguistic cues. |
Copied to clipboard
| Challenge: | Commercial-scale language models (LMs) have taken APR to unprecedented levels, but they are limited by parameters and humans interact with them through explicit prompts. |
| Approach: | They propose a method that utilizes process supervision to improve program repair by allowing users to input feedback from compilers and test cases. |
| Outcome: | The proposed method outperforms large outcome-based generation methods and is inspired by strategies used in programming competitions. |
Copied to clipboard
| Challenge: | Existing work on pretraining models for text classification uses image encoders instead of visual prompts. |
| Approach: | They propose a method to deploy large-scale pre-trained models in the prompt-tuning paradigm in few-shot learning. |
| Outcome: | The proposed method outperforms the most recent prompt-tuning methods on five public text classification datasets. |
Copied to clipboard
| Challenge: | Existing methods for emotion analysis in conversations ignore the specific semantic associations between emotions and cause utterances. |
| Approach: | They propose a position-oriented prompt-tuning model to solve the CEE task in an end-to-end manner. |
| Outcome: | The proposed model achieves state-of-the-art performance on a benchmark dataset. |
Copied to clipboard
| Challenge: | Neural machine translation models are weak enough for document-level translation . current models only translate sentences individually, resulting in poor document coherence . |
| Approach: | They propose to use the original Transformer model to test document-level neural machine translation . they find that the original transformer models can achieve strong results for document translation if trained properly . |
| Outcome: | The proposed model outperforms sentence-level models on nine datasets and two sentence- level datasets across six languages. |
Copied to clipboard
| Challenge: | Existing studies on LLM agents' social behaviors are lacking . previous studies focused on positive social behaviors, leaving research on negative social behaviors relatively scarce. |
| Approach: | They propose a framework that features a multi-agent system facilitating efficient communication and interaction with LLM agents. |
| Outcome: | The proposed framework is based on Avalon and evaluates on game success and analyzes agents’ social behaviors. |
Copied to clipboard
| Challenge: | Existing detectors for Large Language Models (LLMs) struggle to generalize in open-world settings. |
| Approach: | They propose a framework to detect LLM-generated text with exceptional generalization to unseen domains by reinforcing LLMs’ inherent rewriting tendencies. |
| Outcome: | The proposed framework outperforms state-of-the-art detection methods by 23.04% in AUROC, 35.10% for out-of distribution tests, and 48.66% under adversarial attacks. |
Copied to clipboard
| Challenge: | Existing approaches to solve large language models address stereotypical and structural biases in isolation . however, prior paradigms address these in isolation, often at the expense of exacerbating the other . |
| Approach: | They propose a framework to tackle latent spurious feature correlations within input that drive erroneous reasoning shortcuts. |
| Outcome: | The proposed framework mitigates stereotypical and structural biases while preserving robust general reasoning capabilities. |
Copied to clipboard
| Challenge: | Existing 3D AIGC methods don’t fully unleash human creativity. |
| Approach: | They propose a framework that generates 3D content from multimodal inputs . they propose 198 multimodal text inputs for 3D generation tasks . |
| Outcome: | The proposed framework generates 3D content from multimodal inputs without human intervention. |
Copied to clipboard
| Challenge: | Existing methods for parameter pruning fail to utilize the knowledge from pruned parameters. |
| Approach: | They propose a method that uses manifold learning and the Information Bottleneck measure to merge similar layers to preserve model performance. |
| Outcome: | The proposed method outperforms pruning methods on multiple datasets and LLMs with quantization and achieves substantial compression ratios. |
Copied to clipboard
| Challenge: | Existing methods for long-video inference use compression or sparse attention . existing methods restrict LMMs from handling longer, more complex videos . |
| Approach: | They propose a sequence-parallel framework with optimized attention that accelerates long-video inference across multiple GPUs. |
| Outcome: | The proposed framework delivers speedups of 12.72x, 1.70x, and 1.18x over FlashAttn, ZigZagRing, and APB without significant performance loss. |
Copied to clipboard
| Challenge: | Multimodal Machine Translation (MMT) is effective in resolving linguistic ambiguities, but visual information often introduces redundancy or noise, potentially impairing translation quality. |
| Approach: | They propose a semantic-augmented framework that integrates "Imagination" and "Contemplation" they first generate synthetic images from source text and align them with authentic images via an optimal transport loss . |
| Outcome: | The proposed framework outperforms baselines on translation datasets with visually ambiguous or weakly correlated content. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) based agent systems have made great strides in real-world applications beyond traditional NLP tasks. |
| Approach: | They propose a new LLM-based Multi-Agent System benchmark, Collab-Overcooked, built on the popular Overcooked-AI game with more applicable and challenging tasks in interactive environments. |
| Outcome: | The proposed benchmark provides a multi-agent framework supporting diverse tasks and objectives and encourages collaboration through natural language communication. |
Copied to clipboard
| Challenge: | Speculative sampling is an efficient way to accelerate the auto-regressive generation process of large language models. |
| Approach: | They propose a frequency-ranked speculative sampling framework that optimizes draft candidate selection through vocabulary space compression. |
| Outcome: | Experiments show that FR-Spec reduces LM Head computation overhead by 75% while ensuring the equivalence of the final output distribution. |
Copied to clipboard
| Challenge: | Existing methods to mix data with LLMs have relied on domain definitions derived from intuition. |
| Approach: | They propose a reweighting framework that restructures data scheduling as a graph-constrained optimization problem. |
| Outcome: | The proposed framework achieves competitive performance on GPT-2 models. |
Copied to clipboard
| Challenge: | Document-level context is crucial for speech translation due to noise from ASR . incorporating document-level contextual information into ST remains a challenge . |
| Approach: | They develop an online framework that integrates document-level context into machine translation . they use document-based modules to integrate document- level context into ST . |
| Outcome: | The proposed framework outperforms baselines in sentence and discourse metrics . it can correct ASR transcription errors and improve translation performance . |
Copied to clipboard
| Challenge: | Current retrieval models focus on natural text-image retrieval, which is insufficient for STEM education contexts due to ambiguities in the retrieval process. |
| Approach: | They propose a diverse expression retrieval task tailored to educational scenarios . they extract query style features as prototypes and build a continuously updated Prompt Bank . |
| Outcome: | The proposed model outperforms existing retrieval models in most retrieval tasks. |
Copied to clipboard
| Challenge: | Prior research has focused on optimizing general-purpose large language models to downstream tasks . however, these approaches inherently introduce data dependency, which hinders generalization and reusability. |
| Approach: | They propose an algorithm that localizes the most task-sensitive attention heads and prunes by restricting attention training updates to these heads, thereby reducing alignment costs. |
| Outcome: | The proposed algorithm achieves 2% performance improvement over baselines on three tasks while localizing the most task-sensitive attention heads. |
Copied to clipboard
| Challenge: | Existing models focus on utilizing semantic information in the image but ignore using visual emotional cues. |
| Approach: | They propose a face-sensitive image-to-emotional-text translation method that captures visual emotional cues through facial expressions and selectively matches and fuses with the textual content. |
| Outcome: | The proposed method achieves state-of-the-art results on the Twitter-2015 and Twitter-2017 datasets. |
Copied to clipboard
| Challenge: | Mobile GUI agents show promise in automating tasks but face significant generalization challenges in long-tail scenarios. |
| Approach: | They propose a benchmark framework for mobile GUI agents that measures the performance of GUI agents by analyzing their performance. |
| Outcome: | The LearnGUI benchmark outperforms existing methods in offline and online evaluations and demonstrates consistent gains across model architectures. |
Copied to clipboard
| Challenge: | Existing multi-objective preference alignment methods for large language models face limitations such as auxiliary reward/reference models and computational complexity. |
| Approach: | They propose a framework that achieves dynamic balance across preference dimensions by using dimension-aware generation metrics as implicit rewards. |
| Outcome: | Empirical results show that AMoPO outperforms state-of-the-art methods by 28.5% . |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have revolutionized various fields, yet their training efficiency is heavily reliant on effective data curation. |
| Approach: | They propose to reuse pre-computed sample-level scores originally generated for data efficiency and introduce two new data ordering methods to improve LLM training. |
| Outcome: | The proposed methods improve the stability and performance of LLM training. |
Copied to clipboard
| Challenge: | E-Bench is a framework for easy-to-use research on large language models. |
| Approach: | They propose to evaluate the ease-of-use of large language models and construct an E-Bench . they simulate human use from synonymous and typographical perturbations . |
| Outcome: | The proposed model is able to resist synonymous expressions and typos and improves performance. |
Copied to clipboard
| Challenge: | Syntactic language models (SLMs) incorporate syntactical biases into Transformers . authors identify key aspects of design choices in existing models and novel variants based on experimental results . |
| Approach: | They propose a framework that incorporates existing and new SLMs to enhance Transformers by incorporating syntactic biases. |
| Outcome: | The proposed framework improves on existing models and novel variants across language modeling, syntactic generalization, summarization, and inference efficiency. |
Copied to clipboard
| Challenge: | Existing methods for jailbreaking large language models rely on laborious human engineering and whitebox access to model internals. |
| Approach: | They propose a method that instructs large language models to deviate from prior context and generate harmful outputs by instructing them to deviat from previous attacks. |
| Outcome: | The proposed method achieves a 62.83% higher success rate in compromising ten leading chatbots, while using only 12.9% of the queries. |
Copied to clipboard
| Challenge: | Existing LLMs are opaque and difficult to interpret, resulting in limited interpretability. |
| Approach: | They propose an interaction-aware profile generator that jointly produces user and item profiles conditioned on both user history and item evidence. |
| Outcome: | The proposed model outperforms baselines on three real-world datasets. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is a key parameter-efficient fine-tuning method . however, its effectiveness is hampered by semantic drift and structural incoherence . |
| Approach: | They propose a low-rank Adaptation framework that tackles semantic drift and structural incoherence by pruning task-irrelevant directions. |
| Outcome: | Experiments on large language models, vision models, and vision models show that the proposed framework outperforms LoRA and advanced dynamic rank allocation and sparsity-based methods. |
Copied to clipboard
| Challenge: | Existing machine translation metrics have poor correlations with human assessments . entropy-based evaluations are often limited to a limited number of samples . |
| Approach: | They propose a fast and unsupervised approach to enhance machine translation metrics using entropy by introducing sentence-level difficulty. |
| Outcome: | The proposed method outperforms existing metrics on five sub-tracks in the WMT19 Metrics shared tasks. |
Copied to clipboard
| Challenge: | Existing keyphrase extraction methods struggle with document and candidate length discrepancies or fail to fully utilize the pre-trained language model without further fine-tuning. |
| Approach: | They propose an unsupervised keyphrase extraction approach that uses a pre-trained language model to rank candidates based on document embeddings. |
| Outcome: | The proposed approach outperforms the existing keyphrase extraction approach on six benchmarks. |
Copied to clipboard
| Challenge: | Existing unified optimization strategies overlook the statistical conflict between these distinct gradient signals. |
| Approach: | They propose a framework to reduce bias-variance trade-offs in Large Language Models . they propose DYPO, which leverages intrinsic group dynamics to significantly reduce RL gradient variance . |
| Outcome: | The proposed framework outperforms traditional pipelines on reasoning benchmarks and out-of-distribution tasks. |
Copied to clipboard
| Challenge: | Existing approaches to verify agent behaviors in complex environments rely on rule-based verifiers or LLM-as-a-Judge models. |
| Approach: | They propose a benchmark to evaluate Agent-as-a-Judge across three domains . the benchmark covers search, data systems, and graphical user interfaces - with 155 tasks and 516 trajectories . |
| Outcome: | The proposed benchmark outperforms existing benchmarks in search, data systems, and GUI domains while revealing open challenges in agent-based verification. |
Copied to clipboard
| Challenge: | Existing intent detection models can only handle predefined intent classes in the offline environment. |
| Approach: | They propose a method that continually learns new intent classes from new data . structure-based retrospection and contrastive knowledge distillation are used to solve these problems . |
| Outcome: | The proposed method outperforms existing models on three benchmarks. |
Copied to clipboard
| Challenge: | Existing inference optimizations for coarse-grained Mixture-of-Experts models implicitly assume a fixed activation budget, which is poorly understood. |
| Approach: | They propose a training-free policy that adapts token-level activation using router confidence and entropy while remaining within the model’s original budget. |
| Outcome: | The proposed skipping policy can provide substantial throughput gains, but optimal static schedules vary significantly across models and routing mechanisms. |
Copied to clipboard
| Challenge: | Concatenating large language models are adapted to context-aware neural machine translation in a concatenated way . a recent paradigm shift has been witnessed in discourse-related challenges such as zero pronoun translation . |
| Approach: | They propose an alternative adaptation approach to make large language models discriminately model and utilize inter- and intra-sentence contexts. |
| Outcome: | The proposed approach outperforms concatenation mode and improves performance in discourse modeling. |
Copied to clipboard
| Challenge: | Shortcuts such as APIs and deep-links have emerged as efficient complements to flexible GUI operations, but systematic evaluation of GUI–shortcut hybrid agents remains underexplored. |
| Approach: | They propose a benchmark that evaluates GUI-shortcut hybrid agents with a specific focus on the mobile domain. |
| Outcome: | MAS-Bench evaluates agent's ability to generate shortcuts by discovering and creating reusable, low-cost workflows. |
Copied to clipboard
| Challenge: | Event extraction (EE) is an essential task of information extraction, which aims to extract structured event information from unstructured text. |
| Approach: | They propose a tagging scheme and a model to form EE as word-word relation recognition using parallel grid tapping. |
| Outcome: | The proposed model achieves state-of-the-art on 3 overlapped and nested EE benchmarks and faster than baselines. |
Copied to clipboard
| Challenge: | Large reasoning models (LRMs) incur excessive computational overhead due to redundant reasoning, especially on simple tasks. |
| Approach: | They propose an Adaptive Self-Recovery Reasoning framework that suppresses unnecessary reasoning and enables implicit recovery. |
| Outcome: | The proposed framework suppresses unnecessary reasoning and enables implicit recovery. |
Copied to clipboard
| Challenge: | Existing methods of peer review analysis do not address multivariate nature of the process, account for latent variables, and are constrained by privacy concerns due to the sensitive nature of data. |
| Approach: | They propose a large language model based peer review simulation framework which effectively disentangles the impacts of multiple latent factors and addresses the privacy issue. |
| Outcome: | The proposed framework disentangles the impacts of multiple latent factors and addresses privacy concerns. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are gaining popularity as scalable tools for mental health support . however, nearly half of individuals do not receive timely support due to limited selfawareness or reluctance to seek help. |
| Approach: | They propose a proactive emotional support framework that leverages principles of active listening to uncover implicit user needs. |
| Outcome: | The proposed model elicits implicit emotional needs and delivers empathetic support compared to baselines . |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained language models are limited to low-data regimes and require learning different modules to adapt to diverse tasks. |
| Approach: | They propose a framework for parameter-efficient fine-tuning that trains modules per task . they use an instance-dense retriever and a prototypical hypernetwork to generate conditional modules . |
| Outcome: | The proposed framework outperforms existing methods on multi-task learning and few-shot transfer learning. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) highlight an important shift from the “System 1” way of quick reactions to the “system 2” style of reflection-and-correction problem solving. |
| Approach: | They propose a logic-puzzle benchmark for systematic evaluation of large language models' reasoning capabilities that decomposes each puzzle into atomic steps. |
| Outcome: | The proposed model improves on state checking and state transition tasks and demonstrates gains in reasoning by up to 5.1%. |
Copied to clipboard
| Challenge: | Existing methods for jailbreaking LLMs are implemented by binding backdoors to predefined phrases as first few output tokens, inducing the LLM’s next-token prediction to produce continuous responses. |
| Approach: | They propose a model editing-based jailbreak backdoor attack that hijacks LLM representations into a acceptance domain rather than binding to a few output tokens. |
| Outcome: | The proposed model editing method outperforms existing methods, showing stronger jailbreak capabilities across LLMs and datasets. |
Copied to clipboard
| Challenge: | Existing methods for predicting judgment results for multiple defendants are ineffective. |
| Approach: | They propose a method to predict the judgment results for each defendant in multi-defendant cases . they formalize the multi-diffendant judgment process as hierarchical reasoning chains . |
| Outcome: | The proposed method can predict the judgment results for multiple defendants in multi-defendant cases. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have improved search engines and recommendation systems through their text understanding capabilities. |
| Approach: | They propose a token-level proximal policy optimization approach to empower LLMs to perform better in query generation through fine-tuning. |
| Outcome: | The proposed approach outperforms existing LLMs on an open-source and industrial dataset. |
Copied to clipboard
| Challenge: | Existing methods for detecting hallucinations are confounded by epistemic uncertainty and cannot distinguish genuine uncertainty from fabricated content. |
| Approach: | They propose a model-agnostic metric that captures epistemic boundary deviations by measuring answer-level stability across multiple stochastic forward passes. |
| Outcome: | The proposed metric outperforms strong uncertainty-only baselines and can be used to detect hallucinations on open-domain question answering, dialogue generation, and code completion. |
Copied to clipboard
| Challenge: | Existing methods to detect depression from social media posting history are limited by frozen screening models and lack of learning. |
| Approach: | They propose to use a frozen screening model to train a risky post detection model with psychiatric scales to enable a learnable end-to-end learning process. |
| Outcome: | The proposed model outperforms several strong baseline methods and qualitative analysis confirms that it better captures users’ mental states than others. |
Copied to clipboard
| Challenge: | Semantic understanding of programs has attracted great attention in the community . large language models (LLMs) are capable of learning contextual information from data at scale . |
| Approach: | They propose to incorporate a relationship between inputs and possible outputs into learning for achieving a deeper semantic understanding of programs. |
| Outcome: | The proposed method outperforms current state-of-the-art on two programming tasks and outperformed current state of the art by large margins. |
Copied to clipboard
| Challenge: | Recent years have witnessed a paradigm shift in natural language processing, driven by large language models such as GPT-3, PaLM, and Llama. |
| Approach: | They propose a strategy for role-play prompting and assess its performance under the zero-shot setting. |
| Outcome: | The proposed method outperforms the standard zero-shot prompting approach across 12 reasoning benchmarks. |
Copied to clipboard
| Challenge: | Existing approaches treat tool use as a problem of prompt design, API documents specification, or supervised or unsupervised alignment. |
| Approach: | They propose a knowledge-augmented tool execution framework that integrates experiential knowledge with reasoning-width-expanded inference and knowledge-aware training. |
| Outcome: | The proposed framework improves on BFCL-V3 and AppWorld on three model scales. |
Copied to clipboard
| Challenge: | Recent advances in reinforcement learning (RL) have enhanced the reasoning abilities of large language models, but the impact on multimodal LLMs is limited. |
| Approach: | They propose a two-stage RL framework that enhances visual perception and fosters reasoning capabilities. |
| Outcome: | The proposed framework improves geometric reasoning by 9.7% and problem-solving by 9.1% compared to direct reasoning training approach. |
Copied to clipboard
| Challenge: | Existing studies on event schema induction have been hindered by errors and data quality issues. |
| Approach: | They propose a knowledge-enriched discrete diffusion model that distills event scenario knowledge from LLMs. |
| Outcome: | The proposed model achieves outstanding performance across evaluation metrics. |
Copied to clipboard
| Challenge: | Currently, Supervised Fine-Tuning (SFT) is the prevailing method for equipping Large Language Models (LLMs) with function calling capabilities, but its effectiveness is often compromised by two challenges: 1) lengthy Chain-of-Thought (CoT) reasoning tokens dominate training signals over concise function calls in the learning objective; 2) scarcity of hard training examples. |
| Approach: | They propose a framework that uses a self-adjusted signal balancing loss and a hard data re-sampling strategy to selectively generate new, high-quality complex data guided by model errors. |
| Outcome: | The proposed framework surpasses state-of-the-art models like GPT-5 in function calling performance. |
Copied to clipboard
| Challenge: | Existing domain-specific code benchmarks focus on assessing what knowledge LLMs possess rather than how they acquire and apply new knowledge. |
| Approach: | They propose a benchmark to evaluate domain specialization methods in real-world software development. |
| Outcome: | KOCO-bench is a new benchmark for evaluating domain specialization methods in real-world software development. |
Copied to clipboard
| Challenge: | Recent studies have shown that unsupervised bilingual lexicon induction is even on par with supervised methods. |
| Approach: | They propose a relaxed matching procedure to find a more precise matching between two languages by aligning source and target embedding space bidirectionally. |
| Outcome: | The proposed method significantly outperforms previous unsupervised methods on standard benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have high computational costs and privacy concerns due to their high computational expenses and data privacy. |
| Approach: | They propose a method that empowers SLMs to internalize symbolic knowledge and few-shot examples gradually through a progressive fine-tuning process. |
| Outcome: | The proposed approach outperforms state-of-the-art baselines by over 5% while reducing inference costs by up to 4 across a wide range of SLMs in both in-domain (ID) and out-of domain (OOD) tasks. |
Copied to clipboard
| Challenge: | Existing studies rely on deep graph neural networks (GNNs) to capture rich structural information, but they lack the structural information needed for QA. |
| Approach: | They propose a framework which captures structural information from KBs and models long-distance node relations from two perspectives. |
| Outcome: | The proposed framework models long-distance node relations from two perspectives . it is based on two widely used multi-hop KBQA datasets . |
Copied to clipboard
| Challenge: | Current systems often fall short of this goal in settings where translation hinges on culturally grounded entities such as books, films, places, songs and idioms. |
| Approach: | They propose a framework that anchors supervision on a verifiable, entity-level reward signal and incorporates lightweight structural gates to stabilize optimization. |
| Outcome: | The proposed framework improves on XC-Translate and shows that it can learn a robust reasoning process rather than imitating reference translations. |
Copied to clipboard
| Challenge: | Existing approaches to multi-hop question answering emphasize single-step and multi-step iterative decomposition or retrieval, which are susceptible to failure in long-chain reasoning due to the progressive accumulation of erroneous information. |
| Approach: | They propose a Local-tO-Global optimized retrieval method to discover more beneficial information and improve tuplet objective loss. |
| Outcome: | The proposed method outperforms state-of-the-art models and significantly improves multi-hop reasoning. |
Copied to clipboard
| Challenge: | Apertus is a fully open suite of large language models (LLMs) designed to address responsibility shortcomings in today’s open model ecosystem, namely data responsibility and global representation. |
| Approach: | They propose to release a fully open suite of large language models (LLMs) that address data responsibility and global representation shortcomings in today’s open model ecosystem. |
| Outcome: | The proposed model is pretrained on openly available data and suppresses verbatim recall of data while retaining task performance. |
Copied to clipboard
| Challenge: | Mixture-of-Experts (MoE) scales capacity via conditional computation, but lacks knowledge lookup primitive. |
| Approach: | They propose a conditional memory instantiated via Deep Sparse Embedding (DSE) they propose 'u-shaped scaling law' that identifies optimal balance between MoE experts and DSE memory . |
| Outcome: | The proposed model outperforms an iso-parameter and isoFLOPs MoE baseline across knowledge and reasoning benchmarks and is infrastructure-efficient. |
Copied to clipboard
| Challenge: | Using time-sync comments, it is difficult to understand user behavior due to complexity of interactions between users, videos, and comments. |
| Approach: | They propose a novel time-sync comment behavior prediction model that takes historical behavior into account and optimizes it on the basis of user preferences. |
| Outcome: | The proposed model improves the performance of time-sync comments on visual frames and textual comments on two cats playing simultaneously. |
Copied to clipboard
| Challenge: | Low-resource language tokens are often routed to different experts than those activated by high-resourced inputs, which hinders their efficacy in multilingual contexts. |
| Approach: | They propose a framework to transfer specialized capabilities from high-resource languages as anchors to low-resourced languages by using a symmetric Jensen-Shannon constraint. |
| Outcome: | The proposed framework outperforms standard instruction tuning on 5 low-resource languages and 3 benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly being adopted across various domains where they help to make choices. |
| Approach: | They construct a virtual QA platform that includes three different experimental conditions, with four models from GPT and Llama series participating in repeated experiments. |
| Outcome: | The proposed model includes three experimental conditions and four models from GPT and Llama series. |
Copied to clipboard
| Challenge: | Large language models (LLMs) face factual hallucination and knowledge obsolescence when tackling knowledge-intensive tasks. |
| Approach: | They propose a layer-knowledge guided attention method which harnesses the layer-wise knowledge of large language models to optimize per-layer attention on useful passages. |
| Outcome: | The proposed method outperforms existing methods on RALM benchmarks. |
Copied to clipboard
| Challenge: | Recent research focuses on integrating reasoning capabilities into the realm of retrieval-augmented generation (RAG) via outcome-supervised reinforcement learning (RL). |
| Approach: | They propose a process-level reward module to mitigate the unawareness of intermediate reasoning steps in outcome-level supervision without additional annotation. |
| Outcome: | The proposed framework can boost LLMs’ reasoning ability by integrating external knowledge sources through retrieval-augmented generation (RAG) The proposed model can mitigate the unawareness of intermediate reasoning steps in outcome-level supervision without additional annotation. |
Copied to clipboard
| Challenge: | Pre-trained speech encoders have facilitated great success across various speech processing tasks, but fine-tuning them for downstream tasks requires large training data to converge or to achieve state-of-the-art. |
| Approach: | They propose to rewire pre-trained speech encoders to improve their representation space without task-specific labels by neutrally synthesising audio inputs and frame masking. |
| Outcome: | The proposed model shows consistent improvement in isotropy in the representation space on 6 speech processing tasks. |
Copied to clipboard
| Challenge: | Document-level relation extraction is a challenging task as it requires reasoning across multiple sentences. |
| Approach: | They propose to use a recommend-revise scheme to reduce the workload of annotators by providing them with candidate relation instances from distant supervision to supplement and remove relational facts. |
| Outcome: | The proposed dataset is the first large-scale and human-annotated dataset for relation extraction. |
Copied to clipboard
| Challenge: | Evaluating 52 LLMs reveals that only the strongest models maintain robust performance under increasing context lengths and format diversity. |
| Approach: | They propose a benchmark for evaluating long-context reasoning over semi-structured tables across diverse formats, tasks, and domains. |
| Outcome: | The proposed model outperforms compression-based approaches on tasks requiring semantic integration. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly deployed in security-sensitive applications . recent defenses rely on supervised fine-tuning with benign and malicious labels . position bias arises when benign content placed later in a prompt is rejected at much higher rates . |
| Approach: | They analyze three recurring shortcut behaviors induced by supervised fine-tuning . position bias arises when benign content placed later in a prompt is rejected . token trigger bias occurs when strings common in attack data raise rejection probability . |
| Outcome: | The proposed model overrides intended logic when adversarial instructions appear . the proposed model has low rejection rates but narrow correlations in defense data . |
Copied to clipboard
| Challenge: | Existing VSD work focuses on skewed spatial understanding of target objects . Existing work merely models the 2D geometrical vision features . |
| Approach: | They propose to incorporate 3D scene features into visual spatial description tasks by sampling topologically-diverse subgraphs from Go3D-S2G. |
| Outcome: | The proposed framework outperforms baselines on two VSD datasets and produces more spatially-diversified generation. |
Copied to clipboard
| Challenge: | Continual Learning (CL) for Large Language Models faces a fundamental Stability-Plasticity Dilemma . Rank-Blindness enforces a single rank constraint across diverse tasks, leading to catastrophic forgetting of earlier tasks and underfitting on complex new ones. |
| Approach: | They propose a rank-spectrum-based rehearsal-free framework that explicitly disentangles knowledge into two orthogonal subspaces. |
| Outcome: | The proposed framework achieves a superior stability-plasticity balance compared to single-rank baselines. |
Copied to clipboard
| Challenge: | Existing approaches focus on information processing and strategy selection, overlooking the significance of persuasive communication in social deduction games. |
| Approach: | They propose a reinforcement learning framework that trains agents to optimize influential utterances for persuasive impact by formalizing turn-based dialogue as a Stackelberg competition . |
| Outcome: | The proposed framework outperforms baselines across four social deduction benchmarks and shows that it is effective in persuasive communication. |
Copied to clipboard
| Challenge: | Existing approaches to slot filling only learn surface mapping of slot types between D S and D T and get poor generalization capability or robustness. |
| Approach: | They propose a generative zero-shot prompt learning framework for cross-domain slot filling which improves generalization and robustness than previous work. |
| Outcome: | The proposed framework improves generalization and robustness on unseen slots and an efficient prompt tuning strategy boosts performance. |
Copied to clipboard
| Challenge: | Existing semisupervised methods do not fully utilize the knowledge hidden in annotated and nonannotated data, which hinders further improvement of their performance. |
| Approach: | They propose a semi-supervised BLI framework to encourage interaction between supervised signal and unsupervised alignment. |
| Outcome: | The proposed framework can incorporate any supervised and unsupervised BLI methods based on optimal transport and bi-directional lexicon update. |
Copied to clipboard
| Challenge: | Personalized tool utilization is essential for aligning large language models (LLMs) with user preference in interaction scenarios with various tools. |
| Approach: | They propose a key-point-based LLM evaluation method that mitigates biases by manually annotating key points for each test case and providing them to LLM as the reference. |
| Outcome: | The proposed method mitigates biases in the LLM-as-a-judge system by manually annotating key points for each test case and providing them to LLM as the reference. |
Copied to clipboard
| Challenge: | Existing methods to train dense passage retrieval have a large data gap between upstream and downstream relevance. |
| Approach: | They propose a method to pre-train the dense retriever with the text relevance induced by hyperlinks within Web documents. |
| Outcome: | The proposed method outperforms existing methods under different scenarios and in the open-domain question answering domain. |
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) prompting significantly enhances model reasoning, yet its internal mechanisms remain poorly understood. |
| Approach: | They reversely traced information flow across decoding, projection, and activation phases and found that CoT may serve as a decoding space pruner . |
| Outcome: | The proposed framework can be used to design more efficient and robust prompts. |
Copied to clipboard
| Challenge: | Multimodal machine translation (MMT) models focus on intermodal interactions, but focus on simple interactions between nouns and entities in image, overlooking global semantic alignment. |
| Approach: | They propose a Text-Image In-depth Questioning method to deepen interactions and optimize translations by utilizing visual data to capture global semantic alignment. |
| Outcome: | The proposed method achieves state-of-the-art results on five translation directions of Multi30K and AmbigCaps, with +2.35 BLEU on the challenging MSCOCO benchmark. |
Copied to clipboard
| Challenge: | Existing methods for instruction tuning rely on expensive human-annotated seed data or powerful external teacher models. |
| Approach: | They propose a framework that achieves fully seed-free instruction tuning by employing a dual self-training loop where two models are bootstrapped solely from raw, unlabeled text. |
| Outcome: | The proposed framework outperforms seed-driven back-translation baselines and achieves comparable performance to strongly supervised methods. |