You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The Winnograd algorithm is often the fastest way to do a convolution.
When we're performing inference in whole graph mode, we have access to the filter tensor, so we can pre-compute the Winnograd constants at compile time (I think) for extra performance.
Why?
We get faster, which is useful for whole graph workloads.
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
-
Motivation
The Winnograd algorithm is often the fastest way to do a convolution.
When we're performing inference in whole graph mode, we have access to the filter tensor, so we can pre-compute the Winnograd constants at compile time (I think) for extra performance.
Why?
We get faster, which is useful for whole graph workloads.
Why not?
It's an entire separate code path.
It'll make tuning a bit tricky
Beta Was this translation helpful? Give feedback.
All reactions