Algorithms and Complexity Seminar: 2013-2014: Robust Bayesian Inference

Speaker: Aviad Rubinstein , UC Berkeley

Date: Wednesday, March 19, 2014

Time: 4:00 PM to 5:00 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: 32-G575

Event Type:

Room Description:

Host: Ilya Razenshteyn and Henry Yuen

Contact: Patrice Macaluso,

Relevant URL:

Speaker URL: None

Speaker Photo:

Reminders to:

Reminder Subject: TALK: Algorithms and Complexity Seminar: 2013-2014: Robust Bayesian Inference

We show a near optimal policy for Bayesian inference when an adversary can modify inputs using one of a known set of arbitrary modification rules. Given a black-box access to a Bayesian inference in the classic (adversary-free) setting, our near optimal policy runs in polynomial time in the number of inputs and the number of modification rules. This allows to handle the interesting case where the adversary controls a constant number of inputs. For the special case of aggregating noisy signals from independent experts, We address the case where the expert's accuracy is unknown, and show that our policy applies to this case as well.
Joint work with Yishay Mansour and Moshe Tennenholtz.

Research Areas:

Impact Areas:

This event is not part of a series.

Created by Patrice Macaluso Email at Tuesday, March 18, 2014 at 4:25 PM.