Does your graph need a confidence boost? Convergent boosted smoothing on graphs with tabular node features

Abstract

For supervised learning with tabular data, decision tree ensembles produced via boosting techniques generally dominate real-world applications involving iid training/test sets. However for graph data where the iid assumption is violated due to structured relations between samples, it remains unclear how to best incorporate this structure within existing boosting pipelines. To this end, we propose a generalized framework for iterating boosting with graph propagation steps that share node/sample information across edges connecting related samples. Unlike previous efforts to integrate graph-based models with boosting, our approach is anchored in a principled meta loss function such that provable convergence can be guaranteed under relatively mild assumptions. Across a variety of non-iid graph datasets with tabular node features, our method achieves comparable or superior performance than both tabular and graph neural network models, as well as existing hybrid strategies that combine the two. Beyond producing better predictive performance than recently proposed graph models, our proposed techniques are easy to implement, computationally more efficient, and enjoy stronger theoretical guarantees (which make our results more reproducible).

References in corpus (20)

• Semi-Supervised Classification with Graph Convolutional Networks
• Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks
• Pitfalls of Graph Neural Network Evaluation
• Open Graph Benchmark: Datasets for Machine Learning on Graphs
• Attention-based Graph Neural Network for Semi-supervised Learning
• TabTransformer: Tabular Data Modeling Using Contextual Embeddings
• Combining Label Propagation and Simple Models Out-performs Graph Neural Networks
• Machine Learning on Graphs: A Model and Comprehensive Taxonomy
• AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models
• Bag of Tricks for Node Classification with Graph Neural Networks
• Interpreting and Unifying Graph Neural Networks with An Optimization Framework
• Understanding the Message Passing in Graph Neural Networks via Power Iteration Clustering
• Understanding and Resolving Performance Degradation in Graph Convolutional Networks
• Boost then Convolve: Gradient Boosting Meets Graph Neural Networks
• Do We Really Need Deep Learning Models for Time Series Forecasting?
• Graph Neural Networks Inspired by Classical Iterative Algorithms
• Accelerating Gradient Boosting Machine
• Revisiting Graph Convolutional Network on Semi-Supervised Node Classification from an Optimization Perspective
• Should Graph Neural Networks Use Features, Edges, Or Both?
• SnapBoost: A Heterogeneous Boosting Machine