From tselil at stanford.edu Mon Jan 3 16:46:56 2022
From: tselil at stanford.edu (Tselil Schramm)
Date: Mon, 3 Jan 2022 16:46:56 -0800
Subject: [theory-seminar] Advertising STATS 221: Random Processes on Graphs
and Lattices
Message-ID:
Hi theorists,
This quarter I am teaching STATS 221: Random Processes on Graphs and
Lattices, which may be of interest to some on this list. It's a discrete
probability course covering some really beautiful topics close to (and
within) TCS, including random walks and electrical flows, uniform spanning
trees, percolation, ising models, and more. Here's the course website
which
contains a more detailed description of the topics.
We have only had one class meeting so far, so it should be really easy to
catch up :).
Hope to see some of you there!
-Tselil
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From tavorb at stanford.edu Mon Jan 3 22:32:28 2022
From: tavorb at stanford.edu (Tavor Baharav)
Date: Mon, 3 Jan 2022 22:32:28 -0800
Subject: [theory-seminar] =?utf-8?q?=22Contextual_Search_in_the_Presence_o?=
=?utf-8?q?f_Irrational_Agents=22_=E2=80=93_Chara_Podimata_=28Thu?=
=?utf-8?b?LCA2LUphbiBAIDQ6MDBwbSk=?=
Message-ID:
Contextual Search in the Presence of Irrational AgentsChara Podimata ?
Graduate Student, Harvard
Thu, 6-Jan / 4:00pm / Packard 101 (in person)
*Please join us for coffee and snacks at 3:30pm in the Grove outside
Packard (near Bytes' outdoor seating). The talk will be streamed on Zoom
for those unable to attend in
person: https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
*
*If you would like to meet with the speaker, please sign up
here: https://docs.google.com/spreadsheets/d/1IG5JScNdsPJlEv5EfBRf-oT-lwlgKiZ4R01IT1Fq0gQ/edit?usp=sharing
*
Abstract
Contextual search is a generalization of binary search in higher
dimensions, which captures settings such as feature-based dynamic pricing.
Standard game-theoretic formulations of this problem assume that agents act
in accordance with a specific behavioral model. In practice, however, some
agents may not follow the dominant behavioral model or they may act in ways
that seem to be arbitrarily irrational. Existing algorithms heavily depend
on the behavioral model being (approximately) accurate for all agents and
have poor performance in the presence of even a few such arbitrarily
irrational agents. In this talk, I provide a framework for studying
contextual search when some of the agents can behave in ways inconsistent
with the underlying behavioral model. The algorithms that I will present
attain near-optimal regret guarantees in the absence of irrational agents
and their performance degrades gracefully with the number of such agents.
The talk will be based on joint works with Thodoris Lykouris, Akshay
Krishnamurthy, Robert Schapire, Renato Paes Leme, and Jon Schneider.
Bio
Chara Podimata is a final year PhD student in the EconCS group at Harvard,
where she is advised by Yiling Chen. Her research studies incentive-aware
Machine Learning algorithms for decision making, i.e., algorithms that
adapt to the presence of strategic agents as data providers. Chara is
supported by a Microsoft Dissertation Grant and a Siebel Scholarship.
During her PhD, she interned twice at MSR NYC (mentored by Jennifer Wortman
Vaughan and Aleksandrs Slivkins) and once at Google Research NYC (mentored
by Renato Paes Leme). She has given tutorials related to strategic learning
at EC20 and FAccT21. Outside of research, she spends her time training and
adventuring with her pup, Terra.
*This talk is hosted by the ISL Colloquium
. To receive talk announcements, subscribe
to the mailing list isl-colloq at lists.stanford.edu
.*
------------------------------
Mailing list: https://mailman.stanford.edu/mailman/listinfo/isl-colloq
This talk: http://isl.stanford.edu/talks/talks/2022q1/chara-podimata/
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Tue Jan 4 11:45:50 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Tue, 4 Jan 2022 19:45:50 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
Message-ID:
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Tue Jan 4 11:45:50 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Tue, 4 Jan 2022 19:45:50 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
Message-ID:
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From mdharris at stanford.edu Tue Jan 4 11:54:16 2022
From: mdharris at stanford.edu (Megan D. Harris)
Date: Tue, 4 Jan 2022 19:54:16 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
In-Reply-To:
References:
Message-ID:
**Please see attached email. All campus events are suspended until Jan. 28th.
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)?
353 Jane Stanford Way, Stanford CA 94305
ON-CAMPUS DAYS AND HOURS: MONDAYS AND THURSDAYS 7:00AM-4:00PM
WORK FROM HOME: TUESDAYS, WEDNESDAYS AND FRIDAYS 7:00AM-4:00PM
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Tuesday, January 4, 2022 11:45 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
-------------- next part --------------
A non-text attachment was scrubbed...
Name: ALL ON CAMPUS EVENTS SUSPENDED UNTIL JAN. 28.pdf
Type: application/pdf
Size: 51473 bytes
Desc: ALL ON CAMPUS EVENTS SUSPENDED UNTIL JAN. 28.pdf
URL:
From mdharris at stanford.edu Tue Jan 4 11:54:16 2022
From: mdharris at stanford.edu (Megan D. Harris)
Date: Tue, 4 Jan 2022 19:54:16 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
In-Reply-To:
References:
Message-ID:
**Please see attached email. All campus events are suspended until Jan. 28th.
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)?
353 Jane Stanford Way, Stanford CA 94305
ON-CAMPUS DAYS AND HOURS: MONDAYS AND THURSDAYS 7:00AM-4:00PM
WORK FROM HOME: TUESDAYS, WEDNESDAYS AND FRIDAYS 7:00AM-4:00PM
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Tuesday, January 4, 2022 11:45 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
-------------- next part --------------
A non-text attachment was scrubbed...
Name: ALL ON CAMPUS EVENTS SUSPENDED UNTIL JAN. 28.pdf
Type: application/pdf
Size: 51473 bytes
Desc: ALL ON CAMPUS EVENTS SUSPENDED UNTIL JAN. 28.pdf
URL:
From tavorb at stanford.edu Wed Jan 5 22:54:11 2022
From: tavorb at stanford.edu (Tavor Baharav)
Date: Wed, 5 Jan 2022 22:54:11 -0800
Subject: [theory-seminar]
=?utf-8?q?=22Contextual_Search_in_the_Presence_o?=
=?utf-8?q?f_Irrational_Agents=22_=E2=80=93_Chara_Podimata_=28Thu?=
=?utf-8?b?LCA2LUphbiBAIDQ6MDBwbSk=?=
In-Reply-To:
References:
Message-ID:
Due to the current situation, the ISL Colloquium will be online this week
(Zoom link:
https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
). If you would like to meet with the speaker, please sign up here:
https://docs.google.com/spreadsheets/d/1IG5JScNdsPJlEv5EfBRf-oT-lwlgKiZ4R01IT1Fq0gQ/edit?usp=sharing
. There will be no ISL coffee social this week.
On Mon, Jan 3, 2022 at 10:32 PM Tavor Baharav wrote:
> Contextual Search in the Presence of Irrational AgentsChara Podimata ?
> Graduate Student, Harvard
>
> Thu, 6-Jan / 4:00pm / Packard 101 (in person)
>
> *Please join us for coffee and snacks at 3:30pm in the Grove outside
> Packard (near Bytes' outdoor seating). The talk will be streamed on Zoom
> for those unable to attend in
> person: https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
> *
>
> *If you would like to meet with the speaker, please sign up
> here: https://docs.google.com/spreadsheets/d/1IG5JScNdsPJlEv5EfBRf-oT-lwlgKiZ4R01IT1Fq0gQ/edit?usp=sharing
> *
> Abstract
>
> Contextual search is a generalization of binary search in higher
> dimensions, which captures settings such as feature-based dynamic pricing.
> Standard game-theoretic formulations of this problem assume that agents act
> in accordance with a specific behavioral model. In practice, however, some
> agents may not follow the dominant behavioral model or they may act in ways
> that seem to be arbitrarily irrational. Existing algorithms heavily depend
> on the behavioral model being (approximately) accurate for all agents and
> have poor performance in the presence of even a few such arbitrarily
> irrational agents. In this talk, I provide a framework for studying
> contextual search when some of the agents can behave in ways inconsistent
> with the underlying behavioral model. The algorithms that I will present
> attain near-optimal regret guarantees in the absence of irrational agents
> and their performance degrades gracefully with the number of such agents.
>
> The talk will be based on joint works with Thodoris Lykouris, Akshay
> Krishnamurthy, Robert Schapire, Renato Paes Leme, and Jon Schneider.
> Bio
>
> Chara Podimata is a final year PhD student in the EconCS group at Harvard,
> where she is advised by Yiling Chen. Her research studies incentive-aware
> Machine Learning algorithms for decision making, i.e., algorithms that
> adapt to the presence of strategic agents as data providers. Chara is
> supported by a Microsoft Dissertation Grant and a Siebel Scholarship.
> During her PhD, she interned twice at MSR NYC (mentored by Jennifer Wortman
> Vaughan and Aleksandrs Slivkins) and once at Google Research NYC (mentored
> by Renato Paes Leme). She has given tutorials related to strategic learning
> at EC20 and FAccT21. Outside of research, she spends her time training and
> adventuring with her pup, Terra.
>
> *This talk is hosted by the ISL Colloquium
> . To receive talk announcements, subscribe
> to the mailing list isl-colloq at lists.stanford.edu
> .*
> ------------------------------
>
> Mailing list: https://mailman.stanford.edu/mailman/listinfo/isl-colloq
> This talk: http://isl.stanford.edu/talks/talks/2022q1/chara-podimata/
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Wed Jan 5 23:06:50 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 6 Jan 2022 07:06:50 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
In-Reply-To:
References:
Message-ID:
?Hi everyone,
Sorry for the late notice and any confusion due to that.
Because of today's updates to campus policies, we'll have theory lunch on gather.town (https://gather.town/invite?token=CEbVffjYIii5gdTpKGSk5p3M52dLigMh, password: SongComplexity) tomorrow at noon. We'll have an hour of socializing and catching up with our friends in the group.
We haven't decided the long-term plan (until Jan 28) because it's unclear from the university announcement whether food can be served for outdoor gatherings. I'll send you an email next week once that's decided, but if you have any suggestion/question/concern, feel free to let me know.
Wish you a healthy and fruitful winter quarter!
Best,
Junyao
________________________________
From: Megan D. Harris
Sent: Tuesday, January 4, 2022 11:54 AM
To: Junyao Zhao ; theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
**Please see attached email. All campus events are suspended until Jan. 28th.
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)?
353 Jane Stanford Way, Stanford CA 94305
ON-CAMPUS DAYS AND HOURS: MONDAYS AND THURSDAYS 7:00AM-4:00PM
WORK FROM HOME: TUESDAYS, WEDNESDAYS AND FRIDAYS 7:00AM-4:00PM
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Tuesday, January 4, 2022 11:45 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Wed Jan 5 23:06:50 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 6 Jan 2022 07:06:50 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
In-Reply-To:
References:
Message-ID:
?Hi everyone,
Sorry for the late notice and any confusion due to that.
Because of today's updates to campus policies, we'll have theory lunch on gather.town (https://gather.town/invite?token=CEbVffjYIii5gdTpKGSk5p3M52dLigMh, password: SongComplexity) tomorrow at noon. We'll have an hour of socializing and catching up with our friends in the group.
We haven't decided the long-term plan (until Jan 28) because it's unclear from the university announcement whether food can be served for outdoor gatherings. I'll send you an email next week once that's decided, but if you have any suggestion/question/concern, feel free to let me know.
Wish you a healthy and fruitful winter quarter!
Best,
Junyao
________________________________
From: Megan D. Harris
Sent: Tuesday, January 4, 2022 11:54 AM
To: Junyao Zhao ; theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
**Please see attached email. All campus events are suspended until Jan. 28th.
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)?
353 Jane Stanford Way, Stanford CA 94305
ON-CAMPUS DAYS AND HOURS: MONDAYS AND THURSDAYS 7:00AM-4:00PM
WORK FROM HOME: TUESDAYS, WEDNESDAYS AND FRIDAYS 7:00AM-4:00PM
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Tuesday, January 4, 2022 11:45 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Wed Jan 5 23:59:01 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 6 Jan 2022 07:59:01 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
In-Reply-To:
References:
Message-ID:
?Sorry the link in the last email has expired.
The new link: https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du
[https://gather.town/images/site/site_preview.png]
Gather
Gather is a video-calling space that lets multiple people hold separate conversations in parallel, walking in and out of those conversations just as easily as they would in real life.
gather.town
?
Password: SongComplexity
Cheers,
Junyao
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Wednesday, January 5, 2022 11:06 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Cc: Megan D. Harris
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hi everyone,
Sorry for the late notice and any confusion due to that.
Because of today's updates to campus policies, we'll have theory lunch on gather.town (https://gather.town/invite?token=CEbVffjYIii5gdTpKGSk5p3M52dLigMh, password: SongComplexity) tomorrow at noon. We'll have an hour of socializing and catching up with our friends in the group.
We haven't decided the long-term plan (until Jan 28) because it's unclear from the university announcement whether food can be served for outdoor gatherings. I'll send you an email next week once that's decided, but if you have any suggestion/question/concern, feel free to let me know.
Wish you a healthy and fruitful winter quarter!
Best,
Junyao
________________________________
From: Megan D. Harris
Sent: Tuesday, January 4, 2022 11:54 AM
To: Junyao Zhao ; theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
**Please see attached email. All campus events are suspended until Jan. 28th.
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)?
353 Jane Stanford Way, Stanford CA 94305
ON-CAMPUS DAYS AND HOURS: MONDAYS AND THURSDAYS 7:00AM-4:00PM
WORK FROM HOME: TUESDAYS, WEDNESDAYS AND FRIDAYS 7:00AM-4:00PM
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Tuesday, January 4, 2022 11:45 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Wed Jan 5 23:59:01 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 6 Jan 2022 07:59:01 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
In-Reply-To:
References:
Message-ID:
?Sorry the link in the last email has expired.
The new link: https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du
[https://gather.town/images/site/site_preview.png]
Gather
Gather is a video-calling space that lets multiple people hold separate conversations in parallel, walking in and out of those conversations just as easily as they would in real life.
gather.town
?
Password: SongComplexity
Cheers,
Junyao
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Wednesday, January 5, 2022 11:06 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Cc: Megan D. Harris
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hi everyone,
Sorry for the late notice and any confusion due to that.
Because of today's updates to campus policies, we'll have theory lunch on gather.town (https://gather.town/invite?token=CEbVffjYIii5gdTpKGSk5p3M52dLigMh, password: SongComplexity) tomorrow at noon. We'll have an hour of socializing and catching up with our friends in the group.
We haven't decided the long-term plan (until Jan 28) because it's unclear from the university announcement whether food can be served for outdoor gatherings. I'll send you an email next week once that's decided, but if you have any suggestion/question/concern, feel free to let me know.
Wish you a healthy and fruitful winter quarter!
Best,
Junyao
________________________________
From: Megan D. Harris
Sent: Tuesday, January 4, 2022 11:54 AM
To: Junyao Zhao ; theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
**Please see attached email. All campus events are suspended until Jan. 28th.
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)?
353 Jane Stanford Way, Stanford CA 94305
ON-CAMPUS DAYS AND HOURS: MONDAYS AND THURSDAYS 7:00AM-4:00PM
WORK FROM HOME: TUESDAYS, WEDNESDAYS AND FRIDAYS 7:00AM-4:00PM
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Tuesday, January 4, 2022 11:45 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Thu Jan 6 10:53:23 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 6 Jan 2022 18:53:23 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
In-Reply-To:
References:
Message-ID:
?A gentle reminder: This is happening in 10 minutes on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity).
We're still recruiting speakers for this quarter. If you would like to present a paper/topic that you're excited about, please let me know.
Cheers,
Junyao
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Wednesday, January 5, 2022 11:59 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Cc: Megan D. Harris
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
?Sorry the link in the last email has expired.
The new link: https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du
[https://gather.town/images/site/site_preview.png]
Gather
Gather is a video-calling space that lets multiple people hold separate conversations in parallel, walking in and out of those conversations just as easily as they would in real life.
gather.town
?
Password: SongComplexity
Cheers,
Junyao
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Wednesday, January 5, 2022 11:06 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Cc: Megan D. Harris
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hi everyone,
Sorry for the late notice and any confusion due to that.
Because of today's updates to campus policies, we'll have theory lunch on gather.town (https://gather.town/invite?token=CEbVffjYIii5gdTpKGSk5p3M52dLigMh, password: SongComplexity) tomorrow at noon. We'll have an hour of socializing and catching up with our friends in the group.
We haven't decided the long-term plan (until Jan 28) because it's unclear from the university announcement whether food can be served for outdoor gatherings. I'll send you an email next week once that's decided, but if you have any suggestion/question/concern, feel free to let me know.
Wish you a healthy and fruitful winter quarter!
Best,
Junyao
________________________________
From: Megan D. Harris
Sent: Tuesday, January 4, 2022 11:54 AM
To: Junyao Zhao ; theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
**Please see attached email. All campus events are suspended until Jan. 28th.
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)?
353 Jane Stanford Way, Stanford CA 94305
ON-CAMPUS DAYS AND HOURS: MONDAYS AND THURSDAYS 7:00AM-4:00PM
WORK FROM HOME: TUESDAYS, WEDNESDAYS AND FRIDAYS 7:00AM-4:00PM
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Tuesday, January 4, 2022 11:45 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Thu Jan 6 10:53:23 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 6 Jan 2022 18:53:23 +0000
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
In-Reply-To:
References:
Message-ID:
?A gentle reminder: This is happening in 10 minutes on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity).
We're still recruiting speakers for this quarter. If you would like to present a paper/topic that you're excited about, please let me know.
Cheers,
Junyao
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Wednesday, January 5, 2022 11:59 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Cc: Megan D. Harris
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
?Sorry the link in the last email has expired.
The new link: https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du
[https://gather.town/images/site/site_preview.png]
Gather
Gather is a video-calling space that lets multiple people hold separate conversations in parallel, walking in and out of those conversations just as easily as they would in real life.
gather.town
?
Password: SongComplexity
Cheers,
Junyao
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Wednesday, January 5, 2022 11:06 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Cc: Megan D. Harris
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hi everyone,
Sorry for the late notice and any confusion due to that.
Because of today's updates to campus policies, we'll have theory lunch on gather.town (https://gather.town/invite?token=CEbVffjYIii5gdTpKGSk5p3M52dLigMh, password: SongComplexity) tomorrow at noon. We'll have an hour of socializing and catching up with our friends in the group.
We haven't decided the long-term plan (until Jan 28) because it's unclear from the university announcement whether food can be served for outdoor gatherings. I'll send you an email next week once that's decided, but if you have any suggestion/question/concern, feel free to let me know.
Wish you a healthy and fruitful winter quarter!
Best,
Junyao
________________________________
From: Megan D. Harris
Sent: Tuesday, January 4, 2022 11:54 AM
To: Junyao Zhao ; theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: Re: [theory-seminar] Theory Lunch: Winter 2022 edition
**Please see attached email. All campus events are suspended until Jan. 28th.
Best,
Megan Denise Harris
Faculty Administrator
Computer Science (Gates Building)?
353 Jane Stanford Way, Stanford CA 94305
ON-CAMPUS DAYS AND HOURS: MONDAYS AND THURSDAYS 7:00AM-4:00PM
WORK FROM HOME: TUESDAYS, WEDNESDAYS AND FRIDAYS 7:00AM-4:00PM
Stanford, CA 94305
206.313.1390
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Tuesday, January 4, 2022 11:45 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch: Winter 2022 edition
?Hello everyone,
Hope you had a nice winter break and Happy New Year!
Theory lunch will continue this Thursday, noon. We'll meet in the Engineering Quad for an hour of socializing and catching up with our friends in the group, many of whom we haven't seen since last year.
The plan for the rest of the quarter is like the fall quarter. We'll have 30-minute socializing followed by a 30-minute talk on a whiteboard, also in the Engineering Quad.
If you want to share some cool math with the group, please let me know.
Wish you a great start of the winter quarter!
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From jneu at stanford.edu Fri Jan 7 11:41:09 2022
From: jneu at stanford.edu (Joachim Neu)
Date: Fri, 07 Jan 2022 11:41:09 -0800
Subject: [theory-seminar] =?utf-8?q?=22The_Foundations_of_Private_Statisti?=
=?utf-8?q?cal_Estimation=22_=E2=80=93_Jonathan_Ullman_=28Thu=2C_13-Jan_?=
=?utf-8?b?QCA0OjAwcG0p?=
Message-ID: <3a743b9ebc845549e80ed11f266c71ea9d43b7ac.camel@stanford.edu>
The Foundations of Private Statistical Estimation
Jonathan Ullman ? Professor, Northeastern University
Thu, 13-Jan / 4:00pm /
Zoom:?https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
Due to the current circumstances, this talk will be streamed on Zoom:
https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
Abstract
How can researchers use sensitive data for statistical estimation
without compromising the privacy of the individuals who contributed
their data? In this talk, I will describe my work on the foundations of
statistical estimation in a rigorous privacy framework called
differential privacy. Using fundamental examples like mean and
covariance estimation, I?ll discuss a range of issues like the minimax
error rate of private estimation and practical tools for achieving
differential privacy.
Bio
Jonathan Ullman is an Associate Professor in the Khoury College of
Computer Sciences at Northeastern University. His research centers on
privacy for machine learning and statistics, and its surprising
connections to topics like statistical validity, robustness,
cryptography, and fairness. He has been recognized with an NSF CAREER
award and the Ruth and Joel Spira Outstanding Teacher Award.
This talk is hosted by the ISL Colloquium. To receive talk
announcements, subscribe to the mailing list isl-
colloq at lists.stanford.edu.
Mailing list: https://mailman.stanford.edu/mailman/listinfo/isl-colloq
This talk: http://isl.stanford.edu/talks/talks/2022q1/jonathan-ullman/
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Sun Jan 9 21:06:53 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Mon, 10 Jan 2022 05:06:53 +0000
Subject: [theory-seminar] Theory Lunch 1/13: Eren Kizildag (MIT)
Message-ID:
Hi everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity) unless further notice. As usual, we'll start with some socializing, followed by a talk at 12:30pm. Eren will tell us about: Symmetric Binary Perceptron Model: Algorithms and Barriers
Abstract: It has been shown very recently that the symmetric binary perceptron (SBP) exhibits an extreme form of clustering at all positive densities: almost all of its solutions are singletons separated by large distances. This suggests that finding a solution is likely to be computationally intractable. At the same time, SBP admits polynomial-time algorithms succeeding at low enough densities. This conundrum challenges the view that clustering implies algorithmic hardness.
In this paper, we conduct a different landscape analysis to understand the true algorithmic tractability of this problem. Guided by statistical physics insights, we show that SBP exhibits the multi Overlap Gap Property (m-OGP), an intricate geometric property known to be a rigorous barrier for large classes of algorithms. Our analysis shows the m-OGP threshold (a) is well below the satisfiability threshold; and (b) is nearly tight: up to polylogarithmic factors, it matches the best algorithmic threshold. We then leverage the m-OGP to establish that any sufficiently stable algorithm (appropriately defined) fails to find a satisfying solution.
Our hardness result for the stable algorithms is based on Ramsey Theory from extremal combinatorics, and is of independent interest. The most technically involved part of this work is establishing the stability of the known algorithms, which unlike in several prior models, do not appear to fall into the class of low-degree polynomials.
Joint work with David Gamarnik, Will Perkins, and Changji Xu.
Eren is at Berkeley now. He would like to meet our faculties and students. If you're interested in meeting with him, please sign up on this spreadsheet by Tuesday: https://docs.google.com/spreadsheets/d/1oKdsJAlVjJ8Aygx-lA91a8vCeIvFxiyUF0hmK91JWZ0/edit#gid=0.
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Sun Jan 9 21:06:53 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Mon, 10 Jan 2022 05:06:53 +0000
Subject: [theory-seminar] Theory Lunch 1/13: Eren Kizildag (MIT)
Message-ID:
Hi everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity) unless further notice. As usual, we'll start with some socializing, followed by a talk at 12:30pm. Eren will tell us about: Symmetric Binary Perceptron Model: Algorithms and Barriers
Abstract: It has been shown very recently that the symmetric binary perceptron (SBP) exhibits an extreme form of clustering at all positive densities: almost all of its solutions are singletons separated by large distances. This suggests that finding a solution is likely to be computationally intractable. At the same time, SBP admits polynomial-time algorithms succeeding at low enough densities. This conundrum challenges the view that clustering implies algorithmic hardness.
In this paper, we conduct a different landscape analysis to understand the true algorithmic tractability of this problem. Guided by statistical physics insights, we show that SBP exhibits the multi Overlap Gap Property (m-OGP), an intricate geometric property known to be a rigorous barrier for large classes of algorithms. Our analysis shows the m-OGP threshold (a) is well below the satisfiability threshold; and (b) is nearly tight: up to polylogarithmic factors, it matches the best algorithmic threshold. We then leverage the m-OGP to establish that any sufficiently stable algorithm (appropriately defined) fails to find a satisfying solution.
Our hardness result for the stable algorithms is based on Ramsey Theory from extremal combinatorics, and is of independent interest. The most technically involved part of this work is establishing the stability of the known algorithms, which unlike in several prior models, do not appear to fall into the class of low-degree polynomials.
Joint work with David Gamarnik, Will Perkins, and Changji Xu.
Eren is at Berkeley now. He would like to meet our faculties and students. If you're interested in meeting with him, please sign up on this spreadsheet by Tuesday: https://docs.google.com/spreadsheets/d/1oKdsJAlVjJ8Aygx-lA91a8vCeIvFxiyUF0hmK91JWZ0/edit#gid=0.
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From jneu at stanford.edu Wed Jan 12 11:51:04 2022
From: jneu at stanford.edu (Joachim Neu)
Date: Wed, 12 Jan 2022 11:51:04 -0800
Subject: [theory-seminar]
=?utf-8?q?=22The_Foundations_of_Private_Statisti?=
=?utf-8?q?cal_Estimation=22_=E2=80=93_Jonathan_Ullman_=28Thu=2C_13-Jan_?=
=?utf-8?b?QCA0OjAwcG0p?=
In-Reply-To: <3a743b9ebc845549e80ed11f266c71ea9d43b7ac.camel@stanford.edu>
References: <3a743b9ebc845549e80ed11f266c71ea9d43b7ac.camel@stanford.edu>
Message-ID: <5b3cdaae3d5a90f7b6ac0e170bdb70b7840ccb68.camel@stanford.edu>
Reminder: This talk is tomorrow, Thursday, 13-Jan, at 4pm PT, via Zoom:
https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
On Fri, 2022-01-07 at 11:41 -0800, Joachim Neu wrote:
> The Foundations of Private Statistical Estimation
> ?
> Jonathan Ullman ? Professor, Northeastern University
> Thu, 13-Jan / 4:00pm /
> Zoom:?https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
> Due to the current circumstances, this talk will be streamed on Zoom:
> https://stanford.zoom.us/meeting/register/tJckfuCurzkvEtKKOBvDCrPv3McapgP6HygJ
> ?
> Abstract
> How can researchers use sensitive data for statistical estimation
> without compromising the privacy of the individuals who contributed
> their data? In this talk, I will describe my work on the foundations
> of statistical estimation in a rigorous privacy framework called
> differential privacy. Using fundamental examples like mean and
> covariance estimation, I?ll discuss a range of issues like the
> minimax error rate of private estimation and practical tools for
> achieving differential privacy.
> Bio
> Jonathan Ullman is an Associate Professor in the Khoury College of
> Computer Sciences at Northeastern University. His research centers on
> privacy for machine learning and statistics, and its surprising
> connections to topics like statistical validity, robustness,
> cryptography, and fairness. He has been recognized with an NSF CAREER
> award and the Ruth and Joel Spira Outstanding Teacher Award.
> This talk is hosted by the ISL Colloquium. To receive talk
> announcements, subscribe to the mailing list
> isl-colloq at lists.stanford.edu.
> ?
> ?Mailing list:
> https://mailman.stanford.edu/mailman/listinfo/isl-colloq
> ?This talk:
> http://isl.stanford.edu/talks/talks/2022q1/jonathan-ullman/
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Thu Jan 13 00:20:54 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 13 Jan 2022 08:20:54 +0000
Subject: [theory-seminar] Theory Lunch 1/13: Eren Kizildag (MIT)
In-Reply-To:
References:
Message-ID:
Gentle reminder: ?This is happening in 10 minutes on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity).
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Sunday, January 9, 2022 9:06 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch 1/13: Eren Kizildag (MIT)
Hi everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity) unless further notice. As usual, we'll start with some socializing, followed by a talk at 12:30pm. Eren will tell us about: Symmetric Binary Perceptron Model: Algorithms and Barriers
Abstract: It has been shown very recently that the symmetric binary perceptron (SBP) exhibits an extreme form of clustering at all positive densities: almost all of its solutions are singletons separated by large distances. This suggests that finding a solution is likely to be computationally intractable. At the same time, SBP admits polynomial-time algorithms succeeding at low enough densities. This conundrum challenges the view that clustering implies algorithmic hardness.
In this paper, we conduct a different landscape analysis to understand the true algorithmic tractability of this problem. Guided by statistical physics insights, we show that SBP exhibits the multi Overlap Gap Property (m-OGP), an intricate geometric property known to be a rigorous barrier for large classes of algorithms. Our analysis shows the m-OGP threshold (a) is well below the satisfiability threshold; and (b) is nearly tight: up to polylogarithmic factors, it matches the best algorithmic threshold. We then leverage the m-OGP to establish that any sufficiently stable algorithm (appropriately defined) fails to find a satisfying solution.
Our hardness result for the stable algorithms is based on Ramsey Theory from extremal combinatorics, and is of independent interest. The most technically involved part of this work is establishing the stability of the known algorithms, which unlike in several prior models, do not appear to fall into the class of low-degree polynomials.
Joint work with David Gamarnik, Will Perkins, and Changji Xu.
Eren is at Berkeley now. He would like to meet our faculties and students. If you're interested in meeting with him, please sign up on this spreadsheet by Tuesday: https://docs.google.com/spreadsheets/d/1oKdsJAlVjJ8Aygx-lA91a8vCeIvFxiyUF0hmK91JWZ0/edit#gid=0.
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Thu Jan 13 00:20:54 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 13 Jan 2022 08:20:54 +0000
Subject: [theory-seminar] Theory Lunch 1/13: Eren Kizildag (MIT)
In-Reply-To:
References:
Message-ID:
Gentle reminder: ?This is happening in 10 minutes on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity).
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Sunday, January 9, 2022 9:06 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch 1/13: Eren Kizildag (MIT)
Hi everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity) unless further notice. As usual, we'll start with some socializing, followed by a talk at 12:30pm. Eren will tell us about: Symmetric Binary Perceptron Model: Algorithms and Barriers
Abstract: It has been shown very recently that the symmetric binary perceptron (SBP) exhibits an extreme form of clustering at all positive densities: almost all of its solutions are singletons separated by large distances. This suggests that finding a solution is likely to be computationally intractable. At the same time, SBP admits polynomial-time algorithms succeeding at low enough densities. This conundrum challenges the view that clustering implies algorithmic hardness.
In this paper, we conduct a different landscape analysis to understand the true algorithmic tractability of this problem. Guided by statistical physics insights, we show that SBP exhibits the multi Overlap Gap Property (m-OGP), an intricate geometric property known to be a rigorous barrier for large classes of algorithms. Our analysis shows the m-OGP threshold (a) is well below the satisfiability threshold; and (b) is nearly tight: up to polylogarithmic factors, it matches the best algorithmic threshold. We then leverage the m-OGP to establish that any sufficiently stable algorithm (appropriately defined) fails to find a satisfying solution.
Our hardness result for the stable algorithms is based on Ramsey Theory from extremal combinatorics, and is of independent interest. The most technically involved part of this work is establishing the stability of the known algorithms, which unlike in several prior models, do not appear to fall into the class of low-degree polynomials.
Joint work with David Gamarnik, Will Perkins, and Changji Xu.
Eren is at Berkeley now. He would like to meet our faculties and students. If you're interested in meeting with him, please sign up on this spreadsheet by Tuesday: https://docs.google.com/spreadsheets/d/1oKdsJAlVjJ8Aygx-lA91a8vCeIvFxiyUF0hmK91JWZ0/edit#gid=0.
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Mon Jan 17 09:05:49 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Mon, 17 Jan 2022 17:05:49 +0000
Subject: [theory-seminar] Theory Lunch 1/20: Don Knuth
Message-ID:
Hi everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity). As usual, we'll start with some socializing, followed by a talk at 12:30pm. This week we're very fortunate to have Don as our speaker, and he'll tell us about: Tchoukaillon and bipartite matching
By the way, I think it's worth surveying people's feeling about whether to have outdoor in-person theory lunch after Jan 28. Please use this doodle poll to indicate your preference if you would like to: https://doodle.com/poll/nwk9u5xwnepcnthd?utm_source=poll&utm_medium=link.
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Mon Jan 17 09:05:49 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Mon, 17 Jan 2022 17:05:49 +0000
Subject: [theory-seminar] Theory Lunch 1/20: Don Knuth
Message-ID:
Hi everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity). As usual, we'll start with some socializing, followed by a talk at 12:30pm. This week we're very fortunate to have Don as our speaker, and he'll tell us about: Tchoukaillon and bipartite matching
By the way, I think it's worth surveying people's feeling about whether to have outdoor in-person theory lunch after Jan 28. Please use this doodle poll to indicate your preference if you would like to: https://doodle.com/poll/nwk9u5xwnepcnthd?utm_source=poll&utm_medium=link.
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From tpulkit at stanford.edu Tue Jan 18 12:20:26 2022
From: tpulkit at stanford.edu (Pulkit Tandon)
Date: Tue, 18 Jan 2022 20:20:26 +0000
Subject: [theory-seminar] "Algorithmic Obstructions in the Random Number
Partitioning Problem" - Eren Kizildag (Friday, Jan. 21st, 2pm)
Message-ID:
Hi everyone,
We will be restarting the Information Theory Forum (IT Forum) talks for Winter quarter starting this week. The first talk of the quarter will be organized this Friday (21st January), 2pm, accessible via Zoom. Details below:
Algorithmic Obstructions in the Random Number Partitioning Problem
Eren Kizildag, MIT
Fri, 21st January, 2pm
Zoom Link
pwd: 032264
Abstract:
We consider the algorithmic problem of finding a near-optimal solution for the number partitioning problem (NPP). This problem appears in many practical applications, including the design of randomized controlled trials, multiprocessor scheduling, and cryptography; and is also of theoretical significance. The NPP possesses the so-called statistical-to-computational gap: when its input has distribution N(0,I_n), the optimal value of NPP is \Theta(2^{-n}) w.h.p.; whereas the best polynomial-time algorithm achieves the objective value of only 2^{-\Theta(\log^2 n)}, w.h.p.
In this work, we initiate the study of the nature of this gap for the NPP. Inspired by insights from statistical physics, we study the landscape of the NPP and establish the presence of the Overlap Gap Property (OGP), an intricate geometric property which is known to be a rigorous evidence of an algorithmic hardness for large classes of algorithms. By leveraging the OGP, we establish that (a) any sufficiently stable algorithm, appropriately defined, fails to find a near-optimal solution with energy below 2^{-\omega(n \log^{-1?5} n)}; and (b) a very natural Markov Chain Monte Carlo dynamics fails for find near-optimal solutions.
OGP regards the overlap structure of m-tuples of solutions achieving a certain objective value. When m is constant, we prove the presence of OGP for the objective values of order 2^{-\Theta(n)}, and the absence of it in the regime 2^{-o(n)}. Interestingly, though, by considering overlaps with growing values of m we prove the presence of the OGP up to the level 2^{-\omega(\sqrt{n\log n})}. Our proof of the failure of stable algorithms at values 2^{-\omega(n \log^{-1?5} n)} employs methods from Ramsey Theory from the extremal combinatorics and is of independent interest.
Based on arXiv:2103.01369. Joint work with David Gamarnik.
Bio:
Eren is a final year Ph.D. student in the Department of Electrical Engineering and Computer Science (EECS) at Massachusetts Institute of Technology (MIT), where he is advised by Prof. David Gamarnik. His current research focuses on problems in theoretical machine learning, high-dimensional statistics, and discrete applied probability; where he is interested in devising computationally efficient algorithms for solving such problems as well as in understanding their fundamental computational limits by leveraging insights from the statistical physics and spin glass theory. Before that, he received his received his B.S. degree in electrical and electronics engineering from Bo?azi?i University in 2014, and his M.S. degree in EECS from MIT in 2017.?
Best
Pulkit Tandon
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Thu Jan 20 01:44:15 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 20 Jan 2022 09:44:15 +0000
Subject: [theory-seminar] Theory Lunch 1/20: Don Knuth
In-Reply-To:
References:
Message-ID:
?A gentle reminder: This is happening in 10 minutes on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity).
________________________________
From: Junyao Zhao
Sent: Monday, January 17, 2022 9:05 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch 1/20: Don Knuth
Hi everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity). As usual, we'll start with some socializing, followed by a talk at 12:30pm. This week we're very fortunate to have Don as our speaker, and he'll tell us about: Tchoukaillon and bipartite matching
By the way, I think it's worth surveying people's feeling about whether to have outdoor in-person theory lunch after Jan 28. Please use this doodle poll to indicate your preference if you would like to: https://doodle.com/poll/nwk9u5xwnepcnthd?utm_source=poll&utm_medium=link.
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Thu Jan 20 01:44:15 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 20 Jan 2022 09:44:15 +0000
Subject: [theory-seminar] Theory Lunch 1/20: Don Knuth
In-Reply-To:
References:
Message-ID:
?A gentle reminder: This is happening in 10 minutes on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity).
________________________________
From: Junyao Zhao
Sent: Monday, January 17, 2022 9:05 AM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch 1/20: Don Knuth
Hi everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity). As usual, we'll start with some socializing, followed by a talk at 12:30pm. This week we're very fortunate to have Don as our speaker, and he'll tell us about: Tchoukaillon and bipartite matching
By the way, I think it's worth surveying people's feeling about whether to have outdoor in-person theory lunch after Jan 28. Please use this doodle poll to indicate your preference if you would like to: https://doodle.com/poll/nwk9u5xwnepcnthd?utm_source=poll&utm_medium=link.
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Sun Jan 23 20:43:41 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Mon, 24 Jan 2022 04:43:41 +0000
Subject: [theory-seminar] Theory Lunch 1/27: Prasanna Ramakrishnan
Message-ID:
Hello everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity). As usual, we'll start with some socializing, followed by a talk at 12:30pm. Pras will tell us about:
Metric distortion bounds for randomized social choice
Abstract: Consider the following social choice problem. Suppose we have a set of voters and candidates that lie in a metric space. The goal is to design a mechanism to choose a candidate whose average distance to the voters is as small as possible. However, the mechanism does not get direct access to the metric space. Instead, it gets each voter's ordinal ranking of the candidates by distance. Given only this partial information, what is the smallest worst-case approximation ratio (known as the distortion) that a mechanism can guarantee?
Recent work by Gkatzelis, Halpern, and Shah determined that the optimal distortion for deterministic mechanisms is 3. We discuss new work on randomized mechanisms, including an improved distortion lower bound from 2 to 2.113, a proof that the optimal distortion for 3 candidates is 2.026, and proposals for better randomized mechanisms.
(Joint work with Moses Charikar)
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Sun Jan 23 20:43:41 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Mon, 24 Jan 2022 04:43:41 +0000
Subject: [theory-seminar] Theory Lunch 1/27: Prasanna Ramakrishnan
Message-ID:
Hello everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity). As usual, we'll start with some socializing, followed by a talk at 12:30pm. Pras will tell us about:
Metric distortion bounds for randomized social choice
Abstract: Consider the following social choice problem. Suppose we have a set of voters and candidates that lie in a metric space. The goal is to design a mechanism to choose a candidate whose average distance to the voters is as small as possible. However, the mechanism does not get direct access to the metric space. Instead, it gets each voter's ordinal ranking of the candidates by distance. Given only this partial information, what is the smallest worst-case approximation ratio (known as the distortion) that a mechanism can guarantee?
Recent work by Gkatzelis, Halpern, and Shah determined that the optimal distortion for deterministic mechanisms is 3. We discuss new work on randomized mechanisms, including an improved distortion lower bound from 2 to 2.113, a proof that the optimal distortion for 3 candidates is 2.026, and proposals for better randomized mechanisms.
(Joint work with Moses Charikar)
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Wed Jan 26 22:25:23 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 27 Jan 2022 06:25:23 +0000
Subject: [theory-seminar] Theory Lunch 1/27: Prasanna Ramakrishnan
In-Reply-To:
References:
Message-ID:
?A gentle reminder: This is happening in 10 minutes on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity).
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Sunday, January 23, 2022 8:43 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch 1/27: Prasanna Ramakrishnan
Hello everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity). As usual, we'll start with some socializing, followed by a talk at 12:30pm. Pras will tell us about:
Metric distortion bounds for randomized social choice
Abstract: Consider the following social choice problem. Suppose we have a set of voters and candidates that lie in a metric space. The goal is to design a mechanism to choose a candidate whose average distance to the voters is as small as possible. However, the mechanism does not get direct access to the metric space. Instead, it gets each voter's ordinal ranking of the candidates by distance. Given only this partial information, what is the smallest worst-case approximation ratio (known as the distortion) that a mechanism can guarantee?
Recent work by Gkatzelis, Halpern, and Shah determined that the optimal distortion for deterministic mechanisms is 3. We discuss new work on randomized mechanisms, including an improved distortion lower bound from 2 to 2.113, a proof that the optimal distortion for 3 candidates is 2.026, and proposals for better randomized mechanisms.
(Joint work with Moses Charikar)
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Wed Jan 26 22:25:23 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Thu, 27 Jan 2022 06:25:23 +0000
Subject: [theory-seminar] Theory Lunch 1/27: Prasanna Ramakrishnan
In-Reply-To:
References:
Message-ID:
?A gentle reminder: This is happening in 10 minutes on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity).
________________________________
From: theory-seminar on behalf of Junyao Zhao
Sent: Sunday, January 23, 2022 8:43 PM
To: theory-seminar at lists.stanford.edu ; thseminar at cs.stanford.edu
Subject: [theory-seminar] Theory Lunch 1/27: Prasanna Ramakrishnan
Hello everyone,
This week's theory lunch will take place Thursday at noon. We'll meet on gather.town (https://gather.town/invite?token=9-G9my6FNURD4fsaYqv9hThYVeSmG0du, password: SongComplexity). As usual, we'll start with some socializing, followed by a talk at 12:30pm. Pras will tell us about:
Metric distortion bounds for randomized social choice
Abstract: Consider the following social choice problem. Suppose we have a set of voters and candidates that lie in a metric space. The goal is to design a mechanism to choose a candidate whose average distance to the voters is as small as possible. However, the mechanism does not get direct access to the metric space. Instead, it gets each voter's ordinal ranking of the candidates by distance. Given only this partial information, what is the smallest worst-case approximation ratio (known as the distortion) that a mechanism can guarantee?
Recent work by Gkatzelis, Halpern, and Shah determined that the optimal distortion for deterministic mechanisms is 3. We discuss new work on randomized mechanisms, including an improved distortion lower bound from 2 to 2.113, a proof that the optimal distortion for 3 candidates is 2.026, and proposals for better randomized mechanisms.
(Joint work with Moses Charikar)
Cheers,
Junyao
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From junyaoz at stanford.edu Sun Jan 30 21:46:34 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Mon, 31 Jan 2022 05:46:34 +0000
Subject: [theory-seminar] Theory Lunch 2/3: Social (in-person)
Message-ID:
?Hi everyone,
Starting from this week, in-person outdoor theory lunch is back (with food)!
This Thursday at noon we'll meet in the Engineering Quad for an hour of real-life socializing and catching up with our friends in the group, many of whom we haven't met in person for quite a while. We ordered individually boxed lunches (see the order details at the end).
In-person talks will continue next week.
A friendly reminder: per university guidelines, we recommend wearing face cover in crowded settings when 6 feet of distance from others cannot consistently be maintained (e.g., if we have a large crowd during the talk or a large group discussion). When eating lunch, try to separate into smaller groups if there's not enough space for distancing.
Cheers,
Junyao
Lunch details:
The Don's Deli (Mountain View)
Food Items
Whole Sandwich & 2 Sides Boxed Lunches ? 35
Packaging: Individually Packaged
Sandwiches: Half Meat & Half Vegetarian Sandwiches
Condiments: On Sandwiches
Sides: Mixed Green Salad, Assorted Chips
Theory lunch location (marked in red):
[cid:206018ed-4057-40a7-9e68-b1f1b2fb4efb]
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image.png
Type: image/png
Size: 2325705 bytes
Desc: image.png
URL:
From junyaoz at stanford.edu Sun Jan 30 21:46:34 2022
From: junyaoz at stanford.edu (Junyao Zhao)
Date: Mon, 31 Jan 2022 05:46:34 +0000
Subject: [theory-seminar] Theory Lunch 2/3: Social (in-person)
Message-ID:
?Hi everyone,
Starting from this week, in-person outdoor theory lunch is back (with food)!
This Thursday at noon we'll meet in the Engineering Quad for an hour of real-life socializing and catching up with our friends in the group, many of whom we haven't met in person for quite a while. We ordered individually boxed lunches (see the order details at the end).
In-person talks will continue next week.
A friendly reminder: per university guidelines, we recommend wearing face cover in crowded settings when 6 feet of distance from others cannot consistently be maintained (e.g., if we have a large crowd during the talk or a large group discussion). When eating lunch, try to separate into smaller groups if there's not enough space for distancing.
Cheers,
Junyao
Lunch details:
The Don's Deli (Mountain View)
Food Items
Whole Sandwich & 2 Sides Boxed Lunches ? 35
Packaging: Individually Packaged
Sandwiches: Half Meat & Half Vegetarian Sandwiches
Condiments: On Sandwiches
Sides: Mixed Green Salad, Assorted Chips
Theory lunch location (marked in red):
[cid:206018ed-4057-40a7-9e68-b1f1b2fb4efb]
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image.png
Type: image/png
Size: 2325705 bytes
Desc: image.png
URL:
From tpulkit at stanford.edu Mon Jan 31 14:37:28 2022
From: tpulkit at stanford.edu (Pulkit Tandon)
Date: Mon, 31 Jan 2022 22:37:28 +0000
Subject: [theory-seminar] "Learning by Pruning and the Hunt for Lottery
Tickets" - Dimitris Papailiopoulos (Friday, Feb. 4th, 2pm)
Message-ID: <03BEA178-89DC-4862-BC9E-97A8D09A8802@stanford.edu>
Hi everyone,
We continue with the Information Theory Forum (IT Forum) talks this week @Fri, Feb. 4th, 2pm with Prof. Papailiopoulos. The talks are hosted and accessible via Zoom.
If you want to receive reminder emails, please join the IT Forum mailing list.
Details for this week?s talk are below:
Learning by Pruning and the Hunt for Lottery Tickets
Dimitris Papailiopoulos, Univ. of Wisconsin-Madison
Fri, 4th February, 2pm
Zoom Link
pwd: 032264
Abstract:
A recent work by Ramanujan et al. (2020) provides empirical evidence that sufficiently overparameterized, random neural networks contain untrained subnetworks that achieve state-of-the-art accuracy across several predictive tasks. Follow-up theoretical work establishes a version of this phenomenon when the random network to be pruned is a large polynomial factor wider than a target one. We offer an exponential improvement and show that logarithmically overparameterized, random neural networks can be pruned to approximate any target network. We further show that the amplitude of the random weights does not matter, and one can find almost anything within mildly overparameterized random binary networks. I will conclude with discussing how the above hint on a path towards resolving a largely open problem: finding sparse trainable networks at initialization, aka lottery tickets.
Bio:
Dimitris Papailiopoulos is an Assistant Professor of Electrical and Computer Engineering at the University of Wisconsin-Madison. His research interests span machine learning, information theory, and ML systems, with a current focus on efficient large-scale training algorithms. Between 2014 and 2016, Dimitris was a postdoctoral researcher at UC Berkeley. He earned his Ph.D. in ECE from UT Austin in 2014, under the supervision of Alex Dimakis. He received his ECE Diploma and M.Sc. degree from the Technical University of Crete, in Greece. Dimitris is a recipient of the NSF CAREER Award (2019), three Sony Faculty Innovation Awards (2019, 2020, 2021), a joint IEEE ComSoc/ITSoc Best Paper Award (2020), an IEEE Signal Processing Society, Young Author Best Paper Award (2015), the Vilas Associate Award (2021), the IEEE Education Society Mac Van Valkenburg Early Career Teaching Award (2021), the Emil Steiger Distinguished Teaching Award (2021), and the Benjamin Smith Reynolds Award for Excellence in Teaching (2019). In 2018, he co-founded MLSys, a new conference that targets research at the intersection of machine learning and systems.
Best
Pulkit
-------------- next part --------------
An HTML attachment was scrubbed...
URL: