JITuNE: Just-In-Time Hyperparameter Tuning for Network Embedding Algorithms
Not on the map. Why?
Abstract (arXiv)
Network embedding (NE) can generate succinct node representations for massive-scale networks and enable direct applications of common machine learning methods to the network structure. Various NE algorithms have been proposed and used in a number of applications, such as node classification and link prediction. NE algorithms typically contain hyperparameters that are key to performance, but the hyperparameter tuning process can be time consuming. It is desirable to have the hyperparameters tuned within a specified length of time. Although AutoML methods have been applied to the hyperparameter tuning of NE algorithms, the problem of how to tune hyperparameters in a given period of time is not studied for NE algorithms before. In this paper, we propose JITuNE, a just-in-time hyperparameter tuning framework for NE algorithms. Our JITuNE framework enables the time-constrained hyperparameter tuning for NE algorithms by employing the tuning over hierarchical network synopses and transferring the knowledge obtained on synopses to the whole network. The hierarchical generation of synopsis and a time-constrained tuning method enable the constraining of overall tuning time. Extensive experiments demonstrate that JITuNE can significantly improve performances of NE algorithms, outperforming state-of-the-art methods within the same number of algorithm runs.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 19 of its 38 references that are in the map. First posted on arXiv 16 Jan 2021.
Builds on
19 of 38 references.
References · 19
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 584
- 2015LINE: Large-scale Information Network Embeddingcited by 582
- 2017Representation Learning on Graphs: Methods and Applicationscited by 457
- 2018Auto-Keras: An Efficient Neural Architecture Search Systemcited by 171
- 2017A Survey on Network Embeddingcited by 142
- 2017Network Representation Learning: A Surveycited by 101
7 more
- 2017HARP: Hierarchical Representation Learning for Networkscited by 58
- 2018NetLSD: Hearing the Shape of a Graphcited by 52
- 2018Graph Coarsening with Preserved Spectral Propertiescited by 41
- 2017BestConfig: Tapping the Performance Potential of Systems via Automatic Configuration Tuningcited by 25
- 2018Autotune: A Derivative-free Optimization Framework for Hyperparameter Tuningcited by 20
- 2013A Survey and Taxonomy of Graph Samplingcited by 15
- 2014Using Triangles to Improve Community Detection in Directed Networkscited by 3
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 1.
4 papers.
- 2021Automated Machine Learning on Graphs: A Surveycited by 39
- 2022Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directionscited by 9
- 2022MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learningcited by 6
- 2024GLEMOS: Benchmark for Instantaneous Graph Learning Model Selectioncited by 2
- 2024GLEMOS: Benchmark for Instantaneous Graph Learning Model Selection2 Apr 2024
- 2022MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learning18 Jun 2022
- 2022Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directions4 Jan 2022
- 2021Automated Machine Learning on Graphs: A Survey1 Mar 2021