Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts
원문 초록
Least squares estimators, when trained on a few target domain samples, may predict poorly. Supervised domain adaptation aims to improve the predictive accuracy by exploiting additional labeled training samples from a source distribution that is close to the target distribution. Given available data, we investigate novel strategies to synthesize a family of least squares estimator experts that are robust with regard to moment conditions. When these moment conditions are specified using Kullback-Leibler or Wasserstein-type divergences, we can find the robust estimators efficiently using convex optimization. We use the Bernstein online aggregation algorithm on the proposed family of robust experts to generate predictions for the sequential stream of target test samples. Numerical experiments on real data show that the robust strategies may outperform non-robust interpolations of the empirical least squares estimators.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Domain Borders Are There to Be Crossed With Federated Few-Shot Adaptation
UMDATrack: Unified Multi-Domain Adaptive Tracking Under Adverse Weather Conditions
Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition
Unlocking Constraints: Source-Free Occlusion-Aware Seamless Segmentation
Efficient and Generalizable Speaker Diarization via Structured Pruning of Self-Supervised Models
Expressive Score-Based Priors for Distribution Matching with Geometry-Preserving Regularization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.