arXiv:2410.08299cs.LGcs.CL2024-10中稿 · COLM被引 1

提出隐私保护图学习方法,可安全微调大模型

Privately Learning from Graphs with Applications in Fine-tuning Large Language Models

  • 采样关系去耦合,用差分隐私微调图数据
  • 在4个真实图数据上提升关系学习效果
  • 适合需保护敏感关系的模型部署场景

图能揭示实体间独特关系,补充文本与图像模态,扩展模型能力。但图学习常涉及敏感关系,引发隐私担忧。现有隐私方法如DP-SGD依赖梯度解耦假设,不适用于具有样本依赖性的关系学习。为此,我们提出一种隐私保护关系学习流水线,通过采样关系去耦合训练依赖,结合定制化DP-SGD实现差分隐私。该方法应用于在敏感图数据上微调大型语言模型(如Llama2),同时应对计算复杂性。在四个真实世界文本属性图上评估,显著提升关系学习性能并保持强隐私保障。进一步分析了隐私、效用与计算效率之间的权衡,为实际部署提供参考。代码已公开于https://github.com/Graph-COM/PvGaLM。

原文摘要 · Abstract (English)

Graphs offer unique insights into relationships between entities, complementing data modalities like text and images and enabling AI models to extend their capabilities beyond traditional tasks. However, learning from graphs often involves handling sensitive relationships in the data, raising significant privacy concerns. Existing privacy-preserving methods, such as DP-SGD, rely on gradient decoupling assumptions and are incompatible with relational learning due to the inherent dependencies between training samples. To address this challenge, we propose a privacy-preserving pipeline for relational learning that decouples dependencies in sampled relations for training, ensuring differential privacy through a tailored application of DP-SGD. We apply this approach to fine-tune large language models (LLMs), such as Llama2, on sensitive graph data while addressing the associated computational complexities. Our method is evaluated on four real-world text-attributed graphs, demonstrating significant improvements in relational learning tasks while maintaining robust privacy guarantees. Additionally, we analyze the trade-offs between privacy, utility, and computational efficiency, offering insights into the practical deployment of our approach for privacy-preserving relational learning. Code is available at https://github.com/Graph-COM/PvGaLM.

图学习隐私保护大模型微调

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。