1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
//! Backward implementations for operations
//!
//! Each operation has a corresponding backward struct that implements
//! `GradFn` to compute gradients during the backward pass.
//!
//! # Structure
//!
//! - `arithmetic`: Binary operations (add, sub, mul, div, pow)
//! - `unary`: Unary operations (neg, exp, log, sqrt, tan, etc.)
//! - `matmul`: Matrix multiplication
//! - `reduce`: Reductions (sum, mean, max, min)
//! - `activation`: Activation functions (relu, sigmoid, softmax)
//! - `scalar`: Tensor-scalar operations (add_scalar, mul_scalar, etc.)
//! - `linalg`: Linear algebra operations (trace, inverse, det, solve, cholesky)
//! - `shape`: Shape operations (reshape, transpose, permute, broadcast)
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;
pub use *;