A medley of geometry, optimal transport, and machine learning
- đ¤ Speaker: Varun Jog (Cambridge)
- đ Date & Time: Wednesday 10 November 2021, 14:00 - 15:00
- đ Venue: Virtual (Zoom details under abstract)
Abstract
Modern machine learning algorithms are surprisingly fragile to adversarial perturbations of data. In this talk, we present some theoretical contributions towards understanding fundamental bounds on the performance of machine learning algorithms in the presence of adversaries. We shall discuss how optimal transport emerges as a natural mathematical tool to characterize “robust risk”, a notion of risk in the adversarial machine learning literature analogous to Bayes risk in hypothesis testing. We shall also show how, in addition to tools from optimal transport, we may use reverse-isoperimetric inequalities from geometry to provide theoretical bounds on the sample size of estimating robust risk.
Join Zoom Meeting https://maths-cam-ac-uk.zoom.us/j/93933342683?pwd=dUlHZGJYVEhiWXNIaGhsRDVkbmpPZz09
Meeting ID: 939 3334 2683 Passcode: U22EK PmS
Series This talk is part of the CCIMI Seminars series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- CCIMI
- CCIMI Seminars
- Chris Davis' list
- CMS Events
- custom
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Guy Emerson's list
- Hanchen DaDaDash
- Interested Talks
- ndk22's list
- ob366-ai4er
- rp587
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Trust & Technology Initiative - interesting events
- Virtual (Zoom details under abstract)
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Varun Jog (Cambridge)
Wednesday 10 November 2021, 14:00-15:00