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,695 papers · 148 categories

Trend · papers per month

66131197262 · Jun 202019922001200920172026
48 results for Expert selection

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.

In this paper, we propose a hierarchical feature-aware tracking framework for efficient visual tracking. Recent years, ensembled trackers which combine multiple component trackers have achieved impressive performance. In ensembled trackers, the decision of results is usually a post-event process, i.e., tracking result …

2019-10-13abs ↗pdf ↗

LMoE uses LLMs to improve stock trading by selecting experts based on textual and price data.

problem Traditional neural network-based router selection in MoE models is suboptimal and ignores textual data.
method Proposes LLMoE, using LLMs as routers to select experts based on historical price data and stock news.
result LLoM outperforms state-of-the-art MoE models and other deep neural network approaches.

Generalized algorithm for translation and scale-invariant prediction.

problem Sequential prediction with expert advice, focusing on translation and scale invariance.
method Designing a generalized online algorithm using the universal prediction perspective to compete against a generic class of expert selection strategies.
result No preliminary knowledge of loss sequences is required; performance bounds are stable under arbitrary scalings and translations.

A new mechanism reduces expert belief regret in online forecasting.

problem Minimizing expert belief regret in strategic forecasting.
method Developed a no-regret mechanism for non-myopic experts using online I-ELF.
result Achieved ildeO(TN) ilde{O}(\sqrt{T N}) regret for full-information setting.

New algorithm minimizes expert selection regret in partial bandit feedback.

problem Minimizing expert selection regret in partial bandit feedback.
method Develops a sequential minimax optimal algorithm for a generalized partial monitoring setting.
result Second order regret bounds against a general expert selection sequence.

Unified framework for SGMoE resolves estimation and selection issues.

problem Non-identifiability, coupled differential relations, and tight coupling in softmax-Gated models.
method Unified statistical framework with Voronoi-type loss functions and dendrograms of mixing measures.
result Consistent selection of the number of experts without model sweeps, optimal parameter rates under overfitting.

New algorithms reduce label collection for online prediction with expert advice.

problem Efficiently predicting binary sequences with expert advice using fewer labels.
method Adaptive selective sampling for exponentially weighted forecasters.
result Label complexity scales roughly as the square root of the number of rounds for a scenario with a strictly better expert.

Active learning method for ABC statistics selection reduces expert work and improves posterior estimates.

problem Handling intractable likelihood functions in models with domain knowledge.
method Active learning method for selecting summary statistics in ABC.
result Better posterior estimates than existing methods, especially with limited simulation budget.

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%.

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.

Competency questions help experts select best clustering for energy data.

problem Ad hoc and subjective selection of clustering structures by domain experts.
method Formalize expert knowledge and requirements with competency questions.
result Competency questions improve reproducibility and evaluation of clustering applications.

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.

A fuzzy expert system selects stocks for BSE using AI techniques.

problem Selecting stocks for investment allocation is challenging due to many influencing factors.
method Dempster-Shafer (DS) evidence theory for rule base generation, portfolio optimization model with ACO algorithm.
result The model's performance is satisfactory for short-term investment.

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.

Paper proposes interpretable RL policies from a mixture of experts.

problem Making RL policies transparent and understandable in real-world applications.
method Policy iteration scheme with interpretable experts and prototypical states.
result Proposed algorithm learns policies comparable to neural networks but more interpretable.

New model handles complex non-linear relationships with hidden graph structures.

problem Modeling non-linear relationships with hidden graph-structured interactions.
method Block-diagonal localized mixture of polynomial experts (BLoMPE) regression model with penalized maximum likelihood selection criterion.
result Strong theoretical guarantee for finite-sample oracle inequality.

Expert system predicts credit card charge-offs using macroeconomic indicators.

problem Managing charge-off rates in the credit card industry.
method Developed an expert system using machine learning and macroeconomic indicators.
result Achieved mean squared error values of 1.15E-03 and 1.04E-03.

We explore the problem of learning under selective labels in the context of algorithm-assisted decision making. Selective labels is a pervasive selection bias problem that arises when historical decision making blinds us to the true outcome for certain instances. Examples of this are common in many applications, rangin…

2018-07-02abs ↗pdf ↗

Societies often rely on human experts to take a wide variety of decisions affecting their members, from jail-or-release decisions taken by judges and stop-and-frisk decisions taken by police officers to accept-or-reject decisions taken by academics. In this context, each decision is taken by an expert who is typically …

2018-05-25abs ↗pdf ↗

The goal of task transfer in reinforcement learning is migrating the action policy of an agent to the target task from the source task. Given their successes on robotic action planning, current methods mostly rely on two requirements: exactly-relevant expert demonstrations or the explicitly-coded cost function on targe…

2018-05-12abs ↗pdf ↗

Unified framework for expert selection with bandit and lower-bound feedback.

