BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//hacksw/handcal//NONSGML v1.0//EN
BEGIN:VEVENT
UID:node-11351@prod.cs.cornell.edu
DTSTAMP:20201012T202000Z
DTSTART:20201012T202000Z
DTEND:20201012T212000Z
SUMMARY:Theory Seminar: Point location with near-optimal bounds
DESCRIPTION:Shachar Lovett, University of California San Diego. Point location with near-optimal bounds (via Zoom)Abstract: The point location problem is a classical problem in discrete and computational geometry. Given a known partition of R^d by n hyperplanes into cells, and an unknown point, find as efficiently as possible the cell in which the point lies. Access to the unknown point is done indirectly, via linear queries with respect to hyperplanes.This problem is equivalent to another well-studied problem, this time in machine learning: active learning of linear classifiers. Here, there are n known points in R^d, which are labeled by an unknown hyperplane. The goal is to as efficiently as possible find the labeling of all n points. Similarly here, access to the unknown hyperplane is done indirectly, in the form of label queries....https://prod.cs.cornell.edu/content/theory-seminar-point-location-near-optimal-bounds
LOCATION:Streaming via Zoom
END:VEVENT
END:VCALENDAR