Pith. sign in

REVIEW 4 major objections 5 minor 46 references

Soft causal learning for generalized molecule property prediction: An environment perspective

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

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

Pith's one-line read The paper claims that modeling molecular environments as first-class, interactive variables—rather than discarding them as spurious—lets a graph neural network generalize to out-of-distribution molecules, and reports state-of-the-art…

desk verdict A promising environment-centric OOD molecule pipeline with solid-looking experiments, but the core E-GIB bound is mis-specified (Eqs. 4-5) in a load-bearing way and needs repair before the theory can be taken seriously. read the letter →

arxiv 2505.06283 v1 pith:4AJDZJBJ submitted 2025-05-07 cs.LG q-bio.QMstat.ML

Limin Li , Kuo Yang , Wenjie Du , Pengkun Wang , Zhengyang Zhou , Yang Wang This is my paper · ORCID
classification cs.LGq-bio.QMstat.ML
keywords out-of-distributiongeneralizationmolecularpropertypredictiongraphneuralnetworksenvironmentdisentanglementinformationbottleneckcausalinvariancegrowthDrugOODbenchmark
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 out-of-distribution generalization in molecular property prediction fails not only because models rely on spurious correlations, but because the environment—the molecular context around a functional group—is itself expanding and interacting with the causal substructure. It proposes CauEMO, which grows chemically plausible environments through a charge-conservation-constrained graph generator, disentangles label-irrelevant environment information with an environment-graph information bottleneck, and then lets environments and invariances interact through a cross-attention gated bridge. The reported results on six DrugOOD benchmarks and additional real-world and synthetic datasets show consistent improvements over invariant-rationale and environment-based baselines. If this design is right, the practical takeaway is that modeling environments as first-class variables, rather than discarding them, is the route to models that generalize to unseen scaffolds and molecular sizes.

What carries the argument

The central object is the molecular environment, defined as the non-deterministic group set $G_N$ that surrounds the functional-group set $G_I$; the framework's claim is that these environment substructures are informative and interactive rather than noise to be discarded. Three mechanisms carry the argument: (1) a knowledge-enhanced environment generator that ranks $G_N$ substructures by atom count and concatenates them to $G_I$ only when the chemical crosslink/charge-conservation condition of Eq. (1) holds, producing new training graphs; (2) an Environment-Graph Information Bottleneck with objective $\min_{G_E} I(Y,G_E)-\beta I(G,G_E)$, implemented as a stochastic attention extractor and variational KL estimator, that forces $G_E$ to be label-irrelevant while still covering the graph; (3) a Soft Causal Interaction that applies cross-attention between environment and invariance representations and a Gated Causal Bridge, $f_{gate}=\tanh(W_{gate}Z_e)$, so each branch is updated with a soft weighted copy of the other before the final predictor. The machinery's job is to make environment information available to the predictor in a chemically grounded and dynamically weighted way, which is what the paper claims gives the OOD gains.

What would settle it

Run CauEMO on a fresh scaffold-based split of a DrugOOD-style assay that is held out entirely, then apply a standard cheminformatics validity check to every graph produced by the environment growth generator. If a substantial fraction of generated graphs fails the validity check, or if CauEMO's ROC-AUC no longer exceeds that of GALA and IGM on the held-out split, the claim that chemistry-grounded environment growth plus soft interaction drives OOD generalization is falsified.

Watch

Extended reading notes

Core claim

CauEMO's central claim is that a molecule's property is not fully determined by its invariant functional-group substructure; the surrounding environment contributes information and interacts with the invariant part, so OOD models should represent both and let them exchange information softly. The framework treats the environment as a mediating variable, extracts it with an E-GIB objective that minimizes label information while maximizing graph coverage, and fuses environment and invariance via cross-attention and a gated causal bridge. On the DrugOOD benchmark, CauEMO reports the best ROC-AUC on five of six assay/scaffold/size splits and competitive results on the remaining split, and the ablations indicate that each of the three modules—chemistry-guided growth, E-GIB disentanglement, and soft interaction—contributes to the gain.

Load-bearing premise

The load-bearing premise is that a molecule really can be divided into a property-determining functional-group part and a non-deterministic environment part, and that the charge-conservation rule of Eq. (1) is enough to guarantee every concatenation is a chemically valid training molecule—yet the paper never explains how those two parts are identified, so the split itself is the step to scrutinize.

