{"total":33,"rows":[{"id":"2401.04088","title":"Mixtral of Experts","created":"2024-01-08","cited_by_count":1823,"area":"moe"},{"id":"2405.04434","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","created":"2024-05-07","cited_by_count":1135,"area":"moe"},{"id":"2606.19348","title":"DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence","created":"2026-04-26","cited_by_count":1040,"area":"moe"},{"id":"2406.11931","title":"DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence","created":"2024-06-17","cited_by_count":331,"area":"moe"},{"id":"2601.07372","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","created":"2026-01-12","cited_by_count":86,"area":"moe"},{"id":"2507.17702","title":"Towards Greater Leverage: Scaling Laws for Efficient Mixture-of-Experts Language Models","created":"2025-07-23","cited_by_count":45,"area":"moe"},{"id":"2505.12082","title":"Model Merging in Pre-training of Large Language Models","created":"2025-05-17","cited_by_count":37,"area":"moe"},{"id":"2411.12364","title":"Ultra-Sparse Memory Network","created":"2024-11-19","cited_by_count":19,"area":"moe"},{"id":"2609.01343","title":"SMELT: Scaling Laws for Compute-Matched MoE Looped Transformers","created":"2026-09-01","cited_by_count":18,"area":"moe"},{"id":"2507.07024","title":"FlexOlmo: Open Language Models for Flexible Data Use","created":"2025-07-09","cited_by_count":15,"area":"moe"},{"id":"2512.23447","title":"Coupling Experts and Routers in Mixture-of-Experts via an Auxiliary Loss","created":"2025-12-29","cited_by_count":11,"area":"moe"},{"id":"2602.04705","title":"ERNIE 5.0 Technical Report","created":"2026-02-04","cited_by_count":11,"area":"moe"},{"id":"2508.07785","title":"Grove MoE: Towards Efficient and Superior MoE LLMs with Adjugate Experts","created":"2025-08-11","cited_by_count":9,"area":"moe"},{"id":"2506.12119","title":"Mixture-of-Experts Can Surpass Dense LLMs Under Strictly Equal Resource","created":"2025-06-13","cited_by_count":8,"area":"moe"},{"id":"2409.12210","title":"Mixture of Diverse Size Experts","created":"2024-09-18","cited_by_count":5,"area":"moe"},{"id":"2503.11144","title":"MoLEx: Mixture of Layer Experts for Finetuning with Sparse Upcycling","created":"2025-03-14","cited_by_count":5,"area":"moe"},{"id":"2506.05767","title":"dots.llm1 Technical Report","created":"2025-06-06","cited_by_count":5,"area":"moe"},{"id":"2508.18756","title":"UltraMemV2: Memory Networks Scaling to 120B Parameters with Superior Long-Context Learning","created":"2025-08-26","cited_by_count":5,"area":"moe"},{"id":"2507.18671","title":"Innovator: Scientific Continued Pretraining with Fine-grained MoE Upcycling","created":"2025-07-24","cited_by_count":4,"area":"moe"},{"id":"2605.24956","title":"NITP: Next Implicit Token Prediction for LLM Pre-training","created":"2026-05-24","cited_by_count":4,"area":"moe"},{"id":"2512.13996","title":"DTop-p MoE: Sparsity-Controlled Dynamic Top-p MoE for Foundation Model Pre-training","created":"2025-12-16","cited_by_count":3,"area":"moe"},{"id":"2601.21420","title":"ConceptMoE: Adaptive Token-to-Concept Compression for Implicit Compute Allocation","created":"2026-01-29","cited_by_count":3,"area":"moe"},{"id":"2408.17280","title":"Flexible and Effective Mixing of Large Language Models into a Mixture of Domain Experts","created":"2024-08-30","cited_by_count":2,"area":"moe"},{"id":"2506.02965","title":"PC-MoE: Memory-Efficient and Privacy-Preserving Collaborative Training for Mixture-of-Experts LLMs","created":"2025-06-03","cited_by_count":1,"area":"moe"},{"id":"2604.18473","title":"Train Separately, Merge Together: Modular Post-Training with Mixture-of-Experts","created":"2026-04-20","cited_by_count":1,"area":"moe"},{"id":"2605.23893","title":"Complete-muE: Optimal Hyperparameter Transfer and Scaling for MoE Models","created":"2026-05-22","cited_by_count":1,"area":"moe"},{"id":"2602.08818","title":"FlexMoRE: A Flexible Mixture of Rank-heterogeneous Experts for Efficient Federatedly-trained Large Language Models","created":"2026-02-09","cited_by_count":0,"area":"moe"},{"id":"2603.13364","title":"FineRMoE: Dimension Expansion for Finer-Grained Expert with Its Upcycling Approach","created":"2026-03-09","cited_by_count":0,"area":"moe"},{"id":"2609.00791","title":"Instella-MoE Technical Report","created":"2026-09-01","cited_by_count":0,"area":"moe"},{"id":"2609.15126","title":"MoME: Mixture-of-Memory Embeddings for Context-Aware Sparse Lookup","created":"2026-09-14","cited_by_count":0,"area":"moe"},{"id":"2609.32398","title":"Function Over Form: Distributional Orthogonalization in Mixture-of-Experts with Replica Expert Mechanism","created":"2026-09-26","cited_by_count":0,"area":"moe"},{"id":"2610.11575","title":"Smoothing the Top-k Exposure Boundary for Sparse Mixture-of-Experts","created":"2026-10-08","cited_by_count":0,"area":"moe"},{"id":"2610.14074","title":"One Model, Multiple Compute Budgets: Multi-Ratio ConceptMoE for Flexible Compute Across Turns","created":"2026-10-08","cited_by_count":0,"area":"moe"}],"next_cursor":null}