Homepage of Carola Doerr (formerly Winzen)

photo of Carola Doerr

Carola Doerr
Sorbonne University
(formerly Université Pierre et Marie Curie - Paris 6)
LIP6, équipe Recherche Opérationnelle
case 169, 4 place Jussieu
75252 Paris Cedex 05
France

Email: Carola [dot] Doerr "at" mpi-inf.mpg.de
Phone: 0033 (0)1 44 27 54 42


Some Selected Activities and News


  • GECCO 2018 tutorial slides are available here: DoerrGECCO18tutorial.pdf. The target audience of this tutorial are researchers who are familiar with evolutionary computation. I am happy to discuss all concepts and ideas in a form that avoids community-specific terminology.
  • IOHProfiler: Together with Hao Wang, Furong Ye, Sander van Rijn, and Thomas Bäck from Leiden University, we have created IOHProfiler, an algorithm benchmarking and profiling tool for iterative optimization heuristics. We are currently finishing the documentation, and the tool will be made available soon. To receive important updates about IOHProfiler, you can sign up for the newletter here.
  • Two new survey articles available:
    C. Doerr: Complexity Theory for Black-Box Optimization Heuristics (link to arXiv version) and
    B. Doerr and C. Doerr: Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices (link to arXiv version)
  • Our proposal for a Dagstuhl seminar on Theory of Randomized Optimization Heuristics has been accepted. The seminar will be held in October 2019: official seminar web page. Organizers are Carlos M. Fonseca, Tobias Friedrich, Xin Yao, and myself.
  • I will be giving tutorials on dynamic parameter choices in evolutionary computation at GECCO 2018 and at PPSN 2018.
  • Our university has changed its name from Université Pierre et Marie Curie (Paris 6) to Sorbonne University.
  • Dirk Sudholt and I have been chairing THEORY track of GECCO 2017. We are now editing a special issue in Algorithmica.
  • I am serving as Vice-chair of COST action 15140 on Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice (ImAppNIO), and have also organized our first training school COST training school here in Paris (7 days, 35 participants, 7 teachers).

Research Interests


  • Theory of randomized black-box heuristics for discrete optimization problems,
    in particular randomized local search with variable neighborhood sizes, evolutionary algorithms, and non-static parameter selection
  • Black-box complexity, aka randomized query complexity
  • Randomized and quasi-randomized algorithms in general
  • Geometric discrepancies, in particular computational aspects of the star discrepancy

Publications


A list of publications can be found here. Here is an outdated (not sure when I will be able to update...) list of my talks.


Teaching


Courses:

Students:

  • Advisor of student intern Nathan Buskulic (summer 2018).
    Title of the project: Optimal Evolutionary Algorithms with Dynamic Parameters
  • Co-Advisor of Master student Anja Jankovic (summer 2018).
    Title of the project: Randomness in Scheduling
  • Advisor of Master student Eduardo Carvalho Pinto (summer 2017).
    Title of the project: Self-Adjusting Parameter Choices for Discrete Black-Box Optimization
  • Co-Advisor of Master student Yang Jing (summer 2015).
    Title of the project: Tight Bounds for the Unbiased Black-Box Complexity of OneMax
  • Co-Advisor of Master student Axel de Perthuis de Laillevault (summer 2014).
    Title of the project: Evolutionary Algorithms with Iterated Initial Sampling
  • Co-Advisor of the Master student Franziska Ebel (defended spring 2013).
    Title of the thesis: Lessons from the Black-Box: Fast Crossover-Based Genetic Algorithms
  • Advisor of PhD student intern G. Ramakrishna (summer 2012).
    Title of the project: Computing Minimum Cycle Bases in Graphs of Bounded Treewidth
  • Advisor of Master student Vijay Ingalalli (defended autumn 2011).
    Title of the thesis: Evolutionary Algorithms to Compute Lower Bounds for the Star Discrepancy
  • Co-Advisor of student intern Jong-Hyun Lee (winter 2011/12).
    Title of the project: Playing Mastermind with Constant Size Memory

Academic Activities



Short CV


Page last modified July 15, 2018.