pub enum ConvBackwardFilterAlgo {
Auto,
ImplicitGEMM,
ImplicitGEMMSum,
ImplicitPrecompiledGEMMSum,
FFT,
WinogradNonFused,
}
Expand description
Different algorithms to compute the gradient with respect to the filter.
Variants§
Auto
Attempt to automatically find the best algorithm of all the other available ones.
ImplicitGEMM
Compute the convolution as matrix product without forming the matrix that holds the input data.
Does not need any memory workspace.
The results are deterministic.
ImplicitGEMMSum
Compute the convolution as sum of matrix product without forming the matrix that holds the input data.
Does not need any memory workspace.
The results are non-deterministic.
ImplicitPrecompiledGEMMSum
Similar to ImplicitGEMMSum
but needs some workspace to precompile the implicit indices.
The results are non-deterministic.
FFT
Compute the convolution as Fast-Fourier Transform.
Needs a significant memory workspace.
The results are deterministic.
WinogradNonFused
Winograd Transform Non-Fused
Implementations§
Trait Implementations§
source§impl Clone for ConvBackwardFilterAlgo
impl Clone for ConvBackwardFilterAlgo
source§fn clone(&self) -> ConvBackwardFilterAlgo
fn clone(&self) -> ConvBackwardFilterAlgo
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for ConvBackwardFilterAlgo
impl Debug for ConvBackwardFilterAlgo
source§impl PartialEq for ConvBackwardFilterAlgo
impl PartialEq for ConvBackwardFilterAlgo
source§fn eq(&self, other: &ConvBackwardFilterAlgo) -> bool
fn eq(&self, other: &ConvBackwardFilterAlgo) -> bool
self
and other
values to be equal, and is used
by ==
.