Papers by Dongmei Zhang

68 papers
Thread: A Logic-Based Data Organization Paradigm for How-To Question Answering with Retrieval Augmented Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in retrieval-augmented generation (RAG) have substantially improved question-answering systems, particularly for factoid ‘5Ws’ questions.
Approach: They propose a data organization paradigm where large language models transform documents into more structured and loosely interconnected LUs.
Outcome: Experiments in open-domain and industrial settings show that the proposed paradigm outperforms existing paradigms and shows high adaptability across diverse document formats.
Encoding Spreadsheets for Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Spreadsheets are characterized by their extensive two-dimensional grids, flexible layouts, and varied formatting options, which pose significant challenges for large language models (LLMs).
Approach: They propose a structural-anchor-based compression, inverse index translation, and data-format-aware aggregation module to compress spreadsheets effectively.
Outcome: The proposed method outperforms the existing model in GPT4 and achieves a state-of-the-art 78.9% F1 score.
Sequential LLM Framework for Fashion Recommendation (2024.emnlp-industry)

Copied to clipboard

Challenge: Existing fashion recommendation systems struggle with the unique challenges of the fashion domain.
Approach: They propose a sequential fashion recommendation framework that leverages a pre-trained large language model enhanced with recommendation-specific prompts.
Outcome: The proposed framework significantly improves fashion recommendation performance on Amazon fashion.
Towards Robust Numerical Question Answering: Diagnosing Numerical Capabilities of NLP Systems (2022.emnlp-main)

Copied to clipboard

Challenge: Numerical Question Answering is the task of answering questions that require numerical capabilities.
Approach: They propose to conduct numerical capability diagnosis on a series of Numerical Question Answering systems and datasets.
Outcome: The proposed approach relieves existing systems’ lack of robust numerical capabilities.
HermEs: Interactive Spreadsheet Formula Prediction via Hierarchical Formulet Expansion (2023.acl-long)

Copied to clipboard

Challenge: HermEs is a spreadsheet formula prediction language that is difficult for Excel users without programming experience to master.
Approach: They propose a hierarchical approach to formula prediction via HiEraRchical forMulet ExpanSion . they propose generating formulas in a fixed order using hierarchically generated formulas .
Outcome: The proposed approach improves formula prediction accuracy by guaranteeing correct grammar and streamlining token-level decoding with high-level Formulet.
Privacy in Action: Towards Realistic Privacy Mitigation and Evaluation for LLM-Powered Agents (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing benchmarks for privacy performance of LLM agents are limited to static, simplified scenarios.
Approach: They propose a model-agnostic, contextual integrity based mitigation approach that effectively reduces privacy leakage from 36.08% to 7.30% on DeepSeek-R1 and from 33.06% to 8.32% on GPT-4o.
Outcome: The proposed approach reduces privacy leakage from 36.08% to 7.30% on DeepSeek-R1 and from 33.06% to 8.32% on GPT-4o while preserving task helpfulness.
Skeleton-Guided-Translation: A Benchmarking Framework for Code Repository Translation with Fine-Grained Quality Evaluation (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing code translation benchmarks focus on individual functions, overlooking repository-level challenges like intermodule coherence and dependency management.
Approach: They propose a framework for benchmarking Java-to-C# translation at the repository level . it uses a translation framework guided by skeletons and fine-grained quality evaluation .
Outcome: The proposed framework improves Java-to-C# translation quality at the repository level.
UFO: A UI-Focused Agent for Windows OS Interaction (2025.naacl-long)

Copied to clipboard

Challenge: UFO is a UI-Fcused agent designed to fulfill user requests tailored to Windows OS applications . it decomposes user requests using divide-and-conquer approach, enabling seamless navigation and addressing sub-tasks across multiple applications.
Approach: They propose a UI-Fcused Windows OS agent that decomposes user requests using a divide-and-conquer approach and incorporates a control interaction module tailored for Windows OS.
Outcome: The proposed agent decomposes user requests using divide-and-conquer approach, enabling seamless navigation and addressing sub-tasks across multiple applications.
DI-BENCH: Benchmarking Large Language Models on Dependency Inference with Testable Repositories at Scale (2025.findings-acl)

Copied to clipboard

Challenge: Existing studies highlight that dependency-related issues cause over 40% of observed runtime errors on the generated repository.
Approach: They propose a large-scale benchmark and evaluation framework specifically designed to assess LLMs’ capability on dependency inference.
Outcome: The proposed model achieves only a 48% execution pass rate on Python, indicating room for improvement.
Selected Languages are All You Need for Cross-lingual Truthfulness Transfer (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for truthfulness enhancement in English are limited to multilingual scenarios.
Approach: They propose a method for cross-lingual truthfulness transfer that uses language bias and transfer contributions to select an optimal subset of all tested languages and employ translation instruction tuning for cross language truthfulness transfers.
Outcome: The proposed method reduces multilingual representation disparity and boosts cross-lingual truthfulness transfer of LLMs.
LLM Reasoning as Trajectories: Step-Specific Representation Geometry and Correctness Signals (2026.acl-long)

Copied to clipboard

Challenge: Existing models generate tokens by updating high-dimensional representations and decoding from them at each timestep.
Approach: They propose a framework that allows reasoning correction and length control based on derived ideal trajectories.
Outcome: The proposed model can predict correctness and length control based on ideal trajectories.
Call Me When Necessary: LLMs can Efficiently and Faithfully Reason over Structured Environments (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have shown potential in reasoning over structured environments, e.g., knowledge graphs and tables.
Approach: They propose a framework that allows LLMs to efficiently and faithfully reason over structured environments.
Outcome: The proposed framework surpasses state-of-the-art fine-tuned methods on three KGQA and two TableQA datasets and surpasse CWQ and WTQ methods.
“What Do You Mean by That?” A Parser-Independent Interactive Approach for Enhancing Text-to-SQL (2020.emnlp-main)

Copied to clipboard

Challenge: In Natural Language Interfaces to Databases systems, text-to-SQL parsers allow users to query databases by using natural language questions.
Approach: They propose a parser-independent interactive approach that interacts with users using multi-choice questions and can easily work with arbitrary parsers.
Outcome: The proposed approach improves performance with limited interaction turns by using simulation and human evaluation on two cross-domain datasets with five state-of-the-art parsers.
SheetDesigner: MLLM-Powered Spreadsheet Layout Generation with Rule-Based and Vision-Based Reflection (2025.emnlp-main)

Copied to clipboard

Challenge: Existing automated layout models are ill-suited for spreadsheets, authors say . existing layout models treat components as rectangles with continuous coordinates . authors: spreadsheets are powerful tools for organizing and analyzing data .
Approach: They formalize a spreadsheet layout generation task and introduce a framework for spreadsheet layouts . they use multimodal large language models to combine rule and vision reflection .
Outcome: The proposed framework outperforms baselines in a spreadsheet layout generation task by 22.6%.
RESF: Regularized-Entropy-Sensitive Fingerprinting for Black-Box Tamper Detection of Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for tamper detection rely on model stability, not inherently stochastic models.
Approach: They propose a hypothesis-testing method for black-box tamper detection for LLMs . they propose regularized entropy-sensitive fingerprinting to enable efficient fingerprinting .
Outcome: The proposed method achieves 98.80% detection accuracy under challenging conditions . it is based on a first-order surrogate for KL divergence to identify prompts most responsive to parameter perturbations.
End-to-End Beam Retrieval for Multi-Hop Question Answering (2024.naacl-long)

Copied to clipboard

Challenge: Existing beam retrieval frameworks for multi-hop question answering were customized for two-hop questions and were poorly supervised.
Approach: They propose an end-to-end beam retrieval framework for multi-hop question answering . they combine an encoder and two classification heads to optimize the retrieval process .
Outcome: The proposed framework improves on MuSiQue-Ans and surpasses all previous retrievers on HotpotQA and achieves 99.9% precision on 2WikiMultiHopQA.
Data-Anonymous Encoding for Text-to-SQL Generation (D19-1)

Copied to clipboard

Challenge: Existing approaches to handle table-related tokens before the semantic parser are not efficient . existing approaches ignore handling table- related tokens or use deterministic approaches based on string-match or word embedding similarity.
Approach: They propose a more efficient approach to handle table-related tokens before the parser . they propose tagging a sequential tabbing problem and an implicit supervision approach .
Outcome: The proposed approach significantly outperforms deterministic approaches.
Learning to Refine: Self-Refinement of Parallel Reasoning in LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to test-time scaling are limited due to the quality of candidate responses.
Approach: They propose a new metric to quantify the relative improvement of self-refinement beyond majority voting.
Outcome: The proposed method achieves state-of-the-art performance across five benchmarks over other methods.
Quantifying and Improving the Robustness of Retrieval-Augmented Language Models Against Spurious Features in Grounding Data (2026.acl-long)

Copied to clipboard

Challenge: Existing studies on robustness to explicit noise (e.g., document semantics) but overlook implicit noise (spurious features).
Approach: They propose a framework to quantify the robustness of RAGs against spurious features by integrating a data synthesis pipeline and a taxonomy.
Outcome: The proposed framework quantifies the robustness of RALMs against spurious features.
RepoGenesis: Benchmarking End-to-End Microservice Generation from Readme to Repository (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks focus on isolated function/class-level generation, neglecting complete microservice repository generation.
Approach: They propose a multilingual benchmark for repository-level end-to-end web microservice generation that reflects real-world development workflows.
Outcome: The benchmark compared 106 repositories across 18 domains and 11 frameworks and 1,258 API endpoints and 2,335 test cases.
Gradient-Guided Multi-Judge Prompt Optimization (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to prompt optimization trade off signal quality against computational cost.
Approach: They propose a framework that uses a first-order gradient approximation to score segment importance in a continuous masking direction.
Outcome: The proposed framework improves efficiency and robustness by using a first-order gradient approximation to score segment importance in a continuous masking direction.
Table-LLM-Specialist: Language Model Specialists for Tables using Iterative Fine-tuning (2025.emnlp-main)

Copied to clipboard

Challenge: Language models such as GPT and Llama have shown remarkable ability on diverse natural language tasks, yet their performance on complex table tasks is suboptimal.
Approach: They propose a generator-validator paradigm to iteratively generate-then-validate training data from language models to fine-tune stronger Table-Specialist models that can specialize in a given task, without using manually-labeled data.
Outcome: The proposed model outperforms vanilla language models on diverse table tasks and can match or surpass GPT-4 level quality.
PLOG: Table-to-Logic Pretraining for Logical Table-to-Text Generation (2022.emnlp-main)

Copied to clipboard

Challenge: Logical table-to-text generation requires models to derive logical-level facts from table records via logical inference.
Approach: They propose a pretrained logical form generator framework to improve generation fidelity . they use a dataset to test the logical inference accuracy of the framework .
Outcome: The proposed framework outperforms baselines on LOGICNLG and CONTLOG on two benchmarks.
AnaMeta: A Table Understanding Dataset of Field Metadata Knowledge Shared by Multi-dimensional Data Analysis Tasks (2023.findings-acl)

Copied to clipboard

Challenge: Tabular data analysis is performed everyday across various domains.
Approach: They propose to use a dataset of 467k tables with supervision labels for four types of field metadata.
Outcome: The proposed framework improves the understanding capability of tabular models by incorporating distribution and knowledge information.
WarriorCoder: Learning from Expert Battles to Augment Code Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Recent code large language models have demonstrated impressive performance on code-related tasks.
Approach: They propose a paradigm that learns from expert battles to address these limitations . they create an arena where leading LLMs challenge each other with evaluations .
Outcome: The proposed model improves on existing models by leveraging expert battles . it achieves state-of-the-art performance even without relying on proprietary models .
Not All Tokens Matter: Towards Efficient LLM Reasoning via Token Significance in Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) often produce unnecessarily long explanations that reduce efficiency.
Approach: They propose a length-aware reward that selectively penalizes insignificance tokens . they also propose 'dynamic length control' that encourages more detailed reasoning .
Outcome: The proposed method reduces response length while maintaining correctness, the authors show . it selectively penalizes insignificance tokens while maintaining accuracy .
CAST: Achieving Stable LLM-based Text Analysis for Data Analytics (2026.findings-acl)

Copied to clipboard

Challenge: Text analysis of tabular data relies on two core operations: summarization for corpus-level theme extraction and tagging for row-level labeling.
Approach: They propose a framework that enhances output stability by constraining the model’s latent reasoning trajectory.
Outcome: The proposed framework improves stability by constraining the model's latent reasoning trajectory.
RACE: Retrieval-augmented Commit Message Generation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to automatically generate commit messages are repetitive or redundant.
Approach: They propose a retrieval-augmented neural commit message generation method which treats the retrieved similar commit as an exemplar and leverages it to generate an accurate commit message.
Outcome: The proposed method outperforms baselines on a large dataset with five programming languages and can boost existing Seq2Seq models in commit message generation.
ICL-Bandit: Relevance Labeling in Advertisement Recommendation Systems via LLM (2025.findings-emnlp)

Copied to clipboard

Challenge: In-context learning (ICL) is a common practice to enhance LLM performance on domain-specific tasks.
Approach: They propose a method that leverages large language models to enhance query-ad relevance labeling . they identify and provide superior demonstrations for ICL, thereby improving labeling performance .
Outcome: The proposed method improves query-ad relevance labeling performance by providing demonstrations.
EfficientRAG: Efficient Retriever for Multi-Hop Question Answering (2024.emnlp-main)

Copied to clipboard

Challenge: Existing retrieval-augmented generation methods rely on multiple calls of large language models (LLMs) Large-language models lack knowledge underrepresented in training data and still face hallucinations.
Approach: They propose an efficient retriever for multi-hop question answering that generates new queries iteratively without the need for LLM calls.
Outcome: The proposed method surpasses existing methods on three open-domain multi-hop question-answering datasets.
TaCube: Pre-computing Data Cubes for Answering Numerical-Reasoning Questions over Tabular Data (2022.emnlp-main)

Copied to clipboard

Challenge: Existing auto-regressive pre-trained language models are challenged by recent emerging numerical reasoning datasets due to the error-prone implicit calculation.
Approach: They propose a pre-computation tool to pre-compute aggregation/arithmetic results for the table in advance, so they are handy and readily available for PLMs to answer numerical reasoning questions.
Outcome: The proposed model improves on TAT-QA and T5 and BART-large on multiple benchmarks.
AutoRAG-HP: Automatic Online Hyper-Parameter Tuning for Retrieval-Augmented Generation (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in Large Language Models have transformed ML/AI development . a reevaluation of AutoML principles for Retrieval-Augmented Generation (RAG) systems is needed.
Approach: They propose a framework for hyper-parameter tuning and a hierarchical MAB method for efficient exploration of large search spaces.
Outcome: The proposed framework outperforms baseline methods in more challenging optimization scenarios.
Learning Algebraic Recombination for Compositional Generalization (2021.findings-acl)

Copied to clipboard

Challenge: Neural sequence models exhibit limited compositional generalization ability in semantic parsing tasks.
Approach: They propose an end-to-end neural model to learn algebraic recombination for compositional generalization.
Outcome: The proposed model is based on two realistic and comprehensive compositional generalization benchmarks.
DUET: Joint Exploration of User–Item Profiles in Recommendation System (2026.findings-acl)

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.
You Impress Me: Dialogue Generation via Mutual Persona Perception (2020.acl-main)

Copied to clipboard

Challenge: Existing chit-chat systems tend to generate uninformative responses and lack coherent personality traits due to the diversity of speakers.
Approach: They propose a transmitter-receiver framework which explicitly models understanding between interlocutors.
Outcome: The proposed framework improves on a large public dataset, Persona-Chat, with a significant boost over the state-of-the-art frameworks.
Everything of Thoughts: Defying the Law of Penrose Triangle for Thought Generation (2024.findings-acl)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have greatly advanced problem solving in diverse domains such as mathematical reasoning and knowledge reasoning.
Approach: They propose a thought prompting approach called 'Everything of Thoughts' it leverages pretrained reinforcement learning and Monte Carlo Tree Search to incorporate external domain knowledge and planning capability into thoughts.
Outcome: The proposed approach outperforms existing approaches on game of 24, 8-Puzzle, and Pocket Cube.
HiTab: A Hierarchical Table Dataset for Question Answering and Natural Language Generation (2022.acl-long)

Copied to clipboard

Challenge: Existing studies on table reasoning focus on flat tables and hierarchical tables . a new dataset, HiTab, aims to examine numerical reasoning over hierarchic tables based on hierarchically structured tables - a strong challenge for existing baselines and a valuable benchmark for future research.
Approach: They propose a hierarchical question answering and natural language generation dataset to study hierarchic tables.
Outcome: The proposed model shows that it is effective in QA and natural language generation over hierarchical tables.
CAST: Enhancing Code Summarization with Hierarchical Splitting and Reconstruction of Abstract Syntax Trees (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods for code summarization do not capture rich information in ASTs . existing methods are labor-intensive and time-consuming to document code with good summaries manually.
Approach: They propose a model that hierarchically splits and reconstructs ASTs by a neural network . they propose to use AST embeddings and a vanilla code token encoder to generate the model .
Outcome: The proposed model splits and reconstructs ASTs into subtrees and then aggregates embeddings of subtreas to get the complete AST.
CoCoST: Automatic Complex Code Generation with Online Searching and Correctness Testing (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to improve code generation from natural language descriptions are difficult due to complex structure, subtle bugs, and lack of supplementary contents.
Approach: They propose a framework that enhances complex code generation by online searching for more information with planned queries and correctness testing for code refinement.
Outcome: The proposed framework improves the quality of complex code generation on the DS-1000 and ClassEval datasets.
PromptIntern: Saving Inference Costs by Internalizing Recurrent Prompt during Large Language Model Fine-tuning (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in fine-tuning large language models have greatly enhanced their usage in domain-specific tasks.
Approach: They propose a method which internalizes prompt knowledge during model fine-tuning to achieve efficient inference and save costs.
Outcome: The proposed approach reduces input tokens by 90%, accelerates inference by 4.2 times, and reduces monetary inference costs by 88.3%.
Tackling Long Code Search with Splitting, Encoding, and Aggregating (2024.lrec-main)

Copied to clipboard

Challenge: Existing pretraining models take the first 256 tokens of code snippets by default, limiting the input length to 512.
Approach: They propose a baseline SEA model which splits long code into code blocks and aggregates them to obtain a comprehensive long code representation.
Outcome: The proposed model can model long code without changing their internal structure and re-pretraining.
ExeCoder: Empowering Large Language Models with Executability Representation for Code Translation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing code translation models only learn the contextual semantics of code during pre-training, neglecting executability information closely related to the execution state of the code.
Approach: They propose an LLM specifically designed for code translation called ExeCoder . it uses executability representations such as functional semantics and syntax structures to enhance LLMs' capabilities.
Outcome: The proposed model outperforms existing open-source code translation models on two metrics.
EgoMemory: Memory-Augmented Personalized Retrieval for Long-Context Egocentric Video (2026.findings-acl)

Copied to clipboard

Challenge: Existing egocentric video datasets do not support the personalization and long-context reasoning required for episodic memory retrieval.
Approach: They propose a benchmark framework that uses MLLMs and reflective Chain-of-Thought to ground user queries in personal memory explicitly.
Outcome: The proposed framework outperforms state-of-the-art benchmarks on three benchmarks . it can be used to generate detailed target video descriptions in long-context contexts based on user-specific object annotations enriched with user-specified object annotation data .
Accelerating Code Search with Deep Hashing and Code Classification (2022.acl-long)

Copied to clipboard

Challenge: Code search is to search reusable code snippets from source code corpus based on natural languages queries.
Approach: They propose a method to accelerate code search with deep hashing and code classification by using deep hashes and code hash.
Outcome: The proposed method can save 90% of retrieval time while preserving at least 99% of retrievals accuracy.
TableLoRA: Low-rank Adaptation on Table Structure Understanding for Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Tabular data are crucial in many fields and their understanding by large language models (LLMs) under high parameter efficiency paradigm is important.
Approach: They propose a module that uses 2D LoRA to encode low-rank information on cell positions to improve table serialization and representation of two-dimensional structured information within a one-dimensional sequence.
Outcome: Experiments on four tabular-related datasets show that TableLoRA outperforms vanilla LoRA and surpasses table encoding methods tested in control.
Weakly Supervised Semantic Parsing by Learning from Mistakes (2021.findings-emnlp)

Copied to clipboard

Challenge: Weakly supervised semantic parsing requires searching consistent logical forms in a huge space and dealing with spurious logical form.
Approach: They propose a learning framework that trains parsers via utterance-denotation pairs . they use utterrance-logical form pairs created from mistakes to bootstrap parser .
Outcome: The proposed framework outperforms state-of-the-art methods on WikiSQL, TabFact and other datasets.
A Split-and-Recombine Approach for Follow-up Query Analysis (D19-1)

Copied to clipboard

Challenge: Context-dependent semantic parsing has proved to be an important but challenging task.
Approach: They propose to perform follow-up query analysis to restate context-dependent queries with contextual information.
Outcome: The proposed approach outperforms the state-of-the-art by nearly 8% on the FollowUp dataset . the extensibility of STAR on the SQA dataset is also promising .
Token-level Proximal Policy Optimization for Query Generation (2025.emnlp-main)

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.
Zipage: Maintain High Request Concurrency for LLM Reasoning through Compressed PagedAttention (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods to evict KV cache during inference phase are impractical for industrial-grade applications.
Approach: They propose a method that combines token-wise KV cache eviction with PagedAttention and propose 'zipage' it achieves 95% of the performance of Full KV inference engines while delivering over 2.1 speedup .
Outcome: The proposed method achieves 95% of the performance of Full KV inference engines while delivering over 2.1 speedup on large-scale mathematical reasoning tasks.
Incomplete Utterance Rewriting as Semantic Segmentation (2020.emnlp-main)

Copied to clipboard

Challenge: Recent studies focus on the task of incomplete utterance rewriting as a machine translation task.
Approach: They propose a semantic segmentation task which incorporates edit operations into the problem and predicts a word-level edit matrix.
Outcome: The proposed approach outperforms existing baselines on several datasets and is four times faster than the standard approach in inference.
TwT: Thinking without Tokens by Habitual Reasoning Distillation with Multi-Teachers’ Guidance (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) have made significant strides in problem-solving by incorporating reasoning processes, but this enhanced reasoning capability results in an increased number of output tokens during inference, leading to higher computational costs.
Approach: They propose a method that internalizes explicit reasoning into the model’s habitual behavior through a Teacher-Guided compression strategy inspired by human cognition.
Outcome: The proposed method reduces inference-time costs while maintaining high performance while preserving high quality and diversity of the distillation dataset.
Breaking Language Barriers in Multilingual Mathematical Reasoning: Insights and Observations (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing research focuses on developing powerful large language models for mathematical reasoning within monolingual languages.
Approach: They propose to use translation to build powerful multilingual math reasoning models . they propose different training strategies to build xMR LLMs that outperform open-source LLM .
Outcome: The proposed model outperforms open-source LLMs and surpasses ChatGPT in few-shot scenarios.
ESF: Efficient Sensitive Fingerprinting for Black-Box Tamper Detection of Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) are increasingly utilized in diverse applications, including code generation, legal document analysis, medical diagnosis, and decision-making.
Approach: They propose a fingerprinting method tailored for black-box tamper detection of large language models.
Outcome: The proposed method detects tampering with a 99.2% detection rate using 5 fingerprint samples across state-of-the-art LLMs.
KET-QA: A Dataset for Knowledge Enhanced Table Question Answering (2024.lrec-main)

Copied to clipboard

Challenge: Existing datasets that ignore the challenge of missing knowledge in TableQA are limited in their use.
Approach: They propose to use a knowledge base as the external knowledge source for TableQA and construct a dataset with fine-grained gold evidence annotation.
Outcome: The proposed model achieves remarkable performance improvements on three different settings, but still lags behind the human-level performance.
CI-Work: Benchmarking Contextual Integrity in Enterprise LLM Agents (2026.acl-industry)

Copied to clipboard

Challenge: Enterprise LLM agents can dramatically improve workplace productivity, but their core capability, retrieving and using internal context to act on a user’s behalf, also creates new risks for sensitive information leakage.
Approach: They propose a Contextual Integrity-grounded benchmark that simulates enterprise workflows across five information-flow directions and evaluates whether agents can convey *essential* content while withholding *sensitive* context in dense retrieval settings.
Outcome: The proposed model demonstrates that privacy failures are prevalent in enterprise workflows and that higher task utility correlates with increased privacy violations.
TAP4LLM: Table Provider on Sampling, Augmenting, and Packing Semi-structured Data for Large Language Model Reasoning (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing solutions for table reasoning tasks are mainly tested on small tables and face scalability issues and struggle with complex queries due to incomplete or dispersed data across different table sections.
Approach: They propose a table reasoning pre-processor suite that can be used to leverage large language models (LLMs) in table-based tasks.
Outcome: The proposed method improves LLMs’ reasoning capabilities in various tabular tasks and enhances interaction between LLM and tabular data by employing effective pre-processing.
LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression (2024.findings-acl)

Copied to clipboard

Challenge: Existing approaches to compress prompts only leverage unidirectional context, causing suboptimal results.
Approach: They propose a task-agnostic prompt compression method that takes tokens from context . they use a Transformer encoder to capture all essential information needed for prompt compression .
Outcome: The proposed method is 3x-6x faster than existing prompt compression methods and faster than baselines.
SemRegex: A Semantics-Based Approach for Generating Regular Expressions from Natural Language Specifications (D18-1)

Copied to clipboard

Challenge: Existing approaches to generate programs from natural language do not address program aliasing . semantically equivalent programs may have many syntactically different forms .
Approach: They propose a semantics-based approach to generate regular expressions from natural language.
Outcome: The proposed approach improves on three public datasets.
FORTAP: Using Formulas for Numerical-Reasoning-Aware Table Pretraining (2022.acl-long)

Copied to clipboard

Challenge: Tables store rich numerical data, but numerical reasoning over tables is still a challenge.
Approach: They propose a spreadsheet formula is a valuable supervision for numerical reasoning in tables.
Outcome: The proposed method outperforms state-of-the-art methods on three representative datasets of formula prediction, question answering, and cell type classification.
AXIS: Efficient Human-Agent-Computer Interaction with API-First LLM-Based Agents (2025.acl-long)

Copied to clipboard

Challenge: Multimodal large language models (MLLMs) have enabled LLM-based agents to directly interact with application user interfaces (UIs), enhancing agents’ performance in complex tasks.
Approach: They propose a novel agent framework that prioritizes actions through application programming interfaces over UI actions and facilitates the creation and expansion of APIs through automated exploration of applications.
Outcome: The proposed framework reduces task completion time by 65%-70% and cognitive workload by 38%-53% while maintaining accuracy of 97%-98% compared to humans.
TablePilot: Recommending Human-Preferred Tabular Data Analysis with Large Language Models (2025.acl-industry)

Copied to clipboard

Challenge: Tabular data analysis is crucial in many scenarios, yet its complexity and density can make it challenging to determine the most appropriate analysis operations for a new table.
Approach: They propose a tabular data analysis framework that recommends query-code-result triplets for new tables . they propose Rec-Align, a method to further improve recommendation quality .
Outcome: The proposed framework achieves 77.0% top-5 recommendation recall on a dataset designed for tabular data analysis recommendation.
AdaptFlow: Adaptive Workflow Optimization via Meta-Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to large language models rely on static templates or manual workflows.
Approach: AdaptFlow is a language-based meta-learning framework inspired by model-agnostic meta- learning.
Outcome: AdaptFlow outperforms manual and automated workflows on question answering, code generation and mathematical reasoning benchmarks.
How Do In-Context Examples Affect Compositional Generalization? (2023.acl-long)

Copied to clipboard

Challenge: In-context learning paradigms that focus on large corpus are limiting compositional generalization performance.
Approach: They propose a test suite to investigate in-context compositional generalization . they propose to use examples that are structurally similar to the test case .
Outcome: The proposed test suite investigates in-context compositional generalization performance . it finds that the performance can be affected by the selection of in-const examples .
Empower Large Language Model to Perform Better on Industrial Domain-Specific Question Answering (2023.emnlp-industry)

Copied to clipboard

Challenge: Large Language Models (LLMs) have gained popularity but lack specific domain knowledge in domain-specific tasks.
Approach: They propose a model interaction paradigm that empowers LLM to achieve better performance on domain-specific tasks where it is not proficient.
Outcome: The proposed approach outperforms the commonly used LLM with retrieval methods in domain-specific tasks.
From Reasoning to Answer: Empirical, Attention-Based and Mechanistic Insights into Distilled DeepSeek R1 Models (2025.emnlp-main)

Copied to clipboard

Challenge: Large Reasoning Models generate explicit reasoning traces alongside final answers . the extent to which these traces influence answer generation remains unclear .
Approach: They conduct empirical evaluation of Large Reasoning Models that include explicit reasoning . they also show that answer tokens attend substantially to reasoning tokens .
Outcome: The results show that including explicit reasoning improves answer quality across domains . they also show that answer tokens attend substantially to reasoning tokens - the authors .
InsightPilot: An LLM-Empowered Automated Data Exploration System (2023.emnlp-demo)

Copied to clipboard

Challenge: InsightPilot is an LLM-based, automated data exploration system designed to simplify the data exploration process.
Approach: They propose an LLM-based, automated data exploration system that streamlines the data exploration process.
Outcome: InsightPilot is an LLM-based, automated data exploration system . it can help users gain valuable insights from their datasets, in a case study and in nl .
FormLM: Recommending Creation Ideas for Online Forms by Modelling Semantic and Structural Information (2022.emnlp-main)

Copied to clipboard

Challenge: FormLM is a pre-trained language model for creating semi-structured forms where questions and descriptions are organized by predefined structures.
Approach: They propose to enhance pre-trained language model with form structural information to model online forms and recommend form creation ideas.
Outcome: The proposed model outperforms general-purpose language models on all tasks, with an improvement by 4.71 on Question Recommendation and 10.6 on Block Type Suggestion in terms of ROUGE-1 and Macro-F1, respectively.
Towards Complex Text-to-SQL in Cross-Domain Database with Intermediate Representation (P19-1)

Copied to clipboard

Challenge: IRNet synthesizes SQL queries in an end-to-end manner, but it yields unsatisfactory performance on public benchmarks.
Approach: They propose a neural approach called IRNet for complex and cross-domain Text-to-SQL.
Outcome: IRNet achieves 46.7% accuracy on the Spider benchmark, a 19.5% improvement over state-of-the-art approaches.

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