chad-fast - [no description]

	Commit message (Collapse)	Author	Age
*	Fix refcount bug with indexing for nested arrays	Tom Smeding	4 days
\|
*	test: regresion-accum1 (still failing)	Tom Smeding	4 days
\|
*	test: Respect shape lower bounds better	Tom Smeding	4 days
\|
*	test: Some more Compile tests (still passing, but code still broken)	Tom Smeding	5 days
\|
*	test: type R = TScal TF64	Tom Smeding	5 days
\|
*	test: Start of a list of compile tests	Tom Smeding	5 days
\|
*	test: Compile final gradient function (WIP)	Tom Smeding	14 days
\| \| \| \|	This doesn't work yet because Compile doesn't yet support EFold1Inner
*	test fwd: test with simplified expression	Tom Smeding	14 days
\|
*	test: Split adTestGen into one function per test case	Tom Smeding	2025-03-11
\| \| \| \|	This improves (compactifies) hedgehog output
*	test-framework: Even more compact output with testGroupCollapse	Tom Smeding	2025-03-11
\|
*	More compact test output	Tom Smeding	2025-03-10
\|
*	test: Also test pre-simplified term	Tom Smeding	2025-03-09
\|
*	test: Run gradientByForward with compiled DN fun	Tom Smeding	2025-03-09
\|
*	test: Make GMM inputs a little bit smaller	Tom Smeding	2025-03-09
\|
*	Add regression test for HEAD^	Tom Smeding	2025-03-04
\|
*	Add some simplify flags infrastructure for debugging	Tom Smeding	2025-03-04
\|
*	Compile: Fix right-precedence of (*)	Tom Smeding	2025-03-04
\|
*	test: Little cleanup	Tom Smeding	2025-03-03
\|
*	Run test primals with Compile (not all succeed yet)	Tom Smeding	2025-03-03
\|
*	test: Pull term_mulmatvec out into top-level	Tom Smeding	2025-03-01
\|
*	test: Simplify and make it a bit faster	Tom Smeding	2025-02-28
\|
*	test: Use tasty	Tom Smeding	2025-02-28
\|
*	Compile: Emit structs in proper order	Tom Smeding	2025-02-25
\|
*	Add sparse test	Tom Smeding	2024-12-12
\|
*	UnMonoid	Tom Smeding	2024-12-06
\|
*	Working argument accum mode (...)	Tom Smeding	2024-11-26
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	The derivative of 'neural' in full accum mode is pretty atrocious now; I think this is because when you have code like this: \(a :: Arr 1 R) -> let b = a in let c = b in sum d then because the argument, as well as both let bindings, bind a value of array type, each will introduce an accumulator, hence resulting in three (!) nested `with` clauses that each just contribute their result back to their parent. This is pointless, and we should fix this.
*	WIP accum top-level args	Tom Smeding	2024-11-26
\|
*	Configuration for CHAD	Tom Smeding	2024-11-14
\|
*	Remove warnings	Tom Smeding	2024-11-13
\|
*	Test gmm	Tom Smeding	2024-11-10
\|
*	Test GMM; it fails	Tom Smeding	2024-11-10
\|
*	Complete GMM implementation	Tom Smeding	2024-11-10
\|
*	Maximum/minimum	Tom Smeding	2024-11-09
\|
*	Benchmark	Tom Smeding	2024-11-07
\|
*	simplifyFix	Tom Smeding	2024-10-29
\|
*	Can differentiate 'neural' now	Tom Smeding	2024-10-26
\|
*	Also test primal results	Tom Smeding	2024-10-26
\|
*	Make interpreter debug printing conditional	Tom Smeding	2024-10-26
\|
*	Debugging	Tom Smeding	2024-10-26
\|
*	Make test suite a little friendlier to debugging	Tom Smeding	2024-10-22
\|
*	Fix interpreter bug	Tom Smeding	2024-10-22
\|
*	Differentiate Replicate	Tom Smeding	2024-10-22
\|
*	Tests	Tom Smeding	2024-10-21
\|
*	WIP testing neural	Tom Smeding	2024-10-18
\|
*	We can differentiate id	Tom Smeding	2024-10-15
\|
*	More towards test suite	Tom Smeding	2024-10-14
\|
*	Towards a test suite	Tom Smeding	2024-10-07