Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research proposes a compositional kernel ridge regression framework that effectively eliminates noise variables during feature learning, particularly when inputs follow Gaussian distributions. A key theoretical contribution demonstrates that $\ell_1$-type kernels like the Laplace kernel can recover nonlinear features at stationary points, whereas standard Gaussian kernels are limited to linear recovery. This work advances the mathematical understanding of variable selection and feature representation within compositional architectures.
Sources coveringarXiv, LessWrong, Cybersecurity News
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

A Compositional Kernel Model for Feature Learning

arXiv2 min read

arXiv:2509.14158v3 Announce Type: replace Abstract: We study a compositional variant of kernel ridge regression in which the predictor is applied to a coordinate-wise reweighting of the inputs. Formulated as a variational problem, this model provides a tractable setting for studying feature learning in compositional architectures. From the perspective of variable selection, we show how relevant variables are recovered while noise variables are eliminated. We prove that both global minimizers and stationary points discard noise coordinates when the noise variables are Gaussian distributed. A central finding is that $\ell_1$-type kernels, such as the Laplace kernel, succeed in recovering features contributing to nonlinear effects at stationary points, whereas Gaussian kernels recover only linear ones.

Abstract:We study a compositional variant of kernel ridge regression in which the predictor is applied to a coordinate-wise reweighting of the inputs. Formulated as a variational problem, this model provides a tractable setting for studying feature learning in compositional architectures. From the perspective of variable selection, we show how relevant variables are recovered while noise variables are eliminated. We prove that both global minimizers and stationary points discard noise coordinates when the noise variables are Gaussian distributed. A central finding is that $\ell_1$-type kernels, such as the Laplace kernel, succeed in recovering features contributing to nonlinear effects at stationary points, whereas Gaussian kernels recover only linear ones.

Machine Learning (cs.LG); Optimization and Control (math.OC)

arXiv:2509.14158 [cs.LG]

(or arXiv:2509.14158v3 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2509.14158 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 203 words

Related coverage