teeny-kernels 0.2.0

Teenygrad is a high-performance, memory-safe Rust ML training and inference library. It targets devices from microcontrollers to traditional GPUs with statically-typed kernels and full async support.
/*
 * Copyright (c) 2026 Teenygrad.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#![allow(non_snake_case)]

use teeny_macros::kernel;
use teeny_triton::triton::{
    types::{AddOffsets, Comparison},
    *,
};

/// Adagrad step.
///
/// ```text
/// sum = sum + g²
/// p   = p - lr * g / (sqrt(sum) + eps)
/// ```
///
/// Grid: `[ceil(n_elements / BLOCK_SIZE), 1, 1]`.
#[kernel]
pub fn adagrad_step<T: Triton, const BLOCK_SIZE: i32>(
    params_ptr: T::Pointer<f32>,
    grad_ptr: T::Pointer<f32>,
    sum_ptr: T::Pointer<f32>,
    n_elements: i32,
    lr: f32,
    eps: f32,
    weight_decay: f32,
) where
    T::I32Tensor: types::Tensor<i32, 1>,
    T::I32Tensor: Comparison<i32, BoolTensor = T::BoolTensor>,
    T::Pointer<f32>: AddOffsets<i32, 1, T::I32Tensor, Output = T::Tensor<T::Pointer<f32>>>,
{
    let pid = T::program_id(Axis::X);
    let block_start = pid * BLOCK_SIZE;
    let offsets = T::arange(0, BLOCK_SIZE) + block_start;
    let mask = offsets.lt(n_elements);

    let p = T::load(
        params_ptr.add_offsets(offsets),
        Some(mask),
        None,
        &[],
        None,
        None,
        None,
        false,
    );
    let g = T::load(
        grad_ptr.add_offsets(offsets),
        Some(mask),
        None,
        &[],
        None,
        None,
        None,
        false,
    );
    let sum = T::load(
        sum_ptr.add_offsets(offsets),
        Some(mask),
        None,
        &[],
        None,
        None,
        None,
        false,
    );

    let lr_t = T::full(&[BLOCK_SIZE], lr);
    let eps_t = T::full(&[BLOCK_SIZE], eps);
    let wd_t = T::full(&[BLOCK_SIZE], weight_decay);

    let g_eff = g + wd_t * p;
    let sum_new = sum + g_eff * g_eff;
    let p_new = p - lr_t * g_eff / (T::sqrt_rn(sum_new) + eps_t);

    T::store(
        params_ptr.add_offsets(offsets),
        p_new,
        Some(mask),
        &[],
        None,
        None,
    );
    T::store(
        sum_ptr.add_offsets(offsets),
        sum_new,
        Some(mask),
        &[],
        None,
        None,
    );
}

/// Adadelta step.
///
/// ```text
/// square_avg = rho * square_avg + (1 - rho) * g²
/// delta      = sqrt(acc_delta + eps) / sqrt(square_avg + eps) * g
/// p          = p - lr * delta
/// acc_delta  = rho * acc_delta + (1 - rho) * delta²
/// ```
///
/// Grid: `[ceil(n_elements / BLOCK_SIZE), 1, 1]`.
#[kernel]
pub fn adadelta_step<T: Triton, const BLOCK_SIZE: i32>(
    params_ptr: T::Pointer<f32>,
    grad_ptr: T::Pointer<f32>,
    square_avg_ptr: T::Pointer<f32>,
    acc_delta_ptr: T::Pointer<f32>,
    n_elements: i32,
    lr: f32,
    rho: f32,
    eps: f32,
    weight_decay: f32,
) where
    T::I32Tensor: types::Tensor<i32, 1>,
    T::I32Tensor: Comparison<i32, BoolTensor = T::BoolTensor>,
    T::Pointer<f32>: AddOffsets<i32, 1, T::I32Tensor, Output = T::Tensor<T::Pointer<f32>>>,
{
    let pid = T::program_id(Axis::X);
    let block_start = pid * BLOCK_SIZE;
    let offsets = T::arange(0, BLOCK_SIZE) + block_start;
    let mask = offsets.lt(n_elements);

    let p = T::load(
        params_ptr.add_offsets(offsets),
        Some(mask),
        None,
        &[],
        None,
        None,
        None,
        false,
    );
    let g = T::load(
        grad_ptr.add_offsets(offsets),
        Some(mask),
        None,
        &[],
        None,
        None,
        None,
        false,
    );
    let square_avg = T::load(
        square_avg_ptr.add_offsets(offsets),
        Some(mask),
        None,
        &[],
        None,
        None,
        None,
        false,
    );
    let acc_delta = T::load(
        acc_delta_ptr.add_offsets(offsets),
        Some(mask),
        None,
        &[],
        None,
        None,
        None,
        false,
    );

    let lr_t = T::full(&[BLOCK_SIZE], lr);
    let rho_t = T::full(&[BLOCK_SIZE], rho);
    let one_m_rho = T::full(&[BLOCK_SIZE], 1.0_f32 - rho);
    let eps_t = T::full(&[BLOCK_SIZE], eps);
    let wd_t = T::full(&[BLOCK_SIZE], weight_decay);

    let g_eff = g + wd_t * p;
    let square_avg_new = rho_t * square_avg + one_m_rho * g_eff * g_eff;
    let std = T::sqrt_rn(square_avg_new + eps_t);
    let delta = T::sqrt_rn(acc_delta + eps_t) / std * g_eff;
    let p_new = p - lr_t * delta;
    let acc_delta_new = rho_t * acc_delta + one_m_rho * delta * delta;

    T::store(
        params_ptr.add_offsets(offsets),
        p_new,
        Some(mask),
        &[],
        None,
        None,
    );
    T::store(
        square_avg_ptr.add_offsets(offsets),
        square_avg_new,
        Some(mask),
        &[],
        None,
        None,
    );
    T::store(
        acc_delta_ptr.add_offsets(offsets),
        acc_delta_new,
        Some(mask),
        &[],
        None,
        None,
    );
}