Textual graph question answering (GraphQA) and graph-based retrieval-augmented generation (GraphRAG) have gained increasing attention as a way to ground large language models (LLMs) on structured knowledge. Despite extensive efforts, existing methods still face two key gaps. The first is an architectural gap: existing...
Kai-Feng Jin, Yu-Chen Yan, Zhichen Zeng et al.· 0 citations
It is shown that model selection is a recommendation problem, and AgentRec, a multi-stage retrieval-and-ranking framework that progressively narrows hundreds of candidate models using increasingly expensive but more faithful evaluation signals, is introduced.
Chen Luo, Yu-Lin Liu, Yi Liu et al.· Proceedings of the 20th ACM...· 0 citations
It is shown that model selection is a recommendation problem, and AgentRec, a multi-stage retrieval-and-ranking framework that progressively narrows hundreds of candidate models using increasingly expensive but more faithful evaluation signals, is introduced.
Chen Luo, Yu-Lin Liu, Yi Liu et al.· Proceedings of the 20th ACM...· 0 citations
PILL (Probing-based InfiLling with preset-Length-free decoding), an efficient infilling method for DLMs that requires no preset initial length and adds far fewer extra forward passes than baselines, substantially reducing inference time is proposed.
Hao-Bo Xu, Si-Rui Chen, Yuan-Chen Bei et al.· 6 citations
This work proposes a principled VLM TTA method called \algname, and theoretically reveals that the InfoNCE loss can be neatly reformulated as a Wasserstein OT formulation, thereby unifying the objectives of the inference and adaptation of VLMs to achieve their mutual benefits.
Qi Yu, Zhichen Zeng, Katherine Tieu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.