Programme of the ThRaSH'2011 workshop


Friday 8th of July 2011

09:15

09:30

Opening

Christian Igel
Per Kristian Lehre
Carsten Witt

Session: Randomized Search Heuristics in Discrete Search Spaces

09:30

10:30

Tutorial: Introduction to the Complexity Analysis of Discrete Randomized Search Heuristics

Dirk Sudholt (The University of Birmingham, UK)

10:30

11:00

Mini-tutorial: Easy and hard combinatorial optimization problems for randomized search heuristics

Andrei Lissovoi (Technical University of Denmark, Denmark)

11:00

11:15

Coffee break

11:15

11:45

Towards Tight Bounds on The Running Time of the (1+1) EA on Linear Functions

Carsten Witt (Technical University of Denmark, Denmark)

11:45

12:15

On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem

Thomas Jansen (Department of Computer Science, University College Cork, Ireland)
Pietro S. Oliveto (School of Computer Science, University of Birmingham UK)
Christine Zarges (Fakultät für Informatik, TU Dortmund, Germany)

12:15

14:00

Lunch break (free sandwiches).

Session: Genetic Programming and Learning

14:00

14:30

Computational Complexity of GP and Sorting

Markus Wagner (School of Computer Science, University of Adelaide, Australia)
Frank Neumann (School of Computer Science, University of Adelaide, Australia)

14:30

15:00

Geometric Semantic Genetic Programming

Alberto Moraglio (School of Computer Science, University of Birmingham, UK)

15:00

15:30

Parallel Tempering, Importance Sampling, and Restricted Boltzmann Machines

Asja Fischer (Institut für Neuroinformatik, Ruhr-Universität Bochum, Germany and Department of Computer Science, University of Copenhagen, Denmark)
Christian Igel (Department of Computer Science, University of Copenhagen, Denmark)

15:30

16:00

Coffee break / discussions.

Session: Black-Box Complexity of Randomized Search Heuristics

16:00

16:30

Black-Box Models with Restricted Memory

Benjamin Doerr (Max-Planck-Institut für Informatik, Saarbrücken, Germany)
Carola Winzen (Max-Planck-Institut für Informatik, Saarbrücken, Germany)

16:30

17:00

Open and Closed Problems in Black-Box Complexity

Benjamin Doerr (Max-Planck-Institut für Informatik, Saarbrücken, Germany)

18:00

20:00

Workshop Dinner at Nørrebro Bryghus in Ryesgade 3.

Saturday 9th of July 2011

10:00

11:00

Keynote: The Power of Tabulation Hashing

Mikkel Thorup (AT&T Labs-Research, USA)

11:00

11:15

Coffee break

Session: Continuous Optimization and Information Geometry

11:15

12:15

Tutorial: Basic Introduction to the Theoretical Analysis of Real-Valued Evolution Strategies

Jens Jägersküpper (German Aerospace Center, Germany)

12:15

14:00

Lunch break (free sandwiches).

14:00

14:30

Information-Geometric Optimization: A New View-Point on Randomized Search Heuristics

Nikolaus Hansen (INRIA research centre Saclay, Ile-de-France, France)
Joint work with Yann Ollivier, Anne Auger and Ludovic Arnold

14:30

15:00

Rank-\(\mu\) Update CMA-ES from the Viewpoint of Information Geometry

Youhei Akimoto (TAO Team, INRIA Saclay Ile-de-France, France)

15:00

15:30

Coffee break.

Session: Continuous Optimization and Open Problems

15:30

16:00

Evolution Strategies in linearly constrained domains using efficient Gibbs sampling

Christian L. Müller (Department of Computer Science, ETH Zurich, Switzerland)

16:00

16:30

Random derivative-free optimization of convex functions using a line search oracle

Sebastian U. Stich (Department of Computer Science, ETH Zurich, Switzerland)
Christian L. Müller (Department of Computer Science, ETH Zurich, Switzerland)
Bernd Gärtner (Department of Computer Science, ETH Zurich, Switzerland)

16:30

17:00

An Open Question about Random Walks Pertaining to MCMC Sampling and the Coupling Method.

Boris Mitavskiy (Department of Computer Science, Aberystwyth University, UK)
Jonathan Rowe (School of Computer Science, University of Birmingham, UK)
Chris Cannings (School of Mathematics and Statistics, University of Sheffield, UK)

17:00

17:15

Closing

Christian Igel
Per Kristian Lehre
Carsten Witt

Last updated: Mon, 27 Jun 2011 18:15