TY - GEN
T1 - DeMIC
T2 - 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1, KDD 2026
AU - Li, Mingyi
AU - Zhang, Xiao
AU - Chen, Zengzhe
AU - Zhang, Jiawei
AU - Yuan, Yuan
AU - Guo, Wei
AU - Zhuang, Fuzhen
AU - Yu, Dongxiao
N1 - Publisher Copyright:
© 2026 Owner/Author.
PY - 2026/8/8
Y1 - 2026/8/8
N2 - In-Context Learning (ICL) empowers Large Language Models to adapt to novel tasks, presenting a promising solution for privacy-preserving distributed scenarios. However, relying exclusively on inference-time ICL suffers from inherent instability. While fine-tuning models on specific tasks could mitigate these issues, as high-quality data is inherently dispersed across private agents, centralized fine-tuning becomes infeasible due to strict privacy constraints. To bridge this gap, we propose DeMIC, a novel decentralized meta-learning framework designed to collaboratively optimize the intrinsic in-context adaptation mechanism under task heterogeneity and dynamic network topologies. To overcome the insufficient exploration of standard meta-updates, DeMIC incorporates a Refiner-Guided mechanism. By constructing contrastive pairs, this mechanism forces the model to explore broader parameter spaces and learn from negative samples. Theoretically, we establish the first convergence guarantee for distributed Meta-ICL that explicitly models the context-driven adaptation process. Extensive experiments demonstrate significant generalization of DeMIC on new tasks, improving accuracy by 11.76% and F1-score by 10.65% on average over all settings.
AB - In-Context Learning (ICL) empowers Large Language Models to adapt to novel tasks, presenting a promising solution for privacy-preserving distributed scenarios. However, relying exclusively on inference-time ICL suffers from inherent instability. While fine-tuning models on specific tasks could mitigate these issues, as high-quality data is inherently dispersed across private agents, centralized fine-tuning becomes infeasible due to strict privacy constraints. To bridge this gap, we propose DeMIC, a novel decentralized meta-learning framework designed to collaboratively optimize the intrinsic in-context adaptation mechanism under task heterogeneity and dynamic network topologies. To overcome the insufficient exploration of standard meta-updates, DeMIC incorporates a Refiner-Guided mechanism. By constructing contrastive pairs, this mechanism forces the model to explore broader parameter spaces and learn from negative samples. Theoretically, we establish the first convergence guarantee for distributed Meta-ICL that explicitly models the context-driven adaptation process. Extensive experiments demonstrate significant generalization of DeMIC on new tasks, improving accuracy by 11.76% and F1-score by 10.65% on average over all settings.
KW - decentralized meta-learning
KW - in-context learning
UR - https://www.scopus.com/pages/publications/105051079265
U2 - 10.1145/3770855.3818159
DO - 10.1145/3770855.3818159
M3 - 会议稿件
AN - SCOPUS:105051079265
T3 - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
SP - 2674
EP - 2685
BT - KDD 2026 - Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2
PB - Association for Computing Machinery
Y2 - 9 August 2026 through 13 August 2026
ER -