activity
20242026
most citedPre-Training and Prompting for Few-Shot Node Classification on Text-Attributed Graphs

14 citations · 15 across the 10 of their papers we have counts for

collaborators

12 papers

cs.CL2026

Mostly Reading: What Open-Book Scores Measure in Document-Level LoRA Adapters

Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov +1

Single-document LoRA adapters have been proposed as units of knowledge to be merged and retrieved; yet open-book scoring, with the document in the prompt, can credit a document's o…

cs.LG2026

A Storage-Retrieval Gap in Parametric Knowledge Graph Memory

Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov +1

Graph retrieval-augmented generation places retrieved subgraphs into the model's context window at query time, paying a recurring token cost and exposing source data on every call.…

cs.LG2026

Conformalized Large Language Models under Configuration Shift

Yuqicheng Zhu, Jialin Yu, Lin Li +7

Conformal prediction (CP) is a distribution-free framework for uncertainty quantification that has recently been adapted to large language models (LLMs), providing prediction sets…

cs.CL2026

AWM: Answerable Working Memory for Long-Document VQA Agents

Dongzhuoran Zhou, Yuqicheng Zhu, Yule Liu +5

Long-document visual question answering increasingly relies on VLM agents that retrieve candidate pages, inspect page images, write findings to working memory, and synthesize answe…

cs.CL2026

Memory for Large Language Models

Sining Zhoubian, Dan Zhang, Evgeny Kharlamov +1

Memory has evolved into a foundational architectural dimension in large language models (LLMs), shifting from an implicit byproduct of computation to a spectrum of explicit, contro…

cs.LG2026

MADA-RL: Multi-Agent Debate-Aware Reinforcement Learning for Parameter-Efficient Reasoning in Compact Models

Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov +3

Large language models achieve strong reasoning performance, but often at prohibitive training cost - a challenge that is especially acute for compact models (…

cs.AI2026

AISE-Bench: A Full-Cycle Curated Benchmark for Information Seeking on Academic Knowledge Graphs

Fanjin Zhang, Zhengyang Wang, Ruixuan Huang +7

Large language models (LLMs) augmented with tools are emerging as autonomous agents capable of using Web engine, APIs, and code to solve complex, long-horizon tasks. Current tool-u…

cs.CL2026

Cross-Source Reasoning-based Correction for Author Name Disambiguation

Fanjin Zhang, Yunhe Pang, Bo Chen +4

Author name disambiguation is a critical challenge in academic search systems, often addressed through from-scratch and real-time disambiguation approaches. However, current algori…

cs.LG2026

Integrating Meta-Features with Knowledge Graph Embeddings for Meta-Learning

Antonis Klironomos, Ioannis Dasoulas, Francesco Periti +4

The vast collection of machine learning records available on the web presents a significant opportunity for meta-learning, where past experiments are leveraged to improve performan…

cs.CL2025

Can Large Language Models Master Complex Card Games?

Wei Wang, Fuqing Bie, Junzhe Chen +4

Complex games have long been an important benchmark for testing the progress of artificial intelligence algorithms. AlphaGo, AlphaZero, and MuZero have defeated top human players i…

cs.CL2024★ 1 cited

GuARD: Effective Anomaly Detection through a Text-Rich and Graph-Informed Language Model

Yunhe Pang, Bo Chen, Fanjin Zhang +3

Anomaly detection on text-rich graphs is widely prevalent in real life, such as detecting incorrectly assigned academic papers to authors and detecting bots in social networks. The…

cs.SI2024★ 14 cited

Pre-Training and Prompting for Few-Shot Node Classification on Text-Attributed Graphs

Huanjing Zhao, Beining Yang, Yukuo Cen +6

The text-attributed graph (TAG) is one kind of important real-world graph-structured data with each node associated with raw texts. For TAGs, traditional few-shot node classificati…