Pith. sign in

REVIEW 2 cited by

Distributionally Robust Local Non-parametric Conditional Estimation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.05373 v1 pith:AJQKJJNO submitted 2020-10-12 stat.ML cs.LGmath.STstat.TH

classification stat.MLcs.LGmath.STstat.TH
keywords conditionalestimationlocaldatanon-parametricrobustadversarialdistributionally
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Conditional estimation given specific covariate values (i.e., local conditional estimation or functional estimation) is ubiquitously useful with applications in engineering, social and natural sciences. Existing data-driven non-parametric estimators mostly focus on structured homogeneous data (e.g., weakly independent and stationary data), thus they are sensitive to adversarial noise and may perform poorly under a low sample size. To alleviate these issues, we propose a new distributionally robust estimator that generates non-parametric local estimates by minimizing the worst-case conditional expected loss over all adversarial distributions in a Wasserstein ambiguity set. We show that despite being generally intractable, the local estimator can be efficiently found via convex optimization under broadly applicable settings, and it is robust to the corruption and heterogeneity of the data. Experiments with synthetic and MNIST datasets show the competitive performance of this new class of estimators.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Oracle-Based Distributionally Robust Optimization under Optimal Transport Ambiguity Sets

    math.OC 2026-08 conditional novelty 7.0 of 10

    The paper reduces worst-case expectation in transport-based DRO to a scalar budget allocation and gives a scalable oracle-based algorithm plus a tight new support bound for the dual problem.

  2. Distributionally Robust Recovery of Omitted Factors from Forecast Residuals with Application to Interest Rate Risk Management

    q-fin.MF 2026-01 conditional novelty 5.0 of 10

    A distributionally robust ensemble of FADNS and random forest forecasts improves short-horizon U.S. Treasury yield predictions, while random forests dominate longer horizons.

Pith tools