Yao Xu, Shizhu He, Jiabei Chen, ZengXiangrong ZengXiangrong, Bingning Wang, Guang Liu, Jun Zhao, Kang Liu
| Challenge: | Structured knowledge grounding (SKG) tasks are a key part of many NLP applications. |
| Approach: | They propose a framework for enhancing LLMs' ability to handle structured data . they represent various types of structured data in a unified hypergraph format . |
| Outcome: | The proposed framework outperforms existing methods on SKG tasks using LoRA finetuning. |
Similar Papers
Large Language Models are Good Relational Learners (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to serialize large language models disregard critical relational structures and creates redundancies. |
| Approach: | They propose a graph neural network encoder to create structured relational prompts for large language models within a retrieval-augmented generation framework. |
| Outcome: | The proposed architecture preserves relational structure of databases while enabling LLMs to process and reason over complex entity relationships. |
Each graph is a new language: Graph Learning with LLMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Natural language is used to describe graphs, but graph descriptions become verbose and only relying on attribute embeddings limits LLM’s ability to capture adequate graph structural information. |
| Approach: | They propose a graph-defined language for large language model that translates the graph into a corpus instead of graph descriptions and pre-trains LLMs on this corpus to adequately understand the graph. |
| Outcome: | Experiments on five datasets show that the proposed framework outperforms description-based and embedding-based baselines by efficiently modeling different orders of neighbors. |
How Much Pretraining Does Structured Data Need? (2026.eacl-long)
Copied to clipboard
| Challenge: | Large language models are increasingly adopted for handling structured data, despite pretraining on unstructured text. |
| Approach: | They propose to re-initialize subsets of layers with random weights before fine-tuning on structured datasets. |
| Outcome: | The proposed models are compared to unstructured datasets and show that they perform well over structured data. |
GALLa: Graph Aligned Large Language Models for Improved Source Code Understanding (2025.acl-long)
Copied to clipboard
| Challenge: | Programming languages have rich semantics that are represented by graphs and not available from the surface form of source code. |
| Approach: | They propose to use graph neural networks and cross-modal alignment technologies to inject structural information of code into LLMs as an auxiliary task during finetuning. |
| Outcome: | The proposed framework improves on five code tasks with six different baseline LLMs, while incurring no cost at inference time. |
Exploring the Potential of Large Language Models for Heterophilic Graphs (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing approaches for heterophilic graphs overlook rich textual data associated with nodes, which could unlock deeper insights into their heterophilistic contexts. |
| Approach: | They propose a two-stage framework to enhance node classification on heterophilic graphs by leveraging open-world knowledge encoded by large language models. |
| Outcome: | The proposed framework can be used to better characterize heterophilic graphs, where neighboring nodes often exhibit different labels. |
Optimizing Language Augmentation for Multilingual Large Language Models: A Case Study on Korean (2024.lrec-main)
Copied to clipboard
ChangSu Choi, Yongbin Jeong, Seoyoon Park, Inho Won, HyeonSeok Lim, SangMin Kim, Yejee Kang, Chanhyuk Yoon, Jaewan Park, Yiseul Lee, HyeJin Lee, Younggyun Hahm, Hansaem Kim, KyungTae Lim
| Challenge: | Large language models (LLMs) use pretraining to predict the subsequent word, but less-resourced languages are being overlooked. |
| Approach: | They propose to expand the MLLM vocabularies to enhance expressiveness and use bilingual data for pretraining to align the high- and less-resourced languages. |
| Outcome: | The proposed model outperforms existing models in qualitative analyses compared to Korean monolingual models. |
Graph-Assisted Large Language Models: A Perspective on Mitigating Intrinsic Limitations (2026.findings-acl)
Copied to clipboard
Haitong Luo, Fali Wang, Weiyao Zhang, Xianren Zhang, Zhiwei Zhang, Tianxiang Zhao, Minhua Lin, Jiahao Zhang, Hui Liu, Xianfeng Tang, Qi He, Suhang Wang, Xuying Meng, Yujun Zhang
| Challenge: | Large language models exhibit intrinsic limitations such as knowledge cutoff, single-threaded reasoning that hinders finer-grained branch and aggregation, and rigid collaboration mechanisms that struggle to coordinate specialized capabilities. |
| Approach: | They propose a taxonomy spanning *Graph-Assisted Knowledge Augmentation*, *Graph Assisted Reasoning and Planning*, and *Graphed LLM Collaboration*. |
| Outcome: | The proposed models show that graphs can augment and correct LLMs and support dynamic coordination among experts and agents in collaborative settings. |
Nanda Family: Open-Weights Generative Large Language Models for Hindi (2026.eacl-long)
Copied to clipboard
Aaryamonvikram Singh, Debopriyo Banerjee, Dhruv Sahnan, Monojit Choudhury, Shivam Chauhan, Rocktim Jyoti Das, Xudong Han, Haonan Li, Alok Anil Jadhav, Utkarsh Agarwal, Mukund Choudhary, Fajri Koto, Junaid Hamid Bhat, Awantika Shukla, Samujjwal Ghosh, Samta Kamboj, Onkar Pandit, Lalit Pradhan, Rahul Pal, Sunil Kumar Sahu, Parvez Mullah, Ali El Filali, Zainul Abedien Ahmed Quraishi, Neha Sengupta, Gokulakrishnan Ramakrishnan, Rituraj Joshi, Gurpreet Gosal, Avraham Sheinin, Natalia Vassilieva, Preslav Nakov
| Challenge: | Large language models remain predominantly English-centric, which limits their utility for underrepresented languages. |
| Approach: | They propose to extend Llama’s vocabulary with 20% Hindi-specific tokens, thus halving Hindi tokenization fertility while preserving English efficiency. |
| Outcome: | The proposed models outperform open-weight models of comparable size on a 65B-token corpus and bilingual instruction and safety alignment on . a culturally grounded dataset. |
How to Make LMs Strong Node Classifiers? (2026.findings-eacl)
Copied to clipboard
Zhe Xu, Kaveh Hassani, Si Zhang, Hanqing Zeng, Michihiro Yasunaga, Limei Wang, Dongqi Fu, Ning Yao, Bo Long, Hanghang Tong
| Challenge: | Language Models (LMs) are increasingly challenging the dominance of domain-specific models, such as Graph Neural Networks (GNNs) and Graph Transformers (GTs). |
| Approach: | They propose a novel approach that empowers off-the-shelf LMs to achieve performance comparable to state-of-the art (SOTA) GNNs on node classification tasks without requiring any architectural modifications. |
| Outcome: | The proposed approach outperforms existing GNNs on node classification tasks and is open-source upon publication. |
Language is All a Graph Needs (2024.findings-eacl)
Copied to clipboard
| Challenge: | Existing work on integrating graph problems into generative language modeling framework remains limited. |
| Approach: | They propose an LLM with instructions based on natural language to perform graph tasks. |
| Outcome: | The proposed model surpasses all GNN baselines on ogbn-arxiv, Cora and PubMed datasets and sheds light on generative LLMs as new foundation model for graph machine learning. |