236 citations · 327 across the 31 of their papers we have counts for
32 papers
Surprisingly Simple and Effective Multi-Domain Graph Foundation Model through Graph-to-Table Alignment
Chunyu Hu, Tianyin Liao, Ge Lan +4
Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains. Recent advancements in GFMs have been la…
Closed-Form Spectral Regularization for Multi-Task Model Merging
Yongxian Wei, Runxi Cheng, Xingxuan Zhang +4
Model merging combines several independently fine-tuned experts into a single multi-task model without any training data, reducing the storage, serving, and decentralized-developme…
LimiX-2M: Mitigating Low-Rank Collapse and Attention Bottlenecks in Tabular Foundation Models
Yuanrui Wang, Xingxuan Zhang, Han Yu +7
Tabular foundation models (TFMs) increasingly rival tree ensembles, but their performance is often compute-inefficient: with standard affine scalar tokenization, each feature injec…
Breaking the Quality-Privacy Tradeoff in Tabular Data Generation via In-Context Learning
Xinyan Han, Yan Lu, Xiaoyu Lin +5
Tabular data synthesis aims to generate high-quality data while preserving privacy. However, we find that existing tabular generative models exhibit a clear tradeoff in the small-d…
A Knowledge-Informed Pretrained Model for Causal Discovery
Wenbo Xu, Yue He, Yunhai Wang +4
Causal discovery has been widely studied, yet many existing methods rely on strong assumptions or fall into two extremes: either depending on costly interventional signals or parti…
TFMLinker: Universal Link Predictor by Graph In-Context Learning with Tabular Foundation Models
Tianyin Liao, Chunyu Hu, Yicheng Sui +4
Link prediction is a fundamental task in graph machine learning with widespread applications such as recommendation systems, drug discovery, knowledge graphs, etc. In the foundatio…
Generating Risky Samples with Conformity Constraints via Diffusion Models
Han Yu, Hao Zou, Xingxuan Zhang +4
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 s…
ODP-Bench: Benchmarking Out-of-Distribution Performance Prediction
Han Yu, Kehan Li, Dongbai Li +3
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…
LimiX: Unleashing Structured-Data Modeling Capability for Generalist Intelligence
Xingxuan Zhang, Gang Ren, Han Yu +35
We argue that progress toward general intelligence requires complementary foundation models grounded in language, the physical world, and structured data. This report presents Limi…
COUNTS: Benchmarking Object Detectors and Multimodal Large Language Models under Distribution Shifts
Jiansheng Li, Xingxuan Zhang, Hao Zou +6
Current object detectors often suffer significant perfor-mance degradation in real-world applications when encountering distributional shifts. Consequently, the out-of-distribution…
Understanding the Generalization of In-Context Learning in Transformers: An Empirical Study
Xingxuan Zhang, Haoran Wang, Jiansheng Li +6
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.…
Error Slice Discovery via Manifold Compactness
Han Yu, Hao Zou, Jiashuo Liu +4
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,…
A Survey on Evaluation of Out-of-Distribution Generalization
Han Yu, Jiashuo Liu, Xingxuan Zhang +2
Machine learning models, while progressively advanced, rely heavily on the IID assumption, which is often unfulfilled in practice due to inevitable distribution shifts. This render…
PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators
Renzhe Xu, Haotian Wang, Xingxuan Zhang +2
In this paper, we present the Proportional Payoff Allocation Game (PPA-Game), which characterizes situations where agents compete for divisible resources. In the PPA-game, agents s…
On the Out-Of-Distribution Generalization of Multimodal Large Language Models
Xingxuan Zhang, Jiansheng Li, Wenjing Chu +6
We investigate the generalization boundaries of current Multimodal Large Language Models (MLLMs) via comprehensive evaluation under out-of-distribution scenarios and domain-specifi…
Flatness-Aware Minimization for Domain Generalization
Xingxuan Zhang, Renzhe Xu, Han Yu +3
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 explore…
Meta Adaptive Task Sampling for Few-Domain Generalization
Zheyan Shen, Han Yu, Peng Cui +4
To ensure the out-of-distribution (OOD) generalization performance, traditional domain generalization (DG) methods resort to training on data from multiple sources with different u…
Exploring and Exploiting Data Heterogeneity in Recommendation
Zimu Wang, Jiashuo Liu, Hao Zou +4
Massive amounts of data are the foundation of data-driven recommendation models. As an inherent nature of big data, data heterogeneity widely exists in real-world recommendation sy…
Competing for Shareable Arms in Multi-Player Multi-Armed Bandits
Renzhe Xu, Haotian Wang, Xingxuan Zhang +2
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 t…
Rethinking the Evaluation Protocol of Domain Generalization
Han Yu, Xingxuan Zhang, Renzhe Xu +3
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…
Gradient Norm Aware Minimization Seeks First-Order Flatness and Improves Generalization
Xingxuan Zhang, Renzhe Xu, Han Yu +2
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 definiti…
Stable Learning via Sparse Variable Independence
Han Yu, Peng Cui, Yue He +4
The problem of covariate-shift generalization has attracted intensive research attention. Previous stable learning algorithms employ sample reweighting schemes to decorrelate the c…
Product Ranking for Revenue Maximization with Multiple Purchases
Renzhe Xu, Xingxuan Zhang, Bo Li +3
Product ranking is the core problem for revenue-maximizing online retailers. To design proper product ranking algorithms, various consumer choice models are proposed to characteriz…
NICO++: Towards Better Benchmarking for Domain Generalization
Xingxuan Zhang, Yue He, Renzhe Xu +3
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…