Papers by Juncheng Liu

11 papers
HATA: Trainable and Hardware-Efficient Hash-Aware Top-k Attention for Scalable Large Model Inference (2025.findings-acl)

Copied to clipboard

Challenge: Existing top-k attention methods struggle to strike a balance between efficiency and accuracy.
Approach: They propose a top-k attention approach that integrates low-overhead techniques into the Top-k Attention process to achieve 7.2 speedup compared to vanilla full attention.
Outcome: The proposed approach achieves 7.2 speedup compared to current top-k attention methods while maintaining model accuracy.
Self-supervised Meta-Prompt Learning with Meta-Gradient Regularization for Few-shot Generalization (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for prompt tuning can overfit to few-shot training samples, causing overfitting . authors propose a new framework for prompt learning with supervised meta-learning .
Approach: They propose a self-supervised meta-prompt learning framework with MEta-gradient Regularization for few-shot generalization that leverages self-recognized meta-learning with a diverse set of meta-tasks to learn a universal prompt initialization using only unlabeled data.
Outcome: The proposed framework learns a universal prompt initialization for efficient adaptation using only unlabeled data.
Align2LLaVA: Cascaded Human and Large Language Model Preference Alignment for Multi-modal Instruction Curation (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in Multi-modal Large Language Models (MLLMs) introduce significant variability in data quality.
Approach: They propose to use human and LLM preference alignment to compress large corpus of machine-generated multimodal instructions into a compact and high-quality form.
Outcome: The proposed algorithm outperforms LLaVA-series models in MLLM benchmarks by 90% . it uses human and LLM preference alignment to compress a large dataset .
TeamLoRA: Boosting Low-Rank Adaptation with Expert Collaboration and Competition (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for fine-tuning are resource-efficient, but performance often falls short . a new approach, TeamLoRA, integrates collaborative and competitive modules to improve performance.
Approach: They propose to introduce task-specific LoRA as domain experts to improve learning efficiency . teamLoRA integrates collaborative and competition modules to improve model learning .
Outcome: Experiments show that TeamLoRA improves performance in multi-task learning . teamLorea integrates collaborative and competitive modules to improve performance .
Global Structure Knowledge-Guided Relation Extraction Method for Visually-Rich Document (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods focus on manipulating entity features to find pairwise relations, yet neglect the more fundamental structural information that links disparate entity pairs together.
Approach: They propose a Visual Relation Extraction framework that generates relation predictions on entity pairs extracted from scanned images and incorporates global structural knowledge into the representations of the entities.
Outcome: The proposed framework outperforms existing methods in fine-tuning setting and yields stronger data-efficient performance in the low-resource setting.
Dangling-Aware Entity Alignment with Mixed High-Order Proximities (2022.findings-naacl)

Copied to clipboard

Challenge: Existing methods for dangling-aware entity alignment are underexplored but important problem.
Approach: They propose a framework that uses high-order proximities to detect dangling entities and align matchable entities.
Outcome: The proposed framework detects dangling entities and aligns matchable entities better than existing methods.
Should We Rely on Entity Mentions for Relation Extraction? Debiasing Relation Extraction with Counterfactual Analysis (2022.naacl-main)

Copied to clipboard

Challenge: Existing studies rely on entity information for sentence-level relation extraction (RE) but this can leak superficial and spurious clues of relations.
Approach: They propose to use entity mentions to extract relations from textual context . they use a causal graph to model dependencies between variables in RE models .
Outcome: The proposed method yields significant gains on both effectiveness and generalization for RE.
Distilling the Essence, Discarding the Dross: Improving Fairness in Multimodal Large Language Models via Historical Reflection-Guided Prompt Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to debiase MLLMs rely on handcrafted prompts that are brittle and difficult to generalize across tasks and bias types.
Approach: They propose an adaptive self-debiasing framework that optimizes task-specific debiasers to suppress stereotypical outputs.
Outcome: The proposed framework suppresses stereotypical outputs while maintaining performance.
Guided by the Plan: Enhancing Faithful Autoregressive Text-to-Audio Generation with Guided Decoding (2026.eacl-long)

Copied to clipboard

Challenge: Autoregressive (AR) models excel at generating temporally coherent audio by producing tokens sequentially, yet they often falter in faithfully following complex textual prompts.
Approach: They propose a lightweight auxiliary model trained with a GAE-inspired objective to predict final instruction-following quality from partial generations.
Outcome: The proposed model achieves 10 points improvement in CLAP score over baseline AR models while maintaining computational parity with best-of-N decoding.
SWE-AGILE: A Software Agent Framework for Efficiently Managing Dynamic Reasoning Context (2026.findings-acl)

Copied to clipboard

Challenge: representative ReAct-style approaches lack explicit System-2 reasoning for deep analysis and handling complex edge cases.
Approach: They propose a software agent framework that preserves full reasoning history while compressing historical reasoning content into concise Reasoning Digests.
Outcome: Empirically, the proposed framework sets a new standard for 7B-8B models on SWE-Bench-Verified using only 2.2k trajectories and 896 tasks.
A Survey of Reinforcement Learning for Large Language Models under Data Scarcity: Challenges and Solutions (2026.acl-long)

Copied to clipboard

Challenge: Existing research on reinforcement learning for LLMs under data scarcity has not been unified.
Approach: They propose a top-up hierarchical framework built around three complementary perspectives: data-centric, training-centric and framework-centric.
Outcome: The proposed framework provides a clear conceptual foundation for understanding the design space of data-efficient RL for large language models and to guide researchers working in this emerging area.

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