In recent years, graph prompting has emerged as a promising research direction, enabling the learning of additional tokens or subgraphs appended to the original graphs without requiring retraining of pre-trained graph models across various applications. This novel paradigm, shifting from the traditional pretraining and finetuning to pretraining and prompting has shown significant empirical success in simulating graph data operations, with applications ranging from recommendation systems to biological networks and graph transferring. However, despite its potential, the theoretical underpinnings of graph prompting remain underexplored, raising critical questions about its fundamental effectiveness. The lack of rigorous theoretical proof of why and how much it works is more like a dark cloud over the graph prompt area to go further. To fill this gap, this paper introduces a theoretical framework that rigorously analyzes graph prompting from a data operation perspective. Our contributions are threefold: First, we provide a formal guarantee theorem, demonstrating graph prompts capacity to approximate graph transformation operators, effectively linking upstream and downstream tasks. Second, we derive upper bounds on the error of these data operations by graph prompts for a single graph and extend this discussion to batches of graphs, which are common in graph model training. Third, we analyze the distribution of data operation errors, extending our theoretical findings from linear graph models (e.g., GCN) to non-linear graph models (e.g., GAT). Extensive experiments support our theoretical results and confirm the practical implications of these guarantees.
Intelligent Reservoir Decision Support: An Integrated Framework Combining Large Language Models, Advanced Prompt Engineering, and Multimodal Data Fusion for Real-Time Petroleum Operations
Everglades University(埃弗格莱兹大学);University of Campinas (UNICAMP)(坎皮纳斯州立大学)
A Survey of Automatic Prompt Engineering: An Optimization Perspective
School of Computer Science and Technology, Tongji University(同济大学计算机科学与技术学院);East China Normal University(华东师范大学);Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University(同济大学上海智能自主系统研究院)
Robust Length Prediction: A Perspective from Heavy-Tailed Prompt-Conditioned Distributions
State Key Laboratory of Novel Software Technology, Nanjing University(南京大学计算机软件新技术国家重点实验室);School of Artificial Intelligence, Nanjing University(南京大学人工智能学院)
Rethinking the Role of Prompting Strategies in LLM Test-Time Scaling: A Perspective of Probability Theory
MAIS, Institute of Automation, Chinese Academy of Sciences(自动化研究所,中国科学院);School of Artificial Intelligence, University of Chinese Academy of Sciences(中国科学院大学人工智能学院);University of California, Santa Barbara(加州大学圣巴巴拉分校);Beijing Wenge Technology Co., Ltd(北京文格科技有限公司)
Inductive Graph Alignment Prompt: Bridging the Gap between Graph Pre-training and Inductive Fine-tuning From Spectral Perspective
Peking University(北京大学);Hong Kong University of Science and Technology(香港科技大学);Computer Network Information Center, Chinese Academy of Sciences(中国科学院计算机网络信息中心)
Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective
University of Science and Technology of China(中国科学技术大学);Eindhoven University of Technology(埃因霍温理工大学);University of Exeter(埃克塞特大学);Michigan State University(密歇根州立大学);University of Texas at Austin(德克萨斯大学奥斯汀分校);MIT(麻省理工学院);University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校);Harvard University(哈佛大学)
Understanding and Mitigating Overrefusal in LLMs from an Unveiling Perspective of Safety Decision Boundary
The State Key Laboratory of Blockchain and Data Security(区块链与数据安全国家重点实验室);Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security(杭州高新技术区(滨江)区块链与数据安全研究院);Language and Machine Intelligence Department, Ant Group(蚂蚁集团语言与机器智能部门)
NetInjectBench: Benchmarking Indirect Prompt Injection in Tool-Using Large Language Model Agents for Network Operations
School of Computing, Wichita State University(威斯康星州立大学计算机学院);Department of Computer Science, American International University-Bangladesh(孟加拉国国际大学计算机科学系)
Evaluating Large Language Model Creativity from a Literary Perspective
Imperial College London(帝国理工学院);Google DeepMind(谷歌DeepMind);Institute of Historical Research, School of Advanced Study, University of London(伦敦大学高级研究院历史研究所);University of Southampton(南安普顿大学)
Why GRPO Needs Normalization: A Local-Curvature Perspective on Adaptive Gradients
Department of Aeronautics and Astronautics, MIT(麻省理工学院航空与宇航系);Department of Statistics, University of Wisconsin--Madison(威斯康星大学麦迪逊分校统计系);Department of Informatics, King's College London(伦敦国王学院信息学系);Department of Computer Sciences, University of Wisconsin--Madison(威斯康星大学麦迪逊分校计算机科学系)
Brewing Knowledge in Context: Distillation Perspectives on In-Context Learning
University of Chinese Academy of Sciences(中国科学院大学);University of South Florida(佛罗里达州立大学);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Key Laboratory of System Software (Chinese Academy of Sciences)(中国科学院系统软件重点实验室);State Key Laboratory of Computer Science (Institute of Software, Chinese Academy of Sciences)(中国科学院软件研究所计算机科学国家重点实验室)
Designing the Topology of Graph Neural Networks: A Novel Feature Fusion Perspective
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Paradigm. Inc.(第四范式有限公司);Lenovo(联想)