problem Selecting the best expert in scenarios with bandit feedback and lower-bound information.
method Introduces a new feedback model combining bandit and lower-bound information, proving optimal regret bounds for modified Exp3 algorithms.
result Optimal regret bounds for modified Exp3 algorithms, generalizing both bandit and full-information settings.

Paper proposes a novel method to accurately determine the number of experts in Gaussian-gated Gaussian MoE models.

problem Challenges in model selection for MoE models, especially with covariates.
method Introduces a novel extension using dendrograms of mixing measures to estimate the true number of mixture components.
result Achieves optimal convergence rates for parameter estimation and accurately approximates the regression function.

Adaptive Bayesian learning aggregates experts to improve performance.

problem Bayesian online learning's performance depends on inferential choices.
method Treat Bayesian update rules as experts and aggregate them based on sequential predictive losses.
result The aggregate competes with the best expert in hindsight at a low aggregation cost.

A new approach for learning from expert demonstrations using multiple perspectives.

problem Learning from expert demonstrations with limited information from different perspectives.
method Generative adversarial network-based active learning approach.
result Our approach effectively learns from expert demonstrations and highlights the importance of architectural choices.

In life sciences, the experts generally use empirical knowledge to recode variables, choose interactions and perform selection by classical approach. The aim of this work is to perform automatic learning algorithm for variables selection which can lead to know if experts can be help in they decision or simply replaced …

2015-11-04abs ↗pdf ↗

We improve MoE models for classification with rigorous guarantees and practical methods.

problem Limited guarantees for stable maximum-likelihood training and model selection in softmax-gated MoE models.
method Derived a batch MM algorithm with closed-form updates, proved finite-sample rates, and developed a dendrogram selector.
result Achieved near-parametric optimal rates for parameter recovery and improved accuracy over baselines.

In this paper, we derive a novel probabilistic model of boosting as a Product of Experts. We re-derive the boosting algorithm as a greedy incremental model selection procedure which ensures that addition of new experts to the ensemble does not decrease the likelihood of the data. These learning rules lead to a generic …

2012-02-14abs ↗pdf ↗

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 ↗

The paper shows how expert knowledge can improve treatment effect estimation.

problem Lack of leveraging expert knowledge in treatment effect estimation.
method Formally defining two types of expertise (predictive and prognostic) and demonstrating their influence on treatment effect estimation methods.
result Expertise type significantly influences treatment effect estimation methods, and can be predicted from a dataset.

A new method for learning to defer decisions with expert advice improves over standard methods.

problem Learning to defer decisions with expert advice in systems where expert information can be modified after selection.
method An augmented surrogate that operates on the composite expert-advice action space, providing consistency guarantees and excess-risk bounds.
result The method improves over standard Learning-to-Defer and adapts its advice acquisition behavior to the cost regime.

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.

LEARN-SAM improves RL from sub-optimal demonstrations by localizing expert policies and selectively using demonstrations.

problem Improving RL from sub-optimal or sparse demonstrations.
method Local Ensemble and Reparameterization with Split and Merge of expert policies (LEARN-SAM).
result LEARN-SAM boosts learning speed and accuracy by selectively using demonstrations.

In this work we describe a novel deep reinforcement learning architecture that allows multiple actions to be selected at every time-step in an efficient manner. Multi-action policies allow complex behaviours to be learnt that would otherwise be hard to achieve when using single action selection techniques. We use both …

2018-03-14abs ↗pdf ↗

Solving sequential decision prediction problems, including those in imitation learning settings, requires mitigating the problem of covariate shift. The standard approach, DAgger, relies on capturing expert behaviour in all states that the agent reaches. In real-world settings, querying an expert is costly. We propose …

2019-06-18abs ↗pdf ↗

L2D-CD learns to defer expert recommendations in causal discovery.

problem Combining expert knowledge with data-driven results in causal discovery when expert recommendations may contradict data.
method Adapting learning-to-defer algorithms for pairwise causal discovery, L2D-CD learns a deferral function to select between expert recommendations and data-driven methods.
result L2D-CD outperforms both causal discovery methods and the expert used in isolation, identifying domains where the expert's performance is strong or weak.

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.

Gryffin optimizes categorical variables in materials design, leveraging expert knowledge.

problem Optimizing categorical variables in complex design choices like molecule selection.
method Bayesian optimization with smooth approximations to categorical distributions, incorporating expert knowledge.
result Gryffin accelerates discovery of promising molecules and materials, highlighting relevant correlations.

Unified framework for deferring queries to top-k experts, improving accuracy-cost trade-offs.

problem Limitation of existing L2D frameworks to single-expert deferral.
method Top-kk Learning-to-Defer framework, including adaptive Top-k(x)k(x) variant.
result Superior accuracy-cost trade-offs with multi-expert deferral.