Source-Free Structure behind a Searched Answer
Abstract
Structural graph adaptation and guided tree search should be connected through independently checkable paths. Evaluation preserves the source-free information restriction and records the relations supporting the answer. A final accuracy average can conceal topology-sensitive failures or irrelevant evidence. Search cost includes path assessment and verification, rather than just the number of nodes expanded. This focused synthesis develops an empirical comparison that preserves the terminal action, observation process, and total verification cost. Its proposed tests are prospective; no new simulation run, model-training result, or intervention effect is reported.
References
Y. Wang, K. Zhang, M. Wang, S. Gao, and N. Yin, “USBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptation,” Proceedings of the 2026 ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2026.
Y. Wang, S. Fan, M. Wang, S. Gao, C. Wang, and N. Yin, “DAMR: Efficient and Adaptive Context-Aware Knowledge Graph Question Answering with LLM-Guided MCTS,” Proceedings of the 2026 International Conference on Learning Representations, 2026.
Sang, Yinghao. “Robustness of Fine-Tuned LLMs Under Noisy Retrieval Inputs.” 2025 6th International Conference on Artificial Intelligence and Electromechanical Automation (AIEA), IEEE, 2025, pp. 417-420. https://doi.org/10.1109/aiea66061.2025.11160531.
Levine, Sergey, Aviral Kumar, George Tucker, and Justin Fu. “Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems.” arXiv, 2020, arXiv:2005.01643. https://arxiv.org/abs/2005.01643.
Kumar, Aviral, Aurick Zhou, George Tucker, and Sergey Levine. “Conservative Q-Learning for Offline Reinforcement Learning.” Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 1179–1191. https://arxiv.org/abs/2006.04779.
Lewis, Patrick, et al. “Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks.” Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 9459–9474. https://arxiv.org/abs/2005.11401.
Geifman, Yonatan, and Ran El-Yaniv. “Selective Classification for Deep Neural Networks.” Advances in Neural Information Processing Systems, vol. 30, 2017. https://arxiv.org/abs/1705.08500.
Ovadia, Yaniv, et al. “Can You Trust Your Model’s Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shift.” Advances in Neural Information Processing Systems, vol. 32, 2019. https://arxiv.org/abs/1906.02530.
Bertsimas, Dimitris, and Melvyn Sim. “The Price of Robustness.” Operations Research, vol. 52, no. 1, 2004, pp. 35–53. https://doi.org/10.1287/opre.1030.0065.
Rasmussen, Carl Edward, and Christopher K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006. https://gaussianprocess.org/gpml/.
Hu, Edward J., et al. “LoRA: Low-Rank Adaptation of Large Language Models.” International Conference on Learning Representations, 2022. https://openreview.net/forum?id=nZeVKeeFYf9.
Published
Versions
- Version 2
- Version 1