You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
7-leaf exact shortcut: .SPRExact7() uses a precomputed table (src/spr/lookup_table_7.h, spr_table_7()), alongside the 4-, 5- and 6-leaf shortcuts in .SPRRogue().
Early exit in LAPJV. lap() has no cost bound or cutoff argument.
Early exit in mutual clustering info. mutual_clustering_score() only exits early when every split matches exactly; there is no bound against the best leave-one-out score so far.
PolEscapa rogue detector as drop selector. .SPRRogue() still scores each leaf by leave-one-out ProxyDistance (option sprProxy).
VTune profiling (.AGENTS/memory/Optimizations.md, "SPR Distance Profiling") found that reduce_trees iteration dominates. The early-exit items may therefore give limited gains.
PolEscapa rogue detector as drop selector. Not yet investigated.
Details: .AGENTS/memory/Optimizations.md ("SPR Rogue early exits", "Rogue SPR: parent dual prices") and dev/rogue_mci_bound_findings.md. The next lever recorded there is building child cost matrices incrementally from the parent; the fill is now 37–55% of runtime.
Activity
ms609 commentedon Oct 12, 2026
Status: 1 of 4 done.
.SPRExact7()uses a precomputed table (src/spr/lookup_table_7.h,spr_table_7()), alongside the 4-, 5- and 6-leaf shortcuts in.SPRRogue().lap()has no cost bound or cutoff argument.mutual_clustering_score()only exits early when every split matches exactly; there is no bound against the best leave-one-out score so far..SPRRogue()still scores each leaf by leave-one-outProxyDistance(optionsprProxy).VTune profiling (
.AGENTS/memory/Optimizations.md, "SPR Distance Profiling") found thatreduce_treesiteration dominates. The early-exit items may therefore give limited gains.Generated by Claude Code
Faster Rogue SPR: early exits and C++ leaf scoring (#174) (#211)
ms609-agent commentedon Oct 19, 2026
Status update: 3 of 4 settled.
.BoundedCID()and a boundedmutual_clustering<true>()that exits on entropy and row-maximum bounds, plus C++ candidate scoring (spr_rogue_scores()). Bound Rogue SPR candidates with parent dual prices #215 added parent dual-price bounds and warm-started LAPs: −51% at 80 tips, −65% at 150.Early exit in LAPJV.Tested and discounted in Faster Rogue SPR: early exits and C++ leaf scoring (#174) #211. Column-minimum and post-ARR dual bounds insidelap()gave no measurable gain at 50–1000 tips. The row bound already catches candidates far from the cutoff, and the dual bound is too loose for near ones. Templatinglap()also stoppedfindRowSubminbeing inlined. (Bound Rogue SPR candidates with parent dual prices #215's bound sits outsidelap().)Details:
.AGENTS/memory/Optimizations.md("SPR Rogue early exits", "Rogue SPR: parent dual prices") anddev/rogue_mci_bound_findings.md. The next lever recorded there is building child cost matrices incrementally from the parent; the fill is now 37–55% of runtime.Generated by Claude Code