Re: [theory students] [theory faculty] FW: Theory lunch tomorrow

[Shuchi Chawla <shuchi@xxxxxxxxxxx>]

Thanks, Shuai! By the way today's talk was wonderful!

Everyone: we'll try to get pizza during some of the weeks, especially the well attended ones. In order to get an accurate idea of how many people intend to show up, so we can order the right amount of food, I have created a new tab in this spreadsheet. Please go to the "Attendance" tab at the bottom. Create a new column with your name at the top, and place a "1" when you are able to show up and a "0" or blank otherwise. The counts will get updated automatically.Â

Thanks, and look forward to seeing more of you starting next week!

Shuchi

On Wed, Sep 25, 2019 at 2:30 PM Shuai Shao <sh@xxxxxxxxxxx> wrote:

The link I sent out yesterday requires one to sign in using you wisc account. I have changed it. Now, you can edit the sheet without signing in.

https://docs.google.com/spreadsheets/d/12LdZiO-QU7kW7s1bS4zSzeVw_1N-2Fkuh260gdcwM-U/edit?usp=sharing

Â

Best,

Shuai

Â

From: Theory-students <theory-students-bounces@xxxxxxxxxxx> on behalf of Shuai Shao <sh@xxxxxxxxxxx>
Date: Tuesday, September 24, 2019 at 23:14
To: "theory-faculty@xxxxxxxxxxx" <theory-faculty@xxxxxxxxxxx>, "theory-students@xxxxxxxxxxx" <theory-students@xxxxxxxxxxx>, "theory-postdocs@xxxxxxxxxxx" <theory-postdocs@xxxxxxxxxxx>
Subject: [theory students] Theory lunch tomorrow

Â

Hi, Dear all

Â

We will watch TCS+ talk tomorrow noon in 4310. Feel free to bring your lunch and join us. I created a spreadsheet for this semester.

https://docs.google.com/spreadsheets/d/12LdZiO-QU7kW7s1bS4zSzeVw_1N-2Fkuh260gdcwM-U/edit?usp=sharing

Students are encouraged to sign up to give an (informal) talk. Also, professors are certainly welcome to add a note if free food will be provided. Thanks.

Â

Below is the information for tomorrow TCS+ talk.

Â

Title: Chasing Convex Bodies

Speaker: Mark Sellke(Stanford)

Â

Abstract: I will explain our recent understanding of the chasing convex bodies problem posed by Friedman and Linial in 1991. In this problem, an online player receives a request sequence K_1,...,K_T of convex sets in d dimensional space and moves his position online into each requested set. The player's movement cost is the length of the resulting path. Chasing convex bodies asks if there an online algorithm with cost competitive against the offline optimal path. This is both an challenging metrical task system and (equivalent to) a competitive analysis view on online convex optimization. This problem was open for d>2 until last year but has recently been solved twice. The first solution gives a 2^{O(d)} competitive algorithm while the second gives a nearly optimal min(d,sqrt(d*log(T))) competitive algorithm for T requests. The latter result is based on the Steiner point, which is the exact optimal solution to a related geometric problem called Lipschitz selection and dates from 1840. In the talk, I will briefly outline the first solution and fully explain the second.

Â

Partially based on joint works with SÃbastien Bubeck, Bo'az Klartag, Yin Tat Lee, and Yuanzhi Li.

Â

------------------------------------------------------------------------------- This message was sent to the mailing list for the theory students at the Computer Sciences Department of the University of Wisconsin in Madison.

-------------------------------------------------------------------------------
This message was sent to the mailing list for the theory faculty at the
Computer Sciences Department of the University of Wisconsin in Madison.