Automated Machine Learning
|Course type:||Flipped-classroom Lecture + Exercise|
|Time:||Wednesday 12:00 - 14:00|
|Organizer:||Janek Thomas , André Biedenkapp , Edward Bergman , Neeratyoy Mallik , Frank Hutter|
|Web page:||Link to Lecture Page|
Lecture Content: Automated Machine Learning
Applying machine learning (ML) and in particular deep learning (DL) in practice is a challenging task and requires a lot of expertise. Among other things, the success of ML/DL applications depends on many design decisions, including an appropriate preprocessing of the data, choosing a well-performing machine learning algorithm and tuning its hyperparameters, giving rise to a complex pipeline. Unfortunately, even experts need days, weeks or even months to find well-performing pipelines and can still make mistakes when optimizing their pipelines.The course will discuss meta-algorithmic approaches to automatically search for, and obtain well-performing machine learning systems by means of automated machine learning (AutoML). Such AutoML systems allow for faster development of new ML/DL applications, require far less expert knowledge than doing everything from scratch and often even outperform human developers. In this lecture, you will learn how to use such AutoML systems, to develop your own systems and to understand ideas behind state-of-the-art AutoML approaches.
We strongly recommend that you know the foundations of
- machine learning (ML)
- and deep learning (DL)
We further recommend that you have hands-on experience with:
- Python (3.6+)
- machine learning
- deep learning
The participants should have attended at least one other course for ML and DL in the past.
The lectures are partitioned in several parts, including:
- Hyperparameter Optimization
- Bayesian Optimization for Hyperparameter Optimization
- Neural Architecture Search
- Dynamic Configuration
- Analysis and Interpretability of AutoML
- Algorithm Selection/Meta-Learning
The course will be taught in a flipped-classroom style. We will meet weekly once for a combined Q/A session and an exercise. Roughly every week, there will be a new exercise sheet. Most exercises will be practical, involve programming in python and teamwork (teams of up to 3 students!) so that you learn how to apply AutoML in practice.
Lecture/Exercise: Wednesday 12:00 - 14:00
The material is publicly available via the AI-Campus platform . Please register on AI-Campus to access the materials. Grading of the exercises will be done via GitHub classroom. The links to access the GitHub classroom repositories are available here . (The password to that page will be announced in the first session). The course will be taught in English.
“Students groups of three write a short report on one of three potential topics, peer-review the reports and present their work in a virtual poster session.”
- Report: 4 pages + #students pages appendix
- Contributions of each student needs to be described for the report
- Paper template will be provided
- Will be organized on openreview.net
- Peer review:
- Each student has to write a review for one other paper
- We will provide some reviewing guidelines
- Poster Conference:
- Jointly with Hannover
- Online in gather.town
- Oral presentation of your poster during a predefined time-slot
- 20.07.2022: Project handout
- 31.08.2022: Report Deadline
- 09.09.2022: Review Deadline
- 13.09.2022 (16:00 CEST): Poster Submission Deadline (a template is available here )
- 15 - 16.09.2022: Poster Session
- 23.09.2022: Final Deadline (incorporate feedback from the poster session)
|Day||Time Slot||Poster Room||Paper IDs|
|Thursday 15.09.22||09:00 - 10:45||Room 1||9, 16, 20, 24, 25|
|Thursday 15.09.22||11:00 - 12:30||Room 2||6, 7, 11, 12, 27|
|Thursday 15.09.22||13:30 - 15:30||Room 3||2, 13, 14, 15, 28, 30|
|Friday 16.09.22||09:00 - 11:30||Room 1||1, 3, 4, 5, 17, 18, 19|
Please make sure to be at your poster during the time-slot above. While it is not your turn to present a poster, you can visit the other posters and discuss the approaches with the presenters. You are expected to take part in the whole conference. If you're unsure of your paper ID, you can check on openreview.
Fair and Interpretable Machine Learning
Fair and Interpretable Machine Learning
|Time:||Wednesday 16:00 - 18:00|
|Location:||G.-Köhler-Allee 051, SR 00 034|
|Organizers:||Janek Thomas , Noor Awad|
Seminar on Fair and Interpretable Machine Learning
The seminar language will be English (even if everyone is German-spoken, to practice presentation skills in English).
- 27th April, 16:00-18:00, SR 00 034 (G.-Köhler-Allee 051).
- Every Wednesday, 16:00-18:00, SR 00 034 (G.-Köhler-Allee 051).
The seminar focuses on interpretable machine learning in the first half of the semester and fair machine learning in the second half.
We will discuss model-agnostic tools for fairness and interpretability as well as specific algorithms. Further topics include measuring fairness, a causal perspective on fairness and how to consider fairness in AutoML.
Each week: All Students read relevant literature. Three students prepare the topic with slides and applications. Three other students are assigned as discussants. Discussants have to meet with the group presenting prior to the session, give feedback and prepare critical discussion points and open questions.
End of the semester: Each student has to write a short paper (10 pages) about their topic.
We strongly recommend that you know the foundations of
- Machine Learning
- For some topics: Deep Learning
 Molnar, Christoph. Interpretable machine learning. Lulu. com, 2020. - https://christophm.github.io/interpretable-ml-book/
 Mehrabi, Ninareh, et al. "A survey on bias and fairness in machine learning." ACM Computing Surveys (CSUR) 54.6 (2021): 1-35.
 Barocas, Solon, Moritz Hardt, and Arvind Narayanan. "Fairness in machine learning." Nips tutorial 1 (2017): 2.
