[Colloquium] REMINDER: Talks at TTIC tomorrow at noon! Anand Sarwate, TTIC

[Dawn Ellis]

When:     Friday, November 1st at Noon

Where:    TTIC, 6045 S Kenwood Avenue, 5th Floor, Room #526

Who:       Anand Sarwate, TTIC

Title:        Active Learning with Outcome-Dependent Query Costs

Abstract:

In this talk I will introduce a learning problem in which unlabeled data is
freely available, but acquiring labels has a cost which depends on the
value of the label. In particular, we study an extreme case, which we call
auditing, in which the algorithm only pays for negative labels.  This
setting is motivated by applications such as fraud detection, in which
investigating an honest transaction should be avoided if possible. We call
the number of negative labels that an algorithm requests the "auditing
complexity."  We design auditing algorithms for simple hypothesis classes,
and show that with these algorithms, the auditing complexity can be
significantly lower than the active label complexity. We also consider a
general competitive approach for auditing, and demonstrate its potential
for linear classification.

Joint work with Sivan Sabato (Microsoft Research New England) and Nati
Srebro (TTI-Chicago)


-- 
*Dawn Ellis*
Administrative Coordinator,
Bookkeeper
773-834-1757
dellis at ttic.edu

TTIC
6045 S. Kenwood Ave.
Chicago, IL. 60637
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20131031/dce33024/attachment.htm