# Difference between revisions of "Theory tea reading group"

(13 intermediate revisions by 3 users not shown) | |||

Line 3: | Line 3: | ||

Old website: | Old website: | ||

https://www.cs.cornell.edu/~samhop/theory_tea/current_tea.html | https://www.cs.cornell.edu/~samhop/theory_tea/current_tea.html | ||

+ | |||

+ | |||

+ | = Fall 2015 = | ||

+ | This semester we will have 4 reading-group-style talks on interlacing polynomials, Ramanujan graphs, the Kadison-Singer problem, and maybe even the asymmetric traveling salesman problem. | ||

+ | Then we will have a series of student talks on a variety of subjects (research talks, talks on old and new papers, etc). | ||

+ | |||

+ | While there may be exceptions, in general there should not be any required reading/preparation for the talks (i.e.: the talks will be self-contained!). | ||

+ | |||

+ | == Schedule == | ||

+ | {| class="wikitable" | ||

+ | |- | ||

+ | ! Date | ||

+ | ! Presenter | ||

+ | ! Topic | ||

+ | |- | ||

+ | | September 21 | ||

+ | | Sam Hopkins | ||

+ | | Interlacing Polys reading group 1 | ||

+ | |- | ||

+ | | September 28 | ||

+ | | Sam Hopkins | ||

+ | | Interlacing Polys reading group 2 | ||

+ | |- | ||

+ | | October 5 | ||

+ | | Dylan Foster | ||

+ | | Interlacing Polys reading group 3 | ||

+ | |- | ||

+ | | October 12 | ||

+ | | No Talk | ||

+ | | Fall Break | ||

+ | |- | ||

+ | | October 19 | ||

+ | | Theory Seminar | ||

+ | | Theory Seminar | ||

+ | |- | ||

+ | | October 26 | ||

+ | | Dylan Foster | ||

+ | | Interlacing Polys reading group 4 | ||

+ | |- | ||

+ | | November 2 | ||

+ | | No Talk | ||

+ | | STOC deadline! | ||

+ | |- | ||

+ | | November 9 | ||

+ | | Theory Seminar | ||

+ | | Theory Seminar | ||

+ | |- | ||

+ | | November 16 | ||

+ | | Theory Seminar | ||

+ | | Theory Seminar | ||

+ | |- | ||

+ | | November 23 | ||

+ | | Yang Yuan | ||

+ | | Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent ([http://arxiv.org/abs/1407.1537# paper here]) | ||

+ | |- | ||

+ | | November 30 | ||

+ | | Jonathan Shi | ||

+ | | TBA | ||

+ | |- | ||

+ | | Decenber 7 | ||

+ | | Alice Paul | ||

+ | | TBA | ||

+ | |} | ||

+ | |||

+ | |||

= Fall 2014 = | = Fall 2014 = | ||

Line 23: | Line 88: | ||

|- | |- | ||

| September 10 | | September 10 | ||

− | | Thodoris | + | | Thodoris Lykouris |

| Submodularity of Influence in Social Networks | | Submodularity of Influence in Social Networks | ||

|- | |- | ||

| September 17 | | September 17 | ||

− | | Emerson | + | | Emerson Melo |

− | | | + | | Network games: theory and applications |

|- | |- | ||

| September 24 | | September 24 | ||

− | | | + | | Chaoxu Tong |

− | | | + | | Capacitated Facility Location |

|- | |- | ||

− | | | + | | September 30 (Tuesday, 3.30pm) |

− | + | | Rad Niazadeh | |

− | | | + | |Price Posting for Selling an Item: Tight Approximations to Optimal Revenue |

|- | |- | ||

| October 8 | | October 8 | ||

− | | | + | | Soroush Alamdari |

− | | | + | | A Non-Cooperative Game of Public Facilities on Networks |

|- | |- | ||

| October 15 | | October 15 | ||

− | | | + | | Daniel Freund |

− | | | + | | Approximation algorithms for rank aggregation |

|- | |- | ||

| October 22 | | October 22 | ||

Line 50: | Line 115: | ||

| TBA | | TBA | ||

|- | |- | ||

− | | October 28 (3:30pm) | + | | October 28 (Tuesday, 3:30pm) |

− | | Alice | + | | Alice Paul |

− | | | + | | A Spectral Algorithm for Max Colored Cut and an application to MAX 2SAT |

|- | |- | ||

| November 5 | | November 5 | ||

− | | Pooya | + | | Pooya Jalaly |

− | | | + | | Market Equilibrium |

|- | |- | ||

| November 12 | | November 12 | ||

− | | Hedyeh | + | | Hedyeh Beyhaghi |

| TBA | | TBA | ||

|- | |- | ||

| November 19 | | November 19 | ||

− | | Rahmtin | + | | Rahmtin Rotabi |

− | | | + | | Behavioral Econ |

|- | |- | ||

| November 26 | | November 26 | ||

− | | Eoin | + | | Eoin O'Mahony |

| TBA | | TBA | ||

|} | |} | ||

