Papers by Lan Luo

10 papers
An LLM-Enhanced Adversarial Editing System for Lexical Simplification (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to simplify text rely heavily on annotated data, making it challenging to apply in low-resource scenarios.
Approach: They propose a Lexical Simplification method without parallel corpora that uses an Adversarial Editing System and an LLM-enhanced loss to distill knowledge into a small-size LS system.
Outcome: The proposed method uses an LLM-enhanced loss to distill knowledge from Large Language Models (LLMs) into a small-size LS system.
Re-weighting Tokens: A Simple and Effective Active Learning Strategy for Named Entity Recognition (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing active learning approaches focus on information-rich sequences, reducing the need for expert annotation.
Approach: They propose a re-weighting-based active learning strategy that assigns dynamic weights to individual tokens.
Outcome: The proposed strategy improves on multiple corpora and validates its effectiveness.
Automated Peer Reviewing in Paper SEA: Standardization, Evaluation, and Analysis (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to review scientific papers are limited by their content or quality . SEA is a framework for automated scientific review, but its contents are generic or partial.
Approach: They propose a framework for automated scientific review using large language models . they propose to use a standardized review dataset to fine-tune an LLM to generate high-quality reviews.
Outcome: The proposed framework can generate high-quality reviews from standardized datasets and improves on the existing feedback mechanisms.
Table-as-Search: Agentic Information Seeking is Table Completion (2026.findings-acl)

Copied to clipboard

Challenge: Current Information Seeking (InfoSeeking) agents struggle to maintain focus and coherence during long-horizon exploration, as tracking search states within one plain-text context is inherently fragile.
Approach: They propose a structured planning framework that reformulates the InfoSeeking task as a Table Completion task.
Outcome: The proposed framework outperforms state-of-the-art frameworks across three kinds of benchmarks, including multi-agent framework and commercial systems.
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.
IGenBench: Benchmarking the Reliability of Text-to-Infographic Generation (2026.acl-long)

Copied to clipboard

Challenge: Generated infographics may appear correct at first glance but contain easily overlooked issues, such as distorted data encoding or incorrect textual content.
Approach: They propose to evaluate reliability of text-to-infographic generation using IGenBench . they employ multimodal large language models to verify each question .
Outcome: The proposed framework decomposes reliability verification into atomic yes/no questions based on a taxonomy of 10 question types.
Open-Set Living Need Prediction with Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing approaches to living need prediction treat it as a closed-set classification problem, severely limiting their ability to capture diversity and complexity of living needs.
Approach: They propose a system leveraging large language models for unrestricted need prediction that leverages Maslow's hierarchy of needs to align predictions with human living needs.
Outcome: The proposed system outperforms closed-set approaches on need-based life service recall by an average of 19.37% on real-world datasets.
HSCodeComp: A Realistic and Expert-level Agent Benchmark for Hierarchical Rule Application (2026.acl-long)

Copied to clipboard

Challenge: Existing agent benchmarks neglect hierarchical rule application in real-world domains . a critical gap persists in numerous real-life professional domains where decision-making is governed by expert-written rules.
Approach: They propose a benchmark requiring agents to assign a unique 10-digit Harmonized System (HS) Code to products by aligning their fuzzy attributes with strict tariff classification rules.
Outcome: The proposed benchmarks lack hierarchical rule application capability in real-world domains . the proposed benchmark is based on e-commerce and is open-source .
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.
Improving Neural Language Models by Segmenting, Attending, and Predicting the Future (P19-1)

Copied to clipboard

Challenge: Common language models typically predict the next word given a past context.
Approach: They propose a method that aligns the given context and the following phrase . they define syntactic heights and phrase segmentation rules to enable it to learn .
Outcome: The proposed model outperforms strong baseline models on Wikitext-103 dataset.

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