Poisoning Attack on Linear Regression on 3,000 cases Original Setting (Definition 2) (test)
1.092Empirical Performance RatioUpper Bound
Evaluation Results
| Method | Links | |
|---|---|---|
| Upper BoundTime Complexity=O(T(n + λ)) or O((n + λ) log(n + λ))2026.02 | 1.092 | |
| Exact Seg+ETime Complexity=O(n^3)2026.02 | 1 | |
| OptimalTime Complexity=O(((n + λ) / λ)^(2n - 2 + λ))2026.02 | 1 | |
| Heuristic Seg+ETime Complexity=O(nλ)2026.02 | 0.998 | |
| GreedyTime Complexity=O(nλ)2026.02 | 0.933 |