Leibniz Universität Hannover Fakultät Fakultät für Elektrotechnik und Informatik
Kontakt
Institut für Künstliche Intelligenz
 
Institut für Künstliche Intelligenz LUHAI Institut
Marius Lindauer
Prof. Dr. rer. nat. Marius Lindauer
Telefon
+49 511 762 5301
E-Mail
m.lindauer@ai.uni-hannover.de
Adresse
Welfengarten 1
30167 Hannover
Gebäude
1101
Raum
a419
Prof. Dr. rer. nat. Marius Lindauer
Telefon
+49 511 762 5301
E-Mail
m.lindauer@ai.uni-hannover.de
Adresse
Welfengarten 1
30167 Hannover
Gebäude
1101
Raum
a419

In recent years, AI achieved impressive results in different fields, incl. in computer vision, natural language processing and reinforcement learning. These breakthroughs show how AI will influence and change our daily lives, business and even research in many aspects. With the advent of deep learning and also traditional AI methods, such as AI planning, SAT solving or evolutionary algorithms, a multitude of different techniques are available these days. However, applying these techniques is challenging, and even experienced AI developers are faced with several difficult design decisions, making the development of new AI applications a tedious, error-prone and time-consuming task. Therefore, we develop new approaches to increase efficiency in AI application development by reducing the required expert knowledge, improving development time and reducing chances of error. We do this with democratization of AI and social responsibility in mind.

Research Interests

Actually, I'm interested in many topics related to AutoML, machine learning, AI and interdisciplinary applications of these. Here are some selected topics:

  • Green-AutoML
  • Human-centered AutoML
  • Dynamic Algorithm Configuration
  • Generalization of Reinforcement Learning
  • Applications to production or health/medicine

Curriculum Vitae

Publications

First 1 2 3 4 5 6 Last

Zeige Ergebnisse 81 - 100 von 108

2018

Wagner, M., Lindauer, M., Mısır, M., Nallaperuma, S., & Hutter, F. (2018). A case study of algorithm selection for the traveling thief problem. Journal of heuristics, 24(3), 295-320. Vorabveröffentlichung online. https://doi.org/10.1007/s10732-017-9328-y
Mehr...

2017

Biedenkapp, A., Lindauer, M., Eggensperger, K., Hutter, F., Fawcett, C., & Hoos, H. H. (2017). Efficient Parameter Importance Analysis via Ablation with Surrogates. In Proceedings of the AAAI Conference on Artificial Intelligence Vorabveröffentlichung online. https://doi.org/10.1609/aaai.v31i1.10657
Mehr...
Hutter, F., Lindauer, M., Balint, A., Bayless, S., Hoos, H., & Leyton-Brown, K. (2017). The Configurable SAT Solver Challenge (CSSC). Artificial intelligence, 243, 1-25. Vorabveröffentlichung online. https://doi.org/10.1016/j.artint.2016.09.006
Mehr...
Lindauer, M., Hutter, F., Hoos, H. H., & Schaub, T. (2017). AutoFolio: An Automatically Configured Algorithm Selector (Extended Abstract). In C. Sierra (Hrsg.), International Joint Conference on Artificial Intelligence (IJCAI 2017) (S. 5025-5029). AAAI Press/International Joint Conferences on Artificial Intelligence. https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=&ved=2ahUKEwjo2uHc_87qAhVpzMQBHf2lDTwQFjABegQIAxAB&url=https%3A%2F%2Fwww.ijcai.org%2FProceedings%2F2017%2F0715.pdf&usg=AOvVaw1ART0bWLbCU4uLc4oV19yv
Mehr...
Lindauer, M. T., van Rijn, J. N., & Kotthoff, L. (2017). Open Algorithm Selection Challenge 2017 Setup and Scenarios. http://proceedings.mlr.press/v79/lindauer17a/lindauer17a.pdf
Mehr...
Wagner, M., Friedrich, T., & Lindauer, M. (2017). Improving local search in a minimum vertex cover solver for classes of networks. In 2017 IEEE Congress on Evolutionary Computation (CEC): Proceedings (S. 1704-1711). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/cec.2017.7969507
Mehr...

