Thanks a lot, Sanne! We do not have so many occasions to share our experiences and anecdotes, especially with the current lack of conferences and spontaneous meetings at the coffee machine... I'm so glad that Anand has initiated this stream of videos :).
Fantastic interview! Your stories are very inspiring. I agree with you that metaheuristics have many gaps to explore in concerns of local search complexity instead of nature metaphors. Furthermore, I liked your perspective on how much OR techniques could improve heuristics procedures in ML. Thank you, Thibaut, for sharing your stories, and thank you, Anand, for this whole work.
Dear Igor, thank you a lot for the kind words! Indeed, complexity analyses related to local search & and interaction OR-ML are fascinating topics: Here are the two works I mentioned about local search during the interview (there are plenty of great other studies along this line as well): Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988). How easy is local search? Journal of Computer and System Sciences, 37(1), 79-100 De Berg, M., Buchin, K., Jansen, B. M. P., & Woeginger, G. (2020). Fine-grained complexity analysis of two classic TSP variants. ACM Transactions on Algorithms, 17(1).
The Informatics program he works in at PUC-Rio seems so wonderful. I hope I have the opportunity to be there in the future.
Hello Victor, you are very welcome to apply, don't hesitate to reach me by email for tips or advice!
Very nice interview. So interesting to hear more of your story, Thibaut!
I am really glad you enjoyed it Sanne! All the best.
Thanks a lot, Sanne! We do not have so many occasions to share our experiences and anecdotes, especially with the current lack of conferences and spontaneous meetings at the coffee machine... I'm so glad that Anand has initiated this stream of videos :).
Fantastic interview! Your stories are very inspiring. I agree with you that metaheuristics have many gaps to explore in concerns of local search complexity instead of nature metaphors. Furthermore, I liked your perspective on how much OR techniques could improve heuristics procedures in ML.
Thank you, Thibaut, for sharing your stories, and thank you, Anand, for this whole work.
Thanks for your comment Igor!
Dear Igor, thank you a lot for the kind words! Indeed, complexity analyses related to local search & and interaction OR-ML are fascinating topics:
Here are the two works I mentioned about local search during the interview (there are plenty of great other studies along this line as well):
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988). How easy is local search? Journal of Computer and System Sciences, 37(1), 79-100
De Berg, M., Buchin, K., Jansen, B. M. P., & Woeginger, G. (2020). Fine-grained complexity analysis of two classic TSP variants. ACM Transactions on Algorithms, 17(1).
Could you please interview: Dr Julian Hall from the University of Edinburgh.