Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Link opens in a new tab
Search content at Princeton University
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Lower bounds on adversarial robustness from optimal transport
Arjun Nitin Bhagoji
, Daniel Cullina
,
Prateek Mittal
Electrical and Computer Engineering
Princeton Language and Intelligence (PLI)
Center for Information Technology Policy (CITP)
Center for Statistics & Machine Learning
Research output
:
Contribution to journal
›
Conference article
›
peer-review
75
Link opens in a new tab
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Lower bounds on adversarial robustness from optimal transport'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Adversary
100%
Optimal Transport
100%
Adversarial Robustness
100%
Neural Network Training
33%
Cost Function
33%
Machine Learning Classifiers
33%
MNIST
33%
Classification Performance
33%
Transportation Cost
33%
Transport Problem
33%
Classification Problem
33%
Learning Complexity
33%
Linear Classifier
33%
0-1 Loss
33%
Optimal Transportation
33%
Gaussian Data
33%
Neighborhood Constraint
33%
Optimal Classification
33%
Evasion Attack
33%
CIFAR-10
33%
Norm-bounded
33%
Adversarial Classification
33%
Fashion-MNIST
33%
Sample Complexity
33%
Minimum Transportation Cost
33%
Computer Science
Transportation Cost
100%
Adversarial Robustness
100%
Classification Performance
50%
Linear Classifier
50%
Fundamental Question
50%
Labeled Example
50%
Trained Neural Network
50%
Machine Learning
50%
Learning System
50%
Mathematics
Transportation Cost
100%
Optimal Transport
100%
Adversarial Robustness
100%
Optimality
50%
Neural Network
50%
Gaussian Distribution
50%
Cost Function
50%