Pith. sign in

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

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

cs.LG 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

Compute-Optimal Scaling for Value-Based Deep RL

cs.LG · 2025-08-20 · unverdicted · novelty 5.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Compute-Optimal Scaling for Value-Based Deep RL cs.LG · 2025-08-20 · unverdicted · none · ref 2011 · internal anchor

    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.