Editorial extensions

If this is right

  • OOD generalization on molecular graphs improves when training includes grown environments that obey chemical validity constraints, rather than only the invariant subgraphs shared across domains.
  • Disentangling a label-irrelevant but graph-covering environment representation with an information-bottleneck objective is sufficient to get most of the benefit attributed to more complex causal-discovery methods.
  • Explicit soft interaction between environment and invariance representations—cross-attention plus a gated residual bridge—yields clearer extraction of causal substructures than training the two branches independently.
  • On DrugOOD assay, scaffold, and size splits, CauEMO's environment-first strategy reports the best ROC-AUC among compared baselines on five of six splits, with the remaining split also competitive.
  • The same architecture transfers to non-OOD molecular benchmarks (MOLHIV, BBBP, SIDER, MUTAG, Spurious-Motif), indicating the environment-modeling gains do not come at the expense of in-distribution accuracy.

Reading between the lines

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

  • Editorial inference: the same environment-growth-plus-soft-interaction recipe could be ported to other graph domains—materials, social networks, or spatiotemporal data—where 'environment' is the context around a node or motif that shifts across deployment sites.
  • Editorial inference: the hand-defined split into functional-group set $G_I$ and non-deterministic set $G_N$ is the least specified part of the pipeline, so a natural testable extension is learning this split end-to-end or deriving it from chemical ontology rather than fixing it a priori.
  • Editorial inference: if the charge-conservation check in Eq. (1) is the only validity filter, then generated graphs that pass it may still be synthetically inaccessible; stricter filters (synthetic accessibility, strain energy) would tell whether the augmentation gain comes from chemical plausibility or merely from graph diversity.
  • Editorial inference: the paper's own ablation (CauEMO-Random) suggests random growth hurts, which implies the method's value hinges on chemistry-grounded augmentation; a sharp test is whether a chemically random but valid generator (e.g., swapping arbitrary valid fragments) retains the gains.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 5 minor

Summary. The manuscript proposes CauEMO, a graph neural network framework for out-of-distribution (OOD) molecular property prediction. The method has three components: a chemistry-guided environment growth generator that concatenates functional groups with non-deterministic groups to create new training graphs, an Environment-Graph Information Bottleneck (E-GIB) objective intended to disentangle label-irrelevant environment substructures, and a soft causal interaction module with cross-attention and a gated causal bridge that fuses environment and invariant representations. The authors report experiments on DrugOOD, MOLHIV, BBBP, SIDER, MUTAG, and Spurious-Motif datasets, claiming state-of-the-art or competitive OOD performance and improved interpretability.

Significance. If the proposed method were sound, it would address a real limitation of invariant-rationale approaches to graph OOD generalization, namely that environments can expand and interact with invariant substructures. The paper is commendable for attempting to model environments explicitly, for including ablations that isolate each component, and for evaluating on public benchmarks with multiple baselines. However, the central theoretical contribution, the E-GIB objective, is not mathematically valid as formulated. The derivation in Section 3.3 contains an ill-defined KL divergence and a sign error that reverses the intended effect, so the claimed environment disentanglement is not supported. Because this objective is the mechanism that supposedly separates label-irrelevant environment information and defines the causal invariance as its complement, the central claim of the paper is undermined. The paper also leaves the functional-group decomposition and the chemical validity rule underspecified, making the augmentation step not reproducible.

major comments (4)
  1. [Section 3.3, Eq. (4)] Equation (4) states I(G,GE) ≤ KL(Pφ(G|GE)||Q(GE)), but the KL divergence is between a distribution over graphs conditional on an environment and a distribution over environments. These distributions live on different spaces, so the KL divergence is not well-defined. The standard variational information bottleneck upper bound is I(G;GE) ≤ E_G[KL(pφ(GE|G)||q(GE))], requiring a conditional environment distribution given the graph. As printed, Eq. (4) cannot serve as the theoretical justification for the E-GIB objective.
  2. [Section 3.3, Eq. (5) and Algorithm 1] The learning objective in Eq. (5) includes min E[logPθ(Y|GE)], and the same positive environment-prediction term appears in Algorithm 1. Minimizing this term maximizes the conditional likelihood of the label given the environment, which makes GE more predictive of Y, not less. This is the opposite of the stated goal of suppressing label-relevant information in the environment representation. The text says the first term 'inherits the tractable lower bound obtained from literature [36]', but as written the objective cannot produce label-irrelevant environments.
  3. [Section 3.4 and Section 3.3] The causal invariance representation Zc is defined as the complement of the learned environment subgraph, i.e., GI = G − GE (Section 3.3, final paragraph). Consequently, the claim that CauEMO discovers 'causal invariance' is tautological: whatever the E-GIB leaves out is labeled causal. There is no independent causal identification, no test of invariance across environments beyond the benchmark performance, and no comparison of the extracted subgraph with known pharmacophores or ground-truth causal structures on real datasets. The claim that the model identifies true causal associations is therefore not supported.
  4. [Section 3.2, Eq. (1)] The environment growth generator relies on a decomposition into a functional group set GI and a non-deterministic group set GN, but the paper never specifies how these sets are constructed, what chemical criteria define 'functional' versus 'non-deterministic', or how the charge-conservation rule in Eq. (1) is operationalized as an acceptance condition for graph concatenation. Without this information, the data augmentation step is not reproducible, and the assertion that generated graphs satisfy fundamental chemistry principles is unverifiable.
minor comments (5)
  1. [Abstract and Introduction] There are typos and grammatical issues, e.g., 'expaned' in the abstract and 'enviroment' in Section 1; a careful proofread is needed.
  2. [Section 3.2, Eq. (2)] The notation 'G0 = Gi, Gnew = Concat[G0;Gj]' is unclear; it should specify how the concatenation operates on node and edge sets and how the result relates to the original graph.
  3. [Section 3.4, Eq. (11)] The Gated Causal Bridge updates Ze and Zc in a mutually dependent way, but the equations do not specify whether Ze and Zc on the right-hand side are the pre-attention or post-attention values; this ambiguity makes the implementation difficult to reproduce.
  4. [Section 4.4, Table 2] On Spurious-Motif 0.5 and 0.7, IGM outperforms CauEMO, which is acknowledged in the text but should be addressed more directly in the discussion of superiority claims.
  5. [Section 4.1] The description of the Spurious-Motif dataset says 'each graph is composed of one base S and one motif C', but the degree of spurious correlation b is not defined precisely; please clarify how b controls the correlation between the base and the label.

Circularity Check

1 steps flagged · score 3.0 of 10

Benchmark claims are externally grounded; only the causal-invariance interpretation is definitionally tied to the model's own complement split.

  1. self definitional [Section 3.3, last paragraph (E-GIB based irrelevant environment disentanglement)]
    "Finally, the Marginal Distribution can be Controlled via Q. Then we can simultaneously obtain the maximal label-irrelevant information GE, and achieve the complementary subgraph to GE, i.e., GI = G−E, which allows further refinement and environment-invariance interactions."

    The 'causal invariance' representation is not estimated or validated independently; it is defined as the set-theoretic complement of the learned environment subgraph. Consequently, the later narrative that CauEMO 'disentangles' environments from causal invariance, and the visualization claims that it 'identifies invariant property substructures,' restate the definitional split GI = G−GE rather than providing an independent causal estimate. The OOD accuracy comparisons against external baselines are not reduced by this definition, so the circularity is confined to the causal-interpretation layer of the paper.

full rationale

The paper's headline empirical claim—state-of-the-art ROC-AUC/accuracy on DrugOOD, OGB, MUTAG, and Spurious-Motif—is evaluated against public benchmark datasets and external baselines, so it does not reduce to a fitted parameter or to the authors' own definitions. The E-GIB derivations in Eqs. (3)-(5) are mathematically problematic (KL between different sample spaces and a sign that maximizes rather than suppresses label information in GE), but these are correctness defects rather than circular reductions. The one definitional circularity is in the causal interpretation: GI is defined as the complement of GE, so statements that the model discovers or separates causal invariance are true by construction. This does not invalidate the benchmark comparisons but does mean the paper's causal vocabulary is not independently supported. No load-bearing self-citation was found; references to the authors' prior work appear in related-work context only, and the information-bottleneck bounds are cited from external work. Overall score 3 reflects a minor, interpretation-level circularity with an otherwise self-contained empirical evaluation.

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

