ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

Time-MoE: مدل پایه سری زمانی مبتنی بر ترکیب متخصصان (Mixture-of-Experts)×ترکیبی از متخصصان×
حوزهیادگیری عمیقیادگیری عمیق
خانوادهMachine learningMachine learning
سال پیدایش20242017
پدیدآورXiaoming Shi et al.Shazeer, N. et al.
نوعSparse mixture-of-experts autoregressive foundation modelSparse neural network architecture (conditional computation)
منبع بنیادینShi, X., Wang, S., Nie, Y., Li, D., Ye, Z., Wen, Q., & Jin, M. (2024). Time-MoE: Billion-scale time series foundation models with mixture of experts. ICLR 2025. link ↗Shazeer, N. et al. (2017). Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer. ICLR. arXiv:1701.06538 link ↗
نام‌های دیگرTime Mixture-of-Experts, Time-MoE Foundation Model, Sparse Time-Series Transformer, Zaman Karışık Uzmanlar ModeliUzman Karışımı (Mixture of Experts — MoE), uzman karışımı, MoE, sparse mixture of experts
مرتبط33
خلاصهTime-MoE is a billion-scale autoregressive foundation model for universal time-series forecasting, introduced by Shi et al. in 2024 and accepted at ICLR 2025. It combines a decoder-only transformer architecture with sparse Mixture-of-Experts (MoE) feed-forward layers, enabling the model to scale to billions of parameters while activating only a small subset of expert networks per token—dramatically increasing capacity without proportional compute cost.Mixture of Experts (MoE) is a sparse neural-network architecture, introduced by Shazeer and colleagues in 2017 with the sparsely-gated MoE layer, in which only a subset of expert sub-networks is activated for each input. As seen in models such as Switch Transformer and Mixtral, it holds computation cost fixed even as the total parameter count grows.
ScholarGateمجموعه‌داده
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Time-MoE · Mixture of Experts. بازیابی‌شده در 2026-06-19 از https://scholargate.app/fa/compare