<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning in High Dimension Always Amounts to Extrapolation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2110.09485/</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/2110.09485/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by bonoboTP</title><link>https://news.ycombinator.com/item?id=50009390</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:50009390</guid><pubDate>Thu, 08 Oct 2026 17:57:09 GMT</pubDate><description>&lt;p&gt;This depends on some handwavy use of the term &amp;quot;interpolation&amp;quot;, not the mathematical definition. Mathematically interpolation usually means that the query point is in the convex hull of the data points, and that almost never happens in high-dimensional spaces. See: Learning in High Dimension Always Amounts to Extrapolation Randall Balestriero, Jerome Pesenti, Yann LeCun https://arxiv.org/abs/2110.09485 I guess you mean by &amp;quot;interpolation&amp;quot; that it&amp;#x27;s some kind of nonlinear combination of the training data, but that&amp;#x27;s an almost vacuous statement. Any input-output relationship has to be so by…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by orbital-decay</title><link>https://news.ycombinator.com/item?id=48407232</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:48407232</guid><pubDate>Fri, 05 Jun 2026 02:27:05 GMT</pubDate><description>&lt;p&gt;Sorry, I just noticed I posted a wrong link in the comment above. Here&amp;#x27;s the proper one: https://arxiv.org/abs/2110.09485&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by D-Machine</title><link>https://news.ycombinator.com/item?id=47012347</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:47012347</guid><pubDate>Sat, 14 Feb 2026 07:07:00 GMT</pubDate><description>&lt;p&gt;The tricky part is that LLMs aren&amp;#x27;t just spewing outputs from the distribution (or &amp;quot;near&amp;quot; learned manifolds), but also extrapolating / interpolating (depending on how much you care about the semantics of these terms https://arxiv.org/abs/2110.09485). There are genuine creative insights that come from connecting two known semantic spaces in a way that wasn&amp;#x27;t obvious before (e.g, novel isomorphism). It is very conceivable that LLMs could make this kind of connection, but we haven&amp;#x27;t really seen a dramatic form of this yet. This kind of connection can lead to deep, non-trivial insights, but…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by redlock</title><link>https://news.ycombinator.com/item?id=42563271</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:42563271</guid><pubDate>Wed, 01 Jan 2025 01:36:35 GMT</pubDate><description>&lt;p&gt;I don&amp;#x27;t care much for the concept of AGI since it&amp;#x27;s ill defined. However, out of distribution generation and generalization are a better more useful metric. In these Yann Lecun has argued that interpolation is meaningless in the high dimensional spaces these &amp;quot;curves&amp;quot; are embedded in.(https://arxiv.org/abs/2110.09485) ARC has proven they can generalize, and Alpha Go (not an llm but a deep network) has proven it can generate novel/creative solutions. We don&amp;#x27;t need AI to have a sense of self &amp;quot;I&amp;quot; for them to beat us at every human skill and activity. Infact it might be detrimental and not useful…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by a_wild_dandan</title><link>https://news.ycombinator.com/item?id=41987804</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:41987804</guid><pubDate>Tue, 29 Oct 2024 18:27:26 GMT</pubDate><description>&lt;p&gt;The &amp;quot;statistical parrot&amp;quot; parrots have been demonstrably wrong for years (see e.g. LeCun et al[1]). It&amp;#x27;s just harder to ignore reality with hundreds of millions of people now using incredible new AI tools. We&amp;#x27;re approaching &amp;quot;don&amp;#x27;t believe your lying eyes&amp;quot; territory. Deniers will continue pretending that LLMs are just an NFT-level fad or bubble or whatever. The AI revolution will continue to pass them by. More&amp;#x27;s the pity. [1] https://arxiv.org/abs/2110.09485&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by youoy</title><link>https://news.ycombinator.com/item?id=41834991</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:41834991</guid><pubDate>Mon, 14 Oct 2024 07:08:32 GMT</pubDate><description>&lt;p&gt;If you like ML, this is also related with the results of this paper [0], where they show that learning in high dimensions amounts to extrapolation, as opposed to interpolation. Intuitively I think of this as the fact that points in the sphere are convexly independent, and most of the volume of the ball is near the boundary. [0] https://arxiv.org/abs/2110.09485&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by nyrikki</title><link>https://news.ycombinator.com/item?id=39592744</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:39592744</guid><pubDate>Mon, 04 Mar 2024 17:04:05 GMT</pubDate><description>&lt;p&gt;I hate this as being too wooish. There first example, arithmetic, we know actually benefits from over fitting, but even then it isn&amp;#x27;t great. We now know that over Parameterization and double decent is less lossy compression. We know that feed forward networks are TC^0 and we know that CoT etc... are limited to polynomial reductions. The fact that we can&amp;#x27;t predict exactly what is learned in a specific instance is purely a function of computational complexity theory. Attention we know is equivalent to exhaustive search. Yes interpretability is hard and math explains that. We know that the curse…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by a_wild_dandan</title><link>https://news.ycombinator.com/item?id=38651705</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:38651705</guid><pubDate>Fri, 15 Dec 2023 06:53:48 GMT</pubDate><description>&lt;p&gt;&amp;quot;Learning in High Dimension Always Amounts to Extrapolation&amp;quot; [1] [1] https://arxiv.org/abs/2110.09485&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=38190783</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:38190783</guid><pubDate>Wed, 08 Nov 2023 14:32:18 GMT</pubDate><description>&lt;p&gt;&amp;quot;Supercharged Interpolation&amp;quot; is not a thing that exists sorry. Learning in high dimensions always results in extrapolation. https://arxiv.org/abs/2110.09485 And I would love to see the human that can generalize beyond their training distribution.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — HN submission</title><link>https://news.ycombinator.com/item?id=38180213</link><guid isPermaLink="false">urn:hackerpapers:submission:2110.09485:38180213</guid><pubDate>Tue, 07 Nov 2023 17:50:41 GMT</pubDate><description>&lt;p&gt;Learning in High Dimension Always Amounts to Extrapolation&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=38180028</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:38180028</guid><pubDate>Tue, 07 Nov 2023 17:40:03 GMT</pubDate><description>&lt;p&gt;Learning in High Dimension Always Amounts to Extrapolation https://arxiv.org/abs/2110.09485 &amp;quot;Supercharged Interpolation&amp;quot; is not a real thing. They generalize fine when the data incentivizes that.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=38179878</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:38179878</guid><pubDate>Tue, 07 Nov 2023 17:30:28 GMT</pubDate><description>&lt;p&gt;&amp;quot;Supercharged Interpolation&amp;quot; is not something that actually exists. Learning in High Dimension Always Amounts to Extrapolation https://arxiv.org/abs/2110.09485 What you&amp;#x27;re asking for is not &amp;quot;generalization&amp;quot; but magic and humans would also fail.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=38141343</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:38141343</guid><pubDate>Sat, 04 Nov 2023 14:33:44 GMT</pubDate><description>&lt;p&gt;&amp;gt;Since it&amp;#x27;s incapable of actually summarising financial data. It&amp;#x27;s only capable of selecting combinations of pieces of its training set. Third completely off misconception from you today. This is not at all what it is doing. &amp;quot;Supercharged Interpolation&amp;quot; is false and makes no sense. It&amp;#x27;s not a lookup table either. It doesn&amp;#x27;t memorize enough of what it needs to to make your assertion possible. https://arxiv.org/abs/2110.09485&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=38140199</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:38140199</guid><pubDate>Sat, 04 Nov 2023 11:55:32 GMT</pubDate><description>&lt;p&gt;LLMs are not lookup tables. They aren&amp;#x27;t &amp;quot;matching&amp;quot; in that way. There&amp;#x27;s this idea of &amp;quot;supercharged interpolation&amp;quot;, the idea that they just take out certain texts and switch out words or whatever, that is not true. https://arxiv.org/abs/2110.09485&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=38052807</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:38052807</guid><pubDate>Sat, 28 Oct 2023 19:49:40 GMT</pubDate><description>&lt;p&gt;&amp;gt;That is what LLMs can do, they don&amp;#x27;t write something inspired by it they write down a copy of it with switched out words and grammar structure. That&amp;#x27;s not at all what they do. This myth of &amp;quot;supercharged interpolation&amp;quot; really needs to die. https://arxiv.org/abs/2110.09485 &amp;gt;It doesn&amp;#x27;t matter if you personally aren&amp;#x27;t using them like that, the fact that they can be used like that is the problem. Of course it matters. You penalize people when they have done something wrong not if they have the capacity to.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — HN submission</title><link>https://news.ycombinator.com/item?id=38051936</link><guid isPermaLink="false">urn:hackerpapers:submission:2110.09485:38051936</guid><pubDate>Sat, 28 Oct 2023 17:50:24 GMT</pubDate><description>&lt;p&gt;Learning in High Dimension Always Amounts to Extrapolation&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by pizza</title><link>https://news.ycombinator.com/item?id=37668729</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:37668729</guid><pubDate>Wed, 27 Sep 2023 01:46:00 GMT</pubDate><description>&lt;p&gt;These models are pretty much always extrapolating [0] Whether the extrapolation is crude/low-rank or astute/high-rank is a question of memorization vs generalization. That gets into the question of whether or not the model is over-fitted or under-fitted. There are certain heuristics borrowed from high dimensional statistical physics that can be used to guess how good the test performance of a model will be on a typical task without even knowing what the test data is [1]. Originality for me means finding better answers to sub-tasks, and then combining those answers together in a better way.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by abriosi</title><link>https://news.ycombinator.com/item?id=31569809</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:31569809</guid><pubDate>Tue, 31 May 2022 14:21:24 GMT</pubDate><description>&lt;p&gt;I wish I could do a good job at that. Let me rob a definition from this paper &amp;quot;Learning in High Dimension Always Amounts to Extrapolation&amp;quot; https://arxiv.org/pdf/2110.09485.pdf : Definition 1. Interpolation occurs for a sample x whenever this sample belongs to the convex hull of a set of samples X, {x1, . . . , xN }, if not, extrapolation occurs.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by abel_</title><link>https://news.ycombinator.com/item?id=31417808</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:31417808</guid><pubDate>Wed, 18 May 2022 00:23:19 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s a neat argument against these models doing interpolation: the manifold of the data is so sparse that it&amp;#x27;s infinitesimally unlikely for a good predictor to be doing interpolation between existing points on the manifold. https://arxiv.org/abs/2110.09485&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning in High Dimension Always Amounts to Extrapolation — mentioned by Isinlor</title><link>https://news.ycombinator.com/item?id=29509311</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.09485:29509311</guid><pubDate>Fri, 10 Dec 2021 12:58:34 GMT</pubDate><description>&lt;p&gt;Depends on how you define interpolation and extrapolation. In high dimensional spaces basically everything is extrapolation including in pixel space and embedding space. &amp;gt; The notion of interpolation and extrapolation is fundamental in various fields from deep learning to function approximation. Interpolation occurs for a sample x whenever this sample falls inside or on the boundary of the given dataset&amp;#x27;s convex hull. Extrapolation occurs when x falls outside of that convex hull. One fundamental (mis)conception is that state-of-the-art algorithms work so well because of their ability to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.09485/"&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>