The framework depends on a small number of hand-chosen parameters and assumptions. The beta and dimension hyperparameters are tuned on the evaluation datasets. The functional group split and the charge-conservation rule are load-bearing but under-specified. No new physical entities are introduced.

free parameters (4)
  • beta (E-GIB balance) = 1
    Set after sweeping [0.5,1.4] on MUTAG and BBBP (Section 4.6); controls the trade-off between label-irrelevance and graph coverage in Eq (3).
  • Latent dimension d of Ze, Zc, Zce = 64
    Selected from {16,32,64,128} on MUTAG and BBBP; the capacity of the soft causal interaction depends on it.
  • Functional group split G_I vs G_N
    Hand-chosen domain decomposition used by the environment generator to decide which substructures are causal and which are environmental; not derived algorithmically in the paper.
  • Charge-conservation acceptance rule in Eq (1)
    The rule determines which generated graphs are kept; its implementation details, such as how p_ij is computed, are not specified.
assumptions (4)
  • standard math Variational information bottleneck upper bounds can be used to optimize mutual information terms
    Invoked in Section 3.3 for E-GIB; the specific bound in Eq (4) is stated incorrectly, comparing distributions over different spaces, so the standard tool is being misapplied.
  • domain assumption Molecules can be decomposed into causal functional groups and non-deterministic environment groups
    Section 3.2 relies on this decomposition; no evidence or algorithm is given to establish that the split corresponds to real chemical causality.
  • domain assumption Conservation of charge ensures chemically valid concatenations
    Eq (1) is used to accept or reject new graphs; the paper does not validate that generated graphs are synthesizable or chemically meaningful.
  • ad hoc to paper Minimizing E[log P_theta(Y|GE)] suppresses label-relevant information in the environment representation
    Section 3.3; this objective is the negative of standard cross-entropy and has no stability analysis, and the variational bound used to justify it is mis-specified.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Soft causal learning for generalized molecule property prediction: An environment perspective." pith.science (2026). https://pith.science/paper/4AJDZJBJ

@misc{pith2026250506283,
  author       = {Pith},
  title        = {Pith review of: Soft causal learning for generalized molecule property prediction: An environment perspective},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4AJDZJBJ}},
  note         = {Machine review of arXiv:2505.06283}
}
read the original abstract

Learning on molecule graphs has become an increasingly important topic in AI for science, which takes full advantage of AI to facilitate scientific discovery. Existing solutions on modeling molecules utilize Graph Neural Networks (GNNs) to achieve representations but they mostly fail to adapt models to out-of-distribution (OOD) samples. Although recent advances on OOD-oriented graph learning have discovered the invariant rationale on graphs, they still ignore three important issues, i.e., 1) the expanding atom patterns regarding environments on graphs lead to failures of invariant rationale based models, 2) the associations between discovered molecular subgraphs and corresponding properties are complex where causal substructures cannot fully interpret the labels. 3) the interactions between environments and invariances can influence with each other thus are challenging to be modeled. To this end, we propose a soft causal learning framework, to tackle the unresolved OOD challenge in molecular science, from the perspective of fully modeling the molecule environments and bypassing the invariant subgraphs. Specifically, we first incorporate chemistry theories into our graph growth generator to imitate expaned environments, and then devise an GIB-based objective to disentangle environment from whole graphs and finally introduce a cross-attention based soft causal interaction, which allows dynamic interactions between environments and invariances. We perform experiments on seven datasets by imitating different kinds of OOD generalization scenarios. Extensive comparison, ablation experiments as well as visualized case studies demonstrate well generalization ability of our proposal.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

