File size: 2,876 Bytes
68293c9
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
{
  "schema_version": 1,
  "title": "Reproduction: On the Sharp Input-Output Analysis of Nonlinear Systems under Adversarial Attacks",
  "emoji": "🛡",
  "space_id": "snaykey/repro-nonlinear-sysid",
  "paper": {
    "openreview_id": "xrUgA8PrNN"
  },
  "tags": [
    "icml2026-repro",
    "paper-xrUgA8PrNN"
  ],
  "updated_at": "2026-07-31T00:00:00+00:00",
  "root": {
    "slug": "index",
    "title": "Reproduction: On the Sharp Input-Output Analysis of Nonlinear Systems under Adversarial Attacks",
    "file": "pages/index.md",
    "children": [
      {
        "slug": "claim-1-theorem-3-1-error-bound",
        "title": "The paper analyzes an ℓ1-norm (least-absolute-deviation) estimator and proves it achieves an estimation error bound of Θ(ρ^τ), where ρ is the system's contraction factor and τ is the input memory length (Theorem 3.1).",
        "file": "pages/claim-1-theorem-3-1-error-bound/page.md",
        "children": []
      },
      {
        "slug": "claim-2-assumption-2-8-attack-prob",
        "title": "Theorem 3.1's guarantee requires the adversarial attack probability to satisfy p < 1/(2τ), which ensures the probability (1-p)^τ of an attack-free observation window exceeds one half (Assumption 2.8, Remark 2.9).",
        "file": "pages/claim-2-assumption-2-8-attack-prob/page.md",
        "children": []
      },
      {
        "slug": "claim-3-theorem-3-4-lower-bound",
        "title": "A matching lower bound of order Θ(ρ^τ L r/λ) is established, proving the upper bound of Theorem 3.1 is order-optimal and that no estimator can improve on this rate under probabilistic adversarial attacks (Theorem 3.4).",
        "file": "pages/claim-3-theorem-3-4-lower-bound/page.md",
        "children": []
      },
      {
        "slug": "claim-4-section-3-2-exponential-decay",
        "title": "The estimation error is shown to decay exponentially with the input memory length τ through the contraction factor ρ ∈ (0,1) (Section 3.2).",
        "file": "pages/claim-4-section-3-2-exponential-decay/page.md",
        "children": []
      },
      {
        "slug": "claim-5-theorem-3-3-exact-recovery",
        "title": "Section 3.2 first derives sufficient conditions for exact recovery in the case without past-state effects (Theorem 3.3, Section 3.2.1), then extends the analysis to the general case with nonzero past-state terms (Section 3.2.2).",
        "file": "pages/claim-5-theorem-3-3-exact-recovery/page.md",
        "children": []
      },
      {
        "slug": "executive-summary",
        "title": "executive-summary",
        "file": "pages/executive-summary/page.md",
        "children": []
      },
      {
        "slug": "conclusion",
        "title": "conclusion",
        "file": "pages/conclusion/page.md",
        "children": []
      }
    ]
  }
}