Cover Image

Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yue, Yanwei, Zhang, Guibin, Yang, Haoran, Cheng, Dawei
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Pre-Training Identification of Graph Winning Tickets in Adaptive Spatial-Temporal Graph Neural Networks
by: Duan, Wenying, et al.
Published: (2024)

G-Designer: Architecting Multi-agent Communication Topologies via Graph Neural Networks
by: Zhang, Guibin, et al.
Published: (2024)

Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness
by: Zhang, Guibin, et al.
Published: (2024)

The Quest for Winning Tickets in Low-Rank Adapters
by: Damirchi, Hamed, et al.
Published: (2025)

Winning Lottery Tickets in Neural Networks via a Quantum-Inspired Classical Algorithm
by: Isogai, Natsuto, et al.
Published: (2026)

Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets
by: da Cunha, Arthur, et al.
Published: (2023)

GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruning
by: Zhang, Guibin, et al.
Published: (2024)

When Layers Play the Lottery, all Tickets Win at Initialization
by: Jordao, Artur, et al.
Published: (2023)

MasRouter: Learning to Route LLMs for Multi-Agent Systems
by: Yue, Yanwei, et al.
Published: (2025)

SuperTickets: Drawing Task-Agnostic Lottery Tickets from Supernets via Jointly Architecture Searching and Parameter Pruning
by: You, Haoran, et al.
Published: (2022)

Weisfeiler and Leman Go Gambling: Why Expressive Lottery Tickets Win
by: Kummer, Lorenz, et al.
Published: (2025)

Random Masking Finds Winning Tickets for Parameter Efficient Fine-tuning
by: Xu, Jing, et al.
Published: (2024)

Graph Sparsification via Mixture of Graphs
by: Zhang, Guibin, et al.
Published: (2024)

Insights into the Lottery Ticket Hypothesis and Iterative Magnitude Pruning
by: Saleem, Tausifa Jan, et al.
Published: (2024)

Uncovering a Winning Lottery Ticket with Continuously Relaxed Bernoulli Gates
by: Tsayag, Itamar, et al.
Published: (2026)

Growing Winning Subnetworks, Not Pruning Them: A Paradigm for Density Discovery in Sparse Neural Networks
by: Yao, Qihang, et al.
Published: (2025)

Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Search
by: Arora, Tanay, et al.
Published: (2025)

Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks
by: You, Haoran, et al.
Published: (2019)

Pruning Unsafe Tickets: A Resource-Efficient Framework for Safer and More Robust LLMs
by: Si, Wai Man, et al.
Published: (2026)

Quantization vs Pruning: Insights from the Strong Lottery Ticket Hypothesis
by: Kumar, Aakash, et al.
Published: (2025)

Pruning and Quantization Impact on Graph Neural Networks
by: Khedri, Khatoon, et al.
Published: (2025)

NoiseHGNN: Synthesized Similarity Graph-Based Neural Network For Noised Heterogeneous Graph Representation Learning
by: Zhang, Xiong, et al.
Published: (2024)

Cut the Crap: An Economical Communication Pipeline for LLM-based Multi-Agent Systems
by: Zhang, Guibin, et al.
Published: (2024)

You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets
by: Huang, Tianjin, et al.
Published: (2022)

Graph Neural Networks for Financial Fraud Detection: A Review
by: Cheng, Dawei, et al.
Published: (2024)

Enhancing Size Generalization in Graph Neural Networks through Disentangled Representation Learning
by: Huang, Zheng, et al.
Published: (2024)

Causality-Aware Spatiotemporal Graph Neural Networks for Spatiotemporal Time Series Imputation
by: Jing, Baoyu, et al.
Published: (2024)

Graph Neural Networks with Diversity-aware Neighbor Selection and Dynamic Multi-scale Fusion for Multivariate Time Series Forecasting
by: Xu, Jingqi, et al.
Published: (2025)

PSP: Pre-Training and Structure Prompt Tuning for Graph Neural Networks
by: Ge, Qingqing, et al.
Published: (2023)

Zero-One Laws of Graph Neural Networks
by: Adam-Day, Sam, et al.
Published: (2023)

Post-Training Neural Network Pruning using Graph Curvature
by: Tan, Shuhang, et al.
Published: (2026)

LOTUS: Improving Transformer Efficiency with Sparsity Pruning and Data Lottery Tickets
by: Upadhyay, Ojasw
Published: (2024)

TimeFilter: Patch-Specific Spatial-Temporal Graph Filtration for Time Series Forecasting
by: Hu, Yifan, et al.
Published: (2025)

One Shot vs. Iterative: Rethinking Pruning Strategies for Model Compression
by: Janusz, Mikołaj, et al.
Published: (2025)

ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models
by: Meng, Xiang, et al.
Published: (2024)

Layer Pruning with Consensus: A Triple-Win Solution
by: Mugnaini, Leandro Giusti, et al.
Published: (2024)

Spectral Pruning for Recurrent Neural Networks
by: Furuya, Takashi, et al.
Published: (2021)

Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networks
by: Fu, Yonggan, et al.
Published: (2021)

Spectral Theory for Edge Pruning in Asynchronous Recurrent Graph Neural Networks
by: Bessone, Nicolas
Published: (2025)

Hierarchical Attention-based Graph Neural Network with Relevance-driven Pruning
by: Kum, Seungwoo
Published: (2026)