paper-with-me

홈 › Papers

CLEAR-MoE: Shared-Basis Expert Extraction from Frozen Vision Transformers via Calibration-Driven Layer Selection

2026-06-26 · Md Irtiza Hossain, Humaira Ayesha, Junaid Ahmed Sifat arxiv

We present CLEAR-MoE, a four-phase post-training pipeline that converts a frozen pretrained Vision Transformer (ViT) into a sparse Mixture-of-Experts (MoE) model without updating backbone weights. The pipeline (i) scores feed-forward network (FFN) layers by sparsity, clusterability, and output sensitivity; (ii) decomposes selected layers into a shared low-rank SVD basis and per-cluster residual experts using k-means clustering; (iii) trains lightweight routers supervised by cluster labels; and (iv) dispatches tokens through pluggable CUDA backends. On Imagenette with DeiT-Small, CLEAR-MoE retains 99.9% of the dense model's accuracy (86.70 +/- 0.02% versus 86.73%). Extensive ablation studies reveal a consistent empirical finding: the shared SVD basis is the primary factor responsible for preserving accuracy. Random routing, learned routing, and three different router architectures produce nearly identical performance, with accuracy varying by at most 0.06 percentage points (86.62%-86.68%). Accuracy also remains stable across different SVD ranks, expert counts (2-8), calibration set sizes (50-500), and random seeds. This behavior generalizes across five ViT backbones (DeiT-Tiny, DeiT-Small, DeiT-Base, ViT-Small, and ViT-Base), covering models from 5.7M to 86.6M parameters, with accuracy differences <= 0.10 percentage points from their dense counterparts. On a GTX 960 GPU, routing and scatter-gather overhead make the CLEAR-MoE FFN 1.3-1.7x slower than the dense implementation. A dispatch microbenchmark further shows that routing is an order of magnitude more memory-bound than expert matrix multiplications, identifying fused dispatch kernels as a promising direction for future optimization.

📄 PDF Abstract BibTeX arXiv:2606.28516

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation

2026-07-23 · Hehao Zhang, Danli Wang, Xinyuan Wang, Xuange Gao arxiv

At present, reliable evaluation of non-verifiable tasks remains challenging. Existing approaches often fail to adequately capture the diverse evaluative criteria underlying human preferences in such tasks. To this end, w…

Domain Adaptation

Learning to Select, Not Relearn: Hard-Routed Mixtures of Reasoning LoRAs

2026-06-30 · Seyed Alireza Molavi, Zhan Su, Yan Hu, Peyman Sheikholharam Mashhadi 외 arxiv

Composing independently trained LoRA adapters into a single large language model is useful for multi-domain adaptation, especially when the original training data cannot be shared. A common approach is to use MoE-style r…

Reinforcement LearningDomain Adaptation

Generation-Augmented Generation: A Plug-and-Play Framework for Private Knowledge Injection in Large Language Models

2026-01-13 · Rongji Li, Jian Xu, Yi Chen, Xueqing Chen 외 arxiv

In domains such as materials science, biomedicine, and finance, high-stakes deployment of large language models (LLMs) requires injecting private, domain-specific knowledge that is proprietary, fast-evolving, and under-r…

parameter-efficient fine-tuning

EMoE: Eigenbasis-Guided Routing for Mixture-of-Experts

2026-01-17 · Anzhe Cheng, Shukai Duan, Shixuan Li, Chenzhong Yin 외 arxiv

The relentless scaling of deep learning models has led to unsustainable computational demands, positioning Mixture-of-Experts (MoE) architectures as a promising path towards greater efficiency. However, MoE models are pl…

SharedAssembly: A Data Collection Approach via Shared Tele-Assembly

2025-03-15 · Yansong Wu, Xiao Chen, Yu Chen, Hamid Sadeghian 외 arxiv

High-precision, tight-clearance assembly demonstrations are indispensable for training tactile-aware robotic foundation models, yet their acquisition is heavily bottlenecked by the high operational barriers of convention…