DEAG is proposed, a reliability-aware prototype learning framework for data-efficient agentic GDA that estimates class reliability from retained source support and embedding compactness, and constructs stable reusable source anchors by blending empirical prototypes with classifier directions.
Abstract
Agentic learning systems are often required to adapt after deployment by observing new data and reusing prior knowledge under limited supervision or feedback. For graph-structured prediction, Graph Domain Adaptation (GDA) naturally instantiates this setting by transferring knowledge from labeled source graphs to unlabeled target graphs under distribution shifts. However, most GDA methods assume sufficient labeled source graphs, which becomes restrictive in data-efficient agentic settings where only limited source evidence can be retained. Under such constraints, source semantics become unreliable, leading to unstable source anchoring, uncertain target association, and fragile targetmarginal calibration. To address these challenges, we propose DEAG, a reliability-aware prototype learning framework for data-efficient agentic GDA. DEAG estimates class reliability from retained source support and embedding compactness, and constructs stable reusable source anchors by blending empirical prototypes with classifier directions. Guided by these anchors, DEAG performs prototype-aware soft target association and aligns confidence-weighted target centers with source semantics. A source-prior regularizer further sharpens target predictions while keeping the target marginal consistent with retained source evidence. Experiments on graph benchmarks with diverse domain shifts show that DEAG improves average adaptation performance over competitive GDA baselines under the same source-data budget.
EviGDA is proposed, an Evidence-Augmented Graph Domain Adaptation framework that complements graph representation adaptation with a graph-free local expert, and shows that EviGDA outperforms state-of-the-art baselines.
This work introduces structure-aware entropy-based matching discrepancy, which jointly models feature uncertainty and structural coherence to ensure accurate feature adaptation between graphs and develops a domain-aware semi-hard negative sampling strategy that constructs informative contrastive sets by filtering unrel...
Ming-Can Wang, Jun-Chang Xin, Zhong-Ming Yao et al.· arXiv.org· 0 citations
Continual graph learning (CGL) maintains models as graphs evolve without retraining from scratch, while mitigating catastrophic forgetting. Existing methods typically target either transductive or inductive settings and often store past subgraphs or require task identifiers at inference. We propose Community-aware Prot...
Bo-Young Lim, Seokhwan Kim, Kisung Lee et al.· 0 citations
Database configuration debugging aims to identify suitable parameter (knob) settings to resolve performance or stability issues. This task remains challenging even for experts due to the complexity and interdependencies of modern database settings. Recent work has explored vector-based retrieval-augmented generation (R...
Cheng-Yang Luo, Qing Liu, Yu-Jie Guo et al.· Proceedings of the ACM on Ma...· 0 citations
This work formalizes a Wiki Graph schema that seamlessly bridges fine-grained structures with dense contexts, maintaining explicit topologies alongside continuous semantics and engineer an infrastructural NCCL boundary exchange protocol that hoists static partition indices and leverages fixed-shape GPU-to-GPU collectiv...
AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduNov 13, 2026