2016

Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M., Malitsky, Y., Fréchette, A., Hoos, H., Hutter, F., Leyton-Brown, K., Tierney, K., & Vanschoren, J. (2016). ASlib: A benchmark library for algorithm selection. Artificial intelligence, 237, 41-58. Vorabveröffentlichung online. https://doi.org/10.1016/j.artint.2016.04.003
Mehr...
Lindauer, M., Bergdoll, R. D., & Hutter, F. (2016). An Empirical Study of Per-instance Algorithm Scheduling. In P. Festa, M. Sellmann, & J. Vanschoren (Hrsg.), Learning and Intelligent Optimization (S. 253-259). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 10079 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-50349-3_20
Mehr...
Lindauer, M., Hoos, H., Leyton-Brown, K., & Schaub, T. (2016). Automatic construction of parallel portfolios via algorithm configuration. Artificial intelligence, 244, 272-290. https://doi.org/10.1016/j.artint.2016.05.004
Mehr...
Manthey, N., & Lindauer, M. (2016). SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers. In D. Le Berre, & N. Creignou (Hrsg.), Theory and Applications of Satisfiability Testing – SAT 2016 (S. 554-561). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 9710). Springer Verlag. https://doi.org/10.1007/978-3-319-40970-2_36
Mehr...

2015

Albrecht, S. V., Beck, J. C., Buckeridge, D. L., Botea, A., Caragea, C., Chi, C. H., Damoulas, T., Dilkina, B., Eaton, E., Fazli, P., Ganzfried, S., Giles, C. L., Guillet, S., Holte, R., Hutter, F., Koch, T., Leonetti, M., Lindauer, M., Machado, M. C., ... Zheng, Y. (2015). Reports on the 2015 AAAI Workshop Series. AI magazine, 36(2), 90-101. https://doi.org/10.1609/aimag.v36i2.2590
Mehr...
Falkner, S., Lindauer, M., & Hutter, F. (2015). SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers. In M. Heule, & S. Weaver (Hrsg.), Theory and Applications of Satisfiability Testing – SAT 2015 (S. 215-222). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 9340). Springer Verlag. https://doi.org/10.1007/978-3-319-24318-4_16
Mehr...
Hutter, F., Lindauer, M., & Malitsky, Y. (2015). Preface. In Algorithm configuration: papers presented at the Twenty-Ninth AAAI Conference on Artificial Intelligence (S. vii). (AAAI Workshop - Technical Report).
Mehr...
Lindauer, M., Hoos, H. H., Schaub, T., & Hutter, F. (2015). Auto folio: Algorithm configuration for algorithm selection. In Algorithm Configuration: papers presented at the Twenty-Ninth AAAI Conference on Artificial Intelligence (S. 9-15). (AAAI Workshop - Technical Report). AI Access Foundation.
Mehr...
Lindauer, M., Hoos, H. H., Hutter, F., & Schaub, T. (2015). AutoFolio: Algorithm Configuration for Algorithm Selection. In AAAI Workshop: Algorithm Configuration https://dblp.org/db/conf/aaai/aconfig2015.html#LindauerHHS15
Mehr...
Lindauer, M. T., Hoos, H., Hutter, F., & Schaub, T. (2015). AutoFolio: An Automatically Configured Algorithm Selector. Journal of Artificial Intelligence Research, 53, 745-778. https://doi.org/10.1613/jair.4726
Mehr...
Lindauer, M., Hoos, H. H., & Hutter, F. (2015). From Sequential Algorithm Selection to Parallel Portfolio Selection. In C. Dhaenens, L. Jourdan, & M-E. Marmion (Hrsg.), Learning and Intelligent Optimization (S. 1-16). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 8994). Springer Verlag. https://doi.org/10.1007/978-3-319-19084-6_1
Mehr...

2014

Hoos, H., Kaminski, R., Lindauer, M., & Schaub, T. (2014). aspeed: Solver scheduling via answer set programming. Theory and Practice of Logic Programming, 15(1), 117-142. https://doi.org/10.1017/s1471068414000015
Mehr...
Hoos, H., Lindauer, M., & Schaub, T. (2014). claspfolio 2: Advances in Algorithm Selection for Answer Set Programming. Theory and Practice of Logic Programming, 14(4-5), 569-585. https://doi.org/10.1017/S1471068414000210
Mehr...
Hoos, H. H., Kaminski, R., Lindauer, M., & Schaub, T. (2014). Solver Scheduling via Answer Set Programming. CoRR, abs/1401.1024. https://dblp.org/db/journals/corr/corr1401.html#HoosKLS14
Mehr...

Letzte Änderung: 22.04.24 Druckversion

Gefördert vom

So erreichen Sie uns
Kontakt