arXiv:2607. 16528v1 Announce Type: new Abstract: We study hierarchical domain generalization as a problem of extrapolation from finite observed regions to an entire instance space, replacing i.
arXiv:2506. 16704v3 Announce Type: replace Abstract: We study a fundamental question of domain generalization: given a family of domains (i.
The paper investigates how many data samples per domain are needed for effective learning across multiple domains. It derives criteria from learning bounds that reveal an inverse linear relationship between the number of training domains and the required samples per domain, offering theoretical guidance for dataset adequacy and construction. The study also establishes a close link between in-domain learning and out-of-domain generalization through new generalization bounds.
arXiv:2609.39512v1 Announce Type: new Abstract: The small-sample learning problem remains a fundamental challenge in machine learning because limited training data lead to unstable model estimation a...
arXiv:2303. 18031v2 Announce Type: replace-cross Abstract: In real-world applications, a machine learning model is required to handle an open-set recognition (OSR), where unknown classes appear during the inference, in addition to a domain shift, where the data distribution differs between the training and inference phases.
arXiv:2606. 23758v1 Announce Type: cross Abstract: Domain generalization learns from multiple source domains to generalize to unseen target domains.
The paper introduces a unified framework for dataset condensation (DC) that generalizes existing methods by using discrepancy measures to quantify the distance between probability distributions. It extends the traditional goal of DC—creating a small synthetic dataset that preserves generalization—to include additional objectives such as robustness and privacy. The framework positions DC as a formal approximation problem, broadening its applicability across different machine learning regimes.
The paper introduces Joint Domain-Class Federated Learning (JDFL), a lightweight, optimizer‑agnostic extension designed to address feature skew in federated learning. JDFL infers pseudo‑domains from local update signals and expands the classifier head to output joint domain‑class logits, enabling the model to capture domain‑conditioned appearance while sharing a backbone. Two supervision strategies—similarity‑aware soft‑labeling and per‑sample randomized target assignment—are proposed to train the expanded head, and experiments on domain‑shifted image benchmarks show consistent improvements in global test accuracy over standard FL methods.
arXiv:2608.20812v1 Announce Type: new Abstract: We develop constructive approximation and learning guarantees for shallow neural models with infinite-dimensional inputs observed through finitely many...
arXiv:2604. 24749v2 Announce Type: replace Abstract: While the optimal sample complexity of binary classification in terms of the VC dimension is well-established, determining the optimal sample complexity of multiclass classification has remained open.
The paper introduces Joint Distribution Alignment for Universal Domain Adaptation (JAUA), a new algorithm designed for scenarios where source and target domains have differing label spaces. It provides a theoretical upper bound on generalization error for Universal Domain Adaptation and proposes aligning joint distributions using Chi‑Square divergence, complemented by a progressive pseudo‑labeling strategy. Experiments on six public image datasets show JAUA outperforms existing methods in handling Universal Domain Adaptation challenges.
arXiv:2405. 07780v3 Announce Type: replace-cross Abstract: This paper explores test-agnostic long-tail recognition, a challenging long-tail task where the test label distributions are unknown and arbitrarily imbalanced.
arXiv:2602. 17187v2 Announce Type: replace-cross Abstract: The problem of domain generalization concerns learning predictive models that are robust to distribution shifts when deployed in new, previously unseen environments.