← Search

Xingxuan Zhang

23 accepted papers

2026

Error Slice Discovery via Manifold Compactness

AAAI 2026technical

Despite the great performance of deep learning models in many areas, they still make mistakes and underperform on certain subsets of data, i.e. error slices. Given a trained model, it is important to identify its semantically coherent error slices that are easy to interpret, which is referred to as

Cited by 0SourcePDFScholar
2026

Generating Risky Samples with Conformity Constraints via Diffusion Models

AAAI 2026technical

Although neural networks achieve promising performance in many tasks, they may still fail when encountering some examples and bring about risks to applications. To discover risky samples, previous literature attempts to search for patterns of risky samples within existing datasets or inject perturba

Cited by 0SourcePDFScholar
2026

MiniX: Mitigating Low-Rank Collapse and Attention Bottlenecks in Tabular Foundation Models

ICML 2026poster

Recent tabular foundation models routinely match or surpass strong tree ensembles and specialized deep architectures, yet their numeric embeddings remain a bottleneck. We diagnose a low-rank collapse induced by the prevalent linear+ID scheme and introduce RaBEL, a compact Radial Basis Embedding Laye…

Cited by 0SourceScholar
2025

COUNTS: Benchmarking Object Detectors and Multimodal Large Language Models under Distribution Shifts

CVPR 2025highlight

Current object detectors often suffer significant performance degradation in real-world applications when encountering distributional shifts, posing serious risks in high-stakes domains such as autonomous driving and medical diagnosis. Consequently, the out-of-distribution (OOD) generalization capab…

Cited by 0SourcePDFScholar
2025

ODP-Bench: Benchmarking Out-of-Distribution Performance Prediction

ICCV 2025poster

Recently, there has been gradually more attention paid to Out-of-Distribution (OOD) performance prediction, whose goal is to predict the performance of trained models on unlabeled OOD test datasets, so that we could better leverage and deploy off-the-shelf trained models in risk-sensitive scenarios.…

2025

On the Out-Of-Distribution Generalization of Large Multimodal Models

CVPR 2025poster

We investigate the generalization boundaries of current Large Multimodal Models (LMMs) via comprehensive evaluation under out-of-distribution scenarios and domain-specific tasks. We evaluate their zero-shot generalization across synthetic images, real-world distributional shifts, and specialized dat…

2025

Understanding the Generalization of In-Context Learning in Transformers: An Empirical Study

ICLR 2025poster

Large language models (LLMs) like GPT-4 and LLaMA-3 utilize the powerful in-context learning (ICL) capability of Transformer architecture to learn on the fly from limited examples. While ICL underpins many LLM applications, its full potential remains hindered by a limited understanding of its genera…

2024

Rethinking the Evaluation Protocol of Domain Generalization

CVPR 2024poster

Domain generalization aims to solve the challenge of Out-of-Distribution (OOD) generalization by leveraging common knowledge learned from multiple training domains to generalize to unseen test domains. To accurately evaluate the OOD generalization ability it is required that test data information is…

2024

Zero-shot Generalizable Incremental Learning for Vision-Language Object Detection

NeurIPS 2024poster

This paper presents Incremental Vision-Language Object Detection (IVLOD), a novel learning task designed to incrementally adapt pre-trained Vision-Language Object Detection Models (VLODMs) to various specialized domains, while simultaneously preserving their zero-shot generalization capabilities for…

2023

Class Incremental Robotic Pick-and-Place via Incremental Few-Shot Object Detection

RA-L 2023

We introduce a new task, called Class Incremental Robotic Pick-and-Place (CIRPAP), which calls for the capacity to learn to pick and place new categories of objects while retaining the skill of dealing with the previously learned ones. CIRPAP faces three challenges: catastrophic forgetting, few-shot

Cited by 10SourceScholar
2023

Competing for Shareable Arms in Multi-Player Multi-Armed Bandits

ICML 2023poster

Competitions for shareable and limited resources have long been studied with strategic agents. In reality, agents often have to learn and maximize the rewards of the resources at the same time. To design an individualized competing policy, we model the competition between agents in a novel multi-pla…

2023

Flatness-Aware Minimization for Domain Generalization

ICCV 2023poster

Domain generalization (DG) seeks to learn robust models that generalize well under unknown distribution shifts. As a critical aspect of DG, optimizer selection has not been explored in depth. Currently, most DG methods follow the widely used benchmark, DomainBed, and utilize Adam as the default opti…

Cited by 30PDFScholar
2023

Gradient Norm Aware Minimization Seeks First-Order Flatness and Improves Generalization

CVPR 2023highlight

Recently, flat minima are proven to be effective for improving generalization and sharpness-aware minimization (SAM) achieves state-of-the-art performance. Yet the current definition of flatness discussed in SAM and its follow-ups are limited to the zeroth-order flatness (i.e., the worst-case loss w…

2023

Motion Forecasting Network (MoFCNet): IMU-Based Human Motion Forecasting for Hip Assistive Exoskeleton

RA-L 2023

Accurate recognition of human pose and prediction of human motion intention are essential for exoskeleton robots to provide effective assistance. In recent years, inertial measurement units (IMUs) have been widely used to estimate human pose due to their stability and economy. However, physical sens

Cited by 14SourceScholar
2023

NICO++: Towards Better Benchmarking for Domain Generalization

CVPR 2023poster

Despite the remarkable performance that modern deep neural networks have achieved on independent and identically distributed (I.I.D.) data, they can crash under distribution shifts. Most current evaluation methods for domain generalization (DG) adopt the leave-one-out strategy as a compromise on the…

2023

Stable Learning via Sparse Variable Independence

AAAI 2023technical

The problem of covariate-shift generalization has attracted intensive research attention. Previous stable learning algorithms employ sample reweighting schemes to decorrelate the covariates when there is no explicit domain information about training data. However, with finite samples, it is difficul…

Cited by 17SourcePDFScholar
2022

A Theoretical Analysis on Independence-driven Importance Weighting for Covariate-shift Generalization

ICML 2022spotlight

Covariate-shift generalization, a typical case in out-of-distribution (OOD) generalization, requires a good performance on the unknown test distribution, which varies from the accessible training distribution in the form of covariate shift. Recently, independence-driven importance weighting algorith…

2022

Product Ranking for Revenue Maximization with Multiple Purchases

NeurIPS 2022accept

Product ranking is the core problem for revenue-maximizing online retailers. To design proper product ranking algorithms, various consumer choice models are proposed to characterize the consumers' behaviors when they are provided with a list of products. However, existing works assume that each cons…

2021

Deep Stable Learning for Out-of-Distribution Generalization

CVPR 2021poster

Approaches based on deep neural networks have achieved striking performance when testing data and training data share similar distribution, but can significantly fail otherwise. Therefore, eliminating the impact of distribution shifts between training and testing data is crucial for building perform…

Cited by 347PDFcodeScholar