Self-Directed Learning of Convex Labelings on Graphs
<|reference_start|>Self-Directed Learning of Convex Labelings on Graphs: We study the problem of learning the clusters of a given graph in the self-directed learning setup. This learning setting is a variant of online learning, where rather than an adversary determining the sequence in which nodes are presented, the learner autonomously and adaptively selects them. While self-directed learning of Euclidean halfspaces, linear functions, and general abstract multi-class hypothesis classes was recently considered, no results previously existed specifically for self-directed node classification on graphs. In this paper, we address this problem developing efficient algorithms for it. More specifically, we focus on the case of (geodesically) convex clusters, i.e., for every two nodes sharing the same label, all nodes on every shortest path between them also share the same label. In particular, we devise a polynomial-time algorithm that makes only $3(h(G)+1)^4 \ln n$ mistakes on graphs with two convex clusters, where $n$ is the total number of nodes and $h(G)$ is the Hadwiger number, i.e., the size of the largest clique minor of the graph $G$. We also show that our algorithm is robust to the case that clusters are slightly non-convex, still achieving a mistake bound logarithmic in $n$. Finally, for the more standard case of homophilic clusters, where strongly connected nodes tend to belong the same class, we devise a simple and efficient algorithm.<|reference_end|>
@article{sokolov2024self-directed,
    title={Self-Directed Learning of Convex Labelings on Graphs},
    author={Georgy Sokolov, Maximilian Thiessen, Margarita Akhmejanova, Fabio
  Vitale, Francesco Orabona},
    journal={arXiv preprint arXiv:2409.01428},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.01428},
    primaryClass={cs.LG stat.ML}
}