@inproceedings{shirai-etal-2026-generalization,
    title = "Generalization in Graph Reasoning: A Systematic Comparison of {LLM} Training Approaches",
    author = "Shirai, Sola  and
      Srinivas, Kavitha  and
      Dolby, Julian  and
      Katz, Michael  and
      Sohrabi, Shirin  and
      Samulowitz, Horst",
    editor = "Gupta, Vivek  and
      Ding, Kaize  and
      Kokel, Harsha  and
      Zhao, Yue  and
      Agarwal, Amit  and
      Wang, Yu  and
      Glass, Michael  and
      Zhang, Yu  and
      Srinivas, Kavitha  and
      Chen, Xiusi  and
      Hassanzadeh, Oktie  and
      Zhu, Qi  and
      Chang, Shuaichen  and
      Luo, Yuan",
    booktitle = "Proceedings of the First Workshop on Structured Understanding, Retrieval, and Generation in the {LLM} Era ({SURG}e{LLM} 2026)",
    month = jul,
    year = "2026",
    address = "San Diego, California, United States",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/ingest-acl-workshops/2026.surgellm-1.18/",
    pages = "275--297",
    ISBN = "979-8-89176-406-4",
    abstract = "For large language models (LLMs), reasoning over graphs can help solve many problems. Prior work has tried to improve LLM graph reasoning through different training methods, but the merits of such approaches remain unclear and the limitations of each approach with respect to generalizability of reasoning are often not thoroughly explored. In this paper we systematically compare the ability of LLMs to learn fundamental graph tasks across a variety of training methods and their ability to generalize out of distribution across various dimensions. We highlight key tradeoffs between training methods, e.g., training specialized graph encoders and fusing their embeddings with LLMs consistently collapses in terms of generalizability; however, no single method shows clear superiority across all dimensions of generalizability, regardless of the size of the model."
}