Generalized Local Polynomial Regression with Decomposed Context-Aware Kernels
Yaniv Shulman

TL;DR
This paper introduces GC-LPR, a flexible local polynomial regression framework that decouples neighborhood definition from the polynomial fit, enabling effective smoothing over complex, non-Euclidean domains like graphs and manifolds.
Contribution
It proposes a novel context-aware LPR method that models responses across non-Euclidean structures while maintaining interpretability and bias reduction properties.
Findings
GC-LPR effectively models responses on graphs and manifolds.
Theoretical analysis confirms bias properties are preserved.
Demonstrated success on geospatial and network datasets.
Abstract
Local Polynomial Regression (LPR) is a powerful tool for nonparametric smoothing, yet it traditionally suffers from a "Euclidean tautology": the variables used to define the local neighborhood are identical to those used in the polynomial fit. This restricts its ability to handle complex domains where the regression function varies across non-Euclidean structures, such as graphs, manifolds, or discrete categories, while remaining locally smooth in the primary feature space. We propose Generalized Context-Aware LPR (GC-LPR), a framework that decouples the fitting coordinates () from the weighting context (). By adopting a modeling convention where the conditional mean depends jointly on and (), our estimator acts as a "projected smoother": it isolates a slice of the data on the manifold defined by via a compound product kernel, and performs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