46 extracted references · 33 canonical work pages

  1. [36]

    arXiv preprint arXiv:2010.05563 (2020)

    Yu, J., Xu, T., Rong, Y., Bian, Y., Huang, J., He, R.: Graph information bottleneck for subgraph recognition. arXiv preprint arXiv:2010.05563 (2020)

    arXiv 2020

  2. [1]

    Wiley Interdisciplinary Reviews: Computational Molecular Science 4(1), 26–33 (2014) 19

    Barbatti, M., Ruckenbauer, M., Plasser, F., Pittner, J., Granucci, G., Persico, M., Lischka, H.: Newton-x: a surface-hopping program for nonadiabatic molecu- lar dynamics. Wiley Interdisciplinary Reviews: Computational Molecular Science 4(1), 26–33 (2014) 19

    work page 2014

  3. [2]

    Briefings in Bioinformatics 24(1), 560 (2023)

    Du, W., Yang, X., Wu, D., Ma, F., Zhang, B., Bao, C., Huo, Y., Jiang, J., Chen, X., Wang, Y.: Fusing 2d and 3d molecular graphs as unambiguous molecular descriptors for conformational and chiral stereoisomers. Briefings in Bioinformatics 24(1), 560 (2023)

    work page 2023

  4. [3]

    IEEE Transactions on Pattern Analysis and Machine Intelligence (2023)

    Wang, K., Liang, Y., Li, X., Li, G., Ghanem, B., Zimmermann, R., Yi, H., Zhang, Y., Wang, Y., et al.: Brave the wind and the waves: Discovering robust and generalizable graph lottery tickets. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023)

    work page 2023

  5. [4]

    In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp

    Yang, K., Zhou, Z., Sun, W., Wang, P., Wang, X., Wang, Y.: Extract and refine: Finding a support subgraph set for graph representation. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2953–2964 (2023)

    work page 2023

  6. [5]

    In: International Conference on Learning Representations (2022)

    Wu, Y., Wang, X., Zhang, A., He, X., Chua, T.-S.: Discovering invariant rationales for graph neural networks. In: International Conference on Learning Representations (2022)

    work page 2022

  7. [6]

    arXiv preprint arXiv:2202.07082 (2022)

    Zheng, X., Liu, Y., Pan, S., Zhang, M., Jin, D., Yu, P.S.: Graph neural networks for graphs with heterophily: A survey. arXiv preprint arXiv:2202.07082 (2022)

    arXiv 2022

  8. [7]

    International Journal of Machine Tools and Manufacture 194, 104103 (2024)

    Yi, H., Jia, L., Ding, J., Li, H.: Achieving material diversity in wire arc additive manufacturing: leaping from alloys to composites via wire innovation. International Journal of Machine Tools and Manufacture 194, 104103 (2024)

    work page 2024

Show all 46 references
  1. [8]

    Annual review of public health 35(1), 153–167 (2014)

    Bernstein, A.S.: Biological diversity and public health. Annual review of public health 35(1), 153–167 (2014)

    2014

  2. [9]

    In: International Conference on Machine Learning, pp

    Zhao, T., Liu, G., Wang, D., Yu, W., Jiang, M.: Learning from counterfactual links for link prediction. In: International Conference on Machine Learning, pp. 26911–26926 (2022). PMLR

    2022

  3. [10]

    Chen, Y., Bian, Y., Zhou, K., Xie, B., Han, B., Cheng, J.: Does invariant graph learning via environment augmentation learn invariance? (2023)

    2023

  4. [11]

    Advances in Neural Information Processing Systems 36 (2024)

    Yuan, H., Sun, Q., Fu, X., Zhang, Z., Ji, C., Peng, H., Li, J.: Environment-aware dynamic graph learning for out-of-distribution generalization. Advances in Neural Information Processing Systems 36 (2024)

    2024

  5. [12]

    Advances in Neural Information Processing Systems 36 (2024)

    Xia, Y., Liang, Y., Wen, H., Liu, X., Wang, K., Zhou, Z., Zimmermann, R.: Deci- phering spatio-temporal graph forecasting: A causal lens and treatment. Advances in Neural Information Processing Systems 36 (2024)

    2024

  6. [13]

    In: The Eleventh International Conference on Learning Representations (2022) 20

    Wang, K., Liang, Y., Wang, P., Wang, X., Gu, P., Fang, J., Wang, Y.: Searching lottery tickets in graph neural networks: A dual perspective. In: The Eleventh International Conference on Learning Representations (2022) 20

    2022

  7. [14]

    In: Proceedings of the AAAI Conference on Artificial Intelligence, vol

    Sun, Q., Li, J., Peng, H., Wu, J., Fu, X., Ji, C., Philip, S.Y.: Graph structure learning with variational information bottleneck. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 4165–4174 (2022)

    2022

  8. [15]

    In: Proceedings

    Gori, M., Monfardini, G., Scarselli, F.: A new model for learning in graph domains. In: Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005., vol. 2, pp. 729–734 (2005). IEEE

    2005

  9. [16]

    arXiv preprint arXiv:1609.02907 (2016)

    Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)

    2016 arXiv

  10. [17]

    Advances in neural information processing systems 30 (2017)

    Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. Advances in neural information processing systems 30 (2017)

    2017

  11. [18]

    arXiv preprint arXiv:1710.10903 (2017)

    Veliˇ ckovi´ c, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)

    2017 arXiv

  12. [19]

    Advances in Neural Information Processing Systems 33, 8017–8029 (2020)

    Alsentzer, E., Finlayson, S., Li, M., Zitnik, M.: Subgraph neural networks. Advances in Neural Information Processing Systems 33, 8017–8029 (2020)

    2020

  13. [20]

    In: Proceedings of the Web Conference 2021, pp

    Sun, Q., Li, J., Peng, H., Wu, J., Ning, Y., Yu, P.S., He, L.: Sugar: Subgraph neu- ral network with reinforcement pooling and self-supervised mutual information mechanism. In: Proceedings of the Web Conference 2021, pp. 2081–2091 (2021)

    2021

  14. [21]

    In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp

    Yuan, H., Tang, J., Hu, X., Ji, S.: Xgnn: Towards model-level explanations of graph neural networks. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 430–438 (2020)

    2020

  15. [22]

    In: Proceedings of the IEEE/CVF International Conference on Computer Vision, pp

    Lu, Y., Zhang, Y., Han, B., Cheung, Y.-m., Wang, H.: Label-noise learning with intrinsically long-tailed data. In: Proceedings of the IEEE/CVF International Conference on Computer Vision, pp. 1369–1378 (2023)

    2023

  16. [23]

    IEEE Transactions on Neural Networks and Learning Systems 31(8), 2764–2778 (2019)

    Lu, Y., Cheung, Y.-M., Tang, Y.Y.: Adaptive chunk-based dynamic weighted majority for imbalanced data streams with concept drift. IEEE Transactions on Neural Networks and Learning Systems 31(8), 2764–2778 (2019)

    2019

  17. [24]

    arXiv preprint arXiv:1907.02893 (2019)

    Arjovsky, M., Bottou, L., Gulrajani, I., Lopez-Paz, D.: Invariant risk minimiza- tion. arXiv preprint arXiv:1907.02893 (2019)

    2019 arXiv

  18. [25]

    IEEE Transactions on Knowledge and Data Engineering (2022)

    Li, H., Wang, X., Zhang, Z., Zhu, W.: Ood-gnn: Out-of-distribution generalized graph neural network. IEEE Transactions on Knowledge and Data Engineering (2022)

    2022

  19. [26]

    In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp

    Du, Y., Wang, J., Feng, W., Pan, S., Qin, T., Xu, R., Wang, C.: Adarnn: Adap- tive learning and forecasting of time series. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 402–411 (2021) 21

    2021

  20. [27]

    In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp

    Zhou, Z., Huang, Q., Yang, K., Wang, K., Wang, X., Zhang, Y., Liang, Y., Wang, Y.: Maintaining the status quo: Capturing invariant relations for ood spa- tiotemporal learning. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 3603–36...

    2023

  21. [28]

    Pearl, J.: Causal inference in statistics: An overview (2009)

    2009

  22. [29]

    In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp

    Liu, Y., Ao, X., Feng, F., Ma, Y., Li, K., Chua, T.-S., He, Q.: Flood: A flexible invariant learning framework for out-of-distribution generalization on graphs. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1548–1558 (2023)

    2023

  23. [30]

    Advances in Neural Information Processing Systems 35, 12964–12978 (2022)

    Yang, N., Zeng, K., Wu, Q., Jia, X., Yan, J.: Learning substructure invariance for out-of-distribution molecular representations. Advances in Neural Information Processing Systems 35, 12964–12978 (2022)

    2022

  24. [31]

    arXiv preprint arXiv:2202.02466 (2022)

    Wu, Q., Zhang, H., Yan, J., Wipf, D.: Handling distribution shifts on graphs: An invariance perspective. arXiv preprint arXiv:2202.02466 (2022)

    2022 arXiv

  25. [32]

    Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies 7(3), 1–20 (2023)

    Wang, Q., Guo, B., Cheng, L., Yu, Z.: surban: Stable prediction for unseen urban data from location-based sensors. Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies 7(3), 1–20 (2023)

    2023

  26. [33]

    In: The Twelfth International Conference on Learning Representations (2024)

    Wang, B., Wang, P., Xu, W., Wang, X., Zhang, Y., Wang, K., Wang, Y.: Kill two birds with one stone: Rethinking data augmentation for deep long-tailed learning. In: The Twelfth International Conference on Learning Representations (2024)

    2024

  27. [34]

    Advances in Neural Information Processing Systems 33, 20437–20448 (2020)

    Wu, T., Ren, H., Li, P., Leskovec, J.: Graph information bottleneck. Advances in Neural Information Processing Systems 33, 20437–20448 (2020)

    2020

  28. [35]

    In: Proceedings of the IEEE/CVF Conference on Com- puter Vision and Pattern Recognition, pp

    Yu, J., Cao, J., He, R.: Improving subgraph recognition with variational graph information bottleneck. In: Proceedings of the IEEE/CVF Conference on Com- puter Vision and Pattern Recognition, pp. 19396–19405 (2022)

    2022

  29. [37]

    arXiv preprint arXiv:1612.00410 (2016)

    Alemi, A.A., Fischer, I., Dillon, J.V., Murphy, K.: Deep variational information bottleneck. arXiv preprint arXiv:1612.00410 (2016)

    2016 arXiv

  30. [38]

    arXiv preprint arXiv:1611.01144 (2016)

    Jang, E., Gu, S., Poole, B.: Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144 (2016)

    2016 arXiv

  31. [39]

    correlation with molecular orbital energies and hydrophobicity

    Debnath, A.K., Compadre, R.L., Debnath, G., Shusterman, A.J., Hansch, C.: Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity. Journal of medicinal chemistry 34(2), 786–797 (1991) 22

    1991

  32. [40]

    Advances in neural information processing systems 33, 22118–22133 (2020)

    Hu, W., Fey, M., Zitnik, M., Dong, Y., Ren, H., Liu, B., Catasta, M., Leskovec, J.: Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems 33, 22118–22133 (2020)

    2020

  33. [41]

    arXiv preprint arXiv:2201.09637 (2022)

    Ji, Y., Zhang, L., Wu, J., Wu, B., Huang, L.-K., Xu, T., Rong, Y., Li, L., Ren, J., Xue, D., et al.: Drugood: Out-of-distribution (ood) dataset curator and bench- mark for ai-aided drug discovery–a focus on affinity prediction problems with noise annotations. arXiv preprint ar...

    2022 arXiv

  34. [42]

    Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)

    2018 arXiv

  35. [43]

    Advances in Neural Information Processing Systems 35, 31376–31390 (2022)

    Frasca, F., Bevilacqua, B., Bronstein, M., Maron, H.: Understanding and extending subgraph gnns by rethinking their symmetries. Advances in Neural Information Processing Systems 35, 31376–31390 (2022)

    2022

  36. [44]

    In: International Conference on Machine Learn- ing, pp

    Miao, S., Liu, M., Li, P.: Interpretable and generalizable graph learning via stochastic attention mechanism. In: International Conference on Machine Learn- ing, pp. 15524–15543 (2022). PMLR

    2022

  37. [45]

    Advances in Neural Information Processing Systems 35, 22131–22148 (2022)

    Chen, Y., Zhang, Y., Bian, Y., Yang, H., Kaili, M., Xie, B., Liu, T., Han, B., Cheng, J.: Learning causally invariant representations for out-of-distribution gen- eralization on graphs. Advances in Neural Information Processing Systems 35, 22131–22148 (2022)

    2022

  38. [46]

    In: Proceedings of the AAAI Conference on Artificial Intelligence, vol

    Jia, T., Li, H., Yang, C., Tao, T., Shi, C.: Graph invariant learning with subgraph co-mixup for out-of-distribution generalization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, pp. 8562–8570 (2024) 23

    2024

Pith tools

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