[HN Gopher] Convolutions, Fast Fourier Transform and polynomials...
       ___________________________________________________________________
        
       Convolutions, Fast Fourier Transform and polynomials (2022)
        
       Author : clearprop
       Score  : 34 points
       Date   : 2024-06-30 21:08 UTC (1 hours ago)
        
 (HTM) web link (www.alvarorevuelta.com)
 (TXT) w3m dump (www.alvarorevuelta.com)
        
       | bjornsing wrote:
       | Funny feeling: Looking at the title I felt a bit puzzled. Then
       | scrolling the article the concepts and their (well known)
       | connections came back to me.
        
       | programjames wrote:
       | Something that always bothers me about these explanations is they
       | usually forget about numerical errors. You can't just abstract
       | away multiplying coefficients as "constant time". You may as well
       | abstract away the entire multiplication to begin with! If you
       | take into account numerical precision, it's closer to O(n (log
       | n)^3) [1].
       | 
       | [1]:
       | http://numbers.computation.free.fr/Constants/Algorithms/fft....
        
       | adamnemecek wrote:
       | I think that all machine learning is solving a convolutional
       | equation.
       | 
       | This paper talks about it in the context of RL
       | https://arxiv.org/abs/1712.06115 but most approaches fit within
       | that paradigm.
        
       ___________________________________________________________________
       (page generated 2024-06-30 23:00 UTC)