← Search

Hong Xu

18 accepted papers

2026

AGZO: Activation-Guided Zeroth-Order Optimization for LLM Fine-Tuning

ICML 2026poster

Zeroth-Order (ZO) optimization has emerged as a promising solution for fine-tuning LLMs under strict memory constraints, as it avoids the prohibitive memory cost of storing activations for backpropagation. However, existing ZO methods typically employ isotropic perturbations, neglecting the rich str…

Cited by 0SourceScholar
2026

UniScale: Adaptive Unified Inference Scaling via Online Joint Optimization of Model Routing and Test-Time Scaling

ICML 2026poster

In real-world deployments of large language models (LLMs), balancing inference quality and computational cost has become a central challenge. Existing approaches tackle this trade-off along two largely independent dimensions: model routing, which switches among models of different scales to match re…

Cited by 0SourceScholar
2025

ESGenius: Benchmarking LLMs on Environmental, Social, and Governance (ESG) and Sustainability Knowledge

EMNLP 2025

We introduce ESGenius , a comprehensive benchmark for evaluating and enhancing the proficiency of Large Language Models (LLMs) in Environmental, Social, and Governance (ESG) and sustainability-focused question answering. ESGenius comprises two key components: (i) ESGenius-QA , a collection of 1,136

2025

QuickLLaMA: Query-aware Inference Acceleration for Large Language Models

COLING 2025main

The capacity of Large Language Models (LLMs) to comprehend and reason over long contexts is pivotal for advancements in diverse fields. Yet, they still stuggle with capturing long-distance dependencies within sequences to deeply understand semantics. To address this issue, we introduce Query-aware I…

2025

SC-Former: A Segmentation Convolution Transformer for Lung Surgery Robots

ICRA 2025

For lung surgery robots, the precise segmentation of pulmonary fissures is very important. Damaging the inter-lobar fissures during surgery can have serious consequences. Accurately segmenting weak and abnormal fissures commonly found in clinical CT scans remains a challenging task. To solve the abo

Cited by 0SourceScholar
2025

StitchLLM: Serving LLMs, One Block at a Time

ACL 2025long

The rapid evolution of large language models (LLMs) has revolutionized natural language processing (NLP) tasks such as text generation, translation, and comprehension. However, the increasing computational demands and inference costs of these models present significant challenges. This study investi…

Cited by 0SourcePDFScholar
2024

Towards Robust Learning to Optimize with Theoretical Guarantees

CVPR 2024poster

Learning to optimize (L2O) is an emerging technique to solve mathematical optimization problems with learning-based methods. Although with great success in many real-world scenarios such as wireless communications computer networks and electronic design existing L2O works lack theoretical demonstrat…

2023

Adaptive Gating in Mixture-of-Experts based Language Models

EMNLP 2023long main

Large language models have demonstrated exceptional language understanding capabilities in many NLP tasks. Sparsely activated mixture-of-experts (MoE) has emerged as a promising solution for scaling models while maintaining a constant number of computational operations. Existing MoE models adopt a f…

Cited by 0SourceScholar
2022

Disentangled Knowledge Transfer for OOD Intent Discovery with Unified Contrastive Learning

ACL 2022short

Discovering Out-of-Domain(OOD) intents is essential for developing new skills in a task-oriented dialogue system. The key challenge is how to transfer prior IND knowledge to OOD clustering. Different from existing work based on shared intent representation, we propose a novel disentangled knowledge…

2021

Adversarial Generative Distance-Based Classifier for Robust Out-of-Domain Detection

ICASSP 2021accepted

Detecting out-of-domain (OOD) intents is critical in a task-oriented dialog system. Existing methods rely heavily on extensive manually labeled OOD samples and lack robustness. In this paper, we propose an efficient adversarial attack mechanism to augment hard OOD samples and design a novel generati…

Cited by 0SourceScholar
2021

Adversarial Self-Supervised Learning for Out-of-Domain Detection

NAACL 2021long

Detecting out-of-domain (OOD) intents is crucial for the deployed task-oriented dialogue system. Previous unsupervised OOD detection methods only extract discriminative features of different in-domain intents while supervised counterparts can directly distinguish OOD and in-domain intents but requir…

2021

Modeling Discriminative Representations for Out-of-Domain Detection with Supervised Contrastive Learning

ACL 2021short

Detecting Out-of-Domain (OOD) or unknown intents from user queries is essential in a task-oriented dialog system. A key challenge of OOD detection is to learn discriminative semantic features. Traditional cross-entropy loss only focuses on whether a sample is correctly classified, and does not expli…

2021

Novel Slot Detection: A Benchmark for Discovering Unknown Slot Types in the Task-Oriented Dialogue System

ACL 2021long

Existing slot filling models can only recognize pre-defined in-domain slot types from a limited slot set. In the practical application, a reliable dialogue system should know what it does not know. In this paper, we introduce a new task, Novel Slot Detection (NSD), in the task-oriented dialogue syst…

2020

A Deep Generative Distance-Based Classifier for Out-of-Domain Detection with Mahalanobis Space

COLING 2020main

Detecting out-of-domain (OOD) input intents is critical in the task-oriented dialog system. Different from most existing methods that rely heavily on manually labeled OOD samples, we focus on the unsupervised OOD detection scenario where there are no labeled OOD samples except for labeled in-domain…

Cited by 57SourcePDFScholar
2019

Greedy Sampling for Approximate Clustering in the Presence of Outliers

NeurIPS 2019poster

Greedy algorithms such as adaptive sampling (k-means++) and furthest point traversal are popular choices for clustering problems. One the one hand, they possess good theoretical approximation guarantees, and on the other, they are fast and easy to implement. However, one main issue with these algori…