<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Solving a Machine Learning Regression Problem Based on the Theory of Random Functions · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2512.12731/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2512.12731/feed.xml" rel="self" type="application/rss+xml" /><item><title>Solving a Machine Learning Regression Problem Based on the Theory of Random Functions — mentioned by Yuriy_Bakhvalov</title><link>https://news.ycombinator.com/item?id=46526437</link><guid isPermaLink="false">urn:hackerpapers:mention:2512.12731:46526437</guid><pubDate>Wed, 07 Jan 2026 14:01:00 GMT</pubDate><description>&lt;p&gt;Hi HN, I’m the author of this project. I am an independent researcher working on deriving deep learning architectures from first principles (Random Function Theory) rather than empirical heuristics. The core idea: Instead of choosing kernels (like RBF) arbitrarily, I derive the optimal kernel analytically from symmetry postulates (translation, rotation, scale invariance). This leads uniquely to the Polyharmonic Spline. Key features of this architecture: 1. No Gradient Descent: Training uses a synchronized global linear solver (Lagrange multipliers) to update function values. 2. Deep &amp;amp; Stable…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2512.12731/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
