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

3587161,0741,432 · Jun 202019922001200920172026
48 results for expert models

TENP prunes experts and neurons in Mixture-of-Experts models for efficient deployment.

problem Efficient deployment of large language models constrained by static parameter footprint.
method Structured Trapezoidal ExpertNeuron Pruning (TENP) identifies and retains important experts and neurons.
result DeepSeek model achieves 10% better performance on code generation tasks with 40% expert sparsity.

A method to select important experts for Gaussian processes to balance computational efficiency and uncertainty quantification.

problem Balancing computational efficiency and uncertainty quantification in Gaussian processes for big data.
method Using graphical models to select important experts and aggregate their predictions while ensuring uncertainty quantification.
result Substantially reduces computational cost of aggregating dependent experts while ensuring calibrated uncertainty quantification.

Bayesian models combine experts with a flexible gating mechanism for complex data.

problem Theoretical properties of Bayesian mixture-of-experts models with softmax gating remain unexplored.
method Investigated asymptotic behavior of posterior distribution for density estimation, parameter estimation, and model selection.
result Established posterior contraction rates for density estimation and parameter estimation, providing insights for practical model design.

Improved HMoE models using Laplace gating function enhance expert specialization and performance.

problem Improving performance of hierarchical mixture of experts models.
method Used Laplace gating function instead of Softmax in hierarchical mixture of experts models.
result Laplace gating function accelerates expert convergence and enhances specialization.

In this article, we aim at improving the prediction of expert aggregation by using the underlying properties of the models that provide expert predictions. We restrict ourselves to the case where expert predictions come from Kalman recursions, fitting state-space models. By using exponential weights, we construct diffe…

2020-02-26abs ↗pdf ↗

Improved time series forecasting with expert loss integration.

problem Enhancing time series forecasting accuracy and efficiency.
method Adaptive Mixture-of-Experts framework with expert-specific loss integration and online learning.
result Significantly improved forecasting accuracy and computational efficiency.

DeepSeekMoE improves language model efficiency with shared experts and normalized gating.

problem Improving sample efficiency in language model architectures.
method Theoretical and empirical analysis of shared experts and normalized sigmoid gating.
result Theoretical and empirical evidence of improved sample efficiency with shared experts and normalized gating.

In order to improve forecasts, a decisionmaker often combines probabilities given by various sources, such as human experts and machine learning classifiers. When few training data are available, aggregation can be improved by incorporating prior knowledge about the event being forecasted and about salient properties o…

2012-07-11abs ↗pdf ↗

We present a new approach for learning compact and intuitive distributed representations with binary encoding. Rather than summing up expert votes as in products of experts, we employ for each variable the opinion of the most reliable expert. Data points are hence explained through a partitioning of the variables into …

2017-02-16abs ↗pdf ↗

The paper introduces a method to incorporate expert opinion on observable quantities into statistical models.

problem Tackling the challenge of integrating expert knowledge on observable quantities into statistical models.
method The approach involves updating a prior belief using a loss function that reflects expert opinion on observable quantities.
result The method allows for a flexible specification of expert opinion and is straightforward to implement.

fMRI semantic category understanding using linguistic encoding models attempt to learn a forward mapping that relates stimuli to the corresponding brain activation. Classical encoding models use linear multi-variate methods to predict the brain activation (all voxels) given the stimulus. However, these methods essentia…

2018-11-26abs ↗pdf ↗

The paper combines Bitcoin price models with expert corrections for better predictions.

problem Improving Bitcoin price predictions using statistical and expert insights.
method Linear regression models combined with expert corrections, utilizing Bayesian approach for fat-tailed distributions.
result Better price prediction results compared to using either model or expert opinion alone.

Improves accuracy and fairness in prediction systems with multiple domain experts.

problem Designing unbiased and accurate deferral systems with multiple experts.
method Proposes a framework for learning a classifier and deferral system that chooses to defer to multiple human experts.
result Significantly improves accuracy and fairness of final predictions compared to baselines.

A method merges two pretrained diffusion experts to improve image quality and likelihood.

problem Trade-off between image quality and data likelihood in diffusion models.
method Combining two pretrained diffusion experts by switching between them along the denoising trajectory.
result The merged model consistently matches or outperforms its base components, improving or preserving both likelihood and sample quality.

New method aggregates Gaussian experts by detecting conditional independence violations.

problem Aggregation of dependent Gaussian experts leads to sub-optimal solutions.
method Uses Gaussian graphical model to detect and correct conditional independence violations.
result Improves aggregation of Gaussian experts, outperforming SOTA DGP approaches.

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.

In this paper we introduce a model of lifelong learning, based on a Network of Experts. New tasks / experts are learned and added to the model sequentially, building on what was learned before. To ensure scalability of this process,data from previous tasks cannot be stored and hence is not available when learning a new…

2016-11-18abs ↗pdf ↗

