Locally Adaptive and Differentiable Regression
Mingxuan Han, Varun Shankar, Jeff M Phillips, Chenglong Ye

TL;DR
This paper introduces a framework for creating globally continuous and differentiable regression models by combining locally learned models, improving performance and convergence in complex data scenarios.
Contribution
It proposes a novel method to ensure continuity and differentiability in over-parameterized, locally adaptive models, enhancing their theoretical and practical performance.
Findings
Achieves faster statistical convergence.
Improves practical performance on diverse data.
Ensures global continuity and differentiability.
Abstract
Over-parameterized models like deep nets and random forests have become very popular in machine learning. However, the natural goals of continuity and differentiability, common in regression models, are now often ignored in modern overparametrized, locally-adaptive models. We propose a general framework to construct a global continuous and differentiable model based on a weighted average of locally learned models in corresponding local regions. This model is competitive in dealing with data with different densities or scales of function values in different local regions. We demonstrate that when we mix kernel ridge and polynomial regression terms in the local models, and stitch them together continuously, we achieve faster statistical convergence in theory and improved performance in various practical settings.
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.
Taxonomy
TopicsNeural Networks and Applications · Statistical Methods and Inference · Face and Expression Recognition
