Graph-matching domain adaptation for cross-border cropland masks: an artificial intelligence evaluation of label-scarcity transfer failure in national agricultural statistics
Oct 2026· Zenodo (CERN European Organization for Nuclear Research)
Domain Adaptation and Few-Shot Learning
Abstract
Cross-border transfer of cropland masks is routinely proposed as a remedy for label scarcity in national agricultural statistics, yet the conditions under which graph-matching domain adaptation fails have not been formalised. The analysis treats label scarcity as a structural property of the target domain rather than a sampling deficiency, and derives a bound on target risk that separates three additive components: graph-matching distortion, label-scarcity variance, and the divergence between source and target cropland definitions. The bound is used to identify a transfer-failure threshold below which adaptation is dominated by the unadapted source classifier. A formal proposition establishes that graph-matching distortion grows with the spectral gap between source and target adjacency structures, and a corollary shows that this distortion is not reduced by increasing the number of unlabelled target samples. The paper does not report empirical estimates; it provides the formal apparatus, the failure criterion, and the diagnostic quantities that a national statistical office would need to compute before adopting a transferred mask. The contribution is a specification of when cross-border graph-matching adaptation should be rejected, and a set of computable indicators that make that rejection auditable.
This paper investigates developing real-world perception for active agents, proposes Gibson Environment for this purpose, and showcases a set of perceptual tasks learned therein.
F. Xia, Amir Zamir, Zhi-Yang He et al.· 2018 IEEE/CVF Conference on...· 1,069 citations· ⚡112
GAOKAO-Bench is introduced, an intuitive benchmark that employs questions from the Chinese GAOKAO examination as test samples, including both subjective and objective questions that contribute a robust evaluation benchmark for future large language models and offers valuable insights into the advantages and limitations...
Xiaotian Zhang, Chun-yan Li, Yi Zong et al.· arXiv.org· 216 citations· ⚡17
An algorithm is proposed which leverages disentangled semantic factors to generate adversarial perturbation by altering controlled semantic attributes to fool the learner towards various "adversarial" targets.
Haonan Qiu, Chaowei Xiao, Lei Yang et al.· arXiv.org· 208 citations· ⚡17
This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.
This work investigates the possibilities of using LLMs in a resume screening setting via a document retrieval framework that simulates job candidate selection and finds that the MTEs are biased, significantly favoring White-associated names in 85% of cases and female-associated names in only 11.1% of cases.
This work shows that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration and introduces high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical...
Masoud Mohseni, Artur Scherer, K. Johnson et al.· arXiv.org· 121 citations· ⚡9