We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.00322")
get_code_for_paper("2106.00322")
have("2106.00322")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.00322.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.00322)
Connect an agent — have() is free.