tidu 0.1.0

Automatic-differentiation transforms (linearize, transpose, eager reverse-mode) for primitive computation graphs.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

# Getting Started

Start with the vocabulary, then run one of the examples.

For the big picture first, see [How tidu Works](../architecture/overview.qmd).

1. Read [Terminology](terminology.md).
2. Run `cargo run --example primitive_linearization`.
3. Run `cargo run --example eager_reverse_mode`.

The examples define a small scalar primitive set locally so they can be read as
complete downstream integrations.

When you implement your own primitive set, the
[Guides](../guides/implementing-primitives.qmd) cover the rule contract, the
linearize/transpose transforms, and eager integration in depth.