FOGO detects and resolves gradient interference via spectral orthogonalization and compact codebook memory to prevent dominant directions from suppressing rare updates, improving convergence and retention across continual and standard training.
Using expert text descriptions to build LLM-derived priors guides domain selection under scarce target data, yielding near-oracle cold-start error and asymptotic consistency.
GAME regularizes overlapping subgroup submatrices with nuclear norms for local low-rank matrix completion, improving reconstruction and subspace recovery under structured missingness.
A pseudo-labeling framework for kernel GLM domain adaptation minimizes target error via imputation-based model selection with non-asymptotic excess-risk bounds.
Current anomaly detection benchmarks stagnate because trivial feature-extreme methods match deep learning, so evaluation must shift to scenario-specific taxonomies with tailored metrics.
Benchmarking reveals existing continuous Gromov-Wasserstein solvers fail across scenarios, and a new discrete-independent method partially fixes these issues.
Anchor PCA finds shared low-rank directions across domains by trading variance for cross-domain agreement, yielding robust embeddings that generalize to unseen domains.
TILT decomposes predictors into main and auxiliary parts, penalizing the latter on unlabeled target data to implicitly weight sources via self-localized, bounded estimands, yielding finite-sample excess risk guarantees and improved domain adaptation performance.
Post-hoc learning to defer is cast as density-ratio estimation between ideal distributions, yielding adjustable deferral rules that recover Chow's rule and outperform baselines.
A unified meta-learning framework minimizes decomposed risk bounds across marginal and conditional distribution shifts to achieve robust domain generalization. It achieves state-of-the-art results on standard benchmarks and challenging multi-domain long-tailed recognition settings.