Skip to main content

margin_ranking_loss_backward

Function margin_ranking_loss_backward 

Source
pub fn margin_ranking_loss_backward<T: Triton, const BLOCK_SIZE: i32>(
    dy_ptr: T::Pointer<f32>,
    x1_ptr: T::Pointer<f32>,
    x2_ptr: T::Pointer<f32>,
    y_ptr: T::Pointer<f32>,
    dx1_ptr: T::Pointer<f32>,
    dx2_ptr: T::Pointer<f32>,
    n_elements: i32,
    margin: f32,
)
where T::I32Tensor: Tensor<i32, 1> + Comparison<i32, BoolTensor = T::BoolTensor>, T::Pointer<f32>: AddOffsets<i32, 1, T::I32Tensor, Output = T::Tensor<T::Pointer<f32>>>,
Expand description

Margin ranking loss backward (element-wise).

dx1[i] = -y[i] * dy[i] if hinge > 0, else 0. dx2[i] = y[i] * dy[i] if hinge > 0, else 0.