ORID r3PKGNlKET · tags icml2026-repro paper-r3PKGNlKET
| # | Status | Page | Artifact | Claim excerpt |
|---|---|---|---|---|
| 1 | VERIFIED 2/2 | 01-standard-mle-style-log-loss-near-optimal | artifact | Lemma 3.1 shows that standard MLE-style log loss achieves near-optimal uniform c… |
| 2 | VERIFIED 2/2 | 02-establishes-uniform-convergence-square-loss | artifact | Lemma 3.3 establishes uniform convergence for square loss under joint corruption… |
| 3 | VERIFIED 2/2 | 03-privacy-cost-enters-multiplicative-factor | artifact | The privacy cost enters through the multiplicative factor c(epsilon) = (e^epsilo… |
| 4 | VERIFIED 2/2 | 04-two-orderings-corruption-privacy-are | artifact | Two orderings of corruption and privacy are analyzed: Corruption-then-LDP (CTL),… |
| 5 | VERIFIED 2/2 | 05-introduces-privxpo-squarexpo-first-online | artifact | The paper introduces PrivXPO and SquareXPO as the first online algorithms for pr… |
| 6 | VERIFIED 2/2 | 06-offline-algorithms-priv-chi-po-square-chi-po-ach | artifact | Offline algorithms Priv-chi-PO and Square-chi-PO achieve suboptimality gaps of O… |