Interactive Optimization and Learning

The IOL research lab is dedicated to exploring the intersection of mathematical optimization and machine learning, with a focus on developing innovative techniques for learning and optimization. By integrating these two fields, we aim to create new approaches to solving complex problems that leverage the strengths of both optimization and machine learning.

Our group is located both at the Mathematical Optimization research group at the Technische Universität Berlin (TUB) and in the AI in Society, Science, and Technology (AIS²T) department at the Zuse Institute Berlin (ZIB). We are also part of the Berlin mathematics research center MATH+ as well as the Berlin Mathematical School (BMS).

map

Zuse Institute

Takustraße 7
14195 Berlin
www.zib.de
map

Technische Universität

Str. des 17. Juni 136
10587 Berlin
www.tu.berlin

Publication highlights

  1. Martínez-Rubio, D., Wirth, E., and Pokutta, S. (2023). Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond. Proceedings of Annual Workshop on Computational Learning Theory. [arXiv]
    [BibTeX]
    @inproceedings{mwp_accelrated_sparse_pagerank_23,
  year = {2023},
  booktitle = {Proceedings of Annual Workshop on Computational Learning Theory},
  archiveprefix = {arXiv},
  eprint = {2303.12875},
  primaryclass = {math.OC},
  author = {Martínez-Rubio, David and Wirth, Elias and Pokutta, Sebastian},
  title = {Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond}
}
  2. Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2023). Fully Computer-assisted Proofs in Extremal Combinatorics. Proceedings of AAAI Conference on Artificial Intelligence. [arXiv] [slides] [code]
    [BibTeX]
    @inproceedings{ppss_ramsey_22,
  year = {2023},
  booktitle = {Proceedings of AAAI Conference on Artificial Intelligence},
  archiveprefix = {arXiv},
  eprint = {2206.04036},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and Szabó, Tibor},
  title = {Fully Computer-assisted Proofs in Extremal Combinatorics},
  code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g},
  slides = {http://pokutta.com/slides/20220705_DMD22_RamseyMultiplicity.pdf}
}
  3. Besançon, M., Carderera, A., and Pokutta, S. (2022). FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients. INFORMS Journal on Computing. [arXiv] [summary] [slides] [code]
    [BibTeX]
    @article{besanccon2022frankwolfe,
  year = {2022},
  journal = {INFORMS Journal on Computing},
  month = feb,
  archiveprefix = {arXiv},
  eprint = {2104.06675},
  primaryclass = {math.OC},
  author = {Besançon, Mathieu and Carderera, Alejandro and Pokutta, Sebastian},
  title = {FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients},
  code = {https://github.com/ZIB-IOL/FrankWolfe.jl},
  slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf},
  summary = {https://pokutta.com/blog/research/2021/04/20/FrankWolfejl.html}
}
  4. Braun, G., Carderera, A., Combettes, C., Hassani, H., Karbasi, A., Mokhtari, A., and Pokutta, S. (2022). Conditional Gradient Methods. [arXiv]
    [BibTeX]
    @misc{fw_survey_2022,
  archiveprefix = {arXiv},
  eprint = {2211.14103},
  primaryclass = {math.OC},
  year = {2022},
  author = {Braun, Gábor and Carderera, Alejandro and Combettes, Cyrille and Hassani, Hamed and Karbasi, Amin and Mokhtari, Aryan and Pokutta, Sebastian},
  title = {Conditional Gradient Methods}
}

Software repositories

All our publically accessible software repositories are available on GitHub. We have a list of actively maintained repositories:

We are also actively involved in the development of the SCIP Optimization Suite at ZIB and its interfaces to other programming languages: