| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Pass around an accumMap (but it's empty still) | Tom Smeding | 4 days |
| | | |||
| * | D2[Array] now has a Maybe instead of zero-size for zero | Tom Smeding | 6 days |
| | | | | | Remaining problem: 'add' in Compile doesn't use the D2 stuff | ||
| * | Commutativity marker on fold1i | Tom Smeding | 12 days |
| | | |||
| * | Complete accumulator revamp! | Tom Smeding | 2025-03-15 |
| | | |||
| * | Just allow non-array accumulator types | Tom Smeding | 2025-03-09 |
| | | | | | Not sure why I didn't allow this previously | ||
| * | Clean up code organisation a little | Tom Smeding | 2025-03-09 |
| | | |||
| * | Add ext field to remaining AST constructors | Tom Smeding | 2025-01-27 |
| | | |||
| * | WIP UnMonoid (to be used for compiling to C) | Tom Smeding | 2024-12-06 |
| | | |||
| * | Fix indentation | Tom Smeding | 2024-12-06 |
| | | |||
| * | WIP accum top-level args | Tom Smeding | 2024-11-26 |
| | | |||
| * | Prepare for introducing top-level args in accum mod | Tom Smeding | 2024-11-23 |
| | | |||
| * | Use accum storage for Case too | Tom Smeding | 2024-11-23 |
| | | |||
| * | drevScoped returns a data type, not CPS | Tom Smeding | 2024-11-23 |
| | | |||
| * | Factor let storage-dependent scoping logic into separate function | Tom Smeding | 2024-11-22 |
| | | |||
| * | Configuration for CHAD | Tom Smeding | 2024-11-14 |
| | | |||
| * | Make EBuild derivative aware of zero cotangent arrays | Tom Smeding | 2024-11-11 |
| | | |||
| * | Test GMM; it fails | Tom Smeding | 2024-11-10 |
| | | |||
| * | Complete GMM implementation | Tom Smeding | 2024-11-10 |
| | | |||
| * | Some more primitive operators | Tom Smeding | 2024-11-09 |
| | | |||
| * | WIP maximum/minimum | Tom Smeding | 2024-11-08 |
| | | |||
| * | Custom derivatives | Tom Smeding | 2024-11-08 |
| | | |||
| * | Remove build1 | Tom Smeding | 2024-11-07 |
| | | |||
| * | Benchmark | Tom Smeding | 2024-11-07 |
| | | |||
| * | Generate EOneHot in D[EIdx] | Tom Smeding | 2024-11-05 |
| | | | | | | | This generates a one-hot for the zero-dimensional inner array because indexing one level further to the actual element is too difficult. But this should simplify away fine. | ||
| * | WIP EOneHot | Tom Smeding | 2024-11-04 |
| | | |||
| * | Store only on tape what's used in the dual | Tom Smeding | 2024-10-29 |
| | | |||
| * | WIP preserve only subset of D0 bindings in dual (...) | Tom Smeding | 2024-10-27 |
| | | | | | | | | | | | | | | | | The point of this is to ensure that when an expression occurs in a Build, then the parts of D0 that are only there to make sharing work out for D1 are not laboriously taped in an array and preserved for D2, only for D2 to ignore them. However, while the subtape machinery is a good first step, this is not everything: the current Build translation makes a Build for the (elementwise) tape and separately a build for the primal. Because the primal _does_ generally need the subtaped-away stuff, we can't just not tape those. TODO: figure out how to resolve this / what the next step is. | ||
| * | Fix EIdx derivative | Tom Smeding | 2024-10-26 |
| | | |||
| * | Debugging | Tom Smeding | 2024-10-26 |
| | | |||
| * | Fix interpreter bug | Tom Smeding | 2024-10-22 |
| | | |||
| * | Less warnings | Tom Smeding | 2024-10-22 |
| | | |||
| * | Differentiate Replicate | Tom Smeding | 2024-10-22 |
| | | |||
| * | Tests | Tom Smeding | 2024-10-21 |
| | | |||
| * | Towards a test suite | Tom Smeding | 2024-10-07 |
| | | |||
| * | Reverse-by-forward, and checking neural (it's wrong) | Tom Smeding | 2024-10-01 |
| | | |||
| * | Test neural | Tom Smeding | 2024-09-25 |
| | | |||
| * | WIP better zero/plus, fixing Accum (...) | Tom Smeding | 2024-09-13 |
| | | | | | | | | | | | | | | The accumulator implementation was wrong because it forgot (in accumAdd) to take into account that values may be variably-sized. Furthermore, it was also complexity-inefficient because it did not build up a sparse value. Thus let's go for the Haskell-interpreter-equivalent of what a real, fast, compiled implementation would do: just a tree with mutable variables. In practice one can decide to indeed flatten parts of that tree, i.e. using a tree representation for nested pairs is bad, but that should have been done _before_ execution and for _all_ occurrences of that type fragment, not live at runtime by the accumulator implementation. | ||
| * | Towards neural | Tom Smeding | 2024-09-12 |
| | | |||
| * | Interpreter, some operations | Tom Smeding | 2024-09-12 |
| | | |||
| * | Generic accumulators | Tom Smeding | 2024-09-05 |
| | | |||
| * | WIP | Tom Smeding | 2024-09-04 |
| | | |||
| * | Some work | Tom Smeding | 2024-09-03 |
| | | |||
| * | Inching towards drev of build | Tom Smeding | 2024-09-03 |
| | | |||
| * | accumPromote | Tom Smeding | 2024-09-02 |
| | | |||
| * | Code cleanup, and OverloadedLabels for LSeg | Tom Smeding | 2024-09-02 |
| | | |||
| * | Autoweak! | Tom Smeding | 2024-09-02 |
| | | |||
| * | WIP autoWeak | Tom Smeding | 2024-09-02 |
| | | |||
| * | WIP Build1 | Tom Smeding | 2024-08-30 |
| | | |||
| * | Migrate to accumulators (mostly removing EVM code) | Tom Smeding | 2024-08-30 |
| | | |||
| * | Generalise freezeRet a little bit | Tom Smeding | 2024-08-29 |
| | | |||
 |
index : chad-fast | |
| [no description] | git daemon user |
| summaryrefslogtreecommitdiff |