Depth First Search Insights
The discussion delves into the limitations of depth first search (DFS) and the implications of setting a search depth threshold. Daniel suggests that predicting the computational budget before a search is challenging, while Jan highlights the relationship between entropy and the structure of the search tree. They explore the potential of using classifiers to estimate computational needs based on previous tree topologies.In this clip
From this podcast
Machine Learning Street Talk (MLST)
Daniel Franzen & Jan Disselhoff - ARC Prize 2024 winners
Related Questions