← Search

Gezheng Xu

14 accepted papers

2026

Attention with Routed-Memory for Learnable Sparse Control

ICML 2026poster

Despite advances in long-context inference, large language models (LLMs) remain fundamentally limited by the key-value (KV) caching mechanisms that are necessary for stable computation. Management techniques, such as selective token eviction and pruning, have vastly mitigated the issues that have ar…

Cited by 0SourceScholar
2026

Baguan-TS: dual in-context learning model for time series forecasting with covariates

ICML 2026poster

Transformers enable in-context learning (ICL) for rapid, gradient-free adaptation in time series forecasting, yet most ICL-style approaches rely on tabularized, hand-crafted features, while end-to-end sequence models lack inference-time adaptation. We bridge this gap with a unified framework, Baguan…

Cited by 0SourceScholar
2026

Discretized Density-Guided Source-Free Adaptation for Continuous Targets

ICML 2026spotlight

Source-Free Domain Adaptation (SFDA) enables model adaptation under distribution shifts without access to source data, providing a practical solution for privacy-sensitive applications and having shown substantial progress in classification. In contrast, regression involves ordered and continuous ta…

Cited by 0SourceScholar
2026

FUSE: Full‑spectrum Unlearnable Examples via Spectral Equalization

ICML 2026poster

Unlearnable examples (UEs) protect training data by injecting imperceptible perturbations so that models fail to extract exploitable representations. In this paper, we reveal that existing UEs exhibit a critical failure once low-pass filtering is applied, indicating that the effective perturbation s…

Cited by 0SourceScholar
2026

When Priors Backfire: On the Vulnerability of Unlearnable Examples to Pretraining

ICLR 2026poster

Unlearnable Examples (UEs) are introduced as a data protection strategy that generates imperceptible perturbations to mislead models into learning spurious correlations rather than real semantics. In this paper, we reveal a fundamental vulnerability of UEs that emerges when learning starts from a pr…

Cited by 0SourcecodeScholar
2025

Homophily Enhanced Graph Domain Adaptation

ICML 2025poster

Graph Domain Adaptation (GDA) transfers knowledge from labeled source graphs to unlabeled target graphs, addressing the challenge of label scarcity. In this paper, we highlight the significance of graph homophily, a pivotal factor for graph domain alignment, which, however, has long been overlooked…

Cited by 0SourcePDFScholar
2025

Leveraging Group Classification with Descending Soft Labeling for Deep Imbalanced Regression

AAAI 2025technical

Deep imbalanced regression (DIR), where the target values have a highly skewed distribution and are also continuous, is an intriguing yet under-explored problem in machine learning. While recent works have already shown that incorporating various classification-based regularizers can produce enha…

2025

Revisiting Source-Free Domain Adaptation: a New Perspective via Uncertainty Control

ICLR 2025poster

Source-Free Domain Adaptation (SFDA) seeks to adapt a pre-trained source model to the target domain using only unlabeled target data, without access to the original source data. While current state-of-the-art (SOTA) methods rely on leveraging weak supervision from the source model to extract reliabl…

Cited by 0SourcePDFScholar
2025

Versatile Transferable Unlearnable Example Generator

NeurIPS 2025poster

The rapid growth of publicly available data has fueled deep learning advancements but also raises concerns about unauthorized data usage. Unlearnable Examples (UEs) have emerged as a data protection strategy that introduces imperceptible perturbations to prevent unauthorized learning. However, most…

Cited by 0SourcecodeScholar
2025

ZETA: Leveraging $Z$-order Curves for Efficient Top-$k$ Attention

ICLR 2025poster

Over recent years, the Transformer has become a fundamental building block for sequence modeling architectures. Yet at its core is the use of self-attention, whose memory and computational cost grow quadratically with the sequence length $N$, rendering it prohibitively expensive for long sequences.…

Cited by 2SourcePDFScholar
2024

Generalizing across Temporal Domains with Koopman Operators

AAAI 2024technical

In the field of domain generalization, the task of constructing a predictive model capable of generalizing to a target domain without access to target data remains challenging. This problem becomes further complicated when considering evolving dynamics between domains. While various approaches have…

Cited by 6SourcePDFScholar
2023

When Source-Free Domain Adaptation Meets Learning with Noisy Labels

ICLR 2023top-25%

Recent state-of-the-art source-free domain adaptation (SFDA) methods have focused on learning meaningful cluster structures in the feature space, which have succeeded in adapting the knowledge from source domain to unlabeled target domain without accessing the private source data. However, existing…

Cited by 57SourcePDFScholar
2022

On Learning Fairness and Accuracy on Multiple Subgroups

NeurIPS 2022accept

We propose an analysis in fair learning that preserves the utility of the data while reducing prediction disparities under the criteria of group sufficiency. We focus on the scenario where the data contains multiple or even many subgroups, each with limited number of samples. As a result, we present…