The Autumn school on Machine Learning

October 3-11, 2019
Tbilisi, Georgia
https://cte.ibsu.edu.ge/autumn/

Registration deadline: October 3, 2019

The school will be organized by the International Black Sea University with the support of Shota Rustaveli National Science Foundation of Georgia (SRNSFG). The intended audience of the autumn school includes BSc, MSc and PhD students, researchers as well as industry professionals from the fields of computer science and mathematics.

PapaFest for Christos’ 70th birthday

September 6-8, 2019
Columbia University
http://papafest.cs.columbia.edu/

We are happy to invite you to Columbia University to celebrate Christos Papadimitriou’s contributions to science on the occasion of his 70th birthday, through a mix of talks, panels, and fun activities. One of world’s leading computer scientists, Christos is best known for his work in computational complexity, helping to expand its foundations, methodology and reach. Using computation as a scientific lens, he has also made seminal contributions to biology and the theory of evolution, economics and game theory—where he helped found the field of algorithmic game theory, artificial intelligence, robotics, databases, networks and the Internet, and more recently the study of the brain. In this 3 day celebration, we will celebrate the wealth of areas that Christos’s work has influenced directly, as well as areas that have been influenced, are being influenced, or might be influenced by the “algorithmic lens.”

Robustness in Learning and Statistics: Past and Future

August 12-15, 2019
UC San Diego
http://cseweb.ucsd.edu/~slovett/workshops/robust-statistics-2019/

Registration deadline: July 31, 2019

Robust statistics and related topics offer ways to stress test estimators to the assumptions they are making. It offers insights into what makes some estimators behave well in the face of model misspecification, while others do not. In this summer school, we will revisit classic topics in robust statistics from an algorithmic perspective. We will cover recent progress on provably robust and computationally efficient parameter estimation in high-dimensions. We will compare this to other popular models, like agnostic learning and outlier detection. With the foundations in hand, we will explore modern topics like federated learning, semi-random models and connections to decision theory where being robust is formulated in alternative ways. We hope to have time for discussion about open questions like adversarial examples in deep learning, and invite the audience to help us muse about the right definitions to adopt in the first place.

3rd School on Foundations of Programming and Software Systems

September 10-15, 2019
Warsaw, Poland
https://www.mimuw.edu.pl/~fopss19/

The Summer School on Foundations of Programming and Software Systems (FoPSS) was jointly created by EATCS, ETAPS, ACM SIGLOG and ACM SIGPLAN. It was first organised in 2017. The goal is to introduce the participants to various aspects of computation theory and programming languages. The school, spread over a single week, is aimed at students and researchers in Theoretical Computer Science, broadly construed. Each year the school is focused on a particular, actively researched topic.

Our focus in 2019 are Nominal Techniques in Computer Science. For the introduction and cornerstone contributions to this area Murdoch J. Gabbay and Andrew M. Pitts received the 2019 Alonzo Church Award. Both of them are among the lecturers of FoPSS 2019.

3rd Symposium on Simplicity in Algorithms

January 6-7, 2020
Salt Lake City, UT
https://www.siam.org/Conferences/CM/Conference/sosa20

Submission deadline: August 9, 2019

Symposium on Simplicity in Algorithms is a new conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance in the design and analysis of algorithms. The benefits of simplicity are manifold: simpler algorithms manifest a better understanding of the problem at hand; they are more likely to be implemented and trusted by practitioners; they are more easily taught and are more likely to be included in algorithms textbooks; and they attract a broader set of researchers to difficult algorithmic problems. Co-located with SODA 2020.

Paper registration: August 9; Submission deadline: August 16.

5th Algorithmic and Enumerative Combinatorics Summer School 2019

July 29 – August 2, 2019
Linz, Austria
https://www3.risc.jku.at/conferences/aec2019/local.html

Registration deadline: June 16, 2019

The goal of this summer school is to put forward the interplay between the fields of Enumerative Combinatorics, Analytic
Combinatorics, and Algorithmics. This is a very active research area, which, aside from the three fields fueling each other
mutually, receives as well constant impetus from outside, by its interaction with algebra, probability, statistical physics, and computer science.