{"total":24,"rows":[{"id":"2604.04356","title":"REAM: Merging Improves Pruning of Experts in LLMs","created":"2026-04-06","cited_by_count":10,"area":"moe"},{"id":"2511.04805","title":"PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inference","created":"2025-11-06","cited_by_count":9,"area":"moe"},{"id":"2603.06003","title":"EvoESAP: Non-Uniform Expert Pruning for Sparse MoE","created":"2026-03-06","cited_by_count":9,"area":"moe"},{"id":"2602.11184","title":"KBVQ-MoE: KLT-guided SVD with Bias-Corrected Vector Quantization for MoE Large Language Models","created":"2026-01-30","cited_by_count":8,"area":"moe"},{"id":"2508.02322","title":"CAMERA: Multi-Matrix Joint Compression for MoE Models via Micro-Expert Redundancy Analysis","created":"2025-08-04","cited_by_count":7,"area":"moe"},{"id":"2512.18425","title":"MoE Pathfinder: Trajectory-driven Expert Pruning","created":"2025-12-20","cited_by_count":7,"area":"moe"},{"id":"2602.09316","title":"Effective MoE-based LLM Compression by Exploiting Heterogeneous Inter-Group Experts Routing Frequency and Information Density","created":"2026-02-10","cited_by_count":7,"area":"moe"},{"id":"2606.15716","title":"How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principle","created":"2026-06-14","cited_by_count":6,"area":"moe"},{"id":"2509.22299","title":"HEAPr: Hessian-based Efficient Atomic Expert Pruning in Output Space","created":"2025-09-26","cited_by_count":3,"area":"moe"},{"id":"2510.02345","title":"Breaking the MoE LLM Trilemma: Dynamic Expert Clustering with Structured Compression","created":"2025-09-27","cited_by_count":3,"area":"moe"},{"id":"2605.30876","title":"dMoE: dLLMs with Learnable Block Experts","created":"2026-05-29","cited_by_count":2,"area":"moe"},{"id":"2608.08627","title":"UniMoMo: Expert Merging-Based MoE Acceleration for Large Recommendation Models","created":"2026-08-09","cited_by_count":2,"area":"moe"},{"id":"2608.24938","title":"ExFold: Unified Expert Folding for Training-Free MoE Prefill-Decode Acceleration","created":"2026-08-24","cited_by_count":2,"area":"moe"},{"id":"2601.11616","title":"Mixture-of-Experts as Soft Clustering: A Dual Jacobian-PCA Spectral Geometry Perspective","created":"2026-01-09","cited_by_count":1,"area":"moe"},{"id":"2605.28207","title":"Pruning and Distilling Mixture-of-Experts into Dense Language Models","created":"2026-05-27","cited_by_count":1,"area":"moe"},{"id":"2607.28308","title":"Beyond Geometric Complementarity: Coherent Overlap in Sparse Mixture-of-Experts Routing","created":"2026-07-30","cited_by_count":1,"area":"moe"},{"id":"2605.16349","title":"Geometric Asymmetry in MoE Specialization: Functional Decorrelation and Representational Overlap","created":"2026-05-08","cited_by_count":0,"area":"moe"},{"id":"2606.18304","title":"Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compression","created":"2026-06-16","cited_by_count":0,"area":"moe"},{"id":"2609.06076","title":"Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustment","created":"2026-09-05","cited_by_count":0,"area":"moe"},{"id":"2609.18110","title":"SSD-LLaMA: SSD-Native Inference for Trillion-Parameter MoE at 1+ Token/s on a Consumer PC","created":"2026-09-16","cited_by_count":0,"area":"moe"},{"id":"2609.31631","title":"OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuit","created":"2026-09-09","cited_by_count":0,"area":"moe"},{"id":"2609.33614","title":"EAT: Expert Account Tracker for Efficient MoE Inference","created":"2026-09-27","cited_by_count":0,"area":"moe"},{"id":"2610.03265","title":"SPEAR: A Spectral-Disentangled MoE Neural Operator with Knowledge-Guided Expert Aggregation for Large-Scale PDE Pretraining","created":"2026-10-02","cited_by_count":0,"area":"moe"},{"id":"2610.16484","title":"SLEM: Spectrum-Aware Latent Expert Merging","created":"2026-10-12","cited_by_count":0,"area":"moe"}],"next_cursor":null}