LLaTA: Unlocking Graph Structure Learning with Tree-Guided Large Language Models
LLaTA reformulates graph structure learning (GSL) by treating it as a tree optimization problem instead of training edge predictors. It uses structural entropy to build an encoding tree that guides a large language model's in-context learning to integrate textual information. This allows for training-free, decoupled GSL that achieves state-of-the-art results without fine-tuning the LLM.