Dialectical Cot

Use when a reasoning task requires a multi-step Chain-of-Thought (CoT) AND the task is verifiable (grounded answer, testable code, derivable proof). Forbids greedy step-by-step commitment — every step in the chain goes through thesis/antithesis/synthesis BEFORE entering the chain, using memory-primed antitheses to attack the proposed step. Produces a calibrated predicted-correctness per step and per chain. Applies SGD-on-thoughts in the same way `dialectical-reasoning` applies SGD-on-actions.

veegee82 Updated 2 repo stars
Four axes of gradient descent — code (θ), deliverable (y), method (m), reasoning chain (t) — with LDD as the optimizer

File contents

veegee82/loss-driven-development commit 086cde6ede

Frequently asked questions

npx get-skill add veegee82/dialectical-cot