paper-with-me

Papers

Rethinking Parameter Sharing as Graph Coloring for Structured Compression

2025-11-10 · Boyang Zhang, Daning Cheng, Yunquan Zhang arxiv

Modern deep models have massive parameter sizes, leading to high inference-time memory usage that limits practical deployment. Parameter sharing, a form of structured compression, effectively reduces redundancy, but existing approaches remain heuristic-restricted to adjacent layers and lacking a systematic analysis for cross-layer sharing. However, extending sharing across multiple layers leads to an exponentially expanding configuration space, making exhaustive search computationally infeasible and forming a critical bottleneck for parameter sharing. We recast parameter sharing from a group-theoretic perspective as introducing structural symmetries in the model's parameter space. A sharing configuration can be described by a coloring function $α:L\rightarrow C$ (L: layer indices and C: sharing classes), which determines inter-layer sharing groups while preserving structural symmetry. To determine the coloring function, we propose a second-order geometric criterion based on Taylor expansion and the Hessian spectrum. By projecting perturbations onto the Hessian's low-curvature eigensubspace, the criterion provides an analytic rule for selecting sharing groups that minimize performance impact, yielding a principled and scalable configuration procedure. Across diverse architectures and tasks, Geo-Sharing consistently outperforms state-of-the-art heuristic sharing strategies, achieving higher compression ratios with smaller accuracy degradation.

📄 PDF Abstract BibTeX arXiv:2511.06786

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Rethinking Graph Neural Networks for Graph Coloring

2021-01-01 · Wei Li, Ruxuan Li, Yuzhe ma, Siu On Chan 외

The development of graph neural networks (GNNs) stimulated the interest in GNNs for NP-hard problems, while most works apply GNNs for NP-hard problems by empirical intuition and experimental trials and improve the result…

Rethinking Graph Neural Networks for the Graph Coloring Problem

2022-08-15 · Wei Li, Ruxuan Li, Yuzhe ma, Siu On Chan 외

Graph coloring, a classical and critical NP-hard problem, is the problem of assigning connected nodes as different colors as possible. However, we observe that state-of-the-art GNNs are less successful in the graph color…

Evolutionary Algorithm for Graph Coloring Problem

2021-11-17 · Robiul Islam, Arup Kumar Pramanik

The graph coloring problem (GCP) is one of the most studied NP-HARD problems in computer science. Given a graph , the task is to assign a color to all vertices such that no vertices sharing an edge receive the same color…

Embedding models through the lens of Stable Coloring

2021-09-29 · Aditya Desai, Shashank Sonkar, Anshumali Shrivastava, Richard Baraniuk

Embedding-based approaches find the semantic meaning of tokens in structured data such as natural language, graphs, and even images. To a great degree, these approaches have developed independently in different domains. …

Denoising

A Graph Neural Network with Negative Message Passing for Graph Coloring

2023-01-26 · Xiangyu Wang, Xueming Yan, Yaochu Jin

Graph neural networks have received increased attention over the past years due to their promising ability to handle graph-structured data, which can be found in many real-world problems such as recommended systems and d…

Graph Neural Network