atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Evasion and Hardening of Tree Ensemble Classifiers

ICML 2016 · Learning theory and algorithms › Prediction and decision losses · approach: Tree ensemble optimization · 101 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use adversarial boosting to add budgeted evading instances during trainingBDT · MNIST 2 vs 6L0 evasion robustnessHelped
Use adversarial boosting to add budgeted evading instances during trainingBDT · MNIST 2 vs 6L1 evasion robustnessHurt
Use adversarial boosting to add budgeted evading instances during trainingBDT · MNIST 2 vs 6L2 evasion robustnessHurt
Use adversarial boosting to add budgeted evading instances during trainingBDT · MNIST 2 vs 6L∞ evasion robustnessHurt
Use adversarial boosting to add budgeted evading instances during trainingBDT · MNIST 2 vs 6 test settest error: 0.25% -> 0.20%Helped
Use a boosted tree ensemble instead of the benchmark alternativesBDT and RF · MNIST 2 vs 6evasion robustness across L0, L1, L2, and L∞Hurt
Use L1 rather than L2 regularizationlinear logistic regression · MNIST 2 vs 6evasion robustnessHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy