Papers by Ke Chen

55 papers
SkipBERT: Efficient Inference with Shallow Layer Skipping (2022.acl-long)

Copied to clipboard

Challenge: Pre-trained language models have significant demands in computation and inference time, limiting their use in resource-constrained or latencysensitive applications.
Approach: They propose to encode text chunks into independent representations and skip computation of shallow layers to accelerate inference.
Outcome: The proposed approach can reduce latency by 65% without sacrificing performance.
Efficient Inference for Large Vision-Language Models: Bottlenecks, Techniques, and Prospects (2026.findings-acl)

Copied to clipboard

Challenge: Large Vision-Language Models are hindered by a systemic efficiency barrier known as visual token dominance.
Approach: They propose a systematic taxonomy of efficiency techniques structured around the inference lifecycle . they examine visual encoding, prefilling, and decoding to understand bottlenecks .
Outcome: The proposed techniques reveal how upstream decisions dictate downstream bottlenecks . the proposed techniques include hybrid compression and modality-aware decoding .
P-INT: A Path-based Interaction Model for Few-shot Knowledge Graph Completion (2021.findings-emnlp)

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.
Magnet: Multi-turn Tool-use Data Synthesis and Distillation via Graph Translation (2025.acl-long)

Copied to clipboard

Challenge: Large language models have been shown to be effective in multi-turn interactions . however, their performance may be limited in complex, multi-turned interactions involving users and multiple tools.
Approach: They propose a framework for synthesizing high-quality training trajectories to enhance the function calling capability of large language model agents in multi-turn conversations with humans.
Outcome: The proposed model outperforms the teacher model by 68.01 on BFCL-v3 and 73.30 on ToolQuery.
Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for accelerating Large Language Models have been criticized for their inference costs and inefficient decoding.
Approach: They propose a self-speculative decoding approach for accelerating Large Language Models without an auxiliary model.
Outcome: The proposed method achieves a speedup of up to 1.99 with no additional neural network training and no extra memory footprint.
VoiceTextBlender: Augmenting Large Language Models with Speech Capabilities via Single-Stage Joint Speech-Text Supervised Fine-Tuning (2025.naacl-long)

Copied to clipboard

Challenge: Recent studies have augmented large language models (LLMs) with speech capabilities, leading to the development of speech language models.
Approach: They propose a single-stage joint speech-text SFT approach for training SpeechLMs . their model combines text-only SFT data with three types of speech-related data .
Outcome: The proposed model outperforms previous SpeechLMs on speech-based QA tasks while maintaining original speech-only capabilities.
TS-Align: A Teacher-Student Collaborative Framework for Scalable Iterative Finetuning of Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Mainstream approaches to aligning large language models heavily rely on human preference data.
Approach: They propose a framework that fine-tunes a policy model using pairwise feedback data automatically mined from its outputs.
Outcome: The proposed framework outperforms the base model with an average win rate of 69.7% across seven conversational or instruction-following datasets.
Towards Medical Complex Reasoning with LLMs through Medical Verifiable Problems (2025.findings-acl)

Copied to clipboard

Challenge: OpenAI o1 has been a significant milestone in large language model development . however, most research in reasoning has focused on mathematical tasks . medical domains require robust reasoning to provide reliable answers .
Approach: They propose a method to verify medical reasoning using a medical verifier . they also propose RL and reinforcement learning to enhance reasoning .
Outcome: The proposed method outperforms general and medical-specific baselines using only 40K verifiable problems.
Knowledge-augmented Self-training of A Question Rewriter for Conversational Knowledge Base Question Answering (2022.findings-emnlp)

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.
Unlocking LLMs’ Self-Improvement Capacity with Autonomous Learning for Domain Adaptation (2025.findings-acl)

Copied to clipboard

Challenge: Existing models that use self-supervised and instruction fine-tuning can be trained using unlabeled corpora.
Approach: They propose to use unlabeled target corpora to adapt large language models to new domains . they propose to employ self-supervised pre-training and instruction fine-tuning methods .
Outcome: The proposed model can adapt to new domains using only a large amount of unlabeled target corpora.
EVM-QuestBench: An Execution-Grounded Benchmark for Natural-Language Transaction Code Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing evaluations of large language models overlook execution accuracy and safety.
Approach: They propose an execution-grounded benchmark for natural-language transaction-script generation on EVM-compatible chains.
Outcome: The proposed benchmark finds large performance gaps in the models with 5 independent rounds.
xDial-Eval: A Multilingual Open-Domain Dialogue Evaluation Benchmark (2023.findings-emnlp)

Copied to clipboard

Challenge: Currently, human evaluation is the most reliable way to holistically judge the quality of the dialogue.
Approach: They propose to use English dialogue evaluation metrics to generalize them to other languages.
Outcome: The proposed metrics outperform OpenAI’s ChatGPT in terms of average Pearson correlations over all datasets and languages.
Towards Bridging the Reward-Generation Gap in Direct Alignment Algorithms (2026.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated remarkable capabilities across a wide range of tasks, including instruction following, mathematical problem solving, and coding generation.
Approach: They propose a method that truncates both preferred and dispreferred responses to match the shorter one’s length.
Outcome: The proposed approach improves over standard implementations and achieves 11.8 points in AlpacaEval 2 and overall improvements across downstream tasks.
SciAssess: Benchmarking LLM Proficiency in Scientific Literature Analysis (2025.findings-naacl)

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.
QiMeng-PRepair: Precise Code Repair via Edit-Aware Reward Optimization (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to program repair are based on correctness alone.
Approach: They propose a framework that mitigates over-editing and improves repair accuracy by generating buggy programs and re-edits.
Outcome: The proposed framework improves repair precision by 31.4% under fix1@1, a metric that considers repair correctness and extent, and significantly increases decoding throughput when combined with speculative editing.
Towards Injecting Medical Visual Knowledge into Multimodal LLMs at Scale (2024.emnlp-main)

Copied to clipboard

Challenge: Multimodal large language models (MLLMs) lack visual knowledge in medical applications due to data privacy concerns and high annotation costs.
Approach: They refined medical image-text pairs from PubMed and employed MLLMs (GPT-4V) to denoise and reformat the data.
Outcome: The proposed model significantly improves the MMMU Health & Medicine track and shows that it can be used in multimodal scenarios.
Transfer-Aware Data Selection for Domain Adaptation in Text Retrieval (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to improve domain adaptation do not guarantee improved adaptability, but may negatively impact model performance.
Approach: They propose a framework that can effectively improve model adaptability by selecting beneficial data without evaluating all source data.
Outcome: The proposed framework improves model adaptability by selecting beneficial data without evaluating all source data.
Beyond Logits: Aligning Feature Dynamics for Effective Knowledge Distillation (2025.acl-long)

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.
Conditional Neural Generation using Sub-Aspect Functions for Extractive News Summarization (2020.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in text summarization have overcome position bias in news articles . however, there are long-standing, unresolved challenges in extractive summarizing .
Approach: They propose a neural framework that can flexibly control summary generation by introducing a set of sub-aspect functions.
Outcome: The proposed framework can flexibly control summary generation by introducing sub-aspect functions . extracted summaries with minimal position bias are comparable with standard models .
Response-G1: Explicit Scene Graph Modeling for Proactive Streaming Video Understanding (2026.acl-long)

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.
Diversifying Question Generation over Knowledge Base via External Natural Questions (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods on knowledge base question generation focus on refining the quality of a single generated question.
Approach: They propose a new diversity evaluation metric which measures the diversity among top-k generated questions for each instance while ensuring their relevance to the ground truth.
Outcome: The proposed model outperforms pre-trained language model baselines and text-davinci-003 in diversity while achieving comparable performance with ChatGPT.
PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing LRMs often suffer from "overthinking" and excessively long reasoning traces . a dual-level framework for length compression of LRM is proposed .
Approach: They propose a framework for prefix-protected and difficulty-aware compression under hierarchical supervision.
Outcome: The proposed framework reduces token usage while improving accuracy on math benchmarks.
A Reasoner for Real-World Event Detection: Scaling Reinforcement Learning via Adaptive Perplexity-Aware Sampling Strategy (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for abnormal event detection face two predominant limitations . existing methods rely on specialized small models and are limited by performance bottlenecks .
Approach: They propose a framework that leverages the advanced reasoning capabilities of large language models for abnormal event detection.
Outcome: The proposed framework achieves the highest F1 score and an average improvement of 9.59% in OOD transfer tests.
RAG-Instruct: Boosting LLMs with Diverse Retrieval-Augmented Instructions (2025.emnlp-main)

Copied to clipboard

Challenge: Retrieval-Augmented Generation (RAG) has emerged as a key paradigm for enhancing large language models by incorporating external knowledge.
Approach: They propose a method for synthesizing diverse and high-quality RAG instruction data based on any source corpus.
Outcome: The proposed method outperforms existing methods in multiple tasks and achieves strong zero-shot performance.
Multilingual Neural RST Discourse Parsing (2020.coling-main)

Copied to clipboard

Challenge: Existing studies on text discourse parsing for English are limited due to the lack of annotated data.
Approach: They propose to use multilingual vector representations and segment-level translation to establish a neural, cross-lingual discourse parser.
Outcome: The proposed model achieves state-of-the-art on cross-lingual, document-level discourse parsing on all sub-tasks.
HybridKV: Hybrid KV Cache Compression for Efficient Multimodal Large Language Model Inference (2026.acl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) are hindered by the rapid growth of key–value (KV) caches.
Approach: They propose a hybrid KV cache compression framework that reduces KV memory by 7.9 and speeds up decoding by 1.52.
Outcome: Experiments on 11 multimodal benchmarks show that HYBRIDKV cuts KV cache memory by 7.9 and speeds up decoding by 1.52.
Structure-Aware Zero-Shot Relational Learning for Knowledge Graphs without External Knowledge (2026.findings-acl)

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.
T2A-Feedback: Improving Basic Capabilities of Text-to-Audio Generation via Fine-grained AI Feedback (2025.acl-long)

Copied to clipboard

Challenge: Text-to-audio (T2A) models still struggle to satisfy human preferences for prompt-following and acoustic quality when generating complex multi-event audio.
Approach: They propose to use AI feedback learning to enhance basic capabilities of text-to-audio models . they use a large audio preference dataset to evaluate the model's capabilities .
Outcome: The proposed model improves in simple and complex scenarios with AI feedback learning.
SpeechIQ: Speech-Agentic Intelligence Quotient Across Cognitive Levels in Voice Understanding by Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: SIQ quantifies voice understanding abilities and provides unified comparisons between cascaded methods and end-to-end models.
Approach: They propose a human cognition-inspired evaluation pipeline for voice understanding large language models (LLM_Voice) that quantifies voice understanding abilities and provides unified comparisons between cascaded methods and end-to-end models.
Outcome: The proposed framework quantifies voice understanding abilities and provides unified comparisons between cascaded methods and end-to-end models, identifies annotation errors in existing benchmarks, and detects hallucinations in LLM_Voice.
Beyond Templates: Dynamic Adaptation of Reasoning Demonstrations via Feasibility-Aware Exploration (2026.findings-acl)

Copied to clipboard

Challenge: Existing reasoning datasets that are designed for powerful LLMs often lead to degraded performance when directly applied to weaker models.
Approach: They propose a data adaptation framework that bridges the capability gap between expert reasoning trajectories and diverse SLMs by employing a selective imitation strategy guided by step-wise adaptability estimation via solution simulation.
Outcome: The proposed framework improves generalization and data efficiency over static fine-tuning and can be applied to large models with limited model capacity.
C3KG: A Chinese Commonsense Conversation Knowledge Graph (2022.findings-acl)

Copied to clipboard

Challenge: Existing commonsense knowledge bases organize tuples in an isolated manner, causing problems for chatbots .
Approach: They create a Chinese commonsense conversation knowledge graph which integrates social commonsensm and dialog flow information.
Outcome: The proposed graph incorporates social commonsense knowledge and dialog flow information.
GigaSpeech 2: An Evolving, Large-Scale and Multi-domain ASR Corpus for Low-Resource Languages with Automated Crawling, Transcription and Refinement (2025.acl-long)

Copied to clipboard

Challenge: GigaSpeech 2 is a large-scale, multi-domain, multilingual speech recognition corpus for low-resource languages.
Approach: They propose a large-scale, multi-domain, multilingual speech recognition corpus for low-resource languages and an automated pipeline for data crawling, transcription, and label refinement.
Outcome: The proposed corpus reduces the word error rate for Thai, Indonesian, and Vietnamese on a realistic YouTube test set by 25% to 40% compared to Whisper large-v3.
Knowledge-Infused Multi-Bit Watermarking for RAG Knowledge Bases (2026.findings-acl)

Copied to clipboard

Challenge: Existing RAG watermarking methods are limited in their encoding capacity and potential degradation of performance or knowledge quality.
Approach: They propose knowledge-infused and multi-bit watermarking (KMW) for RAG knowledge bases by benign knowledge completion and a tailored generative watermark algorithm.
Outcome: The proposed method extracts watermarks from adversarial RAGs while remaining stealthy and secure.
Pyramid: A Layered Model for Nested Named Entity Recognition (2020.acl-main)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is a fundamental NLP task.
Approach: They propose a pyramid-like layered model for Nested Named Entity Recognition . token or text region embeddings are recursively inputted into L flat NER layers .
Outcome: The proposed model achieves state-of-the-art F1 scores in nested NER on ACE-2004, ACE 2005, GENIA, and NNE.
Semantic Matching for Sequence-to-Sequence Learning (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing models for sequence-to-sequence semantic matching do not match target sentences . Optimal partial transport (OPT) is a technique that partially matches semantically meaningful words between source and partial target sequences.
Approach: They propose a semantic matching scheme based on the Optimal Partial Transport (OPT) to match semantically meaningful words between source and partial target sequences.
Outcome: Extensive experiments show that the proposed approach improves over sequence-to-sequence models.
DeKeyNLU: Enhancing Natural Language to SQL Generation through Task Decomposition and Keyword Extraction (2025.findings-emnlp)

Copied to clipboard

Challenge: NL2SQL provides a model-centric paradigm that simplifies database access for non-technical users . challenges such as inaccurate task decomposition and keyword extraction remain major bottlenecks .
Approach: They propose a RAG-based NL2SQL pipeline that employs three modules for query understanding, entity retrieval, and generation to improve SQL generation accuracy.
Outcome: The proposed pipeline improves the accuracy of query generation on BIRD and Spider datasets.
Learning to Maximize Mutual Information for Chain-of-Thought Distillation (2024.findings-acl)

Copied to clipboard

Challenge: Knowledge distillation is a technique of transferring knowledge from large, complex models to smaller ones.
Approach: They propose a method utilizing chain-of-thought distillation to transfer knowledge from large, complex models to smaller ones by maximizing mutual information of the representation features of the two tasks.
Outcome: The proposed method outperforms the state-of-the-art knowledge distillation method on four datasets.
PAMN: Multi-phase Correlation Modeling for Contrast-Enhanced 3D Medical Image Retrieval (2025.findings-emnlp)

Copied to clipboard

Challenge: Current 3D medical imaging models focus on spatial features, neglecting phase-specific progression detailed in clinical reports.
Approach: They propose a framework that fuses imaging phases with clinical text to enhance 3D medical image retrieval.
Outcome: The proposed framework outperforms state-of-the-art models on a phase-series dataset of 12,230 hospital CT scans.
QiMeng-Attention: SOTA Attention Operator is generated by SOTA Attention Algorithm (2025.findings-acl)

Copied to clipboard

Challenge: Existing LLMs cannot comprehend the complex data flow and computation process of the attention operator and utilize low-level primitive to exploit GPU performance.
Approach: They propose an LLM-friendly Thinking Language (LLM-TL) that can decouple the generation of high-level optimization logic and low-level implementation on GPU and enhance LLMs’ understanding of attention operator.
Outcome: The proposed method outshines existing LLMs on A100, RTX8000, and T4 GPUs, achieving a speed-up of up to 35.16.
You Can Have a Second Chance: Unbiased and Multi-bit Watermarking for Diffusion Language Models with Regret-based Remasking (2026.acl-long)

Copied to clipboard

Challenge: Existing sequential LLMs cannot be directly applied to DLMs, as their generation order is arbitrary.
Approach: They propose a stability-aware constraint that allows watermarking only in stable contexts and a bit-controlled, unbiased modulation to preserve the original DLM output distribution.
Outcome: The proposed scheme achieves stable watermarking with minimal quality impact while maintaining high detection accuracy and multi-bit capacity.
When to Continue Thinking: Adaptive Thinking Mode Switching for Efficient Reasoning (2025.findings-emnlp)

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.
Enhancing Efficiency and Exploration in Reinforcement Learning for LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches allocate an equal number of rollouts to all questions during the RL process, which is inefficient.
Approach: They propose a mechanism for dynamically allocating rollout budgets based on the difficulty of the problems, enabling more efficient RL training.
Outcome: The proposed model improves response precision while preserving exploratory ability to uncover potential correct pathways.
Fin-STAR: Structure-as-Semantics to Resolve Implicitness in Financial Retrieval (2026.findings-acl)

Copied to clipboard

Challenge: Existing Retrieval-Augmented Generation systems treat structure as a physical navigational skeleton rather than intrinsic semantic knowledge.
Approach: They propose a framework that redefining hierarchy as intrinsic semantics and uses snippets to enrich hierarchical lineage.
Outcome: The proposed framework outperforms state-of-the-art hierarchical and graph-based benchmarks on FinTierQA Gold.
To Paraphrase or Not: Efficient Comment Detoxification with Unsupervised Detoxifiability Discrimination (2026.eacl-short)

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.
Skip-Thinking: Chunk-wise Chain-of-Thought Distillation Enable Smaller Language Models to Reason Better and Faster (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods train small language models to learn long rationales in one iteration.
Approach: They propose a method that uses a heuristic search to divide rationale into internal chunks . they propose CWT, which uses CWt to focus SLM on learning from only one chunk per iteration.
Outcome: The proposed method can guide a large language model (LLM) in reasoning tasks.
CharacterGLM: Customizing Social Characters with Large Language Models (2024.emnlp-industry)

Copied to clipboard

Challenge: Character-based dialogue systems (CharacterDial) allow users to customize social characters for social interactions.
Approach: They will collect a large-scale Chinese corpus of characters with diverse categories and behaviors and develop CharacterGLM models to address these challenges.
Outcome: Experiments show that CharacterGLM outperforms most popular open- and closed-source LLMs and performs comparable to GPT-4.
GUI0: Self-Evolving Foundational GUI Agents in Super App Ecosystems (2026.acl-long)

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.
Relaxing the Constraints: A Dual-Importance Projection Mechanism for Lifelong Model Editing (2026.findings-acl)

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.
CoD, Towards an Interpretable Medical Agent using Chain of Diagnosis (2025.findings-acl)

Copied to clipboard

Challenge: Existing large language models (LLMs) are proving to be effective in medical automatic diagnosis, but their interpretability remains unaddressed.
Approach: They propose to use a "Chain-of-Diagnosis" approach to enhance the interpretability of medical automatic diagnosis by outputting the disease confidence distribution.
Outcome: The proposed model outperforms other LLMs on automatic diagnostic tasks across three real-world benchmarks and provides interpretability while ensuring controllability in diagnostic rigor.
SAM Decoding: Speculative Decoding via Suffix Automaton (2025.acl-long)

Copied to clipboard

Challenge: Speculative decoding (SD) methods are inefficient and rely on single retrieval resources.
Approach: They propose a retrieval-based speculative decoding method that adapts the suffix automaton for efficient draft generation by utilizing the generating text sequence and static text corpus.
Outcome: The proposed method can find the longest suffix match and can be integrated with existing methods to generalize to broader domains.
LMOD: A Large Multimodal Ophthalmology Dataset and Benchmark for Large Vision-Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Existing benchmarks for large vision-language models (LVLMs) are limited to ophthalmology-specific applications.
Approach: They introduce a large-scale multimodal ophthalmology benchmark consisting of 21,993 instances across five ocular imaging modalities and 13 state-of-the-art LVLM representatives from closed-source, open-source and medical domains.
Outcome: The proposed model shows significant performance drop in ophthalmology compared to other domains.
EquiBench: Benchmarking Large Language Models’ Reasoning about Program Semantics via Equivalence Checking (2025.emnlp-main)

Copied to clipboard

Challenge: EquiBench is a new benchmark to evaluate large language models' ability to reason about program semantics . Unlike natural language, code is executable.
Approach: They propose a benchmark to evaluate large language models through equivalence checking . EquiBench consists of 2400 program pairs across four languages and six categories .
Outcome: The proposed benchmark consists of 2400 program pairs across four languages and six categories.
Hyperlink-induced Pre-training for Passage Retrieval in Open-domain Question Answering (2022.acl-long)

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.
FuseSearch: Learning Adaptive Parallel Execution for Efficient Code Localization (2026.findings-acl)

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.
NeKo: Cross-Modality Post-Recognition Error Correction with Tasks-Guided Mixture-of-Experts Language Model (2025.acl-industry)

Copied to clipboard

Challenge: Existing methods to train a model on a mixture of domain datasets require separate correction language models.
Approach: They propose a multi-task correction MoE that trains experts to become an "expert" of speech-to-text, language-totext and vision-to text datasets by learning to route each dataset’s tokens to its mapped expert.
Outcome: The proposed model outperforms GPT-3.5 and Claude-3.5-Sonnet on the Open ASR Leaderboard and reaches an average relative 5.0% WER reduction and substantial improvements in BLEU scores.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations