Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

3671107142 · Jun 202019922001200920172026
48 results for sparse MoEs

Mobile V-MoEs scale down ViTs for resource-constrained vision tasks.

problem Scaling down Vision Transformers for resource-constrained applications.
method Sparse Mixture-of-Experts (MoEs) applied to entire images, with a stable training procedure.
result Mobile V-MoEs achieve better performance-efficiency trade-offs than dense ViTs.

E3^3 combines sparse MoEs and ensembles to improve model efficiency and performance.

problem Improving model efficiency and performance in machine learning.
method Combining sparse mixture of experts and ensembles, presenting Efficient Ensemble of Experts (E3^3).
result E3^3 achieves better accuracy, log-likelihood, few-shot learning, robustness, and uncertainty estimates than baselines.

DSelect-k improves MoE models for multi-task learning with better performance and smoother training.

problem Smoothness and convergence issues in sparse gate selection for MoE models.
method Developed DSelect-k, a differentiable and sparse gate for MoE models.
result DSelect-k achieves statistically significant improvements in prediction and expert selection over Top-k.

Moirai-MoE improves time series forecasting by automatically specializing tokens without human-defined frequency.

problem Unified training on time series data remains challenging due to heterogeneity and non-stationarity.
method Uses sparse mixture of experts (MoE) within Transformers to automatically specialize tokens for diverse time series patterns.
result Moirai-MoE outperforms existing foundation models in both in-distribution and zero-shot scenarios.

NAMEx merges experts using Nash bargaining for improved performance.

problem Sparse Mixture of Experts merging strategies lack a principled weighting mechanism.
method Reinterpreting expert merging through game theory, introducing Nash Merging and complex momentum.
result NAMEx consistently outperforms competing methods across various tasks and system sizes.

New framework finds more efficient linear layers over structured matrices.

problem Efficient alternatives for dense linear layers in neural networks.
method Unified framework searching over all linear operators, developing a taxonomy based on computational and algebraic properties.
result BTT-MoE provides substantial compute-efficiency gains over dense layers and standard MoE.

The paper analyzes convergence rates of softmax gating in MoE models.

problem The effectiveness and scalability of machine learning models using MoE.
method Convergence analysis of parameter and expert estimation under MoE with softmax gating and its variants.
result Theoretical results show polynomially many data points are needed for strong identifiability conditions, while exponential points are required for linear experts.

FLoE adapts LLMs by selectively deploying LoRA adapters based on layer importance and task requirements.

problem Uniform LoRA deployment across all layers leads to inefficient and redundant parameter allocation.
method FLoE uses Fisher information to dynamically identify task-critical layers and optimizes LoRA ranks.
result FLoE achieves significant efficiency-accuracy trade-offs, especially in resource-constrained environments.

Paper analyzes approximation and learning of MoEs with (P)ReLU activation.

problem Scaling up deep learning models with MoEs and (P)ReLU activation.
method Approximation and learning-theoretic analysis of MoMLPs with (P)ReLU.
result MoMLPs can uniformly approximate Lipschitz functions with ε\varepsilon accuracy using O(ε1)\mathcal{O}(\varepsilon^{-1}) parameters.

MoEs can efficiently model complex tasks with low-dimensionality and sparsity.

problem Understanding the theoretical foundations of MoEs for complex tasks.
method Systematic study of MoEs with two structural priors: low-dimensionality and sparsity.
result MoEs can approximate functions on low-dimensional manifolds and exhibit exponential structured tasks.

The mixture of experts (MoE) model is a popular neural network architecture for nonlinear regression and classification. The class of MoE mean functions is known to be uniformly convergent to any unknown target function, assuming that the target function is from Sobolev space that is sufficiently differentiable and tha…

2016-02-11abs ↗pdf ↗

Training-free looped transformers improve model performance without additional training.

problem Improving model performance without additional training or fine-tuning.
method A lightweight inference-time wrapper loops a contiguous mid-stack block of layers of a frozen checkpoint without additional fine-tuning.
result Our method improves model performance across various model families.

Study compares MoE and RNN models for stock price prediction across volatility profiles.

problem Improving stock price prediction accuracy across different volatility levels.
method Dynamic Mixture of Experts model combining RNN and linear models, adjusting weights through a gating network.
result MoE model outperforms individual models in reducing prediction errors.

Paper connects MoE and self-attention, proposing active-attention.

problem Improving efficiency and performance of self-attention mechanisms.
method Established connection between MoE and self-attention, analyzed quadratic gating functions, proposed active-attention mechanism.
result Active-attention outperforms standard self-attention in various tasks.

Optimal transport aggregation combines distributed MoE models efficiently.

problem Combining local MoE models trained on distributed datasets.
method Optimal transport for minimizing divergence between local and global estimators, with MM algorithm for optimization.
result Aggregated estimator achieves performance comparable to centralized training but with reduced computation time.

N-BEATS-MOE improves time series forecasting by adapting to series characteristics.

problem Forecasting heterogeneous time series with varying characteristics.
method Mixture-of-Experts layer with dynamic block weighting.
result Consistent improvements across 12 benchmark datasets, especially for heterogeneous series.

The paper establishes convergence rates for MoE models in classification problems.

problem Understanding the behavior of MoE models in classification settings.
method Established convergence rates for density and parameter estimation in softmax gating multinomial logistic MoE models.
result Parameter estimation rates are significantly improved with a novel modified softmax gating function.

Mixture of Experts (MoE) is a popular framework for modeling heterogeneity in data for regression, classification and clustering. For continuous data which we consider here in the context of regression and cluster analysis, MoE usually use normal experts, that is, expert components following the Gaussian distribution. …

2015-06-22abs ↗pdf ↗

This paper tackles model selection for MoE models in high-dimensional data.

problem Model selection for Gaussian-gated localized MoE and block-diagonal covariance localized MoE regression models in high-dimensional data.
method Penalized maximum likelihood estimation framework with non-asymptotic risk bounds.
result Established non-asymptotic risk bounds for model selection in MoE models.

This study analyzes communication constraints in MoE architectures using information theory.

problem Communication constraints in Mixture-of-Experts (MoE) architectures.
method Developed a rate-distortion characterization of finite-rate gating in MoE architectures using information theory.
result Yielded capacity-aware limits for communication-constrained MoE systems.

Theory of MoE Transformers' generalization and scaling.

problem Understanding the generalization and scaling of Mixture-of-Experts (MoE) Transformers.
method Developed a theory that separates active capacity from routing combinatorics, derived a sup-norm covering-number bound, and proved a constructive approximation theorem.
result Generalization and scaling laws for MoE Transformers, showing how active capacity and routing structure affect performance.

Mixture of Experts (MoE) is a popular framework for modeling heterogeneity in data for regression, classification, and clustering. For regression and cluster analyses of continuous data, MoE usually use normal experts following the Gaussian distribution. However, for a set of data containing a group or groups of observ…

2016-12-09abs ↗pdf ↗

MoE outperforms vanilla networks in detecting latent cluster structures in regression tasks.

problem Detecting latent cluster structures in regression tasks with gradient-based learning.
method Theoretical analysis of Mixture of Experts (MoE) using stochastic gradient descent (SGD).
result MoE can successfully divide the problem into subproblems, allowing each expert to recover simpler functions corresponding to individual clusters.

Improved logistic MoE with sigmoid gate shows better sample efficiency.

problem Improving sample efficiency in logistic MoE models.
method Comprehensive analysis of multinomial logistic MoE with modified sigmoid gate, incorporating temperature parameter and using Euclidean score.
result The sigmoid gate leads to lower sample complexity than softmax gate for both parameter and expert estimation.

Study examines Lasso performance in high-dimensional MoE models.

problem Estimating MoE models in high-dimensional settings with Lasso.
method Investigates SGMoE models with Lasso regularization under mild assumptions.
result Provides non-asymptotic bounds for Lasso regularization parameter.

Improved MoE performance through perturbing cosine router.

problem Representation collapse and parameter redundancy in MoE models.
method Least square estimation of cosine router in MoE, followed by noise addition to improve convergence rates.
result Perturbed cosine router leads to polynomial convergence rates for MoE models.

Bayesian MoE framework improves LLMs' uncertainty detection.

problem Brittleness and overconfidence in deterministic routing of LLMs.
method Structured Bayesian routing in weight-space, logit-space, and selection-space.
result Significant improvements in routing stability, calibration, and OoD detection.

The paper studies estimation rates for MoE models with a new prompt.

problem Estimating parameters in a softmax-contaminated MoE model.
method Analytic notion of distinguishability, minimax optimal estimation rates.
result Estimation rates are minimax optimal under distinguishability, but slower otherwise.

The paper analyzes EM for Mixtures of Experts and shows its equivalence to projected Mirror Descent.

problem Training Mixtures of Experts (MoE) models.
method Rigorously analyzes Expectation Maximization (EM) for MoE models using a Mirror Descent perspective.
result Derives new convergence results and identifies conditions for local linear convergence.

Analyzes convergence rates for Gaussian-gated MoE model.

problem Theoretical understanding of Gaussian-gated MoE model is incomplete.
method Maximum likelihood estimation with novel Voronoi loss functions.
result MLE has distinct behaviors under different settings of Gaussian gating function parameters.

New scaling framework for MoE architectures ensures stability and optimal performance at scale.

problem Lack of principled understanding of how hyperparameters should scale in MoE architectures.
method Developed a novel Dynamical Mean Field Theory (DMFT) for three scaling regimes of MoE architectures.
result Derived Maximally Scale-Stable Parameterization (MSSP) for SGD and Adam, providing robust learning rate transfer and monotonic improvement with scale.