− | |||

= Discussion Area -- Feel Free to Edit = | = Discussion Area -- Feel Free to Edit = |

## Revision as of 13:42, 1 October 2015

The Theory Tea reading group meets once per week to discuss current topics in theory of computation. The format and subject matter vary depending on the tastes of the current participants, as channeled, Rousseau-style, through the Theory Tea Czar. The current Czar is Sam Hopkins, capably assisted by Thodoris Lykouris and Daniel Freund.

Old website: https://www.cs.cornell.edu/~samhop/theory_tea/current_tea.html

## Contents

# Fall 2015

This semester we will have 4 reading-group-style talks on interlacing polynomials, Ramanujan graphs, the Kadison-Singer problem, and maybe even the asymmetric traveling salesman problem. Then we will have a series of student talks on a variety of subjects (research talks, talks on old and new papers, etc).

While there may be exceptions, in general there should not be any required reading/preparation for the talks (i.e.: the talks will be self-contained!).

## Schedule

Date | Presenter | Topic |
---|---|---|

September 21 | Sam Hopkins | Interlacing Polys reading group 1 |

September 28 | Sam Hopkins | Interlacing Polys reading group 2 |

October 5 | Dylan Foster | Interlacing Polys reading group 3 |

October 12 | No Talk | Fall Break |

October 19 | Theory Seminar | Theory Seminar |

October 26 | Dylan Foster | Interlacing Polys reading group 4 |

November 2 | No Talk | STOC deadline! |

November 9 | Theory Seminar | Theory Seminar |

November 16 | Theory Seminar | Theory Seminar |

November 23 | Yang Yuan | Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (paper here) |

November 30 | Jonathan Shi | TBA |

Decenber 7 | Alice Paul | TBA |

# Fall 2014

This semester, students will talk about some interesting/neat results related to their own (prior or current) work. This can, but don't have to, be their own results!

Currently, we plan the following: - Wednesday, 5-6 pm - Introductory talks, assuming only basic knowledge of TCS, highlighting the underlying motivation of a result/proof technique/future work/... in the area. - Snacks & beverages (provided funding)

While there may be exceptions, in general there should not be any required reading/preparation for the talks (i.e.: the talks will be self-contained!).

## Schedule

Date | Presenter | Topic |
---|---|---|

September 10 | Thodoris Lykouris | Submodularity of Influence in Social Networks |

September 17 | Emerson Melo | Network games: theory and applications |

September 24 | Chaoxu Tong | Capacitated Facility Location |

September 30 (Tuesday, 3.30pm) | Rad Niazadeh | Price Posting for Selling an Item: Tight Approximations to Optimal Revenue |

October 8 | Soroush Alamdari | A Non-Cooperative Game of Public Facilities on Networks |

October 15 | Daniel Freund | Approximation algorithms for rank aggregation |

October 22 | TBA | TBA |

October 28 (Tuesday, 3:30pm) | Alice Paul | A Spectral Algorithm for Max Colored Cut and an application to MAX 2SAT |

November 5 | Pooya Jalaly | Market Equilibrium |

November 12 | Hedyeh Beyhaghi | TBA |

November 19 | Rahmtin Rotabi | Behavioral Econ |

November 26 | Eoin O'Mahony | TBA |

# Discussion Area -- Feel Free to Edit

# Possible topics

Sign your comments with this string of characters on the edit page:

--~~~~

### Spectral graph theory

Dan Spielman's notes here: http://www.cs.yale.edu/homes/spielman/561/

**In favor:**

### Analysis of boolean functions

Ryan O'Donnell's book here: http://analysisofbooleanfunctions.org/

**In favor:**

- I'd like to know more about fourier analysis and polynomials in this context. --Jshi (talk) 16:13, 19 November 2013 (EST)
- Ditto. Reitblatt (talk) 17:08, 19 November 2013 (EST)

### Error-correcting codes and PCPs

i.e. http://arxiv.org/abs/1111.0405

**In favor:**

### Quantum computing

I can lead one or two survey discussions on this topic. --Jshi (talk) 16:13, 19 November 2013 (EST)