Papers by Zang Li

15 papers
Towards Storage-Efficient Visual Document Retrieval: An Empirical Study on Reducing Patch-Level Embeddings (2025.findings-acl)

Copied to clipboard

Challenge: Visualized Document Retrieval (VDR) uses large vision-language models to encode document pages into embeddings.
Approach: They evaluate methods to reduce patch embeddings per page while minimizing performance degradation.
Outcome: The proposed method maintains 98.2% of retrieval performance with only 11.8% of original memory usage and preserves 94.6% effectiveness at 2% memory footprint.
Solid-SQL: Enhanced Schema-linking based In-context Learning for Robust Text-to-SQL (2025.coling-main)

Copied to clipboard

Challenge: Existing text-to-SQL approaches have overlooked the critical aspect of system robustness.
Approach: They propose a robust text-to-SQL solution that integrates with LLMs . their method achieves SOTA SQL execution accuracy levels of 82.1% and 58.9% .
Outcome: The proposed solution achieves SOTA SQL execution accuracy levels of 82.1% and 58.9% on the general Spider and Bird benchmarks.
Decomposition for Enhancing Attention: Improving LLM-based Text-to-SQL through Workflow Paradigm (2024.findings-acl)

Copied to clipboard

Challenge: In-context learning of large-language models has achieved remarkable success in the field of natural language processing . however, the single-step chain-of-thought prompting approach faces challenges such as attention diffusion and inadequate performance in complex tasks like text-to-SQL.
Approach: They propose a workflow paradigm method to enhance the attention and problem-solving scope of large-language models through decomposition.
Outcome: The proposed method outperforms existing methods on three datasets and improves the upper limit of LLM-based approaches.
Toward Structured Knowledge Reasoning: Contrastive Retrieval-Augmented Generation on Experience (2025.findings-acl)

Copied to clipboard

Challenge: Large language models struggle to infer implicit relationships embedded in tabular formats . authors introduce a framework that builds experience memory representations and enhances generalization through contrastive In-Context Learning (ICL).
Approach: They propose a framework that builds experience memory representations and enhances generalization through contrastive In-Context Learning to simulate human-like knowledge transfer.
Outcome: Experiments on Text-to-SQL and TableQA show CoRE significantly improves performance . it achieves gains of 3.44% and 4.24%, with up to 17.2% on challenging tasks .
Parallelism and Generation Order in Masked Diffusion Language Models: Limits Today, Potential Tomorrow (2026.findings-acl)

Copied to clipboard

Challenge: Autoregressive (AR) language models dominate modern natural language processing due to strong likelihood-based training objectives and reliable left-to-right decoding.
Approach: They characterize MDLM behavior along two dimensions: parallelism strength and generation order . authors propose a Generate-then-Edit paradigm that mitigates dependency loss .
Outcome: The proposed model improves on tasks that require "backward information" the Generate-then-Edit paradigm improves parallel decoding efficiency while reducing dependency loss.
ORANGE: Text-video Retrieval via Watch-time-aware Heterogeneous Graph Contrastive Learning (2023.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for text-video retrieval focus on informative representations and delicate matching mechanisms, but real-world scenarios often involve brief, ambiguous queries and low-quality videos.
Approach: They propose a novel method to learn informative embeddings for queries and videos . they use a watch-time-aware contrastive learning paradigm to capture dependencies .
Outcome: The proposed method is effective in a real-world video-search service.
Intent-Driven Semantic ID Generation for Grounded Conversational News Recommendation (2026.acl-industry)

Copied to clipboard

Challenge: a new approach to news recommendation grounds each suggestion in a rapidly evolving article corpus while addressing implicit user intents that lack explicit retrievable keywords.
Approach: They propose an intent-driven Semantic ID generation paradigm to address these challenges . they map diverse intents to hierarchical SID prefixes and then fuzzy-match them to current news pool .
Outcome: The proposed model achieves 0% hallucination and 12.4% L1 match on a mainstream Chinese news platform.
Uncertainty-Aware Iterative Preference Optimization for Enhanced LLM Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for enhancing the performance of large language models require expensive manual annotations.
Approach: They propose an offline direct preference optimization method that collects preference pairs through iterative sampling and execution feedback to improve model confidence.
Outcome: The proposed method improves performance on three reasoning tasks and shows a 3.6% improvement over the standard method.
LIST: Linearly Incremental SQL Translator for Single-Hop Reasoning, Generation and Verification (2025.findings-acl)

Copied to clipboard

Challenge: Existing schema linking methods are not able to handle complex SQL queries.
Approach: They propose a new algorithm that transforms SQL queries into grammatically verifiable sub-queries which are arranged sequentially to reflect single-hop reasoning steps.
Outcome: The proposed algorithm achieves significant performance gains on the BIRD dataset and surpasses schema linking methods at comparable or better cost.
Do *they* mean ‘us’? Interpreting Referring Expression variation under Intergroup Bias (2024.findings-emnlp)

Copied to clipboard

Challenge: We model intergroup bias as a tagging task on English sports comments from forums dedicated to fandom for NFL teams . linguistic descriptions of win probability are used for large-scale analysis of intergroup variation .
Approach: They propose to model intergroup bias as a tagging task on NFL fan comments . they use linguistic models to model the bias and use them to generate large-scale annotations .
Outcome: The proposed model can reveal unobserved variations in the form of referents across win probabilities.
DSRAG: A Double-Stream Retrieval-Augmented Generation Framework for Countless Intent Detection (2025.naacl-industry)

Copied to clipboard

Challenge: Current intent detection work experiments with minor intent categories.
Approach: They propose a retrieval-augmented generation framework that uses query-to-query and query- to-metadata approaches to retrieve intents from metadata.
Outcome: The proposed framework improves on query-to-query (Q2Q) and query- to-metadata (Q 2M) approaches.
SOAR: Supervision from Observation for Agentic Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Prior work assigns supervision based on outcome rewards or external reward models, but ignores environment observations, a critical source of learning.
Approach: They propose a supervision-based agentic reinforcement learning system that integrates environment observations as an explicit supervision signal.
Outcome: The proposed model improves performance on reasoning and deep research tasks while reducing erroneous and inefficient tool usage.
Towards Multi-System Log Anomaly Detection (2025.acl-industry)

Copied to clipboard

Challenge: Existing models require dataset-specific training, causing costly procedures and performance bottlenecks.
Approach: They propose a log anomaly detection model with semantic relational reasoning that extracts cross-system semantic patterns and encodes them as high-dimensional learnable vectors.
Outcome: The proposed model extracts cross-system semantic patterns and encodes them as high-dimensional learnable vectors.
LIME: Less Is More for MLLM Evaluation (2025.findings-acl)

Copied to clipboard

Challenge: Existing MLLM benchmarks and unified evaluation frameworks cannot accurately and efficiently reflect the ability of MLMLs.
Approach: They propose a semi-automated benchmark curated using a pipeline that filters out uninformative samples and eliminates answer leakage by focusing on tasks that require image-based understanding.
Outcome: The proposed benchmark reduces the number of samples by 76% and evaluation time by 77% while it can more effectively distinguish different models’ abilities.

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