← Search

Tianxin Wei

19 accepted papers

2026

MC-Search: Evaluating and Enhancing Multimodal Agentic Search with Structured Long Reasoning Chains

ICLR 2026oral

With the increasing demand for step-wise, cross-modal, and knowledge-grounded reasoning, multimodal large language models (MLLMs) are evolving beyond the traditional fixed retrieve-then-generate paradigm toward more sophisticated agentic multimodal retrieval-augmented generation (MM-RAG). Existing b…

Cited by 0SourceScholar
2026

Seeing but Not Believing: Probing the Disconnect Between Visual Attention and Answer Correctness in VLMs

ICLR 2026poster

Vision-Language Models (VLMs) achieve strong results on multimodal tasks such as visual question answering, yet they can still fail even when the correct visual evidence is present. In this work, we systematically investigate whether these failures arise from not perceiving the evidence or from not…

Cited by 0SourceScholar
2025

Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting

ICML 2025poster

Time-series forecasting plays a critical role in many real-world applications. Although increasingly powerful models have been developed and achieved superior results on benchmark datasets, through a fine-grained sample-level inspection, we find that (i) no single model consistently outperforms othe…

2025

CLIMB: Class-imbalanced Learning Benchmark on Tabular Data

NeurIPS 2025poster

Class-imbalanced learning (CIL) on tabular data is important in many real-world applications where the minority class holds the critical but rare outcomes. In this paper, we present CLIMB, a comprehensive benchmark for class-imbalanced learning on tabular data. CLIMB includes 73 real-world dataset…

Cited by 0SourcecodeScholar
2025

Graph4MM: Weaving Multimodal Learning with Structural Information

ICML 2025poster

Real-world multimodal data usually exhibit complex structural relationships beyond traditional one-to-one mappings like image-caption pairs. Entities across modalities interact in intricate ways, with images and text forming diverse interconnections through contextual dependencies and co-references.…

Cited by 0SourcePDFScholar
2025

LLM-Forest: Ensemble Learning of LLMs with Graph-Augmented Prompts for Data Imputation

ACL 2025finding

Missing data imputation is a critical challenge in various domains, such as healthcare and finance, where data completeness is vital for accurate analysis. Large language models (LLMs), trained on vast corpora, have shown strong potential in data generation, making them a promising tool for data imp…

2025

Latte: Collaborative Test-Time Adaptation of Vision-Language Models in Federated Learning

ICCV 2025poster

Test-time adaptation with pre-trained vision-language models has gained increasing attention for addressing distribution shifts during testing. Among these approaches, memory-based algorithms stand out due to their training-free nature and ability to leverage historical test data. However, existing…

2025

Learning to Instruct: Fine-Tuning a Task-Aware Instruction Optimizer for Black-Box LLMs

EMNLP 2025

The performance of Large Language Models (LLMs) critically depends on designing effective instructions, which is particularly challenging for black-box LLMs with inaccessible internal states. To this end, we introduce Learning to Instruct , a novel paradigm that formulates instruction optimization a

Cited by 0SourcePDFScholar
2025

SelfElicit: Your Language Model Secretly Knows Where is the Relevant Evidence

ACL 2025long

Providing Language Models (LMs) with relevant evidence in the context (either via retrieval or user-provided) can significantly improve their ability to provide better-grounded responses. However, recent studies have found that LMs often struggle to fully comprehend and utilize key evidence from the…

2025

i$^2$VAE: Interest Information Augmentation with Variational Regularizers for Cross-Domain Sequential Recommendation

UAI 2025

Cross-Domain Sequential Recommendation (CDSR) leverages user behaviors across multiple domains to mitigate data sparsity and cold-start challenges in Single-Domain Sequential Recommendation. Existing methods primarily rely on shared users (overlapping users) to learn transferable interest representa

2024

Graph Mixup on Approximate Gromov–Wasserstein Geodesics

ICML 2024poster

Mixup, which generates synthetic training samples on the data manifold, has been shown to be highly effective in augmenting Euclidean data. However, finding a proper data manifold for graph data is non-trivial, as graphs are non-Euclidean data in disparate spaces. Though efforts have been made, most…

Cited by 12SourcePDFScholar
2024

Language Models as Semantic Indexers

ICML 2024poster

Semantic identifier (ID) is an important concept in information retrieval that aims to preserve the semantics of objects such as documents and items inside their IDs. Previous studies typically adopt a two-stage pipeline to learn semantic IDs by first procuring embeddings using off-the-shelf text en…

2024

TAU: Trajectory Data Augmentation with Uncertainty for Next POI Recommendation

AAAI 2024technical

Next Point-of-Interest (POI) recommendation has been proven effective at utilizing sparse, intricate spatial-temporal trajectory data to recommend subsequent POIs to users. While existing methods commonly alleviate the problem of data sparsity by integrating spatial-temporal context information, POI…

Cited by 12SourcePDFScholar
2024

Towards Unified Multi-Modal Personalization: Large Vision-Language Models for Generative Recommendation and Beyond

ICLR 2024poster

Developing a universal model that can effectively harness heterogeneous resources and respond to a wide range of personalized needs has been a longstanding community aspiration. Our daily choices, especially in domains like fashion and retail, are substantially shaped by multi-modal data, such as pi…

2023

Adaptive Test-Time Personalization for Federated Learning

NeurIPS 2023poster

Personalized federated learning algorithms have shown promising results in adapting models to various distribution shifts. However, most of these methods require labeled data on testing clients for personalization, which is usually unavailable in real-world scenarios. In this paper, we introduce a n…

2023

Meta-Learning with Neural Bandit Scheduler

NeurIPS 2023poster

Meta-learning has been proven an effective learning paradigm for training machine learning models with good generalization ability. Apart from the common practice of uniformly sampling the meta-training tasks, existing methods working on task scheduling strategies are mainly based on pre-defined sam…

2023

NTK-approximating MLP Fusion for Efficient Language Model Fine-tuning

ICML 2023poster

Fine-tuning a pre-trained language model (PLM) emerges as the predominant strategy in many natural language processing applications. However, even fine-tuning the PLMs and doing inference are expensive, especially on edge devices with low computing power. Some general approaches (e.g. quantization a…

2022

Augmentations in Hypergraph Contrastive Learning: Fabricated and Generative

NeurIPS 2022accept

This paper targets at improving the generalizability of hypergraph neural networks in the low-label regime, through applying the contrastive learning approach from images/graphs (we refer to it as HyperGCL). We focus on the following question: How to construct contrastive views for hypergraphs via a…