:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Roth, Andreas
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2407.11876
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks
by: Roth, Andreas, et al.
Published: (2023)

Position: Don't be Afraid of Over-Smoothing And Over-Squashing
by: Kormann, Niklas, et al.
Published: (2026)

Spectral Graph Pruning Against Over-Squashing and Over-Smoothing
by: Jamadandi, Adarsh, et al.
Published: (2024)

Mitigating Over-Smoothing and Over-Squashing using Augmentations of Forman-Ricci Curvature
by: Fesser, Lukas, et al.
Published: (2023)

Towards Understanding and Avoiding Limitations of Convolutions on Graphs
by: Roth, Andreas
Published: (2026)

Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Survey
by: Attali, Hugo, et al.
Published: (2024)

Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Survey
by: Attali, Hugo, et al.
Published: (2026)

Alleviating Over-Smoothing via Aggregation over Compact Manifolds
by: Zhou, Dongzhuoran, et al.
Published: (2024)

Comment on "A Note on Over-Smoothing for Graph Neural Networks"
by: Hasson, Razi, et al.
Published: (2025)

On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learning
by: Arroyo, Álvaro, et al.
Published: (2025)

Enhancing Recommendation Systems with GNNs and Addressing Over-Smoothing
by: Liu, Wenyi, et al.
Published: (2024)

Bridging Smoothness and Approximation: Theoretical Insights into Over-Smoothing in Graph Neural Networks
by: Yang, Guangrui, et al.
Published: (2024)

TSC: A Simple Two-Sided Constraint against Over-Smoothing
by: Peng, Furong, et al.
Published: (2024)

Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing
by: Fu, Guoji, et al.
Published: (2023)

Simplified priors for Object-Centric Learning
by: Patil, Vihang, et al.
Published: (2024)

What Can We Learn From MIMO Graph Convolutions?
by: Roth, Andreas, et al.
Published: (2025)

SILK: Smooth InterpoLation frameworK for motion in-betweening A Simplified Computational Approach
by: Akhoundi, Elly, et al.
Published: (2025)

Simplified PCNet with Robustness
by: Li, Bingheng, et al.
Published: (2024)

Simplifying Transformer Blocks
by: He, Bobby, et al.
Published: (2023)

Simplifying Graph Kernels for Efficient
by: Wang, Lin, et al.
Published: (2025)

Dual Mamba for Node-Specific Representation Learning: Tackling Over-Smoothing with Selective State Space Modeling
by: He, Xin, et al.
Published: (2025)

Simplifying Deep Temporal Difference Learning
by: Gallici, Matteo, et al.
Published: (2024)

Adam Simplified: Bias Correction Debunked
by: Laing, Sam, et al.
Published: (2025)

UniGAP: A Universal and Adaptive Graph Upsampling Approach to Mitigate Over-Smoothing in Node Classification Tasks
by: Wang, Xiaotang, et al.
Published: (2024)

Simplifying Random Forests' Probabilistic Forecasts
by: Koster, Nils, et al.
Published: (2024)

Simplified and Generalized Masked Diffusion for Discrete Data
by: Shi, Jiaxin, et al.
Published: (2024)

Model Sparsity Can Simplify Machine Unlearning
by: Jia, Jinghan, et al.
Published: (2023)

Simplifying Adversarially Robust PAC Learning with Tolerance
by: Ashtiani, Hassan, et al.
Published: (2025)

MOOSComp: Improving Lightweight Long-Context Compressor via Mitigating Over-Smoothing and Incorporating Outlier Scores
by: Zhou, Fengwei, et al.
Published: (2025)

Rethinking Over-Smoothing in Graph Neural Networks: A Perspective from Anderson Localization
by: Ouyang, Kaichen
Published: (2025)

Interpretability Illusions in the Generalization of Simplified Models
by: Friedman, Dan, et al.
Published: (2023)

Simplifying, Stabilizing and Scaling Continuous-Time Consistency Models
by: Lu, Cheng, et al.
Published: (2024)

Simplifying Optimal Transport through Schatten-$p$ Regularization
by: Maunu, Tyler
Published: (2025)

Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors
by: Lu, Jielong, et al.
Published: (2025)

A Unified Theory of Stochastic Proximal Point Methods without Smoothness
by: Richtárik, Peter, et al.
Published: (2024)

Single-Timescale Multi-Sequence Stochastic Approximation Without Fixed Point Smoothness: Theories and Applications
by: Huang, Yue, et al.
Published: (2024)

Simplified Diffusion Schrödinger Bridge
by: Tang, Zhicong, et al.
Published: (2024)

Accelerated Smoothing: A Scalable Approach to Randomized Smoothing
by: Bhardwaj, Devansh, et al.
Published: (2024)

Reservoir Computing for Fast, Simplified Reinforcement Learning on Memory Tasks
by: McKee, Kevin
Published: (2024)

Simplifying Latent Dynamics with Softly State-Invariant World Models
by: Saanum, Tankred, et al.
Published: (2024)