|Date||Topic||Main Ref.||Further Refs.|
|27.04.2022||Introduction, groups and topic assignments||-|
|11.05.2022||-|| Chapter 1-3|
|18.05.2022||Interpretable Machine Learning Methods|| Chapter 5||Friedman, Jerome H., and Bogdan E. Popescu. "Predictive learning via rule ensembles." The annals of applied statistics 2.3 (2008): 916-954.|
|Lou, Yin, et al. "Accurate intelligible models with pairwise interactions." Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. 2013.|
|Hofner, Benjamin, et al. "A framework for unbiased model selection based on boosting." Journal of Computational and Graphical Statistics 20.4 (2011): 956-971.|
|25.05.2022||Global Model-Agnostic Interpretability Methods|| Chapter 8||Apley, Daniel W., and Jingyu Zhu. “Visualizing the effects of predictor variables in black box supervised learning models.” Journal of the Royal Statistical Society: Series B (Statistical Methodology) 82.4 (2020): 1059-1086.|
|Wei, Pengfei, Zhenzhou Lu, and Jingwen Song. "Variable importance analysis: a comprehensive review." Reliability Engineering & System Safety 142 (2015): 399-432.|
|Kim, Been, Rajiv Khanna, and Oluwasanmi O. Koyejo. "Examples are not enough, learn to criticize! criticism for interpretability." Advances in neural information processing systems 29 (2016).|
|01.06.2022||Local Model-Agnostic Interpretability Methods|| Chapter 9||Goldstein, Alex, et al. "Peeking inside the black box: Visualizing statistical learning with plots of individual conditional expectation." journal of Computational and Graphical Statistics 24.1 (2015): 44-65.|
|Ribeiro, Marco Tulio, Sameer Singh, and Carlos Guestrin. "" Why should I trust you?" Explaining the predictions of any classifier." Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. 2016.|
|Karimi, Amir-Hossein, et al. "Model-agnostic counterfactual explanations for consequential decisions." International Conference on Artificial Intelligence and Statistics. PMLR, 2020.|
|08.06.2022||-|| Chapter 1|
|15.06.2022||Interpretability Methods for Neural Networks|| Chapter 10||Zeiler, Matthew D., and Rob Fergus. "Visualizing and understanding convolutional networks." European conference on computer vision. Springer, Cham, 2014.|
|Kim, Been, et al. "Interpretability beyond feature attribution: Quantitative testing with concept activation vectors (tcav)." International conference on machine learning. PMLR, 2018.|
|Jain, Sarthak, and Byron C. Wallace. "Attention is not explanation." arXiv preprint arXiv:1902.10186 (2019).|
|22.06.2022||Multi-Objective and constrained Optimization and Model Selection||TBD||Deb, Kalyanmoy, et al. "A fast and elitist multiobjective genetic algorithm: NSGA-II." IEEE transactions on evolutionary computation 6.2 (2002): 182-197.|
|Knowles, Joshua. "ParEGO: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems." IEEE Transactions on Evolutionary Computation 10.1 (2006): 50-66.|
|Gardner, Jacob R., et al. "Bayesian Optimization with Inequality Constraints." ICML. Vol. 2014. 2014.|
|29.06.2022||Measures for Fairness|| Section 4.1||Hardt, Moritz, Eric Price, and Nati Srebro. "Equality of opportunity in supervised learning." Advances in neural information processing systems 29 (2016).|
|Kearns, Michael, et al. "An empirical study of rich subgroup fairness for machine learning." Proceedings of the conference on fairness, accountability, and transparency. 2019.|
|Chouldechova, Alexandra. "Fair prediction with disparate impact: A study of bias in recidivism prediction instruments." Big data 5.2 (2017): 153-163.|
|06.07.2022||Debiasing Methods|| Section 5.1||Mehrabi, Ninareh, et al. "Debiasing community detection: The importance of lowly connected nodes." 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 2019.|
|Calmon, Flavio, et al. "Optimized pre-processing for discrimination prevention." Advances in neural information processing systems 30 (2017).|
|Kamiran, Faisal, and Toon Calders. "Data preprocessing techniques for classification without discrimination." Knowledge and information systems 33.1 (2012): 1-33.|
|13.07.2022||Fair Machine Learning Algorithms|| Section 5.2||Zafar, Muhammad Bilal, et al. "Fairness constraints: Mechanisms for fair classification." Artificial Intelligence and Statistics. PMLR, 2017.|
|Kamishima, Toshihiro, et al. "Fairness-aware classifier with prejudice remover regularizer." Joint European conference on machine learning and knowledge discovery in databases. Springer, Berlin, Heidelberg, 2012.|
|Berk, Richard, et al. "A convex framework for fair regression." arXiv preprint arXiv:1706.02409 (2017).|
|20.07.2022||Causal Perspective on Fair ML|| Chapter 4||Zhang, Lu, Yongkai Wu, and Xintao Wu. "A causal framework for discovering and removing direct and indirect discrimination." arXiv preprint arXiv:1611.07509 (2016).|
|Loftus, Joshua R., et al. "Causal reasoning for algorithmic fairness." arXiv preprint arXiv:1805.05859 (2018).|
|Nabi, Razieh, and Ilya Shpitser. "Fair inference on outcomes." Proceedings of the AAAI Conference on Artificial Intelligence. Vol. 32. No. 1. 2018.|
|27.07.2022||Fairness & Interpretability in Model Selection||Wu, Qingyun, and Chi Wang. "Fair AutoML." arXiv preprint arXiv:2111.06495 (2021).|
|Cruz, André F., et al. "Promoting Fairness through Hyperparameter Optimization." 2021 IEEE International Conference on Data Mining (ICDM). IEEE, 2021.|
|Perrone, Valerio, et al. "Fair bayesian optimization." Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society. 2021.|
- Presentation: 40%
- Paper: 40%
- Role as discutant: 20%
For questions, please send an email to one of the organizers: Janek Thomas
Laboratory: Deep Learning Lab
Welcome to the Deep Learning Lab a joint teaching effort of the Robotics (R) , Robot Learning (RL) , Neurorobotics (NR) , Computer Vision (CV) , and Machine Learning (ML) Labs. For more details check the following link: https://rl.uni-freiburg.de/teaching/ss22/laboratory-deep-learning-lab