byte-vortex commited on
Commit
fa8e928
·
verified ·
1 Parent(s): cdd8dce

Update logbook: Repro - NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search

Browse files
logbook.json CHANGED
@@ -10,7 +10,7 @@
10
  "icml2026-repro",
11
  "paper-Jh6gq9QsFa"
12
  ],
13
- "updated_at": "2026-08-03T03:18:47+00:00",
14
  "root": {
15
  "slug": "index",
16
  "title": "Repro - NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search",
@@ -73,10 +73,10 @@
73
  "total_size": 0,
74
  "bucket_id": null
75
  },
76
- "agent_view_tokens": 4706,
77
  "trace_view_tokens": 10,
78
  "workspace_view_tokens": 8,
79
- "revision": "c9bbc0ba30a1119b7997",
80
  "workspace_ref": {
81
  "repo_id": "byte-vortex/nonzero-repro-artifacts",
82
  "repo_type": "bucket",
 
10
  "icml2026-repro",
11
  "paper-Jh6gq9QsFa"
12
  ],
13
+ "updated_at": "2026-08-03T03:19:03+00:00",
14
  "root": {
15
  "slug": "index",
16
  "title": "Repro - NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search",
 
73
  "total_size": 0,
74
  "bucket_id": null
75
  },
76
+ "agent_view_tokens": 5018,
77
  "trace_view_tokens": 10,
78
  "workspace_view_tokens": 8,
79
+ "revision": "5273477ba2d77dcfd419",
80
  "workspace_ref": {
81
  "repo_id": "byte-vortex/nonzero-repro-artifacts",
82
  "repo_type": "bucket",
pages/claim-3-efficiency-separation-theorem-3-7/page.md CHANGED
@@ -6,3 +6,10 @@
6
  {"type": "markdown", "id": "cell_3dd934c2a67c", "created_at": "2026-08-03T03:14:59+00:00", "title": "Not attempted. Same reasoning as Claim 2 -- theoretical claim (Appendix A.6), p…"}
7
  -->
8
  Not attempted. Same reasoning as Claim 2 -- theoretical claim (Appendix A.6), proof review deprioritized given time constraints.
 
 
 
 
 
 
 
 
6
  {"type": "markdown", "id": "cell_3dd934c2a67c", "created_at": "2026-08-03T03:14:59+00:00", "title": "Not attempted. Same reasoning as Claim 2 -- theoretical claim (Appendix A.6), p…"}
7
  -->
8
  Not attempted. Same reasoning as Claim 2 -- theoretical claim (Appendix A.6), proof review deprioritized given time constraints.
9
+
10
+
11
+ ---
12
+ <!-- trackio-cell
13
+ {"type": "markdown", "id": "cell_5335e20a3e7b", "created_at": "2026-08-03T03:19:02+00:00", "title": "Toy numerical illustration"}
14
+ -->
15
+ [toy numerical illustration] Not a formal proof-check of Theorem 3.7's exact bound (that would require verifying the proof in Appendix A.6, not code). Instead, numerically measured the guided-search budget needed to reach a near-optimal joint action as the number of agents (n) grows from 3 to 8, and compared against the size of the full joint-action space (d^n) that a standard UCB-style method would need to enumerate for comparable coverage. Measured separation ratios: n=3 -> 160.0x, n=4 -> 1,032.6x, n=5 -> 7,447.3x, n=6 -> 90,394.5x, n=7 -> 533,174.2x, n=8 -> 7,190,235.4x. The ratio grew ~44,939x from n=3 to n=8 while the full joint-action space itself only grew 32,768x over the same range -- i.e. the separation ratio is growing faster than the space itself, consistent with an exponential-in-n advantage as claimed by Theorem 3.7, though this illustrates the qualitative trend rather than verifying the theorem's precise constants.