Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement

Guoming Li; Jian Yang; Shangsong Liang; Xukun Wang; Yifan Chen; Zixiao Wang

REVIEW 4 major objections 5 minor 295 references

Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement

T0 review · 4 major / 5 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Coarsening-based GNN training degrades sharply under heterophily; ACE, an auxiliary-loss wrapper with a learned projector, recovers up to ~15 accuracy points at ~5% overhead.

desk verdict Solid empirical study of heterophily in coarsening-based GNN training, but the auxiliary loss's label masking is unspecified and could invalidate the headline gains; worth reviewing, not yet citable. read the letter →

arxiv 2607.21885 v1 pith:TOESOWFD submitted 2026-07-24 cs.LG cs.NAeess.SPmath.NA

Guoming Li , Jian Yang , Xukun Wang , Zixiao Wang , Shangsong Liang , Yifan Chen This is my paper

classification cs.LGcs.NAeess.SPmath.NA

keywords graphcoarseningheterophilyneuralnetworksauxiliarylosslearnedprojectormutualinformationanisotropicdiffusionhomoscedasticuncertainty

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that training a GNN on a coarsened graph — a common trick for scaling to massive graphs — fails on heterophilic graphs, where connected nodes tend to have different labels, because coarsening discards exactly the fine-grained, label-relevant structure inside each supernode. Existing coarsening pipelines lose roughly four times more accuracy on heterophilic benchmarks than on homophilic ones, and even heterophily-specialized GNN backbones cannot escape the drop. The authors propose ACE, which learns a projector that reconstructs original node features from supernode features, regularized by an anisotropic diffusion term that respects local heterophily. Training then combines the usual coarsened-graph loss with an auxiliary full-graph loss, automatically weighted by homoscedastic uncertainty. Across four coarsening pipelines and six GNN backbones, ACE consistently recovers a large fraction of the gap — up to about 15 accuracy points on heterophilic graphs — while adding only a few percent to runtime and memory.

What carries the argument

The load-bearing object is the learned heterophily-aware projector P(ϕ), defined by a softmax over per-node affinities that combine a structural affinity S = A C⁻¹ P and a feature affinity F (Gaussian kernel to supernode centroids), with the logits produced by a small MLP. It is trained by minimizing J_ASR: an anisotropic smoothness term whose edge weights exp(−||Xi−Xj||²) suppress smoothing across dissimilar neighbors, plus a feature reconstruction cost. The projector bridges the coarsened graph back to the full graph: lifting coarsened logits through P(ϕ) defines an auxiliary cross-entropy loss against full-graph labels, and learnable homoscedastic uncertainty parameters σ₁, σ₂ automatical

What would settle it

Estimate the quantities in Proposition 2.2 on a real heterophilic dataset (e.g., Genius): I(f(A,X;Θ*); f(A,X;Θ**)), I(f(A,X;Θ*);Y), and I(g(G\G');Y | f(A,X;Θ**)) using trained models. If the inequality fails, or if the conditional mutual information Ω is not larger for heterophilic than for comparable homophilic graphs, the paper's information-theoretic explanation of the coarsening gap would be refuted, even if ACE still improves accuracy empirically.

Watch

Extended reading notes

Core claim

The central claim is that performance degradation in coarsening-based GNN training under heterophily is not a model artifact but a consequence of information loss in the coarsening step itself. Treating the discarded intra-supernode structure G\G' as a source of label information, the paper proves a mutual-information bound (Proposition 2.2): the similarity between full-graph-trained and coarsened-graph-trained models is capped by I(f(A,X;Θ*);Y) − I(g(G\G');Y | f(A,X;Θ**)), so the larger the conditional mutual information between discarded structure and labels, the larger the gap. ACE attacks this gap directly: it learns a heterophily-aware projector P(ϕ) that maps supernode centroids back t

Load-bearing premise

The load-bearing assumption is that the full-graph-trained and coarsened-graph-trained model outputs are conditionally independent given the true labels, which is what makes the mutual-information bound in Proposition 2.2 go through; the empirical ACE recipe does not depend on this assumption.

Editorial extensions

If this is right

Any existing coarsening-based GNN pipeline can be upgraded by adding ACE's auxiliary loss with the learned projector, without retraining or altering the coarsening algorithm.
Coarsening-based training becomes practical on large heterophilic graphs, where the gap to full-graph training shrinks substantially — for instance, GCN on Genius improves from 67.47 to 77.63 against a full-graph score of 87.42.
The same recipe extends to other graph-reduction methods such as graph condensation and to extreme 1% coarsening ratios, where the relative gains are even larger.
Inference cost stays identical to the base coarsening pipeline because the auxiliary branch is discarded after training; only training time and memory rise by roughly 4–7%.
ACE-enhanced conventional coarsening methods become competitive with state-of-the-art scalable training approaches such as sampling and condensation, while preserving the simpler model-agnostic coarsening paradigm.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A direct test of the proposed mechanism would estimate the three mutual-information terms in Proposition 2.2 on real heterophilic and homophilic graphs; if the conditional mutual information Ω is not larger under heterophily, or if the inequality fails, the theory would be refuted even though ACE's empirical gains could still stand on the auxiliary-loss supervision.
Because the projector is learned purely from features and structure, ACE could plausibly transfer to other settings where a reduced graph substitutes for the full one, such as graph distillation, continual graph learning, or scalable inference on evolving graphs.
The homoscedastic weighting likely acts as a form of curriculum: early training may emphasize the cheap coarsened loss and later shift to the fine-grained auxiliary loss. Inspecting the learned σ₁/σ₂ trajectories would reveal whether the benefit comes from a stable early phase or from late fine-grained correction.
The paper's own limitation section concedes that ACE recovers discarded information implicitly rather than through explicit intra-supernode structure, which it says caps the achievable gain; adding a lightweight explicit decoder of intra-supernode edges is a natural next step toward closing the remaining gap to full-graph training.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Here's my take on 2607.21885. The paper is the first systematic look at coarsening-based GNN training under heterophily, and its empirical work is genuinely useful. Across four coarsening pipelines, six backbones, five heterophilic and two homophilic datasets, ACE gives consistent gains up to ~15 points, with small overhead. The toy experiment—a simple auxiliary loss recovering much of the gap—is a nice observation. This is a real gap in the literature and the authors have done the heavy lifting of benchmarking it.

The soft spots, in order of seriousness:

1. The auxiliary loss in Eq. (5) and Eq. (11) uses Y as defined in Sec. 2.1: the full n x c one-hot label matrix. The paper never states that a train/validation/test mask is applied. In transductive node classification, Y includes test labels. If those labels are used to compute the auxiliary loss, the reported test accuracies are meaningless and the comparison to baselines is unfair. The magnitude of the gains—about what you'd expect from full-label supervision—makes this a load-bearing question, not a formatting nit. The authors must state explicitly that only training labels are used, and the released code must confirm it. The stress-test note is right to make this the primary issue.

2. The theory is not rigorous. Proposition 2.2's proof leans on a conditional-independence assumption (Lemma A.2) that is not justified, and the data-processing inequality in Eq. (20) is applied to a Markov chain that is at best a stretch. Proposition 3.1 characterizes the lifted signal, not the learned projector. Since the empirical contribution stands without the theory, this is fixable by reframing as intuition or tightening the proofs.

3. Minor: implementation details T, N(i), and label masking are not specified. The code repository is referenced but not verified.

Proportionately, the paper is a good empirical contribution with an underspecified crucial detail and a weak theoretical overlay. It deserves a serious referee, not a desk reject. If the masking issue checks out, this is a solid paper. If not, it collapses.

Recommendation: send to peer review; make sure the reviewers check the code and ask for an explicit statement about label masking. I'd hold off citing it until that's resolved.

Referee Report

4 major / 5 minor

