← Search

Xizhao Luo

5 accepted papers

2026

AlphaRouter: Token-level Routing Between SLM and LLM with Reinforcement Learning and Tree Search

ICML 2026poster

SLM-LLM routing accelerates generation by strategically invoking LLMs for critical tokens. However, existing methods typically train routers to mimic the LLM, capping performance at the reference trajectory's limit. In this work, we demonstrate that the SLM-LLM collaborative inference space offers a…

Cited by 0SourceScholar
2026

Forgetting by Pruning: Data Deletion in Join Cardinality Estimation

AAAI 2026technical

Machine unlearning in learned cardinality estimation (CE) systems presents unique challenges due to the complex distributional dependencies in multi-table relational data. Specifically, data deletion, a core component of machine unlearning, faces three critical challenges in learned CE models: attri

Cited by 0SourcePDFScholar
2026

GRASP: Awakening Latent Spatial Reasoning in LVLMs via Training-free Geometric Rectification

ICML 2026poster

Large Vision-Language Models (LVLMs) exhibit remarkable general capabilities but struggle significantly with spatial reasoning tasks. In this paper, we uncover a critical representation-output misalignment via linear probing: LVLMs correctly encode spatial features internally, but generate incorrect…

Cited by 0SourceScholar
2026

Learning Molecular Semantic Invariant Representation with Prototype Constraint

ICML 2026poster

Molecular representation learning has achieved remarkable progress in molecular property prediction, yet out-of-distribution (OOD) generalization remains challenging. In practice, training data typically cover only a limited portion of the chemical space, causing models to rely on environment-depend…

Cited by 0SourceScholar
2026

Multi-scale Explainer for Graph Neural Networks

ICML 2026poster

Explainability for graph neural networks (GNNs) aims to unveil the complex decision logic of learned models by identifying the most influential structures in the input graph, thereby improving transparency and trustworthiness. Existing post-hoc explainers typically extract a sparse key subgraph at a…

Cited by 0SourceScholar