Update logbook: Repro - Solving Positive Linear Programs with Differential Privacy
Browse files
logbook.json
CHANGED
|
@@ -10,7 +10,7 @@
|
|
| 10 |
"icml2026-repro",
|
| 11 |
"paper-zlSioMUQ2Y"
|
| 12 |
],
|
| 13 |
-
"updated_at": "2026-07-17T10:
|
| 14 |
"root": {
|
| 15 |
"slug": "index",
|
| 16 |
"title": "Repro - Solving Positive Linear Programs with Differential Privacy",
|
|
@@ -66,6 +66,6 @@
|
|
| 66 |
}
|
| 67 |
]
|
| 68 |
},
|
| 69 |
-
"agent_view_tokens":
|
| 70 |
-
"revision": "
|
| 71 |
}
|
|
|
|
| 10 |
"icml2026-repro",
|
| 11 |
"paper-zlSioMUQ2Y"
|
| 12 |
],
|
| 13 |
+
"updated_at": "2026-07-17T10:33:43+00:00",
|
| 14 |
"root": {
|
| 15 |
"slug": "index",
|
| 16 |
"title": "Repro - Solving Positive Linear Programs with Differential Privacy",
|
|
|
|
| 66 |
}
|
| 67 |
]
|
| 68 |
},
|
| 69 |
+
"agent_view_tokens": 19027,
|
| 70 |
+
"revision": "1784284423334061000"
|
| 71 |
}
|
pages/claim-5-mwu-variants-for-mixed-packing-covering-algorithms-3-4/page.md
CHANGED
|
@@ -147,3 +147,24 @@ Both algorithms of Section 5 exist, are implementable from the pseudocode, have
|
|
| 147 |
**π― Trackio dashboard** `private-positive-lp-repro`
|
| 148 |
|
| 149 |
trackio-local-dashboard://private-positive-lp-repro
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 147 |
**π― Trackio dashboard** `private-positive-lp-repro`
|
| 148 |
|
| 149 |
trackio-local-dashboard://private-positive-lp-repro
|
| 150 |
+
|
| 151 |
+
|
| 152 |
+
---
|
| 153 |
+
<!-- trackio-cell
|
| 154 |
+
{"type": "markdown", "id": "cell_d74e1939dd55", "created_at": "2026-07-17T10:33:40+00:00", "title": "Algorithm 3: alpha = 0.5 completes the sweep"}
|
| 155 |
+
-->
|
| 156 |
+
## Algorithm 3 β final row (alpha = 0.5), completing the sweep
|
| 157 |
+
|
| 158 |
+
The `alpha = 0.5` configuration finished: **T = 140,623 iterations at full length, uncapped** (~23 min on the L4). It is the hardest of the three β the smallest approximation factor, hence the largest `T` and the loosest `s`.
|
| 159 |
+
|
| 160 |
+
| alpha | T (full) | s | **s/n** | scale-EM error | Lemma 21 smax/smin | **violations @ private** | time |
|
| 161 |
+
|---|---|---|---|---|---|---|---|
|
| 162 |
+
| 0.8 | 34,331 | 3.31e5 | 0.083 β | 0.41% of n β | 0.4142 β€ 1.8 β | **0 / 4,000,000** | 261s |
|
| 163 |
+
| 0.7 | 51,247 | 6.20e5 | 0.155 β | 0.51% of n β | 0.4081 β€ 1.7 β | **0 / 4,000,000** | 409s |
|
| 164 |
+
| **0.5** | **140,623** | 3.01e6 | **0.752** β | **0.88%** of n β | **0.5368 β€ 1.5** β | **0 / 4,000,000** | 1371s |
|
| 165 |
+
|
| 166 |
+
`[PASS] Theorem 11.1 guarantee in all 3 configurations`
|
| 167 |
+
|
| 168 |
+
At `alpha = 0.5` the theorem permits **3,007,000** of the 4,000,000 constraints to be violated and the algorithm violates **zero**. Lemma 21's ratio bound tightens as `alpha` shrinks (1.8 β 1.7 β 1.5) and the measured ratio tracks it with room to spare (0.41 β 0.41 β 0.54).
|
| 169 |
+
|
| 170 |
+
Raw results: [txus/private-positive-lp-repro](https://huggingface.co/datasets/txus/private-positive-lp-repro) (`gpu_mixed_n4000000.json`).
|