Summary. The paper studies the performance degradation of coarsening-based GNN training on heterophilic graphs. It first documents empirically that existing coarsening pipelines (SCAL, FGC, UGC, SGBGC) lose substantially more accuracy on heterophilic than homophilic graphs. It then proposes ACE, a plug-and-play auxiliary-loss framework: a learnable projector P(ϕ) is optimized with an anisotropic structural regularization term, and the resulting projector is used to lift coarsened-graph predictions to the original graph for an auxiliary cross-entropy loss against the full label matrix; the primary and auxiliary losses are combined via homoscedastic uncertainty weighting. Experiments on 5 heterophilic and 2 homophilic datasets with up to 6 backbones report consistent gains, up to ~15 points, with modest computational overhead. The paper also offers two theoretical propositions (Prop. 2.2 on a mutual-information gap, Prop. 3.1 on the projector's spectral behavior).

Significance. If the empirical results are valid, ACE is a practical and broadly applicable enhancement for coarsening-based training: it is model-agnostic, works across four coarsening pipelines, and the experiments are extensive (10 runs with standard deviations, multiple backbones, ablation studies, noise robustness, and overhead measurements). The paper also releases code and includes careful efficiency analyses. However, the two theoretical propositions are not rigorously established; they are best viewed as post-hoc intuition rather than proofs. The central unresolved issue is whether the auxiliary loss uses only training labels: the manuscript defines Y as the full n×c label matrix and never specifies a mask, which could invalidate the reported test accuracy gains.

major comments (4)

[Sec. 2.1, Eq. (5), Eq. (11)] The label matrix Y is defined as the full n×c one-hot matrix, and both auxiliary losses (Eq. (5) and Eq. (11)) are written against Y with no train/validation/test mask. In transductive node classification, using test labels in the loss would inflate the reported test accuracies (Tables 3, 8–11) and make the comparison to coarsening baselines unfair. Please state explicitly how the label mask is applied in the auxiliary loss and in Y' = C^{-1} P Y. If test labels are used, the experiments must be rerun with a proper training mask; if a mask is used in the code but omitted from the text, it must be described precisely.
[Eq. (5), Eq. (11), Sec. 2.1] The lifting operator is written as P^T C (or P(ϕ*)^T C). Given the coarsened labels are defined as Y' = C^{-1} P Y, the natural inverse mapping from coarse predictions to fine nodes is P^T C^{-1}, or simply P^T if f outputs a probability vector. The factor C appears to be the wrong inverse. This makes the definition of the auxiliary loss mathematically inconsistent with the stated coarsening convention. Please correct the equations or clarify the intended operator; if the implementation actually uses C^{-1}, that should be stated explicitly.
[Appendix A, Prop. 2.2] The proof is not valid. Lemma A.2 assumes conditional independence A⊥B|Y for the outputs of two models trained on the same labels, which is not justified and generally false for two trained GNNs. Moreover, Eq. (20) applies the data-processing inequality to the chain Y→f(A,X;Θ*)→(f(A,X;Θ**),g(G\G')), but this Markov chain does not hold: f(A,X;Θ**) depends on Y through the coarsened labels Y' and is not a function of f(A,X;Θ*). Consequently, the inequality in Eq. (4) is not established. The theoretical explanation should either be rigorously proven or explicitly presented as a heuristic.
[Appendix B, Prop. 3.1] The proof analyzes a local objective Li((P(ϕ)µ)_i) and differentiates with respect to the lifted signal (P(ϕ)µ)_i while treating neighboring lifted signals as constants. The resulting update rule (Eq. (29)) is not the fixed-point condition for the minimizer, and the optimization is over ϕ, not directly over the lifted signal. Thus the claimed high-frequency/low-frequency interpolation behavior of P(ϕ*) is not proven. Please revise the proof or weaken the proposition to a stated intuition.

minor comments (5)

[Eq. (11)] The homoscedastic uncertainty weighting uses 1/(2σ^2) for both losses, which is the regression form from Kendall et al. For classification, the standard form is (1/σ^2) L + log σ. Please verify and correct the formula.
[Sec. 3.2.1] Typo: 'features anisotropic structural regularization' should likely be 'features an anisotropic structural regularization' or 'incorporates anisotropic structural regularization'.
[Throughout] Inconsistent naming: 'GLOGNN' vs 'GloGNN', 'Ogbn-product' vs 'Ogbn-products', and 'arXiv' vs 'arXiv-year' in a few places. Please standardize.
[Appendix D.2] The description states UGC 'explicitly accounts for the heterophily present in such graphs,' which seems to contradict the introduction's claim that prior coarsening work has been developed almost exclusively for homophilic graphs. Please reconcile.
[Sec. 2.2, Table 1] The text says the degradation is 'often nearly four times larger' on heterophilic graphs. This ratio is not computed or shown; please provide the exact computation or substantiate the claim.

Circularity Check

2 steps flagged · score 2.0 of 10

No significant circularity in the empirical method; the theory sections contain a self-definitional proposition and a proof that assumes its conclusion.

other [Appendix A, proof of Proposition 2.2 (Lemma A.2 and Eq. 20)]
"Assume that A and B are conditionally independent given Y, i.e. A⊥B|Y. Then I(A;B)≤min{I(A;Y), I(B;Y)}. ... Notice that f(; Θ∗), f(; Θ∗∗), and g are all deterministic functions. Hence, by letting U=Y, V=f(A, X; Θ∗), W=(f(A, X; Θ∗∗), g(G \ G′)), we can derive..."

The proposition's bound is obtained by first assuming the two model outputs are conditionally independent given Y, which already enforces that their shared information flows only through the label. The subsequent DPI step postulates the Markov chain Y→f(A,X;Θ*)→(f(A,X;Θ**),g(G\G')), which is a stronger version of the target claim: it asserts the full-graph output screens off all extra label information carried by the coarsened model and the discarded graph. Thus the 'explanation' of the coarsening gap rests on the informational separation it is supposed to prove, rather than being derived from the coarsening process.
self definitional [Section 3.2.1, Eq. (10) and Proposition 3.1 / Appendix B]
"JASR(ϕ) = Σ_{i,j∈E} ωij · ∥(P(ϕ)µ)i −(P(ϕ)µ)j∥2 + β·∥X−P(ϕ)µ∥2F, where ωij := exp(−∥Xi −Xj∥2). ... Heterophilic Regime: In regions where ∥Xi −Xj∥→∞, P(ϕ∗) approaches the solution of identity reconstruction, prioritizing high-frequency signal fidelity over structural smoothness."

The proposition's two regimes follow immediately from the definition of ωij: when ∥Xi-Xj∥ is large, ωij→0 and only the reconstruction term remains; when it is small, ωij→1 and the smoothness term dominates. The 'heterophily-aware' interpolation is therefore installed into the objective by construction, and the proposition restates that definitional behavior rather than deriving an independent property of the learned projector.

full rationale

The empirical core of ACE is not circular. The reported gains are measured on external heterophilic and homophilic benchmarks against four coarsening baselines and multiple backbones; the refined projector is optimized unsupervised via Eq. (10) using only graph structure and features, and the auxiliary loss is a standard supervised objective. There is no load-bearing self-citation chain: the reference to the corresponding author's earlier spectral-coarsening work is contextual, and the anisotropic-diffusion inspiration is attributed to external prior work. The only circular-adjacent parts are theoretical. Proposition 2.2's proof assumes conditional independence of model outputs given Y and a DPI Markov chain that effectively contains the conclusion, so the mutual-information explanation is not independently derived. Proposition 3.1 is a self-definitional unpacking of JASR: the heterophily-aware regimes are built into ωij by definition. Separately, Eqs. (5) and (11) write the auxiliary loss against the full n×c label matrix Y without explicitly stating a train/validation/test mask; if Y included test labels, the accuracy tables would be fitted values rather than predictions. That is an unguarded definition in the manuscript, not evidence that the authors used test labels, and it does not undermine the self-contained nature of the empirical comparison as normally instantiated. Overall, the central empirical contribution is externally benchmarked and independent of the theory, so the circularity score is low.

Assumptions & free parameters 5 free parameters · 5 assumptions · 0 invented entities

The load-bearing logical assumptions are mostly empirical premises (coarsening loses information; anisotropic diffusion helps) and two unjustified information-theoretic steps in the proof of Prop 2.2. The method's free parameters are hyperparameters (β, T, MLP width), not fitted to test data.

free parameters (5)

β (anisotropic regularization trade-off) = 1 (default; robust across 0.01–100)
Balances reconstruction vs anisotropic smoothness in Eq (10); tuned from {0.1,1,10}.
T (projector optimization epochs) = not reported
Number of epochs for learning P(ϕ); complexity is O(T(n d + |E| d)) but T is never given.
λ (toy auxiliary loss weight) = not stated
Trade-off in Eq (5), manually chosen; replaced by uncertainty weighting in final ACE.
MLP hidden dim for f_ϕ = 500
Architecture choice for the projector MLP, fixed across experiments.
σ1, σ2 (uncertainty weights) = learned
Learned via homoscedastic uncertainty weighting in Eq (11); not reported post-training.

assumptions (5)

standard math Cross-entropy minimization with softmax is equivalent to mutual information maximization (Lemma A.1, from Qin et al. 2020)
Cited lemma used to convert loss minimization to MI maximization in the proof of Prop 2.2.
ad hoc to paper Outputs of two different models trained on the same labels are conditionally independent given the label (Lemma A.2)
Unproven and generally false: model outputs share feature/architecture correlations beyond the label. This assumption is load-bearing for the core bound.
ad hoc to paper Data processing inequality can be applied as I(Y; f_full) ≥ I(Y; (f_coarse, g(G\G')))
Eq (20) assumes Y→f_full→(f_coarse,g) is a Markov chain, which is not established; f_coarse is not a function of f_full.
domain assumption Anisotropic diffusion captures heterophily better than isotropic diffusion
Motivates the anisotropic structural regularization in Eq (10); inherited from prior literature [Fu et al. 2023, Perona & Malik].
domain assumption Coarsening discards label-relevant structure, especially under heterophily
Central premise supported only empirically via the toy experiment; not formally proven.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement." pith.science (2026). https://pith.science/paper/TOESOWFD

@misc{pith2026260721885,
  author       = {Pith},
  title        = {Pith review of: Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TOESOWFD}},
  note         = {Machine review of arXiv:2607.21885}
}

read the original abstract

Coarsening-based training for graph neural networks (GNNs), i.e.\ training on coarsened graphs rather than the original large ones, has become a promising direction for scaling GNNs to massive graphs. However, prior work has been evaluated almost exclusively on \textit{homophilic} graphs, leaving the more challenging \textit{heterophilic} settings underexplored. We show, both empirically and theoretically, that existing coarsening-based training methods suffer significant performance degradation on heterophilic graphs due to inevitable loss of graph information during coarsening. To address this, we propose {\bf A}daptive {\bf C}omplementary {\bf E}nhancement, a plug-and-play, model-agnostic strategy that reintegrates the information discarded in coarsening: ACE learns a projector for re-constructing original node features and applies \textit{anisotropic structural regularization} to embed local heterophily. We further adopt \textit{homoscedastic uncertainty weighting} to adaptively balance the combined training objective of primary coarsened-graph training loss and full-graph auxiliary loss with augmented node features re-constructed by the heterophily-aware projector. Extensive experiments show that ACE drives consistent gains on heterophilic benchmarks while preserving competitive results on homophilic graphs with minimal computational overhead. Code is available at the GitHub repository: https://github.com/vasile-paskardlgm/ACE.

Figures

Figures reproduced from arXiv: 2607.21885 by the authors.

**Figure 1.** Illustration for graph coarsening: G ′ encodes intersupernode relations; G \ G′ holds intra-supernode information discarded during coarsening. mutual information between their outputs satisfies I(f(A, X; Θ∗ ); f(A, X; Θ∗∗)) ≤ I(f(A, X; Θ∗ ); Y ) − Ω , (4) where Ω = I(g(G \ G′ ); Y |f(A, X; Θ∗∗)), and g : G \ G ′ 7→ Y is arbitrary neural network that maps G \ G′ to the node label space Y and maximizes the condition… view at source ↗

**Figure 2.** Effect of β across coarsening pipelines, GNN backbones, and datasets. More results can be found in [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗

**Figure 3.** Comparison of preprocessing time for SCAL, SG [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗

Figures from the paper (5 more)

**Figure 5.** Figure 5: Effect of β across coarsening pipelines, GNN backbones, and datasets [PITH_FULL_IMAGE:figures/full_fig_p022_5.png]

**Figure 6.** Figure 6: Preprocessing time of each coarsening training pipelines and those with our ACE across diverse benchmarks. [PITH_FULL_IMAGE:figures/full_fig_p023_6.png]

**Figure 7.** Figure 7: Per-epoch training time of SCAL, FGC, SGBGC, and their ACE-improved versions across diverse backbone [PITH_FULL_IMAGE:figures/full_fig_p023_7.png]

**Figure 8.** Figure 8: Training GPU memory allocation of SCAL, FGC, SGBGC, and their ACE-improved versions across diverse [PITH_FULL_IMAGE:figures/full_fig_p024_8.png]

**Figure 9.** Figure 9: Noise robustness evaluation on the Pokec dataset. Experiments are conducted using GCN and GPRGNN backbones [PITH_FULL_IMAGE:figures/full_fig_p024_9.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

295 extracted references · 9 canonical work pages

[1]

A note on over-smoothing for graph neural networks, 2020

Chen Cai and Yusu Wang. A note on over-smoothing for graph neural networks, 2020. URL https://arxiv.org/abs/2006.13318

arXiv 2020
[2]

Grand: Graph neural diffusion

Ben Chamberlain, James Rowbottom, Maria I Gorinova, Michael Bronstein, Stefan Webb, and Emanuele Rossi. Grand: Graph neural diffusion. In Marina Meila and Tong Zhang, editors, Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pages 1407--1418. PMLR, 18--24 Jul 2021. URL https://pr...

2021
[3]

Graph coarsening: from scientific computing to machine learning

Jie Chen, Yousef Saad, and Zechen Zhang. Graph coarsening: from scientific computing to machine learning. SeMA Journal, 79 0 (1): 0 187--223, 2022 a

2022
[4]

Optimization-induced graph implicit nonlinear diffusion

Qi Chen, Yifei Wang, Yisen Wang, Jiansheng Yang, and Zhouchen Lin. Optimization-induced graph implicit nonlinear diffusion. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, editors, Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, pa...

2022
[5]

A gromov- W asserstein geometric view of spectrum-preserving graph coarsening

Yifan Chen, Rentian Yao, Yun Yang, and Jie Chen. A gromov- W asserstein geometric view of spectrum-preserving graph coarsening. In Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett, editors, Proceedings of the 40th International Conference on Machine Learning, volume 202 of Proceedings of Machine Learni...

2023
[6]

Adaptive universal generalized pagerank graph neural network

Eli Chien, Jianhao Peng, Pan Li, and Olgica Milenkovic. Adaptive universal generalized pagerank graph neural network. In International Conference on Learning Representations, 2021. URL https://openreview.net/forum?id=n6jl7fLxrP

2021
[7]

Spectral Graph Theory , volume 92

Fan Chung. Spectral Graph Theory , volume 92. CBMS Regional Conference Series in Mathematics, 1997. ISBN 978-0-8218-0315-8. doi:/10.1090/cbms/092

doi:10.1090/cbms/092 1997
[8]

Elements of information theory

Thomas M Cover. Elements of information theory. John Wiley & Sons, 1999

1999

Show all 295 references

[9]

Re-think and re-design graph neural networks in spaces of continuous graph diffusion functionals

Tingting Dan, Jiaqi Ding, Ziquan Wei, Shahar Kovalsky, Minjeong Kim, Won Hwa Kim, and Guorong Wu. Re-think and re-design graph neural networks in spaces of continuous graph diffusion functionals. In A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors, ...

2023
[10]

Halappanavar, Edoardo Serra, and Alex Pothen

Siddhartha Shankar Das, S M Ferdous, Mahantesh M. Halappanavar, Edoardo Serra, and Alex Pothen. Ags-gnn: Attribute-guided sampling for graph neural networks. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD '24, page 538–549, New Yor...

2024
[11]

Polynormer: Polynomial-expressive graph transformer in linear time

Chenhui Deng, Zichao Yue, and Zhiru Zhang. Polynormer: Polynomial-expressive graph transformer in linear time. In The Twelfth International Conference on Learning Representations, 2024. URL https://openreview.net/forum?id=hmv1LpNfXa

2024
[12]

Graph coarsening via convolution matching for scalable graph neural network training

Charles Dickens, Edward Huang, Aishwarya Reganti, Jiong Zhu, Karthik Subbian, and Danai Koutra. Graph coarsening via convolution matching for scalable graph neural network training. In Companion Proceedings of the ACM on Web Conference 2024, WWW '24, page 1502–1510, New York, ...

2024
[13]

Ahmed A. A. Elhag, Gabriele Corso, Hannes St \"a rk, and Michael M. Bronstein. Graph anisotropic diffusion for molecules. In ICLR2022 Machine Learning for Drug Discovery, 2022. URL https://openreview.net/forum?id=MDYOh60QN94

2022
[14]

Pde-gcn: Novel architectures for graph neural networks motivated by partial differential equations

Moshe Eliasof, Eldad Haber, and Eran Treister. Pde-gcn: Novel architectures for graph neural networks motivated by partial differential equations. In M. Ranzato, A. Beygelzimer, Y. Dauphin, P.S. Liang, and J. Wortman Vaughan, editors, Advances in Neural Information Processing ...

2021
[15]

Faster graph embeddings via coarsening

Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, and Chi Wang. Faster graph embeddings via coarsening. In Hal Daumé III and Aarti Singh, editors, Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learnin...

2020
[16]

Implicit graph neural diffusion based on constrained dirichlet energy minimization

Guoji Fu, Mohammed Haroon Dupty, Yanfei Dong, and Wee Sun Lee. Implicit graph neural diffusion based on constrained dirichlet energy minimization. In NeurIPS 2023 Workshop: New Frontiers in Graph Learning, 2023. URL https://openreview.net/forum?id=a9loLCbWs1

2023
[17]

Bronstein

Francesco Di Giovanni, James Rowbottom, Benjamin Paul Chamberlain, Thomas Markovich, and Michael M. Bronstein. Understanding convolution on graphs via energies. Transactions on Machine Learning Research, 2023. ISSN 2835-8856. URL https://openreview.net/forum?id=v5ew3FPTgb

2023
[18]

Learning from graphs with heterophily: Progress and future, 2024

Chenghua Gong, Yao Cheng, Xiang Li, Caihua Shan, and Siqiang Luo. Learning from graphs with heterophily: Progress and future, 2024. URL https://arxiv.org/abs/2401.09769

2024 arXiv
[19]

Scalable graph condensation with evolving capabilities

Shengbo Gong, Mohammad Hashemi, Juntong Ni, Carl Yang, and Wei Jin. Scalable graph condensation with evolving capabilities. In Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1, KDD '26, page 314–323, New York, NY, USA, 2026. Association ...

2026
[20]

From continuous dynamics to graph neural networks: Neural diffusion and beyond, 2023

Andi Han, Dai Shi, Lequan Lin, and Junbin Gao. From continuous dynamics to graph neural networks: Neural diffusion and beyond, 2023. URL https://arxiv.org/abs/2310.10121

2023 arXiv
[21]

Aditya Prakash, and Wei Jin

Mohammad Hashemi, Shengbo Gong, Juntong Ni, Wenqi Fan, B. Aditya Prakash, and Wei Jin. A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation. In Kate Larson, editor, Proceedings of the Thirty-Third International Joint Conference on Artificial ...

2024 doi
[22]

Open graph benchmark: Datasets for machine learning on graphs

Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. Open graph benchmark: Datasets for machine learning on graphs. In H. Larochelle, M. Ranzato, R. Hadsell, M.F. Balcan, and H. Lin, editors, Advances in Neural Inform...

2020
[23]

Scaling up graph neural networks via graph coarsening

Zengfeng Huang, Shengzhong Zhang, Chong Xi, Tang Liu, and Min Zhou. Scaling up graph neural networks via graph coarsening. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, KDD '21, page 675–684, New York, NY, USA, 2021. Association for Com...

2021
[24]

Graph condensation for graph neural networks

Wei Jin, Lingxiao Zhao, Shichang Zhang, Yozen Liu, Jiliang Tang, and Neil Shah. Graph condensation for graph neural networks. In International Conference on Learning Representations, 2022. URL https://openreview.net/forum?id=WLEx3Jo4QaB

2022
[25]

Graph coarsening with preserved spectral properties

Yu Jin, Andreas Loukas, and Joseph JaJa. Graph coarsening with preserved spectral properties. In Silvia Chiappa and Roberto Calandra, editors, Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, volume 108 of Proceedings of Machi...

2020
[26]

Graph coarsening with message-passing guarantees, 2024

Antonin Joly and Nicolas Keriven. Graph coarsening with message-passing guarantees, 2024. URL https://arxiv.org/abs/2405.18127

2024 arXiv
[27]

Ugc: Universal graph coarsening

Mohit Kataria, Sandeep Kumar, and Jayadeva. Ugc: Universal graph coarsening. In A. Globerson, L. Mackey, D. Belgrave, A. Fan, U. Paquet, J. Tomczak, and C. Zhang, editors, Advances in Neural Information Processing Systems, volume 37, pages 63057--63081. Curran Associates, Inc., 2024

2024
[28]

Multi-task learning using uncertainty to weigh losses for scene geometry and semantics

Alex Kendall, Yarin Gal, and Roberto Cipolla. Multi-task learning using uncertainty to weigh losses for scene geometry and semantics. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2018

2018
[29]

Kingma and Jimmy Ba

Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization, 2014. URL https://arxiv.org/abs/1412.6980

2014 arXiv
[30]

Kipf and Max Welling

Thomas N. Kipf and Max Welling. Semi-supervised classification with graph convolutional networks, 2017. URL https://openreview.net/forum?id=SJU4ayYgl

2017
[31]

A unified framework for optimization-based graph coarsening

Manoj Kumar, Anurag Sharma, and Sandeep Kumar. A unified framework for optimization-based graph coarsening. Journal of Machine Learning Research, 24 0 (118): 0 1--50, 2023 a . URL http://jmlr.org/papers/v24/22-1085.html

2023
[32]

Featured graph coarsening with similarity guarantees

Manoj Kumar, Anurag Sharma, Shashwat Saxena, and Sandeep Kumar. Featured graph coarsening with similarity guarantees. In Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett, editors, Proceedings of the 40th International Confe...

2023
[33]

Finding global homophily in graph neural networks when meeting heterophily

Xiang Li, Renyu Zhu, Yao Cheng, Caihua Shan, Siqiang Luo, Dongsheng Li, and Weining Qian. Finding global homophily in graph neural networks when meeting heterophily. In ICML. PMLR, 2022. URL https://proceedings.mlr.press/v162/li22ad.html

2022
[34]

Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods

Derek Lim, Felix Matthew Hohne, Xiuyu Li, Sijia Linda Huang, Vaishnavi Gupta, Omkar Prasad Bhalerao, and Ser-Nam Lim. Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods. In A. Beygelzimer, Y. Dauphin, P. Liang, and J. Wortman Vaughan, edit...

2021
[35]

Graph summarization methods and applications: A survey

Yike Liu, Tara Safavi, Abhilash Dighe, and Danai Koutra. Graph summarization methods and applications: A survey. ACM Comput. Surv., 51 0 (3), jun 2018. ISSN 0360-0300. URL https://doi.org/10.1145/3186727

2018 doi
[36]

Spectrally approximating large graphs with smaller graphs

Andreas Loukas and Pierre Vandergheynst. Spectrally approximating large graphs with smaller graphs. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pages 32...

2018
[37]

Li, Jian Tang, Guy Wolf, and Stefanie Jegelka

Sitao Luan, Chenqing Hua, Qincheng Lu, Liheng Ma, Lirong Wu, Xinyu Wang, Minkai Xu, Xiao-Wen Chang, Doina Precup, Rex Ying, Stan Z. Li, Jian Tang, Guy Wolf, and Stefanie Jegelka. The heterophilic graph learning handbook: Benchmarks, models, theoretical analysis, applications a...

2024 arXiv
[38]

A fractional graph laplacian approach to oversmoothing

Sohir Maskey, Raffaele Paolino, Aras Bacho, and Gitta Kutyniok. A fractional graph laplacian approach to oversmoothing. In A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors, Advances in Neural Information Processing Systems, volume 36, pages 13022--1...

2023
[39]

E. A. Nadaraya. On estimating regression. Theory of Probability & Its Applications, 9 0 (1): 0 141--142, 1964. doi:10.1137/1109020. URL https://doi.org/10.1137/1109020

1964 doi
[40]

Perona and J

P. Perona and J. Malik. Scale-space and edge detection using anisotropic diffusion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12 0 (7): 0 629--639, 1990. doi:10.1109/34.56205

1990 doi
[41]

A critical look at the evaluation of GNN s under heterophily: Are we really making progress? In International Conference on Learning Representations, 2023

Oleg Platonov, Denis Kuznedelev, Michael Diskin, Artem Babenko, and Liudmila Prokhorenkova. A critical look at the evaluation of GNN s under heterophily: Are we really making progress? In International Conference on Learning Representations, 2023. URL https://openreview.net/fo...

2023
[42]

Aditya Prakash, Chanhyun Kang, Yao Zhang, and V.S

Manish Purohit, B. Aditya Prakash, Chanhyun Kang, Yao Zhang, and V.S. Subrahmanian. Fast influence-based coarsening for large networks. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '14, page 1296–1305, New York, NY,...

2014
[43]

Rethinking softmax with cross-entropy: Neural network classifier as mutual information estimator, 2020

Zhenyue Qin, Dongwoo Kim, and Tom Gedeon. Rethinking softmax with cross-entropy: Neural network classifier as mutual information estimator, 2020. URL https://arxiv.org/abs/1911.10688

2020 arXiv
[44]

J. W. Ruge and K. Stüben. 4. Algebraic Multigrid, pages 73--130. doi:10.1137/1.9781611971057.ch4. URL https://epubs.siam.org/doi/abs/10.1137/1.9781611971057.ch4

doi
[45]

Konstantin Rusch, Michael M

T. Konstantin Rusch, Michael M. Bronstein, and Siddhartha Mishra. A survey on oversmoothing in graph neural networks, 2023. URL https://arxiv.org/abs/2303.10993

2023 arXiv
[46]

Scalable graph neural network training: The case for sampling

Marco Serafini and Hui Guan. Scalable graph neural network training: The case for sampling. SIGOPS Oper. Syst. Rev., 55 0 (1): 0 68–76, June 2021. ISSN 0163-5980. doi:10.1145/3469379.3469387. URL https://doi.org/10.1145/3469379.3469387

2021
[47]

Graph attention networks

Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, and Yoshua Bengio. Graph attention networks. In International Conference on Learning Representations, 2018. URL https://openreview.net/forum?id=rJXMpikCZ

2018
[48]

Xiao Wang, Deyu Bo, Chuan Shi, Shaohua Fan, Yanfang Ye, and Philip S. Yu. A survey on heterogeneous graph embedding: Methods, techniques, applications and sources. IEEE Transactions on Big Data, 9 0 (2): 0 415--436, 2023. doi:10.1109/TBDATA.2022.3177455

2023
[50]

Sgformer: Simplifying and empowering transformers for large-graph representations

Qitian Wu, Wentao Zhao, Chenxiao Yang, Hengrui Zhang, Fan Nie, Haitian Jiang, Yatao Bian, and Junchi Yan. Sgformer: Simplifying and empowering transformers for large-graph representations. In A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors, Advance...

2023
[51]

Graph coarsening via supervised granular-ball for scalable graph neural network training

Shuyin Xia, Xinjun Ma, Zhiyuan Liu, Cheng Liu, Sen Zhao, and Guoyin Wang. Graph coarsening via supervised granular-ball for scalable graph neural network training. Proceedings of the AAAI Conference on Artificial Intelligence, 39 0 (12): 0 12872--12880, Apr. 2025. doi:10.1609/...

2025 doi
[52]

Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks

Yujun Yan, Milad Hashemi, Kevin Swersky, Yaoqing Yang, and Danai Koutra. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. In 2022 IEEE International Conference on Data Mining (ICDM), pages 1287--1292, 2022

2022
[53]

A survey on multi-task learning

Yu Zhang and Qiang Yang. A survey on multi-task learning. IEEE Transactions on Knowledge and Data Engineering, 34 0 (12): 0 5586--5609, 2022. doi:10.1109/TKDE.2021.3070203

2022
[54]

Yu, and Shirui Pan

Xin Zheng, Yi Wang, Yixin Liu, Ming Li, Miao Zhang, Di Jin, Philip S. Yu, and Shirui Pan. Graph neural networks for graphs with heterophily: A survey, 2024. URL https://arxiv.org/abs/2202.07082

2024 arXiv
[56]

Beyond homophily in graph neural networks: Current limitations and effective designs

Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. Beyond homophily in graph neural networks: Current limitations and effective designs. In NeurIPS, 2020. URL https://proceedings.neurips.cc/paper_files/paper/2020/file/58ae23d878a47004366189884c2...

2020
[58]

Proceedings of the AAAI Conference on Artificial Intelligence , author=

Deeper Insights Into Graph Convolutional Networks for Semi-Supervised Learning , volume=. Proceedings of the AAAI Conference on Artificial Intelligence , author=. 2018 , month=. doi:10.1609/aaai.v32i1.11604 , number=

2018 doi
[59]

2020 , isbn =

Liu, Meng and Gao, Hongyang and Ji, Shuiwang , title =. 2020 , isbn =. doi:10.1145/3394486.3403076 , booktitle =

2020
[60]

2021 , eprint=

Graph Neural Networks Exponentially Lose Expressive Power for Node Classification , author=. 2021 , eprint=

2021
[61]

2023 , eprint=

Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials , author=. 2023 , eprint=

2023
[62]

2024 , eprint=

Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach , author=. 2024 , eprint=

2024
[63]

2023 , eprint=

LON-GNN: Spectral GNNs with Learnable Orthonormal Basis , author=. 2023 , eprint=

2023
[64]

ICML , year=

Feature Expansion for Graph Neural Networks , author=. ICML , year=
[65]

Proceedings of the 2023 SIAM International Conference on Data Mining (SDM) , publisher=

Dominic Jack and Sarah Erfani and Jeffrey Chan and Sutharshan Rajasegarar and Christopher Leckie , title =. Proceedings of the 2023 SIAM International Conference on Data Mining (SDM) , publisher=. 2023 , pages =

2023
[66]

Proceedings of the AAAI Conference on Artificial Intelligence , author=

Improving Expressive Power of Spectral Graph Neural Networks with Eigenvalue Correction , volume=. Proceedings of the AAAI Conference on Artificial Intelligence , author=. 2024 , month=. doi:10.1609/aaai.v38i13.29326 , number=

2024 doi
[67]

Proceedings of the AAAI Conference on Artificial Intelligence , author=

SEA-GWNN: Simple and Effective Adaptive Graph Wavelet Neural Network , volume=. Proceedings of the AAAI Conference on Artificial Intelligence , author=. 2024 , month=. doi:10.1609/aaai.v38i10.29058 , number=

2024 doi
[68]

2023 , eprint=

Accelerating Scalable Graph Neural Network Inference with Node-Adaptive Propagation , author=. 2023 , eprint=

2023
[69]

PC-Conv: Unifying Homophily and Heterophily with Two-Fold Filtering , url=

Li, Bingheng and Pan, Erlin and Kang, Zhao , year=. PC-Conv: Unifying Homophily and Heterophily with Two-Fold Filtering , url=. doi:10.1609/aaai.v38i12.29246 , journal=

doi
[70]

2024 , eprint=

An Effective Universal Polynomial Basis for Spectral Graph Neural Networks , author=. 2024 , eprint=

2024
[71]

2023 , eprint=

Learning Graph Filters for Spectral GNNs via Newton Interpolation , author=. 2023 , eprint=

2023
[72]

2024 , eprint=

Rethinking Spectral Graph Neural Networks with Spatially Adaptive Filtering , author=. 2024 , eprint=

2024
[73]

2017 , eprint=

Multi-dimensional Graph Fourier Transform , author=. 2017 , eprint=

2017
[74]

and Bresson, Xavier , title=

Monti, Federico and Bronstein, Michael M. and Bresson, Xavier , title=. Proceedings of the 31st International Conference on Neural Information Processing Systems , pages=. 2017 , isbn=

2017
[75]

Factorization Machines , year=

Rendle, Steffen , booktitle=. Factorization Machines , year=
[76]

Higher-Order Factorization Machines , url=

Blondel, Mathieu and Fujino, Akinori and Ueda, Naonori and Ishihata, Masakazu , booktitle=. Higher-Order Factorization Machines , url=
[77]

Proceedings of the 26th International Joint Conference on Artificial Intelligence , pages=

Guo, Huifeng and Tang, Ruiming and Ye, Yunming and Li, Zhenguo and He, Xiuqiang , title=. Proceedings of the 26th International Joint Conference on Artificial Intelligence , pages=. 2017 , isbn=

2017
[78]

2017 , eprint=

Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networks , author=. 2017 , eprint=

2017
[79]

and Sturmfels, Pascal and Lee, Su-In , title=

Janizek, Joseph D. and Sturmfels, Pascal and Lee, Su-In , title=. J. Mach. Learn. Res. , month=. 2021 , publisher=

2021
[80]

2020 , isbn=

Wang, Xiao and Zhu, Meiqi and Bo, Deyu and Cui, Peng and Shi, Chuan and Pei, Jian , title=. 2020 , isbn=. doi:10.1145/3394486.3403177 , booktitle=

2020
[81]

2024 , eprint=

Spectral GNN via Two-dimensional (2-D) Graph Convolution , author=. 2024 , eprint=

2024
[82]

Aggarwal and Dawei Yin and Jiliang Tang , title=

Yao Ma and Suhang Wang and Chara C. Aggarwal and Dawei Yin and Jiliang Tang , title=. Proceedings of the 2019 SIAM International Conference on Data Mining (SDM) , chapter=. 2019 , doi=

2019
[83]

The Eleventh International Conference on Learning Representations , year=

Specformer: Spectral Graph Neural Networks Meet Transformers , author=. The Eleventh International Conference on Learning Representations , year=
[84]

Dual Feature Interaction-Based Graph Convolutional Network , year=

Zhao, Zhongying and Yang, Zhan and Li, Chao and Zeng, Qingtian and Guan, Weili and Zhou, MengChu , journal=. Dual Feature Interaction-Based Graph Convolutional Network , year=
[85]

2021 , isbn=

Li, Qimai and Zhang, Xiaotong and Liu, Han and Dai, Quanyu and Wu, Xiao-Ming , title=. 2021 , isbn=. doi:10.1145/3447548.3467413 , booktitle=

2021
[87]

EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networks , url=

Lei, Runlin and Wang, Zhen and Li, Yaliang and Ding, Bolin and Wei, Zhewei , booktitle=. EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networks , url=
[88]

2024 , eprint=

Elevating Spectral GNNs through Enhanced Band-pass Filter Approximation , author=. 2024 , eprint=

2024
[89]

Node-Oriented Spectral Filtering for Graph Neural Networks , year=

Zheng, Shuai and Zhu, Zhenfeng and Liu, Zhizhe and Li, Youru and Zhao, Yao , journal=. Node-Oriented Spectral Filtering for Graph Neural Networks , year=
[90]

Graph Neural Networks With Convolutional ARMA Filters , year=

Bianchi, Filippo Maria and Grattarola, Daniele and Livi, Lorenzo and Alippi, Cesare , journal=. Graph Neural Networks With Convolutional ARMA Filters , year=
[91]

, journal=

Levie, Ron and Monti, Federico and Bresson, Xavier and Bronstein, Michael M. , journal=. CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters , year=
[92]

Rational Neural Networks for Approximating Graph Convolution Operator on Jump Discontinuities , year=

Chen, Zhiqian and Chen, Feng and Lai, Rongjie and Zhang, Xuchao and Lu, Chang-Tien , booktitle=. Rational Neural Networks for Approximating Graph Convolution Operator on Jump Discontinuities , year=
[93]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =

Li, Qimai and Wu, Xiao-Ming and Liu, Han and Zhang, Xiaotong and Guan, Zhichao , title =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =
[94]

2022 , editor=

Li, Mingjie and Guo, Xiaojun and Wang, Yifei and Wang, Yisen and Lin, Zhouchen , booktitle=. 2022 , editor=

2022
[96]

and Fefferman, Robert , year=

Zygmund, A. and Fefferman, Robert , year=. Trigonometric Series , DOI=
[97]

International Conference on Learning Representations , year=

Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective , author=. International Conference on Learning Representations , year=
[98]

Tay, David B. H. and Lin, Zhiping , journal=. Design of Near Orthogonal Graph Filter Banks , year=
[99]

Infinite Impulse Response Graph Filters in Wireless Sensor Networks , year=

Shi, Xuesong and Feng, Hui and Zhai, Muyuan and Yang, Tao and Hu, Bo , journal=. Infinite Impulse Response Graph Filters in Wireless Sensor Networks , year=
[100]

Autoregressive Moving Average Graph Filtering , year=

Isufi, Elvin and Loukas, Andreas and Simonetto, Andrea and Leus, Geert , journal=. Autoregressive Moving Average Graph Filtering , year=
[101]

Rational Chebyshev Graph Filters , year=

Rimleanscaia, Oxana and Isufi, Elvin , booktitle=. Rational Chebyshev Graph Filters , year=
[102]

Fourier-Based and Rational Graph Filters for Spectral Processing , year=

Patanè, Giuseppe , journal=. Fourier-Based and Rational Graph Filters for Spectral Processing , year=
[103]

Optimal surface smoothing as filter design

Taubin, Gabriel and Zhang, Tong and Golub, Gene. Optimal surface smoothing as filter design. ECCV '96. 1996

1996
[104]

, booktitle=

Dengwei Fu and Willson, A.N. , booktitle=. Design of an improved interpolation filter using a trigonometric polynomial , year=
[105]

and Zhi-Quan Luo and Sturm, J.F

Davidson, T.N. and Zhi-Quan Luo and Sturm, J.F. , journal=. Linear matrix inequality formulation of spectral mask constraints with applications to FIR filter design , year=
[106]

and Rodrigues, Joseph X

Gudino, Lucy J. and Rodrigues, Joseph X. and Jagadeesha, S. N. , booktitle=. Linear phase FIR filter for narrow-band filtering , year=
[107]

Perfect Decomposition Narrow-Band FIR Filter Banks , year=

Zahradnik, Pavel and Vlcek, Miroslav , journal=. Perfect Decomposition Narrow-Band FIR Filter Banks , year=
[108]

2023 , issn=

Minimax design of two-channel critically sampled graph QMF banks , journal=. 2023 , issn=. doi:https://doi.org/10.1016/j.sigpro.2023.109129 , url=

2023
[109]

Sharma and A

A. Sharma and A. K. Varma , title =. Duke Mathematical Journal , number =. 1965 , doi =

1965
[110]

Hardware implementation of the exponential function using Taylor series , year=

Nilsson, Peter and Shaik, Ateeq Ur Rahman and Gangarajaiah, Rakesh and Hertz, Erik , booktitle=. Hardware implementation of the exponential function using Taylor series , year=
[111]

2016 , doi=

Accurate and efficient computation of nonlocal potentials based on Gaussian-sum approximation , journal=. 2016 , doi=

2016
[112]

Annals of Mathematics , number=

Zhiwei, Yun and Wei, Zhang , title=. Annals of Mathematics , number=. 2017 , doi=

2017
[113]

2018 , doi=

A Taylor expansion of the square root matrix function , journal=. 2018 , doi=

2018
[114]

2019 , doi=

Taylor approximation and variance reduction for PDE-constrained optimal control under uncertainty , journal=. 2019 , doi=

2019
[115]

2023 , doi=

Assessing the chaos strength of Taylor approximations of the sine chaotic map , journal=. 2023 , doi=

2023
[116]

Stine and Michael, J

James, E. Stine and Michael, J. Schulte , title=. Journal of VLSI signal processing systems for signal, image and video technology , year=
[117]

A Piece-Wise Polynomial Filtering Approach for Graph Neural Networks

Lingam, Vijay and Sharma, Manan and Ekbote, Chanakya and Ragesh, Rahul and Iyer, Arun and Sellamanickam, Sundararajan. A Piece-Wise Polynomial Filtering Approach for Graph Neural Networks. Machine Learning and Knowledge Discovery in Databases. 2023

2023
[118]

and Burgess, N

Lee, B. and Burgess, N. , booktitle=. Some results on Taylor-series function approximation on FPGA , year=
[119]

Approximating sine functions using variable-precision Taylor polynomials , year=

Brunelli, Claudio and Berg, Heikki and Guevorkian, David , booktitle=. Approximating sine functions using variable-precision Taylor polynomials , year=
[120]

Hammond and Pierre, Vandergheynst and Rémi, Gribonval , title=

David, K. Hammond and Pierre, Vandergheynst and Rémi, Gribonval , title=. Vertex-Frequency Analysis of Graph Signals , year=
[121]

Proceedings of The 25th International Conference on Artificial Intelligence and Statistics , pages=

Adaptive Gaussian Processes on Graphs via Spectral Graph Wavelets , author=. Proceedings of The 25th International Conference on Artificial Intelligence and Statistics , pages=. 2022 , volume=

2022
[122]

Constructive Approximation , volume=

On trigonometric wavelets , author=. Constructive Approximation , volume=. 1993 , publisher=

1993
[123]

Wavelet Analysis and Its Applications , publisher =

Interpolatory and Orthonormal Trigonometric Wavelets , author =. Wavelet Analysis and Its Applications , publisher =. 1998 , doi =

1998
[124]

Numerical Algorithms , volume=

Trigonometric interpolation and wavelet decompositions , author=. Numerical Algorithms , volume=. 1995 , publisher=

1995
[125]

2010 , month =

Newman, Mark , title = ". 2010 , month =. doi:10.1093/acprof:oso/9780199206650.001.0001 , url =

2010
[126]

and Bruna, Joan and LeCun, Yann and Szlam, Arthur and Vandergheynst, Pierre , journal=

Bronstein, Michael M. and Bruna, Joan and LeCun, Yann and Szlam, Arthur and Vandergheynst, Pierre , journal=. Geometric Deep Learning: Going beyond Euclidean data , year=
[127]

, title=

Hamilton, William L. , title=. Synthesis Lectures on Artificial Intelligence and Machine Learning , year=. doi:10.1007/978-3-031-01588-5 , url=

doi
[128]

2003 , publisher =

Washio, Takashi and Motoda, Hiroshi , title =. 2003 , publisher =. doi:10.1145/959242.959249 , journal =

2003
[129]

Inductive Representation Learning on Large Graphs , url =

Hamilton, Will and Ying, Zhitao and Leskovec, Jure , booktitle =. Inductive Representation Learning on Large Graphs , url =
[130]

Mining large graphs: Algorithms, inference, and discoveries , year=

Kang, U and Chau, Duen Horng and Faloutsos, Christos , booktitle=. Mining large graphs: Algorithms, inference, and discoveries , year=
[131]

2022 , publisher=

Wu, Lingfei and Cui, Peng and Pei, Jian and Zhao, Liang and Song, Le , title=. 2022 , publisher=. doi:10.1007/978-981-16-6054-2 , url=

2022 doi
[132]

and Bottou, L

Lecun, Y. and Bottou, L. and Bengio, Y. and Haffner, P. , journal=. Gradient-based learning applied to document recognition , year=
[133]

and Riley, Patrick F

Gilmer, Justin and Schoenholz, Samuel S. and Riley, Patrick F. and Vinyals, Oriol and Dahl, George E. , keywords =. Neural Message Passing for Quantum Chemistry , publisher =. 2017 , copyright =. doi:10.48550/ARXIV.1704.01212 , url =

2017 doi arXiv
[134]

2014 , booktitle =

Spectral networks and locally connected networks on graphs , author =. 2014 , booktitle =

2014
[135]

, title=

Monti, Federico and Boscaini, Davide and Masci, Jonathan and Rodola, Emanuele and Svoboda, Jan and Bronstein, Michael M. , title=. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , month=
[136]

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering , year=

Defferrard, Michaël and Bresson, Xavier and Vandergheynst, Pierre , booktitle=. Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering , year=
[137]

International Conference on Learning Representations , year=

Combining Neural Networks with Personalized PageRank for Classification on Graphs , author=. International Conference on Learning Representations , year=
[138]

Advances in Neural Information Processing Systems , editor=

Adaptive Diffusion in Graph Neural Networks , author=. Advances in Neural Information Processing Systems , editor=. 2021 , url=

2021
[139]

A Fractional Graph Laplacian Approach to Oversmoothing , volume =

Maskey, Sohir and Paolino, Raffaele and Bacho, Aras and Kutyniok, Gitta , booktitle =. A Fractional Graph Laplacian Approach to Oversmoothing , volume =
[140]

SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations , volume =

Wu, Qitian and Zhao, Wentao and Yang, Chenxiao and Zhang, Hengrui and Nie, Fan and Jiang, Haitian and Bian, Yatao and Yan, Junchi , booktitle =. SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations , volume =
[141]

The Twelfth International Conference on Learning Representations , year=

Polynormer: Polynomial-Expressive Graph Transformer in Linear Time , author=. The Twelfth International Conference on Learning Representations , year=
[142]

2021 , isbn=

Zhu, Meiqi and Wang, Xiao and Shi, Chuan and Ji, Houye and Cui, Peng , title=. 2021 , isbn=. doi:10.1145/3442381.3449953 , booktitle=

2021
[143]

ICML , year=

Finding Global Homophily in Graph Neural Networks When Meeting Heterophily , author=. ICML , year=
[144]

2023 , eprint=

NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification , author=. 2023 , eprint=

2023
[145]

NeurIPS , url=

BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation , author=. NeurIPS , url=
[146]

Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs , url =

Zhu, Jiong and Yan, Yujun and Zhao, Lingxiao and Heimann, Mark and Akoglu, Leman and Koutra, Danai , booktitle=. Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs , url =
[147]

2023 , isbn=

Huang, Jincheng and Du, Lun and Chen, Xu and Fu, Qiang and Han, Shi and Zhang, Dongmei , title=. 2023 , isbn=. doi:10.1145/3543507.3583335 , booktitle=

2023
[148]

International Conference on Learning Representations , year=

Graph Attention Networks , author=. International Conference on Learning Representations , year=
[149]

International Conference on Learning Representations , year=

Semi-Supervised Classification with Graph Convolutional Networks , author=. International Conference on Learning Representations , year=
[150]

NeurIPS , year=

Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited , author=. NeurIPS , year=
[151]

Revisiting Heterophily For Graph Neural Networks , volume =

Luan, Sitao and Hua, Chenqing and Lu, Qincheng and Zhu, Jiaqi and Zhao, Mingde and Zhang, Shuyuan and Chang, Xiao-Wen and Precup, Doina , booktitle =. Revisiting Heterophily For Graph Neural Networks , volume =
[152]

2023 , isbn=

Guo, Yuhe and Wei, Zhewei , title=. 2023 , isbn=. doi:10.1145/3580305.3599275 , booktitle=

2023
[153]

ICML , year=

How Powerful are Spectral Graph Neural Networks , author=. ICML , year=
[154]

ICML , pdf=

Graph Neural Networks with Learnable and Optimal Polynomial Bases , author=. ICML , pdf=
[155]

International Conference on Learning Representations , year=

Simple Spectral Graph Convolution , author=. International Conference on Learning Representations , year=
[156]

International Conference on Learning Representations , year=

Graph Wavelet Neural Network , author=. International Conference on Learning Representations , year=
[157]

Proceedings of the ACM Web Conference 2022 , year=

GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophily , author=. Proceedings of the ACM Web Conference 2022 , year=

2022
[158]

Proceedings of the 36th International Conference on Machine Learning , pages=

Simplifying Graph Convolutional Networks , author=. Proceedings of the 36th International Conference on Machine Learning , pages=. 2019 , volume=

2019
[159]

Proceedings of the 39th International Conference on Machine Learning , pages=

A New Perspective on the Effects of Spectrum in Graph Neural Networks , author=. Proceedings of the 39th International Conference on Machine Learning , pages=. 2022 , volume=

2022
[160]

2021 , url=

Moshe Eliasof and Eldad Haber and Eran Treister , booktitle=. 2021 , url=

2021
[161]

2020 , eprint=

SIGN: Scalable Inception Graph Neural Networks , author=. 2020 , eprint=

2020
[162]

Scalable Graph Neural Networks via Bidirectional Propagation , url =

Chen, Ming and Wei, Zhewei and Ding, Bolin and Li, Yaliang and Yuan, Ye and Du, Xiaoyong and Wen, Ji-Rong , booktitle =. Scalable Graph Neural Networks via Bidirectional Propagation , url =
[163]

Node Dependent Local Smoothing for Scalable Graph Learning , url =

Zhang, Wentao and Yang, Mingyu and Sheng, Zeang and Li, Yang and Ouyang, Wen and Tao, Yangyu and Yang, Zhi and CUI, Bin , booktitle =. Node Dependent Local Smoothing for Scalable Graph Learning , url =
[164]

International Conference on Learning Representations , year=

Adaptive Universal Generalized PageRank Graph Neural Network , author=. International Conference on Learning Representations , year=
[165]

2021 , eprint=

Bridging the Gap between Spatial and Spectral Domains: A Survey on Graph Neural Networks , author=. 2021 , eprint=

2021
[166]

2018 , eprint=

Representation Learning on Graphs: Methods and Applications , author=. 2018 , eprint=

2018
[167]

Deep Learning on Graphs: A Survey , year=

Zhang, Ziwei and Cui, Peng and Zhu, Wenwu , journal=. Deep Learning on Graphs: A Survey , year=
[168]

, journal=

Wu, Zonghan and Pan, Shirui and Chen, Fengwen and Long, Guodong and Zhang, Chengqi and Yu, Philip S. , journal=. A Comprehensive Survey on Graph Neural Networks , year=
[169]

ACM Transactions on Intelligent Systems and Technology , keywords =

Zhou, Yu and Zheng, Haixia and Huang, Xin and Hao, Shufeng and Li, Dengao and Zhao, Jumin , title =. ACM Transactions on Intelligent Systems and Technology , keywords =. 2022 , issue_date =. doi:10.1145/3495161 , month =

2022 doi
[170]

2022 , eprint=

A Survey on Graph Structure Learning: Progress and Opportunities , author=. 2022 , eprint=

2022
[171]

2023 , eprint=

A Survey on Spectral Graph Neural Networks , author=. 2023 , eprint=

2023
[172]

1997 , volume=

Chung, Fan , title = ". 1997 , volume=

1997
[173]

and Frossard, Pascal and Ortega, Antonio and Vandergheynst, Pierre , journal=

Shuman, David I and Narang, Sunil K. and Frossard, Pascal and Ortega, Antonio and Vandergheynst, Pierre , journal=. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , year=
[174]

Sandryhaila, Aliaksei and Moura, José M. F. , booktitle=. Discrete signal processing on graphs: Graph filters , year=
[175]

Sandryhaila, Aliaksei and Moura, José M. F. , booktitle=. Discrete signal processing on graphs: Graph fourier transform , year=
[176]

and Vetterli, M

Rioul, O. and Vetterli, M. , journal=. Wavelets and signal processing , year=
[177]

2011 , issn =

Wavelets on graphs via spectral graph theory , journal =. 2011 , issn =. doi:https://doi.org/10.1016/j.acha.2010.04.005 , url =

2011 doi
[178]

Graph Wavelets for Multiscale Community Mining , year=

Tremblay, Nicolas and Borgnat, Pierre , journal=. Graph Wavelets for Multiscale Community Mining , year=
[179]

Point Cloud Denoising Using Normal Vector-Based Graph Wavelet Shrinkage , year=

Watanabe, Ryosuke and Nonaka, Keisuke and Kato, Haruhisa and Pavez, Eduardo and Kobayashi, Tatsuya and Ortega, Antonio , booktitle=. Point Cloud Denoising Using Normal Vector-Based Graph Wavelet Shrinkage , year=
[180]

Large Graph Signal Denoising With Application to Differential Privacy , year=

Chedemail, Elie and de Loynes, Basile and Navarro, Fabien and Olivier, Baptiste , journal=. Large Graph Signal Denoising With Application to Differential Privacy , year=
[181]

EIT Imaging Regularization Based on Spectral Graph Wavelets , year=

Gong, Bo and Schullcke, Benjamin and Krueger-Ziolek, Sabine and Vauhkonen, Marko and Wolf, Gerhard and Mueller-Lisse, Ullrich and Moeller, Knut , journal=. EIT Imaging Regularization Based on Spectral Graph Wavelets , year=
[182]

Proceedings of the 30th ACM International Conference on Information and Knowledge Management , doi=

Chang, Heng and Rong, Yu and Xu, Tingyang and Huang, Wenbing and Sojoudi, Somayeh and Huang, Junzhou and Zhu, Wenwu , title=. Proceedings of the 30th ACM International Conference on Information and Knowledge Management , doi=. 2021 , pages=

2021
[183]

Multi-Scale Graph Convolutional Network With Spectral Graph Wavelet Frame , year=

Shen, Yangmei and Dai, Wenrui and Li, Chenglin and Zou, Junni and Xiong, Hongkai , journal=. Multi-Scale Graph Convolutional Network With Spectral Graph Wavelet Frame , year=
[184]

Advances in Neural Information Processing Systems , editor=

Deconvolutional Networks on Graph Data , author=. Advances in Neural Information Processing Systems , editor=. 2021 , url=

2021
[185]

Ms-Gwnn: Multi-Scale Graph Wavelet Neural Network for Breast Cancer Diagnosis , year=

Zhang, Mo and Dong, Bin and Li, Quanzheng , booktitle=. Ms-Gwnn: Multi-Scale Graph Wavelet Neural Network for Breast Cancer Diagnosis , year=
[186]

Graph Neural Networks With Lifting-Based Adaptive Graph Wavelets , year=

Xu, Mingxing and Dai, Wenrui and Li, Chenglin and Zou, Junni and Xiong, Hongkai and Frossard, Pascal , journal=. Graph Neural Networks With Lifting-Based Adaptive Graph Wavelets , year=
[187]

Proceedings of the 39th International Conference on Machine Learning , pages=

Rethinking Graph Neural Networks for Anomaly Detection , author=. Proceedings of the 39th International Conference on Machine Learning , pages=. 2022 , volume=

2022
[188]

Journal of Machine Learning Research , year=

Xuebin Zheng and Bingxin Zhou and Yu Guang Wang and Xiaosheng Zhuang , title=. Journal of Machine Learning Research , year=
[189]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =

Wang, Lei and Huang, Yuchun and Hou, Yaolin and Zhang, Shenman and Shan, Jie , title =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =
[190]

Proceedings of the AAAI Conference on Artificial Intelligence , author=

GMAN: A Graph Multi-Attention Network for Traffic Prediction , volume=. Proceedings of the AAAI Conference on Artificial Intelligence , author=. 2020 , month=. doi:10.1609/aaai.v34i01.5477 , number=

2020 doi
[191]

A Graph Neural Network Framework for Social Recommendations , year=

Fan, Wenqi and Ma, Yao and Li, Qing and Wang, Jianping and Cai, Guoyong and Tang, Jiliang and Yin, Dawei , journal=. A Graph Neural Network Framework for Social Recommendations , year=
[192]

, booktitle=

Shi, John and Moura, José M.F. , booktitle=. Topics in Graph Signal Processing: Convolution and Modulation , year=
[193]

Graphs, Convolutions, and Neural Networks: From Graph Filters to Graph Neural Networks , year=

Gama, Fernando and Isufi, Elvin and Leus, Geert and Ribeiro, Alejandro , journal=. Graphs, Convolutions, and Neural Networks: From Graph Filters to Graph Neural Networks , year=
[194]

, author=

Linear algebra and its applications. , author=. 2006 , publisher=

2006
[195]

Ortega, Antonio and Frossard, Pascal and Kovačević, Jelena and Moura, José M. F. and Vandergheynst, Pierre , journal=. Graph Signal Processing: Overview, Challenges, and Applications , year=
[196]

Graph Signal Processing for Machine Learning: A Review and New Perspectives , year=

Dong, Xiaowen and Thanou, Dorina and Toni, Laura and Bronstein, Michael and Frossard, Pascal , journal=. Graph Signal Processing for Machine Learning: A Review and New Perspectives , year=
[197]

Sandryhaila, Aliaksei and Moura, José M. F. , journal=. Discrete Signal Processing on Graphs , year=
[198]

1990 , adsurl=

Two-dimensional signal and image processing. 1990 , adsurl=

1990
[199]

2003 , isbn=

Bose, Tamal and Meyer, Francois , title=. 2003 , isbn=

2003
[200]

2020 , publisher=

Two-dimensional digital filters , author=. 2020 , publisher=

2020
[201]

Joint Graph Learning and Signal Recovery via Kalman Filter for Multivariate Auto-Regressive Processes , year=

Ramezani-Mayiami, Mahmoud and Beferull-Lozano, Baltasar , booktitle=. Joint Graph Learning and Signal Recovery via Kalman Filter for Multivariate Auto-Regressive Processes , year=
[202]

, booktitle=

Pang, Jiahao and Cheung, Gene and Ortega, Antonio and Au, Oscar C. , booktitle=. Optimal graph laplacian regularization for natural image denoising , year=
[203]

and Ribeiro, Alejandro R

Huang, Weiyu and Marques, Antonio G. and Ribeiro, Alejandro R. , journal=. Rating Prediction via Graph Signal Processing , year=
[204]

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’18) , year=

DeepInf: Social Influence Prediction with Deep Learning , author=. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’18) , year=
[205]

International Conference on Learning Representations , year=

Supervised Community Detection with Line Graph Neural Networks , author=. International Conference on Learning Representations , year=
[206]

Proceedings of the 35th International Conference on Machine Learning , pages=

Graph Networks as Learnable Physics Engines for Inference and Control , author=. Proceedings of the 35th International Conference on Machine Learning , pages=. 2018 , volume=

2018
[207]

Protein Interface Prediction using Graph Convolutional Networks , url =

Fout, Alex and Byrd, Jonathon and Shariat, Basir and Ben-Hur, Asa , booktitle =. Protein Interface Prediction using Graph Convolutional Networks , url =
[208]

, booktitle=

Zhao, Long and Peng, Xi and Tian, Yu and Kapadia, Mubbasir and Metaxas, Dimitris N. , booktitle=. Semantic Graph Convolutional Networks for 3D Human Pose Regression , year=
[209]

Learning Skeletal Graph Neural Networks for Hard 3D Pose Estimation , year=

Zeng, Ailing and Sun, Xiao and Yang, Lei and Zhao, Nanxuan and Liu, Minhao and Xu, Qiang , booktitle=. Learning Skeletal Graph Neural Networks for Hard 3D Pose Estimation , year=
[210]

Modulated Graph Convolutional Network for 3D Human Pose Estimation , year=

Zou, Zhiming and Tang, Wei , booktitle=. Modulated Graph Convolutional Network for 3D Human Pose Estimation , year=
[211]

doi:10.48550/ARXIV.2002.02126 , url=

He, Xiangnan and Deng, Kuan and Wang, Xiang and Li, Yan and Zhang, Yongdong and Wang, Meng , title=. doi:10.48550/ARXIV.2002.02126 , url=

2002 doi arXiv
[212]

The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval , year=

Xia, Lianghao and Xu, Yong and Huang, Chao and Dai, Peng and Bo, Liefeng , title=. The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval , year=. doi:10.1145/3404835.3462972 , pages=
[213]

Proceedings of the 39th International Conference on Machine Learning , pages=

DSTAGNN: Dynamic Spatial-Temporal Aware Graph Neural Network for Traffic Flow Forecasting , author=. Proceedings of the 39th International Conference on Machine Learning , pages=. 2022 , volume=

2022
[214]

Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=

Spatial-Temporal Graph ODE Networks for Traffic Flow Forecasting , author=. Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=
[215]

1987 , publisher=

Introduction to numerical analysis , author=. 1987 , publisher=

1987
[216]

Digital signal processing , year=

Jogh G.Proakis , journal=. Digital signal processing , year=
[217]

The Mathematical Gazette , publisher=

Fourier Transforms , author=. The Mathematical Gazette , publisher=. 1951 , pages=. doi:10.2307/3609365 , number=

1951 doi
[218]

2009 , publisher=

Delta functions: Introduction to generalised functions , author=. 2009 , publisher=

2009
[219]

Encyclopedia of Biostatistics , volume=

Polynomial approximation , author=. Encyclopedia of Biostatistics , volume=. 1998 , publisher=

1998
[220]

2003 , publisher=

Interpolation and approximation by polynomials , author=. 2003 , publisher=. doi:10.1007/b97417 , isbn=

2003 doi
[221]

2008 , publisher=

Polynomial approximation of differential equations , author=. 2008 , publisher=

2008
[222]

Constructive Approximation , volume=

On multivariate polynomial interpolation , author=. Constructive Approximation , volume=. 1990 , publisher=

1990
[223]

Advances in Computational Mathematics , volume=

Polynomial interpolation in several variables , author=. Advances in Computational Mathematics , volume=. 2000 , publisher=

2000
[224]

1939 , publisher=

Orthogonal polynomials , author=. 1939 , publisher=

1939
[225]

2011 , publisher=

An introduction to orthogonal polynomials , author=. 2011 , publisher=

2011
[226]

2020 , publisher=

Chebyshev polynomials , author=. 2020 , publisher=

2020
[227]

2013 , publisher=

Bernstein polynomials , author=. 2013 , publisher=

2013
[228]

Journal of Computational and graphical Statistics , volume=

Shape-constrained estimation using nonnegative splines , author=. Journal of Computational and graphical Statistics , volume=. 2014 , publisher=

2014
[229]

Advances in Neural Information Processing Systems , year=

Understanding Non-linearity in Graph Neural Networks from the Bayesian-Inference Perspective , author=. Advances in Neural Information Processing Systems , year=
[230]

Church History , publisher=

Ockham, Studies and Selections , author=. Church History , publisher=. 1938 , pages=. doi:10.2307/3160457 , number=

1938 doi
[231]

and Salakhutdinov, Ruslan , title =

Yang, Zhilin and Cohen, William W. and Salakhutdinov, Ruslan , title =. doi:10.48550/ARXIV.1603.08861 , url =

doi arXiv
[232]

2019 , eprint=

Pitfalls of Graph Neural Network Evaluation , author=. 2019 , eprint=

2019
[233]

International Conference on Learning Representations , year=

Geom-GCN: Geometric Graph Convolutional Networks , author=. International Conference on Learning Representations , year=
[234]

Journal of Complex Networks , volume =

Rozemberczki, Benedek and Allen, Carl and Sarkar, Rik , title =. Journal of Complex Networks , volume =. 2021 , month =. doi:10.1093/comnet/cnab014 , url =

2021 doi
[235]

Open Graph Benchmark: Datasets for Machine Learning on Graphs , volume =

Hu, Weihua and Fey, Matthias and Zitnik, Marinka and Dong, Yuxiao and Ren, Hongyu and Liu, Bowen and Catasta, Michele and Leskovec, Jure , booktitle =. Open Graph Benchmark: Datasets for Machine Learning on Graphs , volume =
[236]

Advances in Neural Information Processing Systems , editor=

Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods , author=. Advances in Neural Information Processing Systems , editor=
[237]

doi:10.1145/1557019.1557108 , booktitle=

Tang, Jie and Sun, Jimeng and Wang, Chi and Yang, Zi , title=. doi:10.1145/1557019.1557108 , booktitle=
[238]

A critical look at the evaluation of

Oleg Platonov and Denis Kuznedelev and Michael Diskin and Artem Babenko and Liudmila Prokhorenkova , booktitle=. A critical look at the evaluation of. 2023 , url=

2023
[239]

doi:10.48550/ARXIV.1903.02428 , url =

Fey, Matthias and Lenssen, Jan Eric , title =. doi:10.48550/ARXIV.1903.02428 , url =

1903 doi arXiv
[240]

and Ba, Jimmy , keywords =

Kingma, Diederik P. and Ba, Jimmy , keywords =. Adam: A Method for Stochastic Optimization , publisher =. 2014 , copyright =. doi:10.48550/ARXIV.1412.6980 , url =

2014 doi arXiv
[241]

Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , month =

He, Kaiming and Zhang, Xiangyu and Ren, Shaoqing and Sun, Jian , title =. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , month =
[242]

ICML , year=

Simple and Deep Graph Convolutional Networks , author=. ICML , year=
[243]

Proceedings of the 39th International Conference on Machine Learning , pages=

Optimization-Induced Graph Implicit Nonlinear Diffusion , author=. Proceedings of the 39th International Conference on Machine Learning , pages=. 2022 , volume=

2022
[244]

2019 , eprint=

Optuna: A Next-generation Hyperparameter Optimization Framework , author=. 2019 , eprint=

2019
[245]

and Kumar, Ravi and Raghavan, Prabhakar and Rajagopalan, Sridhar and Tomkins, Andrew S

Kleinberg, Jon M. and Kumar, Ravi and Raghavan, Prabhakar and Rajagopalan, Sridhar and Tomkins, Andrew S. The Web as a Graph: Measurements, Models, and Methods. Computing and Combinatorics. 1999

1999
[246]

Proceedings of The 35th Uncertainty in Artificial Intelligence Conference , pages=

Fisher-Bures Adversary Graph Convolutional Networks , author=. Proceedings of The 35th Uncertainty in Artificial Intelligence Conference , pages=. 2020 , editor=

2020
[247]

Graph Random Neural Networks for Semi-Supervised Learning on Graphs , url=

Feng, Wenzheng and Zhang, Jie and Dong, Yuxiao and Han, Yu and Luan, Huanbo and Xu, Qian and Yang, Qiang and Kharlamov, Evgeny and Tang, Jie , booktitle=. Graph Random Neural Networks for Semi-Supervised Learning on Graphs , url=
[248]

International Conference on Learning Representations , year=

DropEdge: Towards Deep Graph Convolutional Networks on Node Classification , author=. International Conference on Learning Representations , year=
[249]

2022 , isbn=

Feng, Wenzheng and Dong, Yuxiao and Huang, Tinglin and Yin, Ziqi and Cheng, Xu and Kharlamov, Evgeny and Tang, Jie , title=. 2022 , isbn=. doi:10.1145/3485447.3512044 , booktitle=

2022
[250]

Advances in Neural Information Processing Systems , editor=

Directed Graph Contrastive Learning , author=. Advances in Neural Information Processing Systems , editor=. 2021 , url=

2021
[251]

Universal Graph Contrastive Learning with a Novel

Ko, Taewook and Choi, Yoonhyuk and Kim, Chong-Kwon , booktitle=. Universal Graph Contrastive Learning with a Novel. 2023 , editor=

2023
[252]

The Eleventh International Conference on Learning Representations , year=

Spectral Augmentation for Self-Supervised Learning on Graphs , author=. The Eleventh International Conference on Learning Representations , year=
[253]

Epperson , title=

James F. Epperson , title=. The American Mathematical Monthly , volume=. 1987 , publisher=. doi:10.1080/00029890.1987.12000642 , URL=

1987
[254]

, title=

Gil, Amparo and Segura, Javier and Temme, Nico M. , title=. 2007 , doi=

2007
[255]

SIAM Journal on Applied Mathematics , volume=

On the matrix equations AX-XB=C and AX-YB=C , author=. SIAM Journal on Applied Mathematics , volume=. 1977 , publisher=

1977
[256]

Linear Algebra and its Applications , volume=

The matrix equation ax- yb= c , author=. Linear Algebra and its Applications , volume=. 1979 , publisher=

1979
[257]

2015 , publisher=

Generalized Sylvester equations: unified parametric solutions , author=. 2015 , publisher=

2015
[258]

The Equations ax- yb= c and ax- xb= c in Matrices , author=. Proc. Amer. Math. Soc , volume=
[259]

2016 , publisher=

Deep learning , author=. 2016 , publisher=

2016
[260]

Traffic sign recognition with multi-scale Convolutional Networks , year=

Sermanet, Pierre and LeCun, Yann , booktitle=. Traffic sign recognition with multi-scale Convolutional Networks , year=
[261]

Multi-column deep neural networks for image classification , year=

Ciregan, Dan and Meier, Ueli and Schmidhuber, Jürgen , booktitle=. Multi-column deep neural networks for image classification , year=
[262]

ImageNet Classification with Deep Convolutional Neural Networks , url=

Krizhevsky, Alex and Sutskever, Ilya and Hinton, Geoffrey E , booktitle=. ImageNet Classification with Deep Convolutional Neural Networks , url=
[263]

2015 , eprint=

How far can we go without convolution: Improving fully-connected networks , author=. 2015 , eprint=

2015
[264]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month=

Li, Pengyu and Wang, Biao and Zhang, Lei , title=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month=. 2021 , pages=

2021
[265]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month=

An, Xiang and Deng, Jiankang and Guo, Jia and Feng, Ziyong and Zhu, XuHan and Yang, Jing and Liu, Tongliang , title=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month=. 2022 , pages=

2022
[266]

2017 , eprint=

An Equivalence of Fully Connected Layer and Convolutional Layer , author=. 2017 , eprint=

2017
[267]

Proceedings of the American Mathematical Society , volume=

Equivalence of approximation by convolutional neural networks and fully-connected networks , author=. Proceedings of the American Mathematical Society , volume=
[268]

Proceedings of the 38th International Conference on Machine Learning , pages=

Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depth , author=. Proceedings of the 38th International Conference on Machine Learning , pages=. 2021 , editor=

2021
[269]

Page and S

L. Page and S. Brin and R. Motwani and T. Winograd , title =. Technical report, stanford University , year =
[270]

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering , url =

Defferrard, Micha\". Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering , url =. Advances in Neural Information Processing Systems , editor =
[271]

Proceedings of the European Conference on Computer Vision (ECCV) , month =

Wang, Chu and Samari, Babak and Siddiqi, Kaleem , title =. Proceedings of the European Conference on Computer Vision (ECCV) , month =
[272]

Spectral Temporal Graph Neural Network for Multivariate Time-series Forecasting , url =

Cao, Defu and Wang, Yujing and Duan, Juanyong and Zhang, Ce and Zhu, Xia and Huang, Congrui and Tong, Yunhai and Xu, Bixiong and Bai, Jing and Tong, Jie and Zhang, Qi , booktitle =. Spectral Temporal Graph Neural Network for Multivariate Time-series Forecasting , url =
[273]

Spectral Temporal Graph Neural Network for Trajectory Prediction , year=

Cao, Defu and Li, Jiachen and Ma, Hengbo and Tomizuka, Masayoshi , booktitle=. Spectral Temporal Graph Neural Network for Trajectory Prediction , year=
[274]

Proceedings of the First Learning on Graphs Conference , pages =

MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian , author =. Proceedings of the First Learning on Graphs Conference , pages =. 2022 , editor =

2022
[275]

and Feris, Rogerio S

Cheng, Yu and Yu, Felix X. and Feris, Rogerio S. and Kumar, Sanjiv and Choudhary, Alok and Chang, Shi-Fu , title =. Proceedings of the IEEE International Conference on Computer Vision (ICCV) , month =
[276]

Proceedings of the 32nd International Conference on Machine Learning , pages=

Compressing Neural Networks with the Hashing Trick , author=. Proceedings of the 32nd International Conference on Machine Learning , pages=. 2015 , editor=

2015
[277]

The Mathematics of Generalization , pages=

Simplifying neural networks by soft weight sharing , author=. The Mathematics of Generalization , pages=. 2018 , publisher=

2018
[278]

ICML 2020 Workshop on Graph Representation Learning and Beyond (GRL+ 2020) , archivePrefix=

TUDataset: A collection of benchmark datasets for learning with graphs , author=. ICML 2020 Workshop on Graph Representation Learning and Beyond (GRL+ 2020) , archivePrefix=. 2007.08663 , url=

2020 arXiv
[279]

, title =

Yanardag, Pinar and Vishwanathan, S.V.N. , title =. 2015 , isbn =. doi:10.1145/2783258.2783417 , booktitle =

2015
[280]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence , series =

Zhang, Muhan and Cui, Zhicheng and Neumann, Marion and Chen, Yixin , title =. Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence , series =. 2018 , isbn =

2018
[281]

Universal Invariant and Equivariant Graph Neural Networks , url =

Keriven, Nicolas and Peyr\'. Universal Invariant and Equivariant Graph Neural Networks , url =. Advances in Neural Information Processing Systems , editor =
[282]

1999 , publisher=

Modern applied statistics with S-PLUS , author=. 1999 , publisher=

1999
[283]

Encyclopedia of statistical sciences , volume=

Spearman correlation coefficients, differences between , author=. Encyclopedia of statistical sciences , volume=. 2004 , publisher=

2004
[284]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =

Rebuffi, Sylvestre-Alvise and Fong, Ruth and Ji, Xu and Vedaldi, Andrea , title =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =
[285]

EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruning

Li, Bailin and Wu, Bowen and Su, Jiang and Wang, Guangrun. EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruning. Computer Vision -- ECCV 2020. 2020

2020
[286]

Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction , url =

Yun, Seongjun and Kim, Seoyoon and Lee, Junhyun and Kang, Jaewoo and Kim, Hyunwoo J , booktitle =. Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction , url =
[287]

Proceedings of the 37th International Conference on Machine Learning , pages =

Graph Convolutional Network for Recommendation with Low-pass Collaborative Filters , author =. Proceedings of the 37th International Conference on Machine Learning , pages =. 2020 , editor =

2020
[288]

Proceedings of the AAAI Conference on Artificial Intelligence , author=

Low-Pass Graph Convolutional Network for Recommendation , volume=. Proceedings of the AAAI Conference on Artificial Intelligence , author=. 2022 , month=. doi:10.1609/aaai.v36i8.20878 , number=

2022 doi
[289]

2021 , isbn =

Dong, Yushun and Ding, Kaize and Jalaian, Brian and Ji, Shuiwang and Li, Jundong , title =. 2021 , isbn =. doi:10.1145/3459637.3482226 , booktitle =

2021
[290]

Proceedings of the 15th Asian Conference on Machine Learning , pages=

Unleashing the Power of High-pass Filtering in Continuous Graph Neural Networks , author=. Proceedings of the 15th Asian Conference on Machine Learning , pages=. 2024 , editor=

2024
[291]

Proceedings of the 38th International Conference on Machine Learning , pages=

How Framelets Enhance Graph Neural Networks , author=. Proceedings of the 38th International Conference on Machine Learning , pages=. 2021 , editor=

2021
[292]

Saff, Edward B and Varga, Richard S , year=. Pad
[293]

1979 , publisher=

Approximation with rational functions , author=. 1979 , publisher=

1979
[294]

Applications , author=

Approximate construction of rational approximations and the effect of error autocorrection. Applications , author=. 2001 , eprint=

2001
[295]

Rational Approximation and Interpolation: Proceedings of the United Kingdom-United States Conference held at Tampa, Florida, December 12--16, 1983 , pages=

Some properties and applications of Chebyshev polynomial and rational approximation , author=. Rational Approximation and Interpolation: Proceedings of the United Kingdom-United States Conference held at Tampa, Florida, December 12--16, 1983 , pages=. 2006 , organization=

1983
[296]

Rational approximation of real functions , author=
[297]

Theory of approximation , author=
[298]

BIT Numerical Mathematics , year=

Rational approximation of decay-type functions , author=. BIT Numerical Mathematics , year=
[299]

Mathematics of Computation , volume=

Numerical Chebyshev approximation by interpolating rationals , author=. Mathematics of Computation , volume=
[300]

Two simple algorithms for discrete rational approximation , author=

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.

[1] [1]

A note on over-smoothing for graph neural networks, 2020

Chen Cai and Yusu Wang. A note on over-smoothing for graph neural networks, 2020. URL https://arxiv.org/abs/2006.13318

arXiv 2020

[2] [2]

Grand: Graph neural diffusion

Ben Chamberlain, James Rowbottom, Maria I Gorinova, Michael Bronstein, Stefan Webb, and Emanuele Rossi. Grand: Graph neural diffusion. In Marina Meila and Tong Zhang, editors, Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pages 1407--1418. PMLR, 18--24 Jul 2021. URL https://pr...

2021

[3] [3]

Graph coarsening: from scientific computing to machine learning

Jie Chen, Yousef Saad, and Zechen Zhang. Graph coarsening: from scientific computing to machine learning. SeMA Journal, 79 0 (1): 0 187--223, 2022 a

2022

[4] [4]

Optimization-induced graph implicit nonlinear diffusion

Qi Chen, Yifei Wang, Yisen Wang, Jiansheng Yang, and Zhouchen Lin. Optimization-induced graph implicit nonlinear diffusion. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, editors, Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, pa...

2022

[5] [5]

A gromov- W asserstein geometric view of spectrum-preserving graph coarsening

Yifan Chen, Rentian Yao, Yun Yang, and Jie Chen. A gromov- W asserstein geometric view of spectrum-preserving graph coarsening. In Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett, editors, Proceedings of the 40th International Conference on Machine Learning, volume 202 of Proceedings of Machine Learni...

2023

[6] [6]

Adaptive universal generalized pagerank graph neural network

Eli Chien, Jianhao Peng, Pan Li, and Olgica Milenkovic. Adaptive universal generalized pagerank graph neural network. In International Conference on Learning Representations, 2021. URL https://openreview.net/forum?id=n6jl7fLxrP

2021

[7] [7]

Spectral Graph Theory , volume 92

Fan Chung. Spectral Graph Theory , volume 92. CBMS Regional Conference Series in Mathematics, 1997. ISBN 978-0-8218-0315-8. doi:/10.1090/cbms/092

doi:10.1090/cbms/092 1997

[8] [8]

Elements of information theory

Thomas M Cover. Elements of information theory. John Wiley & Sons, 1999

1999