AI & ML
Locally Linear Generalized Single Index Regression
arXiv stat.ML0 views
arXiv:2611.22011v1 Announce Type: cross Abstract: In this work we propose and analyze a procedure for estimating a generalized single-index regression model. This generalized single-index regression framework models the conditional mean of the responses $Y$ as a function of the covariates $X$ where the mapping is assumed to have the form $f \circ g$, where $g$ is $\beta$-H\"older with $\beta \geq 2$ and $f$ can be a discontinuous function of bounded variation. We propose a general procedure that operates under minimal assumptions about the distribution of covariates $X$, requiring only boundedness, sufficient smoothness and absolute continuity with respect to Lebesgue. Our procedure jointly estimates the gradient vector $\hat v(x) \approx \nabla g(x)$ and the conditional mean $\mu(x) = f(g(x))$ by solving a localized weighted linear least squares problem. We derive central limit theorems for gradient vector estimates $\hat{v}_x$ and regression estimates $\hat{\mu}(x)$, and we derive rates of convergence for our approach, illustrating that it indeed achieves a stochastic convergence rate matching the minimax mean squared error rate when $\beta = 2$ and $f$ has a locally Lipschitz derivative. Unlike prior approaches our velocity estimation results accommodate link functions in the local bounded-variation class, allowing for nonsmooth and even discontinuous links while retaining consistency and asymptotic normality at almost every inference point. Finally, we instantiate this model in the situation where $g = \Pi$ is a closest point projection onto a compact and regular embedded $C^3$ curve $\gamma$, a setting recently studied in the literature. We also supplement our theoretical results with experiments on real and synthetic data to demonstrate the utility of our procedure.
Source:https://arxiv.org/abs/2611.22011PreviousDEFTS: Data-Efficient, Training-Free Few-Shot Learning for CLIP in the Text SubspaceNextTwo Counterexamples for e-means
Related posts

Will Wright’s next game uses AI to map your memories
0The Verge
Microsoft Built Its Own Coding Model, and the Price Is the Point
0dev.to

El diario económico coreano Maeil Business cuenta 12 primeros puestos de Darwin en Hugging Face: cuéntalos tú con Python
0dev.to
Can Peer Review Survive AI-Generated Text? [pdf]
0Hacker News
Toward Planning Representations That Separate Task Structure from Visual Content
0arXiv cs.RO
Spectral Steering: Local Inverse Geometry for Frozen Diffusion Generators
0arXiv cs.RO