Marek Dědič

executive director of EA Czechia & machine learning scientist
Me

I am the executive director of Effective altruism Czechia and a machine learning researcher specializing in neural networks and ways to exploit data structure with them. I am doing a PhD at Cisco and the Faculty of Nuclear Sciences and Physical Engineering of the Czech Technical University.

My current research interests are mostly in graphs and graph neural networks, particularly graph structure and its interplay with the performance of machine learning tasks on the graph. I proposed a method for graph reduction guided by local properties of the graph. Together with my colleagues, we study the effect of graph properties on downstream tasks and their usability in hyper-parameter optimization for GNNs. Additionally, I maintain an interest in multi-instance learning, an underdeveloped field of machine learning. I am mainly interested in nested hierarchical models and their use in the field of computer network security. See more details in the publications page.

Additionally, I am an active member of the Czech Scouting organization. Since 2015, I am a lecturer at a summer course for aspiring patrol leaders, which I was also leading from 2019 until 2023. I was in previous years organising an educator conference for ca. 100 attendees as a programme chair or a general chair. I am also combining IT with scouting as a software developer for internal applications. Lastly, since 2024, I am serving as an elected member of the National Board, the top legislative and strategic body of the Czech Scouting organization.

recent publications

Benchmarking and Transfer Learning for Hyperparameter Optimization of Graph Neural Networks

Marek Dědič, and Michal Bělohlávek
A benchmark of hyperparameter optimization algorithms on graph neural networks and a novel, dataset-property-informed hyperparameter optimization algorithm for graph learning.
PDF
Benchmarking and Transfer Learning for Hyperparameter Optimization of Graph Neural Networks

Convolutional Signal Propagation: A Simple Scalable Algorithm for Hypergraphs

Pavel Procházka, Marek Dědič, and Lukáš Bajer
A simple, scalable and efficient baseline algorithm for classification and retrieval in hypergraphs, based on non-parametric convolution.
PDF
Convolutional Signal Propagation: A Simple Scalable Algorithm for Hypergraphs