Pith. sign in

REVIEW 1 cited by

Adaptive Non-Parametric Regression With the $K$-NN Fused Lasso

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 1807.11641 v4 pith:O5WS5HPU submitted 2018-07-31 stat.ME

classification stat.ME
keywords fusedlassographapproachpointsadaptivityconnectiondesign
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The fused lasso, also known as total-variation denoising, is a locally-adaptive function estimator over a regular grid of design points. In this paper, we extend the fused lasso to settings in which the points do not occur on a regular grid, leading to an approach for non-parametric regression. This approach, which we call the $K$-nearest neighbors ($K$-NN) fused lasso, involves (i) computing the $K$-NN graph of the design points; and (ii) performing the fused lasso over this $K$-NN graph. We show that this procedure has a number of theoretical advantages over competing approaches: specifically, it inherits local adaptivity from its connection to the fused lasso, and it inherits manifold adaptivity from its connection to the $K$-NN approach. We show that excellent results are obtained in a simulation study and on an application to flu data. For completeness, we also study an estimator that makes use of an $\epsilon$-graph rather than a $K$-NN graph, and contrast this with the $K$-NN fused lasso.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Compute-Optimal Scaling for Value-Based Deep RL

    cs.LG 2025-08 unverdicted novelty 5.0 of 10

    Value-based deep RL shows TD-overfitting: large batches degrade Q-function accuracy for small networks but not large ones, enabling compute-optimal splits between model size and update frequency.

Pith tools