From ccanonne at cs.stanford.edu Mon Jul 1 15:46:51 2019
From: ccanonne at cs.stanford.edu (=?UTF-8?Q?Cl=c3=a9ment_Canonne?=)
Date: Mon, 1 Jul 2019 15:46:51 -0700
Subject: [theory-seminar] SODA'20: Paper Swap
Message-ID: <195e90d2-d4fa-1ac5-a8fd-f69e0c0fea3c@cs.stanford.edu>
Hi everyone,
There is, as usual, a deadline coming. This one is SODA 2020, which
actually has two*.
In order to gather feedback on your submissions, or to altruistically
give some feedback even if you're not submitting anything, I'll organize
a paper swap this Monday (the deadline being next Tuesday): if you're
interested, sign up at https://doodle.com/poll/6iusps25yecvtvck
The idea: you fill this form by Friday, 5th at *noon*, and send me the
list of your submissions (or the symbol ? if you have none but are
interested in providing feedback) by email by Friday, *4pm*.
I'll match the participants and tell you who is reading your submission
by Friday 6pm, so that you can send them your manuscript by Saturday,
*noon*.
Then we all gather for lunch at *12pm* on Monday, and give/receive
feedback on those.
If you have any question, let me know.
* If you want to submit something, don't forget to register your
abstract by Friday 07/05!
Best,
--
-- Cl?ment
From ccanonne at cs.stanford.edu Thu Jul 4 22:07:51 2019
From: ccanonne at cs.stanford.edu (=?UTF-8?Q?Cl=c3=a9ment_Canonne?=)
Date: Thu, 4 Jul 2019 22:07:51 -0700
Subject: [theory-seminar] SODA'20: Paper Swap
In-Reply-To: <195e90d2-d4fa-1ac5-a8fd-f69e0c0fea3c@cs.stanford.edu>
References: <195e90d2-d4fa-1ac5-a8fd-f69e0c0fea3c@cs.stanford.edu>
Message-ID: <2b8b0172-7a2d-612e-6f6d-c30d7741f327@cs.stanford.edu>
Reminder: tomorrow, noon is the paper swap deadline! (and also, tomorrow
is the abstract registration deadline)
Best,
-- Cl?ment
On 7/1/19 3:46 PM, Cl?ment Canonne wrote:
> Hi everyone,
>
> There is, as usual, a deadline coming. This one is SODA 2020, which
> actually has two*.
>
> In order to gather feedback on your submissions, or to altruistically
> give some feedback even if you're not submitting anything, I'll organize
> a paper swap this Monday (the deadline being next Tuesday): if you're
> interested, sign up at https://doodle.com/poll/6iusps25yecvtvck
>
> The idea: you fill this form by Friday, 5th at *noon*, and send me the
> list of your submissions (or the symbol ? if you have none but are
> interested in providing feedback) by email by Friday, *4pm*.
>
> I'll match the participants and tell you who is reading your submission
> by Friday 6pm, so that you can send them your manuscript by Saturday,
> *noon*.
>
> Then we all gather for lunch at *12pm* on Monday, and give/receive
> feedback on those.
>
> If you have any question, let me know.
>
> * If you want to submit something, don't forget to register your
> abstract by Friday 07/05!
>
> Best,
From anilesh at stanford.edu Fri Jul 5 10:28:18 2019
From: anilesh at stanford.edu (Anilesh K. Krishnaswamy)
Date: Fri, 5 Jul 2019 10:28:18 -0700
Subject: [theory-seminar] Fwd: [ee-doctorate] EE PhD Oral Defense
Announcement: Anilesh K. Krishnaswamy
In-Reply-To: <027801d531d8$8b82f4d0$a288de70$@ee.stanford.edu>
References: <027801d531d8$8b82f4d0$a288de70$@ee.stanford.edu>
Message-ID:
---------- Forwarded message ---------
From: Meo Kittiwanich
Date: Wed, Jul 3, 2019 at 12:50 PM
Subject: [ee-doctorate] EE PhD Oral Defense Announcement: Anilesh K.
Krishnaswamy
To: ,
University Ph.D. Dissertation Defense
Department of Electrical Engineering
*Anilesh K. Krishnaswamy*
*Scaling up Collective Decision Making*
Advisor: Ashish Goel
*Date: Tuesday, July 9, 2019*
*Time: 10:00 am (refreshments at 9:45 am)*
*Location: 200-305*
The rise of online platforms has the potential to revolutionize
traditionally small-group endeavors, such as informed decision-making, by
allowing them to operate in a distributed manner at much larger scales. In
this talk, I will discuss my work on the design of appropriate mechanisms
to fully leverage this development, and some exciting avenues for future
research.
I will describe my work on Participatory Budgeting (as part of the Stanford
Crowdsourced Democracy Team): in particular, Knapsack Voting, a novel
voting method for this setting. I will then demonstrate how this scheme
works in practice (https://pbstanford.org/), and share theoretical and
empirical insights as to how it performs better than conventional methods.
Despite the ever-increasing use of algorithms to make societal decisions, a
study of the fairness properties of preference aggregation methods has
hitherto remained lacking. In this regard, I will describe a general
framework for quantifying the fairness properties of aggregation methods
based on ideas from multi-objective optimization.
--
EE students mailing list
ee-students at lists.stanford.edu
https://mailman.stanford.edu/mailman/listinfo/ee-students
_______________________________________________
ee-doctorate mailing list
ee-doctorate at lists.stanford.edu
https://mailman.stanford.edu/mailman/listinfo/ee-doctorate
--
----------------------------------------------------------------------------
Anilesh K. Krishnaswamy,
Ph.D. candidate,
Society & Algorithms Lab,
Stanford University.
Webpage: https://web.stanford.edu/~anilesh/
Cell: 650-387-7272
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Mon Jul 8 13:28:40 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Mon, 8 Jul 2019 20:28:40 +0000
Subject: [theory-seminar] Theory Lunch 7/11 -- Summer is Here!
Message-ID:
Hi everyone,
Theory lunch resumes this Thursday 7/11. There's no talk this week - we will just meet and chat (and welcome our visitors!). It would be great if those of you who went to FCRC could share an interesting question/idea that you learned.
As always, please join us from noon to 1pm at 463A.
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Mon Jul 8 13:28:40 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Mon, 8 Jul 2019 20:28:40 +0000
Subject: [theory-seminar] Theory Lunch 7/11 -- Summer is Here!
Message-ID:
Hi everyone,
Theory lunch resumes this Thursday 7/11. There's no talk this week - we will just meet and chat (and welcome our visitors!). It would be great if those of you who went to FCRC could share an interesting question/idea that you learned.
As always, please join us from noon to 1pm at 463A.
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From ccanonne at cs.stanford.edu Tue Jul 9 12:14:32 2019
From: ccanonne at cs.stanford.edu (=?UTF-8?Q?Cl=c3=a9ment_Canonne?=)
Date: Tue, 9 Jul 2019 12:14:32 -0700
Subject: [theory-seminar] SODA Post-deadline
Message-ID:
Hi,
It'll *maybe* be a bit early for beer [1], but for those who are
battling a SODA submission, and the others as well: there will be
Theta(1) cookies [2] at 2:00pm in 363A, to unwind (and have cookies).
[1] [Citation needed]
[2] The constants hidden in the notation are manageable.
Best,
--
-- Cl?ment
From moses at cs.stanford.edu Fri Jul 12 13:08:51 2019
From: moses at cs.stanford.edu (Moses Charikar)
Date: Fri, 12 Jul 2019 14:08:51 -0600
Subject: [theory-seminar] job market posters at FOCS 2019
Message-ID:
Theory folks,
For those of you on the job market next year, here is an excellent
opportunity to publicize your work at FOCS 2019 (conveniently timed right
before the application/interview season gets underway).
>From Ravi Kumar:
Graduating students and postdocs can showcase their work (regardless of
having a paper at FOCS) at the Job Market Poster Session at FOCS 2019.
Deadline for registering a poster: September 6 See:
http://focs2019.cs.jhu.edu/posters/
Cheers,
Moses
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Mon Jul 15 16:32:39 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Mon, 15 Jul 2019 23:32:39 +0000
Subject: [theory-seminar] Theory Lunch 7/18 -- You??
Message-ID:
Hi all,
Just a note that our speaker this Thursday (7/18) had to cancel. If you would like to give a talk or do fun activities with theory folks, please let me know. Thanks!
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Mon Jul 15 16:32:39 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Mon, 15 Jul 2019 23:32:39 +0000
Subject: [theory-seminar] Theory Lunch 7/18 -- You??
Message-ID:
Hi all,
Just a note that our speaker this Thursday (7/18) had to cancel. If you would like to give a talk or do fun activities with theory folks, please let me know. Thanks!
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Wed Jul 17 12:52:11 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Wed, 17 Jul 2019 19:52:11 +0000
Subject: [theory-seminar] Theory Lunch 7/18 -- Robert Tarjan
Message-ID:
Hi all,
Tomorrow at theory lunch, we are fortunate to have Robert Tarjan from Princeton and Intertrust tell us about "Simple Concurrent Connected Components Algorithms." (See abstract below.)
As always, please join us from noon to 1pm at 463A.
-------------------------------------------------
Simple Concurrent Connected Components Algorithms
Speaker: Robert E. Tarjan (Princeton University and Intertrust technologies)
The problem of finding the connected components of an undirected graph is one of the most basic in graph algorithms. It can be solved sequentially in linear time using graph search or in almost-linear time using a disjoint-set data structure. The latter solves the incremental version of the problem, in which edges are added singly or in batches on-line.
With the growth of the internet, computing connected components on huge graphs has become important, and both experimentalists and theoreticians have explored the use of concurrency in speeding up the computation. We shall survey recent work. Even simple concurrent algorithms are hard to analyze, as we discuss. This work is joint with Sixue Liu of Princeton.
-------------------------------------------------
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Wed Jul 17 12:52:11 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Wed, 17 Jul 2019 19:52:11 +0000
Subject: [theory-seminar] Theory Lunch 7/18 -- Robert Tarjan
Message-ID:
Hi all,
Tomorrow at theory lunch, we are fortunate to have Robert Tarjan from Princeton and Intertrust tell us about "Simple Concurrent Connected Components Algorithms." (See abstract below.)
As always, please join us from noon to 1pm at 463A.
-------------------------------------------------
Simple Concurrent Connected Components Algorithms
Speaker: Robert E. Tarjan (Princeton University and Intertrust technologies)
The problem of finding the connected components of an undirected graph is one of the most basic in graph algorithms. It can be solved sequentially in linear time using graph search or in almost-linear time using a disjoint-set data structure. The latter solves the incremental version of the problem, in which edges are added singly or in batches on-line.
With the growth of the internet, computing connected components on huge graphs has become important, and both experimentalists and theoreticians have explored the use of concurrency in speeding up the computation. We shall survey recent work. Even simple concurrent algorithms are hard to analyze, as we discuss. This work is joint with Sixue Liu of Princeton.
-------------------------------------------------
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From moses at cs.stanford.edu Sun Jul 21 06:51:31 2019
From: moses at cs.stanford.edu (Moses Charikar)
Date: Sun, 21 Jul 2019 08:51:31 -0500
Subject: [theory-seminar] Fwd: School on robust statistics, August 12-15,
UCSD
In-Reply-To:
References:
Message-ID:
FYI. This sounds like an excellent opportunity to learn about the current
research on this topic.
Cheers,
Moses
---------- Forwarded message ---------
From: Shachar Lovett
Date: Sun, Jul 21, 2019 at 8:39 AM
Subject: School on robust statistics, August 12-15, UCSD
To:
Dear colleagues,
We are organizing a school on robust statistics at UCSD, August 12-15.
Speakers are: Dave Donoho (Stanford), Ankur Moitra (MIT), Greg Valiant
(Stanford). The topics will cover both classic statistics approaches as
well as more recent computational approaches, and explore different notions
of what it means to be "robust". Registration is free. For details see:
https://cseweb.ucsd.edu/~slovett/workshops/robust-statistics-2019/
I would appreciate if you could forward this email to your relevant
ML/theory mailing lists, and encourage your students (or yourselves) to
come.
Thanks,
Shachar
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Mon Jul 22 11:58:47 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Mon, 22 Jul 2019 18:58:47 +0000
Subject: [theory-seminar] Theory Lunch 7/25 -- Dengwang Tang
Message-ID:
Hi everyone,
This Thursday at theory lunch, Dengwang Tang from UMich will tell us about "Balanced Allocation with Random Walk Based Sampling." (See abstract below.)
As always, please join us from noon to 1pm at 463A.
-----------------------------------------------
Balanced Allocation with Random Walk Based Sampling
Speaker: Dengwang Tang (UMich)
In the standard ball-in-bins experiment, a well-known scheme is to sample $d$ bins independently and uniformly at random and put the ball into the least loaded bin. It can be shown that this scheme yields a maximum load of $\log\log n/\log d+O(1)$ with high probability. Subsequent work analyzed the model when at each time, $d$ bins are sampled through some correlated or non-uniform way. However, the case when the sampling for different balls are correlated are rarely investigated. In this work we analyze a few new schemes for the ball-in-bins allocation problem. We assume that there is an underlying $k$-regular graph connecting the bins. The new schemes are variants of \emph{power-of-$d$ choices}, except that the sampling of $d$ bins at each time are based on the locations of $d$ independently moving non-backtracking random walkers. We show that under some conditions for the underlying graph, the scheme can perform as well as \emph{power-of-$d$}, so that the maximum load is bounded by $\frac{\log\log n}{\log d}+O(1)$ with high probability. We further characterize the conditions of the graph in which the maximum load is bounded by $\Theta(\log \log n)$. Our results resolves Alon et al.'s open question, and the random walk based assignment can be seen as a \emph{derandomization} of \emph{power-of-$d$ choices}.
-----------------------------------------------
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Mon Jul 22 11:58:47 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Mon, 22 Jul 2019 18:58:47 +0000
Subject: [theory-seminar] Theory Lunch 7/25 -- Dengwang Tang
Message-ID:
Hi everyone,
This Thursday at theory lunch, Dengwang Tang from UMich will tell us about "Balanced Allocation with Random Walk Based Sampling." (See abstract below.)
As always, please join us from noon to 1pm at 463A.
-----------------------------------------------
Balanced Allocation with Random Walk Based Sampling
Speaker: Dengwang Tang (UMich)
In the standard ball-in-bins experiment, a well-known scheme is to sample $d$ bins independently and uniformly at random and put the ball into the least loaded bin. It can be shown that this scheme yields a maximum load of $\log\log n/\log d+O(1)$ with high probability. Subsequent work analyzed the model when at each time, $d$ bins are sampled through some correlated or non-uniform way. However, the case when the sampling for different balls are correlated are rarely investigated. In this work we analyze a few new schemes for the ball-in-bins allocation problem. We assume that there is an underlying $k$-regular graph connecting the bins. The new schemes are variants of \emph{power-of-$d$ choices}, except that the sampling of $d$ bins at each time are based on the locations of $d$ independently moving non-backtracking random walkers. We show that under some conditions for the underlying graph, the scheme can perform as well as \emph{power-of-$d$}, so that the maximum load is bounded by $\frac{\log\log n}{\log d}+O(1)$ with high probability. We further characterize the conditions of the graph in which the maximum load is bounded by $\Theta(\log \log n)$. Our results resolves Alon et al.'s open question, and the random walk based assignment can be seen as a \emph{derandomization} of \emph{power-of-$d$ choices}.
-----------------------------------------------
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Tue Jul 30 14:06:56 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Tue, 30 Jul 2019 21:06:56 +0000
Subject: [theory-seminar] Theory Lunch 8/1 -- Ray Li
Message-ID:
Hi all,
This Thursday at theory lunch, Ray will tell us about "Lifted multiplicity codes and the disjoint repair group property." (See abstract below.)
As always, please join us from noon to 1pm at 463A.
------------------------------------------------
Lifted multiplicity codes and the disjoint repair group property
Speaker: Ray Li
Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in the context of locally correctable and testable codes. They are multivariate polynomials whose restriction to any line is a codeword of a Reed-Solomon code. In this talk, we discuss a generalization of this construction, which we call Lifted Multiplicity Codes. These are multivariate polynomial codes whose restriction to any line is a codeword of a multiplicity code (Kopparty, Saraf, Yekhanin 2014). Our main result shows that lifted multiplicity codes give the best known trade-off between redundancy and a notion of locality called the t-disjoint-repair-group property.
Based on joint work with Mary Wootters.
------------------------------------------------
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
From wyma at stanford.edu Tue Jul 30 14:06:56 2019
From: wyma at stanford.edu (Weiyun Ma)
Date: Tue, 30 Jul 2019 21:06:56 +0000
Subject: [theory-seminar] Theory Lunch 8/1 -- Ray Li
Message-ID:
Hi all,
This Thursday at theory lunch, Ray will tell us about "Lifted multiplicity codes and the disjoint repair group property." (See abstract below.)
As always, please join us from noon to 1pm at 463A.
------------------------------------------------
Lifted multiplicity codes and the disjoint repair group property
Speaker: Ray Li
Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in the context of locally correctable and testable codes. They are multivariate polynomials whose restriction to any line is a codeword of a Reed-Solomon code. In this talk, we discuss a generalization of this construction, which we call Lifted Multiplicity Codes. These are multivariate polynomial codes whose restriction to any line is a codeword of a multiplicity code (Kopparty, Saraf, Yekhanin 2014). Our main result shows that lifted multiplicity codes give the best known trade-off between redundancy and a notion of locality called the t-disjoint-repair-group property.
Based on joint work with Mary Wootters.
------------------------------------------------
Best,
Anna
-------------- next part --------------
An HTML attachment was scrubbed...
URL: