Hi zfzhang!



 zfzhang:

Current research does indicate that Winograd speeds up convolution, see:


These two papers you cite:
https://arxiv.org/abs/1509.09308 1
and
http://cs231n.stanford.edu/reports/2016/pdfs/117_Report.pdf 3
refer to a “minimal filtering algorithm” published by Winograd in 1980.
The Wikipedia link you give for the “Winograd algorithm” in your original
post:

  
      en.wikipedia.org
  
  
    

Coppersmith–Winograd algorithm 6


In linear algebra, the Coppersmith–Winograd algorithm, named after Don Coppersmith and Shmuel Winograd, was the asymptotically fastest known matrix multiplication algorithm from 1990 until 2010. It can multiply two 
  
    
      
        n
        ×
        n
      
    
    {\displaystyle n\times n}
  
 matrices in 
  
    
      
        
          
            O
          
        
        (
        
          n
          
            2.375477
          
        
        )
      
    
    {\...

  
  
    
    
  
  


is for the Strassen-like Coppersmith-Winograd matrix-multiplication
algorithm published by them in 1990.  Same Winograd, two different
algorithms.
I’m willing to believe that Winograd’s minimal-filtering algorithm can
be used in practice to speed up CNNs.
Best.
K. Frank