arXiv:2608. 01879v1 Announce Type: new Abstract: Tabular data generation supports analysis and decision-making when target-domain data are scarce, yet collecting complete target samples is often costly.
arXiv:2609.14045v1 Announce Type: new Abstract: Agentic learning systems are often required to adapt after deployment by observing new data and reusing prior knowledge under limited supervision or fe...
arXiv:2610.00873v1 Announce Type: cross Abstract: In many industrial applications, 1) tabular data is scarce and imbalanced and thus requires synthetic expansion; 2) input distributions drift between...
arXiv:2606. 11640v1 Announce Type: cross Abstract: Few-shot tabular learning provides a cost-effective approach for real-world applications where annotation is costly and collecting sufficient samples for new tasks is difficult.
INCONVENIENT is a new benchmark that evaluates how machine‑learning models, especially large language models, generalize when trained on convenience samples that bias feature–target relationships. Unlike prior distribution‑shift tests that rely on natural domain splits, INCONVENIENT explicitly perturbs these relationships while keeping the deployment population unchanged, allowing controlled study of shift severity and direction. The benchmark covers 200 tabular classification and regression datasets and produces about 15,500 shifted training distributions, revealing significant performance degradation.
The paper critically evaluates common few‑shot learning protocols that rely on pre‑training a model on a large auxiliary set with classes disjoint from the target but drawn from the same visual domain. By comparing no pre‑training, class‑disjoint in‑domain pre‑training, supervised out‑of‑domain pre‑training, and label‑free out‑of‑domain pre‑training across eight datasets and three architectures, the authors find that in‑domain pre‑training yields a 33.41‑point average improvement, while out‑of‑domain pre‑training offers a 23.75‑point gain, revealing a 9.66‑point optimistic bias due to domain overlap. They also demonstrate that a label‑free augmentation strategy can match supervised out‑of‑domain performance and propose a descriptor‑based source‑selection method that closely approximates oracle selection, underscoring the need to move beyond in‑domain pre‑training as the default evaluation protocol.
The paper introduces Adaptive Dual-Teacher Distillation with Subnetwork Rectification (DDSR), a method for black-box domain adaptation that fuses predictions from a black-box source model and a vision‑language model to generate reliable pseudo‑labels for the target domain. DDSR uses adaptive prediction fusion, subnetwork regularization to prevent overfitting, iterative refinement of pseudo‑labels and prompts, and class‑wise prototypes for self‑training. Experiments on several benchmark datasets show that DDSR outperforms existing state‑of‑the‑art approaches, even those that have access to source data or source model parameters.
arXiv:2504.14280v2 Announce Type: replace-cross Abstract: As machine learning evolves, domain generalization (DG) and domain adaptation (DA) have become crucial for improving model robustness across...
arXiv:2607. 17668v1 Announce Type: cross Abstract: Unsupervised Graph Domain Adaptation (UGDA) aims to facilitate knowledge transfer from a labeled source graph to an unlabeled target graph by mitigating cross-domain distribution shifts.
The paper introduces Meta‑Diff, a method that learns a reusable source‑to‑target relation in a compact task space, enabling rapid adaptation of a diffusion model to new targets with minimal or no target data. By encoding each distribution into a low‑dimensional coordinate and transporting a source coordinate to its predicted target, the approach avoids costly fine‑tuning and achieves significant performance gains on CIFAR‑100 and Office‑Home benchmarks. Experiments show that when task identity is preserved, the relation generalizes across tasks, and the source‑target shift is manageable, Meta‑Diff can outperform target‑only modeling and full fine‑tuning. whyItMatters:"The method offers a practical solution for few‑shot adaptation in data‑scarce settings, such as healthcare, by reducing computational cost and improving reliability compared to traditional retraining approaches."
arXiv:2606. 00808v1 Announce Type: new Abstract: Source-free graph domain adaptation (SF-GDA) aims to adapt source-trained graph models to unlabeled target graphs when source graphs are no longer accessible.
arXiv:2509. 21489v4 Announce Type: replace Abstract: Graph foundation models face several fundamental challenges including transferability across diverse domains and data scarcity, which calls into question the very feasibility of creating such models.
TabCausal is a causal discovery foundation model that learns to map datasets directly to causal graphs by pretraining across diverse causal environments. It uses a dynamic task construction strategy to expose the model to varied graph priors, mechanisms, noise models, dimensions, sample sizes, and intervention regimes, improving transferability from observational and mixed‑interventional data. On large synthetic benchmarks and a new protocol‑guided semantic benchmark, TabCausal outperforms many classical baselines and shows robust structure recovery, especially when interventional evidence is available.