Improved regret bounds for bandits with expert advice.

problem Optimizing decision-making in environments with expert advice.
method Proved lower and upper bounds for regret in restricted and standard feedback models.
result Proved a new upper bound of order KTln(N/K)\sqrt{K T \ln(N/K)} for the worst-case regret, matching a previously known lower bound.

Non-experts have long made important contributions to machine learning (ML) by contributing training data, and recent work has shown that non-experts can also help with feature engineering by suggesting novel predictive features. However, non-experts have only contributed features to prediction tasks already posed by e…

2018-02-14abs ↗pdf ↗

CoCoAFusE fuses expert predictions to model complex patterns with interpretability and uncertainty.

problem Modeling complex patterns with interpretability and uncertainty quantification.
method Competitive/Collaborative Fusion of Experts (CoCoAFusE) that fuses expert distributions in addition to mixing.
result CoCoAFusE avoids multimodality artifacts and provides tighter credible bounds on the response variable.

Framework allows systems to defer difficult decisions to unknown experts.

problem Ensuring safety and robustness in autonomous systems with unknown human experts.
method Meta-learning approach that adapts to new experts at test-time using optimization and model-based attention mechanisms.
result Framework can quickly adapt deferral policies to new experts without re-training.

Proposes unbiased estimators for training mixture of experts models.

problem Efficiently training large-scale mixture of experts models on modern hardware.
method Two unbiased estimators based on principled stochastic assignment procedures.
result Both estimators are more effective and robust than biased alternatives.

In regression tasks the distribution of the data is often too complex to be fitted by a single model. In contrast, partition-based models are developed where data is divided and fitted by local models. These models partition the input space and do not leverage the input-output dependency of multimodal-distributed data,…

2019-03-18abs ↗pdf ↗

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.

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.

High-dimensional prediction is a challenging problem setting for traditional statistical models. Although regularization improves model performance in high dimensions, it does not sufficiently leverage knowledge on feature importances held by domain experts. As an alternative to standard regularization techniques, we p…

2019-12-09abs ↗pdf ↗

Sigmoid gating is more sample efficient than softmax in mixture of experts.

problem Softmax gating leads to unnecessary competition among experts, causing representation collapse.
method Theoretical analysis of a regression framework with mixture of experts, identifying identifiability conditions and convergence rates.
result Sigmoid gating requires fewer samples to achieve the same expert estimation error as softmax gating.

Existing imitation learning approaches often require that the complete demonstration data, including sequences of actions and states, are available. In this paper, we consider a more realistic and difficult scenario where a reinforcement learning agent only has access to the state sequences of an expert, while the expe…

2019-03-11abs ↗pdf ↗

Multi-expert L2D underfits more severely, requiring new methods.

problem Underfitting in multi-expert L2D settings.
method PiCCE (Pick the Confident and Correct Expert), a surrogate-based method.
result PiCCE effectively reduces multi-expert L2D to a single-expert-like problem, resolving underfitting.

New findings explain why online methods outperform offline methods in noisy expert feedback settings.

problem The challenge of learning from imperfect expert feedback in sequential decision-making systems.
method Introduced a noisy expert model and a novel variant of on-policy distillation (OPD) to address the gap between offline and online imitation learning.
result Online interaction with a noisy expert via OPD enables polynomial dependence on the horizon, unlike offline methods which require exponential growth in sample complexity.

MM-DREX adapts LLM experts for financial trading via dynamic routing.

problem Challenges of non-stationary financial markets and static expert designs.
method MM-DREX uses a VLM-powered dynamic router to allocate expert weights and designs heterogeneous trading experts.
result Significantly outperforms 15 baselines across key metrics.

Proposes GPHMEs using Gaussian processes for hierarchical expert models.

problem Hierarchical mixtures of experts with complex gating functions.
method Gaussian process-gated hierarchical mixtures of experts (GPHMEs) with non-linear gating and expert functions.
result Outperforms tree-based HMEs and achieves good performance with reduced complexity.

Improved transfer learning with expert models, reducing compute and speeding up performance.

problem Improving sample efficiency and reducing computational requirements for new tasks.
method Training a diverse set of experts using existing label structures and performance proxies to select the relevant expert for each target task.
result Significant speed-up of 2-3 orders of magnitude compared to competing approaches.

VMoER improves uncertainty quantification in MoE layers for scalable foundation models.

problem Uncertainty quantification in large-scale models like MoE layers.
method Structured Bayesian approach with amortized variational inference over routing logits and temperature parameter inference.
result Improves routing stability, reduces calibration error, and increases AUROC by 12%.

Mixtures of experts probabilistically divide the input space into regions, where the assumptions of each expert, or conditional model, need only hold locally. Combined with Gaussian process (GP) experts, this results in a powerful and highly flexible model. We focus on alternative mixtures of GP experts, which model th…

2019-05-30abs ↗pdf ↗