Papers › Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

8 Jun 2019NeurIPS 2019 12arXiv:1906.03526archive 2025-07-28

Maksym Andriushchenko, Matthias Hein

The problem of adversarial robustness has been studied extensively for neural networks. However, for boosted decision trees and decision stumps there are almost no results, even though they are widely used in practice (e.g. XGBoost) due to their accuracy, interpretability, and efficiency. We show in this paper that for boosted decision stumps the exact min-max robust loss and test error for an l_∞-attack can be computed in O(TlogT) time per input, where T is the number of decision stumps and the optimal update step of the ensemble can be done in O(n² TlogT), where n is the number of data points. For boosted trees we show how to efficiently calculate and optimize an upper bound on the robust loss, which leads to state-of-the-art robust test error for boosted trees on MNIST (12.5% for ϵ_∞=0.3), FMNIST (23.2% for ϵ_∞=0.1), and CIFAR-10 (74.7% for ϵ_∞=8/255). Moreover, the robust test error rates we achieve are competitive to the ones of provably robust convolutional networks. The code of all our experiments is available at http://github.com/max-andr/provably-robust-boosting

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 12 code samples harvested from 1 repository linked to this paper: 10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 12 samples from 1 repository, 10 ran (10 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

max-andr/provably-robust-boosting officialmentioned in papermentioned on GitHubBSD-3-ClauseSyntology: 12 samples, 10 ran (0 instrument-failed) · 2 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested: 10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

10ran
2unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from max-andr/provably-robust-boosting. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

max-andr/provably-robust-boosting official repository 12 samples, 10 ran (0 instrument-failed) · 2 unverified
clip in 31 papers utils.py ran fingerprinted BSD-3-Clause (permissive) · 683bc1854d08f77d · report fixture: signature val:float/0/float, val_min:float/0/float, val_max:float/0/float · returned float · level recorded 2026-09-25
cube_attack attacks.py ran BSD-3-Clause (permissive) · 242a09d9693b5d69 · report fixture: signature f:MockClassifier/0/?, X:ndarray/2/float, y:ndarray/1/int, eps:float/0/float, n_trials:int/0/int, p:float/0/float, deltas_init:NoneType/0/?, independent_delta:bool/0/bool, min_val:float/0/float, max_val:float/0/float · returned tuple · level recorded 2026-09-25
find_min_yf_point tree_ensemble.py ran BSD-3-Clause (permissive) · 0ea677162ae82cfe · report fixture: signature nodes:ndarray/2/float, x:ndarray/1/float, y:float/0/float, eps:float/0/float · returned float · level recorded 2026-09-25
find_min_yf_tree_par tree_ensemble.py ran BSD-3-Clause (permissive) · 2f6060c220b1f525 · report fixture: signature nodes:ndarray/2/float, X:ndarray/2/float, y:ndarray/1/float, eps:float/0/float · returned ndarray · level recorded 2026-09-25
get_contiguous_indices utils.py ran fingerprinted BSD-3-Clause (permissive) · 92eb12a00be37bd9 · report fixture: signature indices_opt_init:ndarray/1/int · returned ndarray · level recorded 2026-09-25
minimum utils.py ran fingerprinted BSD-3-Clause (permissive) · 23596bd126ba3587 · report fixture: signature arr1:ndarray/1/float, arr2:ndarray/1/float · returned ndarray · level recorded 2026-09-25
normalize_per_feature_0_1 data.py ran fingerprinted BSD-3-Clause (permissive) · 22a45269af07d150 · report fixture: signature X_train:ndarray/2/float, X_test:ndarray/2/float · returned tuple · level recorded 2026-09-25
predict_point tree_ensemble.py ran BSD-3-Clause (permissive) · b282ba89051ec5db · report fixture: signature nodes:ndarray/2/float, x:ndarray/1/float · returned float · level recorded 2026-09-25
split_train_test in 9 papers data.py ran fingerprinted BSD-3-Clause (permissive) · 9ecc4a0f8c651c2d · report fixture: signature X_all:Tensor/2/float, y_all:Tensor/1/int, frac_train:float/0/float · returned tuple · level recorded 2026-09-25
split_train_validation data.py ran BSD-3-Clause (permissive) · 0c371bdbcb6a457f · report fixture: signature X_train_orig:ndarray/2/float, y_train_orig:ndarray/1/int, frac_valid:float/0/float, shuffle:bool/0/bool · returned tuple · level recorded 2026-09-25
binary_search_attack attacks.py unverified BSD-3-Clause (permissive) · 4f36bf322e7ee391 · report
sampling_attack attacks.py unverified BSD-3-Clause (permissive) · 7a18374118969762 · report

Tasks

Adversarial Robustness

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections