:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Shi, Zhihao, Liang, Xize, Wang, Jie
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Machine Learning
Accesso online:	https://arxiv.org/abs/2302.00924
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Provably Convergent Subgraph-wise Sampling for Fast GNN Training
di: Wang, Jie, et al.
Pubblicazione: (2023)

Accurate and Scalable Graph Neural Networks via Message Invariance
di: Shi, Zhihao, et al.
Pubblicazione: (2025)

Subgraphormer: Unifying Subgraph GNNs and Graph Transformers via Graph Products
di: Bar-Shalom, Guy, et al.
Pubblicazione: (2024)

Efficient Subgraph GNNs by Learning Effective Selection Policies
di: Bevilacqua, Beatrice, et al.
Pubblicazione: (2023)

Improving Subgraph-GNNs via Edge-Level Ego-Network Encodings
di: Alvarez-Gonzalez, Nurudin, et al.
Pubblicazione: (2023)

A Flexible, Equivariant Framework for Subgraph GNNs via Graph Products and Graph Coarsening
di: Bar-Shalom, Guy, et al.
Pubblicazione: (2024)

Cross-attentive Cohesive Subgraph Embedding to Mitigate Oversquashing in GNNs
di: Hossain, Tanvir, et al.
Pubblicazione: (2026)

Using Subgraph GNNs for Node Classification:an Overlooked Potential Approach
di: Zeng, Qian, et al.
Pubblicazione: (2025)

Translating Subgraphs to Nodes Makes Simple GNNs Strong and Efficient for Subgraph Representation Learning
di: Kim, Dongkwan, et al.
Pubblicazione: (2022)

An Efficient Subgraph GNN with Provable Substructure Counting Power
di: Yan, Zuoyu, et al.
Pubblicazione: (2023)

Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNs
di: Scholkemper, Michael, et al.
Pubblicazione: (2024)

Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality
di: Southern, Joshua, et al.
Pubblicazione: (2025)

Distance-Restricted Folklore Weisfeiler-Leman GNNs with Provable Cycle Counting Power
di: Zhou, Junru, et al.
Pubblicazione: (2023)

ROPO: Robust Preference Optimization for Large Language Models
di: Liang, Xize, et al.
Pubblicazione: (2024)

Provable Training for Graph Contrastive Learning
di: Yu, Yue, et al.
Pubblicazione: (2023)

Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization
di: Sankagiri, Suryanarayana, et al.
Pubblicazione: (2025)

Absorb and Converge: Provable Convergence Guarantee for Absorbing Discrete Diffusion Models
di: Liang, Yuchen, et al.
Pubblicazione: (2025)

TINED: GNNs-to-MLPs by Teacher Injection and Dirichlet Energy Distillation
di: Zhou, Ziang, et al.
Pubblicazione: (2024)

Branching Strategies Based on Subgraph GNNs: A Study on Theoretical Promise versus Practical Reality
di: Zhou, Junru, et al.
Pubblicazione: (2025)

Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification
di: Luo, Yuankai, et al.
Pubblicazione: (2024)

A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport
di: Liang, Ling, et al.
Pubblicazione: (2026)

The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs
di: Wang, Kun, et al.
Pubblicazione: (2024)

Provable Target Sample Complexity Improvements as Pre-Trained Models Scale
di: Fukuchi, Kazuto, et al.
Pubblicazione: (2026)

Training Dynamics of Softmax Self-Attention: Fast Global Convergence via Preconditioning
di: Goel, Gautam, et al.
Pubblicazione: (2026)

Greedy Sampling Is Provably Efficient for RLHF
di: Wu, Di, et al.
Pubblicazione: (2025)

Provably Convergent Federated Trilevel Learning
di: Jiao, Yang, et al.
Pubblicazione: (2023)

Fast and Simple Densest Subgraph with Predictions
di: Bui, Thai, et al.
Pubblicazione: (2025)

Robust and Fast Training via Per-Sample Clipping
di: Nobile, Davide, et al.
Pubblicazione: (2026)

Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
di: Bian, Fengmiao, et al.
Pubblicazione: (2025)

Cost-Sensitive Conformal Training with Provably Controllable Learning Bounds
di: Jia, Xuesong, et al.
Pubblicazione: (2025)

FuseSampleAgg: Fused Neighbor Sampling and Aggregation for Mini-batch GNNs
di: Stanković, Aleksandar
Pubblicazione: (2025)

Learning Provably Improves the Convergence of Gradient Descent
di: Song, Qingyu, et al.
Pubblicazione: (2025)

MGDA Converges under Generalized Smoothness, Provably
di: Zhang, Qi, et al.
Pubblicazione: (2024)

Decentralized Federated Policy Gradient with Byzantine Fault-Tolerance and Provably Fast Convergence
di: Jordan, Philip, et al.
Pubblicazione: (2024)

Provable Convergence and Limitations of Geometric Tempering for Langevin Dynamics
di: Chehab, Omar, et al.
Pubblicazione: (2024)

Rethinking the Expressive Power of GNNs via Graph Biconnectivity
di: Zhang, Bohang, et al.
Pubblicazione: (2023)

SubGCache: Accelerating Graph-based RAG with Subgraph-level KV Cache
di: Zhu, Qiuyu, et al.
Pubblicazione: (2025)

Provably Convergent Primal-Dual DPO for Constrained LLM Alignment
di: Du, Yihan, et al.
Pubblicazione: (2025)

Product-Stability: Provable Convergence for Gradient Descent on the Edge of Stability
di: Gan, Eric
Pubblicazione: (2026)

Provably Neural Active Learning Succeeds via Prioritizing Perplexing Samples
di: Bu, Dake, et al.
Pubblicazione: (2024)