Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Explores Decision Trees, from induction to pruning, emphasizing interpretability and automatic feature selection strengths, while addressing challenges like overfitting.
Covers planning with adversaries, heuristic search algorithms, and strategies for games with chance, emphasizing the significance of deliberative agents.
Explores decision and regression trees, impurity measures, learning algorithms, and implementations, including conditional inference trees and tree pruning.
Covers the basics of machine learning, supervised and unsupervised learning, various techniques like k-nearest neighbors and decision trees, and the challenges of overfitting.
Delves into self-reconfigurable modular robots, discussing advantages, design concepts, planning strategies, and challenges in motion planning and search algorithms.
Explores supervised learning in financial econometrics, covering linear regression, model fitting, potential problems, basis functions, subset selection, cross-validation, regularization, and random forests.