English
Related papers

Related papers: Robust Decision Trees Against Adversarial Examples

200 papers

Optimal motion planning involves obstacles avoidance where path planning is the key to success in optimal motion planning. Due to the computational demands, most of the path planning algorithms can not be employed for real-time based…

Robotics · Computer Science 2022-02-15 Geesara Kulathunga

Given the widespread use of deep learning models in safety-critical applications, ensuring that the decisions of such models are robust against adversarial exploitation is of fundamental importance. In this thesis, we discuss recent…

Machine Learning · Computer Science 2025-09-24 Alexander Robey

Transfer learning, in which a network is trained on one task and re-purposed on another, is often used to produce neural network classifiers when data is scarce or full-scale training is too costly. When the goal is to produce a model that…

Machine Learning · Computer Science 2020-02-24 Ali Shafahi , Parsa Saadatpanah , Chen Zhu , Amin Ghiasi , Christoph Studer , David Jacobs , Tom Goldstein

Machine learning-based forecasting models are commonly used in Intelligent Transportation Systems (ITS) to predict traffic patterns and provide city-wide services. However, most of the existing models are susceptible to adversarial attacks,…

Machine Learning · Computer Science 2023-06-27 Fan Liu , Weijia Zhang , Hao Liu

We investigate the adaptive robust control framework for portfolio optimization and loss-based hedging under drift and volatility uncertainty. Adaptive robust problems offer many advantages but require handling a double optimization problem…

Optimization and Control · Mathematics 2020-05-06 Tao Chen , Michael Ludkovski

The Robust Markov Decision Process (RMDP) framework focuses on designing control policies that are robust against the parameter uncertainties due to the mismatches between the simulator model and real-world settings. An RMDP problem is…

Machine Learning · Computer Science 2022-05-17 Kishan Panaganti , Dileep Kalathil

Boosted decision trees enjoy popularity in a variety of applications; however, for large-scale datasets, the cost of training a decision tree in each round can be prohibitively expensive. Inspired by ideas from the multi-arm bandit…

Machine Learning · Computer Science 2018-05-22 Maryam Aziz , Jesse Anderton , Javed Aslam

Neural networks are vulnerable to adversarial examples, i.e. inputs that are imperceptibly perturbed from natural data and yet incorrectly classified by the network. Adversarial training, a heuristic form of robust optimization that…

Machine Learning · Computer Science 2019-11-12 Ruiqi Gao , Tianle Cai , Haochuan Li , Liwei Wang , Cho-Jui Hsieh , Jason D. Lee

Researchers have proposed many methods for fair and robust machine learning, but comprehensive empirical evaluation of their subgroup robustness is lacking. In this work, we address this gap in the context of tabular data, where sensitive…

Machine Learning · Computer Science 2023-04-18 Josh Gardner , Zoran Popović , Ludwig Schmidt

Most previous works usually explained adversarial examples from several specific perspectives, lacking relatively integral comprehension about this problem. In this paper, we present a systematic study on adversarial examples from three…

Machine Learning · Computer Science 2019-03-01 Ke Sun , Zhanxing Zhu , Zhouchen Lin

The existence of adversarial data examples has drawn significant attention in the deep-learning community; such data are seemingly minimally perturbed relative to the original data, but lead to very different outputs from a deep-learning…

Machine Learning · Computer Science 2019-11-12 Bai Li , Changyou Chen , Wenlin Wang , Lawrence Carin

Data used to train machine learning models can be adversarial--maliciously constructed by adversaries to fool the model. Challenge also arises by privacy, confidentiality, or due to legal constraints when data are geographically gathered…

Machine Learning · Computer Science 2020-07-09 Alireza Sadeghi , Gang Wang , Meng Ma , Georgios B. Giannakis

In this paper, we take a first step towards answering the question of how to design fair machine learning algorithms that are robust to adversarial attacks. Using a minimax framework, we aim to design an adversarially robust fair regression…

Cryptography and Security · Computer Science 2022-11-09 Yulu Jin , Lifeng Lai

Model-based reinforcement learning has attracted much attention due to its high sample efficiency and is expected to be applied to real-world robotic applications. In the real world, as unobservable disturbances can lead to unexpected…

Robotics · Computer Science 2025-05-26 Taisuke Kobayashi

With the widespread use of machine learning, concerns over its security and reliability have become prevalent. As such, many have developed defenses to harden neural networks against adversarial examples, imperceptibly perturbed inputs that…

Machine Learning · Computer Science 2022-05-09 Pratik Vaishnavi , Kevin Eykholt , Amir Rahmati

We identify a trade-off between robustness and accuracy that serves as a guiding principle in the design of defenses against adversarial examples. Although this problem has been widely studied empirically, much remains unknown concerning…

Machine Learning · Computer Science 2019-06-25 Hongyang Zhang , Yaodong Yu , Jiantao Jiao , Eric P. Xing , Laurent El Ghaoui , Michael I. Jordan

Neural machine translation (NMT) often suffers from the vulnerability to noisy perturbations in the input. We propose an approach to improving the robustness of NMT models, which consists of two parts: (1) attack the translation model with…

Computation and Language · Computer Science 2019-06-07 Yong Cheng , Lu Jiang , Wolfgang Macherey

In recent years, it has been found that neural networks can be easily fooled by adversarial examples, which is a potential safety hazard in some safety-critical applications. Many researchers have proposed various method to make neural…

Machine Learning · Computer Science 2018-04-24 Shuangtao Li , Yuanke Chen , Yanlin Peng , Lin Bai

We study reward maximisation in a wide class of structured stochastic multi-armed bandit problems, where the mean rewards of arms satisfy some given structural constraints, e.g. linear, unimodal, sparse, etc. Our aim is to develop methods…

Machine Learning · Statistics 2020-07-03 Rémy Degenne , Han Shao , Wouter M. Koolen

Decision Trees (DTs) are commonly used for many machine learning tasks due to their high degree of interpretability. However, learning a DT from data is a difficult optimization problem, as it is non-convex and non-differentiable.…

Machine Learning · Computer Science 2024-08-20 Sascha Marton , Stefan Lüdtke , Christian Bartelt , Heiner Stuckenschmidt
‹ Prev 1 4 5 6 7 8 10 Next ›