Search Results for author: Jonathan Brophy

Found 8 papers, 5 papers with code

TCAB: A Large-Scale Text Classification Attack Benchmark

1 code implementation21 Oct 2022 Kalyani Asthana, Zhouhang Xie, Wencong You, Adam Noack, Jonathan Brophy, Sameer Singh, Daniel Lowd

In addition to the primary tasks of detecting and labeling attacks, TCAB can also be used for attack localization, attack target labeling, and attack characterization.

Abuse Detection Sentiment Analysis +2

Instance-Based Uncertainty Estimation for Gradient-Boosted Regression Trees

1 code implementation23 May 2022 Jonathan Brophy, Daniel Lowd

We also find that IBUG can achieve improved probabilistic performance by using different base GBRT models, and can more flexibly model the posterior distribution of a prediction than competing methods.

regression tabular-regression

Adapting and Evaluating Influence-Estimation Methods for Gradient-Boosted Decision Trees

1 code implementation30 Apr 2022 Jonathan Brophy, Zayd Hammoudeh, Daniel Lowd

In the pursuit of better understanding GBDT predictions and generally improving these models, we adapt recent and popular influence-estimation methods designed for deep learning models to GBDTs.

Decision Making

Identifying Adversarial Attacks on Text Classifiers

no code implementations21 Jan 2022 Zhouhang Xie, Jonathan Brophy, Adam Noack, Wencong You, Kalyani Asthana, Carter Perkins, Sabrina Reis, Sameer Singh, Daniel Lowd

The landscape of adversarial attacks against text classifiers continues to grow, with new attacks developed every year and many of them available in standard toolkits, such as TextAttack and OpenAttack.

Abuse Detection Adversarial Text +2

TREX: Tree-Ensemble Representer-Point Explanations

1 code implementation11 Sep 2020 Jonathan Brophy, Daniel Lowd

The weights in the kernel expansion of the surrogate model are used to define the global or local importance of each training example.

Machine Unlearning for Random Forests

3 code implementations11 Sep 2020 Jonathan Brophy, Daniel Lowd

The upper levels of DaRE trees use random nodes, which choose split attributes and thresholds uniformly at random.

Machine Unlearning

EGGS: A Flexible Approach to Relational Modeling of Social Network Spam

no code implementations14 Jan 2020 Jonathan Brophy, Daniel Lowd

In this paper, we present Extended Group-based Graphical models for Spam (EGGS), a general-purpose method for classifying spam in online social networks.

Cannot find the paper you are looking for? You can Submit a new open access paper.