Pith. sign in

REVIEW 2 cited by

Fast Nonparametric Conditional Density 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 1206.5278 v1 pith:6SKN64VJ submitted 2012-06-20 stat.ME cs.LGstat.ML

classification stat.MEcs.LGstat.ML
keywords densityconditionalbandwidthestimationfastincludinglittlenone
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Conditional density estimation generalizes regression by modeling a full density f(yjx) rather than only the expected value E(yjx). This is important for many tasks, including handling multi-modality and generating prediction intervals. Though fundamental and widely applicable, nonparametric conditional density estimators have received relatively little attention from statisticians and little or none from the machine learning community. None of that work has been applied to greater than bivariate data, presumably due to the computational difficulty of data-driven bandwidth selection. We describe the double kernel conditional density estimator and derive fast dual-tree-based algorithms for bandwidth selection using a maximum likelihood criterion. These techniques give speedups of up to 3.8 million in our experiments, and enable the first applications to previously intractable large multivariate datasets, including a redshift prediction problem from the Sloan Digital Sky Survey.

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. Parallel gradient boosting for flexible estimation of conditional distributions

    stat.ML 2026-07 conditional novelty 6.0 of 10

    A modified gradient-boosting algorithm trains one univariate weak learner per iteration for all output targets, giving similar accuracy to XGBoost for multiple quantile regression while cutting runtime by up to roughly 50x.

  2. Conformal Inference of Individual Treatment Effects Using Conditional Density Estimates

    stat.ML 2025-01 conditional novelty 5.0 of 10

    Replacing quantile-regression scores with conditional density scores, estimated via a reference distribution classifier, yields shorter valid conformal intervals for individual treatment effects in the tested settings.

Pith tools