Papers by Nie Lin

10 papers
Learning Semantic Correspondences from Noisy Data-text Pairs by Local-to-Global Alignments (2020.coling-main)

Copied to clipboard

Challenge: Existing methods for data-to-text generation use a large-scale training corpus to learn semantic correspondences between structured input data and associated texts.
Approach: They propose a local-to-global alignment framework that uses local and global models to learn semantic correspondences from large-scale datasets.
Outcome: The proposed framework can be generalized to restaurant and computer domains and improve alignment accuracy.
Vision-Language Model Fine-Tuning via Simple Parameter-Efficient Modification (2024.emnlp-main)

Copied to clipboard

Challenge: Recent advances in fine-tuning Vision-Language Models have seen the success of prompt tuning and adapter tuning.
Approach: They propose a method to fine-tune CLIP without introducing any overhead of extra parameters.
Outcome: The proposed method improves CLIP by 7.27% average harmonic mean accuracy.
Operation-guided Neural Networks for High Fidelity Data-To-Text Generation (D18-1)

Copied to clipboard

Challenge: Recent neural models for data-to-text generation generate descriptions that are not consistent with structured data.
Approach: They propose a framework for data-to-text generation that uses symbolic operations to generate texts from structured data.
Outcome: The proposed framework improves the fidelity of the generated texts to the input structured data.
STSPL-SSC: Semi-Supervised Few-Shot Short Text Clustering with Semantic text similarity Optimized Pseudo-Labels (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for obtaining task-specific labels require prior knowledge of clustering categories and uncontrollable clustering centers.
Approach: They propose a framework for supervised clustering using a discrete process and a robust Contrastive Learning module.
Outcome: The proposed framework outperforms state-of-the-art models on a real-world dataset with just one label per class . the proposed framework is based on k-means clustering and a robust Contrastive Learning module .
LLaDA 1.5: Variance-Reduced Preference Optimization for Large Language Diffusion Models (2026.acl-long)

Copied to clipboard

Challenge: Masked diffusion language models have achieved significant progress in language modeling . however, the systematic analysis and empirical validation of their alignment on general tasks remains underexplored.
Approach: They propose a framework that analyzes the bias and variance of preference optimization loss and gradient based on Direct Preference Optimization.
Outcome: The proposed model outperforms its SFT-only predecessor on general benchmarks . it consistently outperformed other strong language models and ARMs on general tasks .
HAIC: Improving Human Action Understanding and Generation with Better Captions for Multi-modal Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing studies have shown that high-quality video captions can improve MLLMs' performance on videos involving human actions.
Approach: They propose a data annotation pipeline to collect videos featuring clear human actions from the Internet and annotate them in a standardized caption format that uses human attributes to distinguish individuals.
Outcome: The proposed pipeline combines two datasets to evaluate human action understanding.
A Simple Recipe towards Reducing Hallucination in Neural Surface Realisation (P19-1)

Copied to clipboard

Challenge: Recent neural language generation systems often hallucinate contents when trained on loosely corresponding pairs of the input structure and text.
Approach: They propose to integrate a language understanding module for data refinement with self-training iterations to induce strong equivalence between the input data and the paired text.
Outcome: Experiments on the E2E challenge dataset show that the proposed framework reduces relative unaligned noise by 50% compared with the current state-of-the-art ensemble generator.
BrowseComp-Plus: A Fair and Disentangled Evaluation Benchmark for Deep Search Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for deep search agents rely on blackbox web search APIs . dynamic and opaque web APIs hinder reproducibility and fair comparisons - authors .
Approach: They propose a benchmark that employs a fixed corpus for controlled retrieval for deep search agents.
Outcome: The new benchmark shows that agents that combine large language models with retrieval tools excel at complex, reasoning-intensive queries.
OSCR-Attack: One-Shot Character Level Attacks through Self-Optimizing Continuous Relaxation (2026.findings-acl)

Copied to clipboard

Challenge: Character-level adversarial attacks preserve semantics but are costly and inefficient . generative LLMs are gaining popularity due to their uncertainty and vulnerability to textual adversarials .
Approach: They propose an end-to-end framework that transforms discrete choices into continuous representations and a conflict resolution strategy that maps them back into discrete insertion operations.
Outcome: The proposed framework improves ASR by 21.45% points and accelerates the attack by 3.66 times compared to baselines.

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