Papers by Hui Tian

13 papers
PaddleSpeech: An Easy-to-Use All-in-One Speech Toolkit (2022.naacl-demo)

Copied to clipboard

Challenge: PaddleSpeech is an open-source speech toolkit that supports speech-to-text and text-to speech tasks.
Approach: They describe the design philosophy and core architecture of PaddleSpeech to support several essential speech-to-text and text-to speech tasks.
Outcome: The proposed framework achieves competitive or state-of-the-art performance on various speech datasets and implements the most popular methods.
Attn-GS: Attention-Guided Context Compression for Efficient Personalized LLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to personalize large language models (LLMs) rely on heuristic methods to compress user profiles but they ignore how LLMs process and prioritize different profile components.
Approach: They propose an attention-guided context compression framework that leverages attention feedback from a marking model to mark important personalization sentences and guides a compression model to generate task-relevant compressed user contexts.
Outcome: The proposed framework outperforms baselines across tasks, token limits, and settings while reducing token usage by 50 times.
PlanGenLLMs: A Modern Survey of LLM Planning Capabilities (2025.acl-long)

Copied to clipboard

Challenge: Existing studies have focused on developing LLMs to automate complex planning tasks.
Approach: They propose to provide a comprehensive overview of current LLM planners to fill this gap . they examine performance criteria including completeness, executability, optimality, representation, generalization, and efficiency .
Outcome: The proposed survey examines performance criteria for LLM planners and highlights their strengths and weaknesses.
Facilitating Long Context Understanding via Supervised Chain-of-Thought Reasoning (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have enabled them to process increasingly longer sequences, ranging from 2K to 2M tokens and even beyond.
Approach: They propose a synthetic dataset in the financial domain that integrates Chain-of-Thought reasoning into LLMs in a supervised manner to facilitate effective long-context understanding.
Outcome: The proposed model outperforms standard GPT-4o-mini on the Loong benchmark and fine tunes LLaMA-3.1-8B-Instruct on the model, achieving a 28.0% gain on the financial subset.
Dual Context-Guided Continuous Prompt Tuning for Few-Shot Learning (2022.findings-acl)

Copied to clipboard

Challenge: Existing prompt-based paradigms have shown their competitive performance in many NLP tasks, but their effectiveness varies upon the model and training data.
Approach: They propose a dual context-guided continuous prompt tuning method that integrates contextual information into the input input.
Outcome: The proposed method outperforms existing prompt tuning methods in the few-shot setting and can be used in many NLP tasks.
A Localized Geometric Method to Match Knowledge in Low-dimensional Hyperbolic Space (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods for entity alignment are limited to Euclidean space and hyperbolic embedding can represent hierarchical structure in knowledge graphs.
Approach: They propose a localized geometric method to find equivalent entities in hyperbolic space using a hyperbolical neural network.
Outcome: The proposed method outperforms the state-of-the-art by a large margin.
Domain-Specific Data Generation Framework for RAG Adaptation (2026.findings-acl)

Copied to clipboard

Challenge: Retrieval-Augmented Generation (RAG) combines the language understanding and reasoning capabilities of large language models (LLMs) with external retrieval to produce domain-grounded responses.
Approach: They propose a scalable and modular data-centric framework for generating domain-grounded question–answer–context triples tailored to diverse RAG adaptation strategies.
Outcome: The proposed framework generates domain-grounded question–answer–context triples for multiple RAG adaptation strategies.
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 .
Unraveling the Mechanics of Learning-Based Demonstration Selection for In-Context Learning (2025.acl-long)

Copied to clipboard

Challenge: Recent learning-based demonstration selection methods have proven beneficial to in-context learning (ICL) by choosing more useful exemplars.
Approach: They propose two methods to capture task-agnostic similarities between input and output of LLMs.
Outcome: The proposed methods integrate task-agnostic similarities of different levels between input and output of exemplars and test cases to eliminate costly data collection.
Learning to Instruct: Fine-Tuning a Task-Aware Instruction Optimizer for Black-Box LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: Learning to Instruct is a new paradigm for black-box LLMs with inaccessible internal states.
Approach: They propose a new paradigm that formulates instruction optimization as an LLM fine-tuning objective for a white-box “instruction engineer” LLM.
Outcome: The proposed framework outperforms strong baselines in performance and efficiency.
Learning Transition Patterns by Large Language Models for Sequential Recommendation (2025.coling-main)

Copied to clipboard

Challenge: Extensive experiments on six real-world datasets show our approach outperforms the best baselines by 7.33% in NDCG@10, 4.65% in Recall@10 and 8.42% in MRR.
Approach: They propose a framework for mapping sequential item texts to sequential item IDs that incorporates multi-query input and item linear projection to model conditional probability distribution of items.
Outcome: The proposed framework outperforms baseline models on six real-world datasets by 7.33% and 4.65% respectively.
DebugBench: Evaluating Debugging Capability of Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated exceptional coding capabilities, but their debugging capabilities remain relatively unexplored.
Approach: They propose a debugging benchmark consisting of 4,253 LLMs with four major bug categories and 18 minor types in C++, Java, and Python.
Outcome: The proposed benchmark covers four major bug categories and 18 minor types in C++, Java, and Python.
AgentMark: Utility-Preserving Behavioral Watermarking for Agents (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have improved text generation and reasoning.
Approach: They propose a behavioral watermarking framework that embeds multi-bit identifiers into planning decisions while preserving utility.
Outcome: The proposed framework embeds multi-bit provenance into planning decisions while preserving utility.

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