vimarsh's picture
Update logbook: Repro - SlideSparse: Fast and Flexible (2N-2):2N Structured Sparsity
6f8f573 verified
|
Raw
History Blame Contribute Delete
1.3 kB

Claim 1: Coverage theorem


$ orx exp run 90f0c35f-3004-4be0-9962-314b959df1f0 --backend local

exit 0 · 16.0s

✓ Local run started.
  dir  /nas_hcfc/vimarsh/hf-icml-agent-repo-2026/.orx/openresearch/local-runs/08cf457f-a865-4d6d-9e6c-a059956f6ac2
  run  08cf457f-a865-4d6d-9e6c-a059956f6ac2
  Follow it with `orx exp wait 90f0c35f-3004-4be0-9962-314b959df1f0` or `orx logs 08cf457f-a865-4d6d-9e6c-a059956f6ac2`.

Verified independently. Exhaustive enumeration covered all 371 maximally populated (2N-2):2N masks for N=2 through 8. A capacity-constrained exact matcher and the authors' released left-to-right greedy assignment both had zero failures; reconstructed inner products had 0.0 maximum absolute error. Managed local run: 08cf457f-a865-4d6d-9e6c-a059956f6ac2.