Sergei Ivanov, Liudmila Prokhorenkova
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graph neural networks (GNNs) are powerful models that have been successful in various graph representation learning tasks. Whereas gradient boosted decision trees (GBDT) often outperform other machine learning methods when faced with heterogeneous tabular data. But what approach should be used for graphs with tabular node features? Previous GNN models have mostly focused on networks with homogeneous sparse features and, as we show, are suboptimal in the heterogeneous setting. In this work, we propose a novel architecture that trains GBDT and GNN jointly to get the best of both worlds: the GBDT model deals with heterogeneous features, while GNN accounts for the graph structure. Our model benefits from endto-end optimization by allowing new trees to fit the gradient updates of GNN. With an extensive experimental comparison to the leading GBDT and GNN models, we demonstrate a significant increase in performance on a variety of graphs with tabular features. The code is available: https://github.com/nd7141/bgnn.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2101.08543")
get_code_for_paper("2101.08543")
have("2101.08543")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2101.08543.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2101.08543)
Connect an agent — have() is free.