arXiv:2609. 11918v1 Announce Type: new Abstract: Generalization under distribution shift remains a core challenge in modern machine learning, yet existing learning bound theory is limited to narrow, idealized settings and is non-estimable from samples.
By Hongbo Chen, Li Charlie Xia
This paper introduces a method for adapting unlabeled‑unlabeled (UU) learning to distribution shifts by applying importance weighting. The approach estimates weights from UU data in both training and test distributions to minimize test risk, enabling handling of various learning scenarios—including PU and noisy‑label learning—without assuming specific shift types. Experiments on real‑world datasets confirm the method’s effectiveness.
By Atsutoshi Kumagai, Tomoharu Iwata, Hiroshi Takahashi, Taishi Nishiyama, Kazuki Adachi, Yasuhiro Fujiwara
arXiv:2605.31187v2 Announce Type: replace-cross
Abstract: Detecting covariate shift is critical for building reliable vision systems. While most prior work focuses on improving robustness to shift, e...
By Firas Gabetni, Alexandre Rocchi, Nacim Belkhir, Ziyi Liu, Gianni Franchi
arXiv:2609.39829v1 Announce Type: new
Abstract: Modern machine learning depends heavily on massive datasets, but obtaining high-quality annotations at scale is often expensive. As a result, learning...
By Xabier de Juan, Santiago Mazuelas, Yilun Zhu, Clayton Scott
arXiv:2606. 14506v1 Announce Type: cross Abstract: Understanding how a prediction model will perform in a new environment before deployment is essential to preventing harm when algorithms inform decision-making.
By Annie Ulichney, Amanda Coston
arXiv:2607. 18088v1 Announce Type: new Abstract: Standard evaluation of many recognition systems contains distribution shift by construction, since benchmarks place disjoint conditions in the training and test splits.
By Weijia Han, Lisha Qu