Paper improves regret bounds for distributed experts problem.
problem Minimizing loss in a distributed experts problem.
method Protocol achieving improved regret bound with minimized communication.
result Regret bound improved to .
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,694 papers · 148 categories
Trend · papers per month
48 results for “distributed experts”
A new method uses a product of experts with Dirichlet variables to approximate complex distributions.
problem Approximating complex distributions with tractable models.
method A product of experts with auxiliary Dirichlet variables, using a Feynman identity to sample and optimize.
result The method efficiently approximates complex distributions using a product of experts and Dirichlet variables.
New method calibrates Gaussian product experts for better predictions.
problem Erratic predictions and uncalibrated uncertainty in Gaussian product experts.
method Calibration via tempered softmax and Wasserstein barycenter for predictions.
result Improved predictions with better mean and uncertainty quantification.
ARGUE combines expert networks for anomaly detection.
problem Anomaly detection without labeled data.
method Gated mixture-of-experts architecture combining expert networks.
result Prior knowledge about normal data distribution is valuable.
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.
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.
Develops a simulation-based method to translate expert knowledge into prior distributions for Bayesian models.
problem Effective incorporation of expert knowledge into prior distributions for diverse model structures.
method Simulation-based stochastic gradient descent to learn hyperparameters of parametric priors from expert knowledge.
result Method is adaptable to various elicitation techniques and independent of model structure.
Dynamic Partition Modelsstat.ML
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 …
A recommender system based on ranks is proposed, where an expert's ranking of a set of objects and a user's ranking of a subset of those objects are combined to make a prediction of the user's ranking of all objects. The rankings are assumed to be induced by latent continuous variables corresponding to the grades assig…
Expert augmentation improves hybrid model generalization.
problem Limited generalization of hybrid models outside training distribution.
method Introducing expert augmentation to improve hybrid model performance.
result Expert augmentation improves generalization of hybrid models.
Bayesian model fuses multiple classifiers with explicit correlation modeling.
problem Combining outputs of multiple classifiers with explicit correlation.
method Hierarchical Bayesian model with correlated Dirichlet distribution.
result Fused classifier performance can be Bayes optimal even for highly correlated base classifiers.
A new CoVaR framework integrates expert views using entropy pooling.
problem Risk assessment and spillover effects from diverse expert views.
method Entropy pooling method to integrate expert views and compute general CoVaR.
result General CoVaR shows linear relationships with expectations and differences in expectations, and nonlinear dependencies with variance, quantiles, and correlation.
Study post-hoc Learning to Defer using density-ratio losses.
problem Optimizing decision-making between models and experts.
method Density-ratio losses for post-hoc L2D scorers, derived from class-probability estimation.
result The approach recovers known results and introduces new connections to expert comparison and anomaly detection.
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,…
Improved regret bounds for bandits with fixed expert advice using information theory.
problem Optimizing regret in bandit problems with fixed expert distributions.
method Information-theoretic analysis and KL-divergence measures.
result First regret bounds for EXP4 that can get arbitrarily close to zero under certain conditions.
Proposes a FoE prior for improving CNN performance in distribution shifts.
problem Improving CNN performance in image analysis tasks with distribution shifts.
method Uses a field-of-experts (FoE) prior to match feature distributions of test and training images.
result Outperforms previous TTA methods in lesion segmentation and most healthy tissue segmentation tasks.
We consider the problem of contextual bandits with stochastic experts, which is a variation of the traditional stochastic contextual bandit with experts problem. In our problem setting, we assume access to a class of stochastic experts, where each expert is a conditional distribution over the arms given a context. We p…
Incorporating Expert Opinion on Observable Quantities into Statistical Models -- A General Frameworkstat.ML
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.
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 method for ILO with transition model disparity using an intermediary policy.
problem Learning tasks from expert observations with different transition dynamics.
method Training an intermediary policy to match the state transitions of the expert dataset.
result Our method outperforms existing ILO approaches with transition model mismatch.
Mixture of Experts (MoE) is a popular framework in the fields of statistics and machine learning for modeling heterogeneity in data for regression, classification and clustering. MoE for continuous data are usually based on the normal distribution. However, it is known that for data with asymmetric behavior, heavy tail…
Proposes -balancing for more balanced expert utilization in MoE models.
problem Balanced expert utilization in MoE models to avoid bias.
method Directly targets population-level balance by minimizing a convex potential function.
result Consistently outperforms prior methods in stability and effectiveness.
Meta-algorithm optimizes nonstochastic bandits with infinitely many experts.
problem Maximizing reward by choosing actions sequentially from a set of experts.
method Proposed a variant of Exp4.P for infinitely many experts and a meta-algorithm.
result Proved high-probability upper bound of on regret.
Learning From Multiple Experts: Self-paced Knowledge Distillation for Long-tailed Classificationcs.CV
In real-world scenarios, data tends to exhibit a long-tailed distribution, which increases the difficulty of training deep networks. In this paper, we propose a novel self-paced knowledge distillation framework, termed Learning From Multiple Experts (LFME). Our method is inspired by the observation that networks traine…
Combines neural networks and expert rules for concept-based learning.
problem Extending concept-based learning with machine learning models.
method Form constraints for joint probability distribution and represent feasible set as a convex polytope.
result Neural networks can be trained to satisfy expert rules without violating them.
Online L2D algorithm for multiclass classification with varying experts.
problem Handling streaming data, changing expert availability, and shifting expert distribution.
method First online L2D algorithm with and regret guarantees.
result Effective extension of standard L2D to settings with varying expert availability and reliability.
Optimizes expensive experiments by incorporating expert knowledge.
problem Expensive experiments require minimizing the number of trials.
method Bayesian optimization with posterior sampling of expert knowledge.
result Demonstrates significant efficiency gains in experiments and hyperparameter tuning.
We consider the problem of imitation learning from a finite set of expert trajectories, without access to reinforcement signals. The classical approach of extracting the expert's reward function via inverse reinforcement learning, followed by reinforcement learning is indirect and may be computationally expensive. Rece…
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.
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.
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.
Continuous control imitation learning fails if expert actions are smooth.
problem Continuous control imitation learning fails if expert actions are smooth.
method Study of imitation learning in discrete-time, continuous state-and-action control systems.
result Any smooth, deterministic imitator policy suffers exponentially larger error than the expert.
Sharp bounds found on expert error in binary advice aggregation.
problem Aggregating binary advice from conditionally independent experts.
method Sharp upper and lower bounds on optimal error probability in asymmetric case.
result Sharp bounds recover and sharpen known results in symmetric case.
Bayesian Experience Reuse improves learning from multiple experts.
problem Learning from multiple experts with conflicting goals.
method Bayesian neural networks with shared features to model uncertainty and derive a probability distribution over expert models.
result BERS method effectively samples demonstrations from the derived distribution to reuse them in new tasks.
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…
To quantify an operational risk capital charge under Basel II, many banks adopt a Loss Distribution Approach. Under this approach, quantification of the frequency and severity distributions of operational risk involves the bank's internal data, expert opinions and relevant external data. In this paper we suggest a new …
GWIL uses Gromov-Wasserstein distance to align expert and imitation agent states.
problem Cross-domain imitation learning challenges due to different system dimensions and stationary distributions.
method Gromov-Wasserstein Imitation Learning (GWIL) using Gromov-Wasserstein distance.
result GWIL effectively aligns expert and imitation agent states in various continuous control domains.
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…
Synthesizes robust estimators for domain adaptation.
problem Improving prediction accuracy in target domain with limited data.
method Synthesizes a family of robust least squares estimators using convex optimization.
result Robust strategies can outperform non-robust interpolations.
In this work we study the problem of inferring a discrete probability distribution using both expert knowledge and empirical data. This is an important issue for many applications where the scarcity of data prevents a purely empirical approach. In this context, it is common to rely first on an initial domain knowledge …
New method improves conformal prediction for ambiguous labels.
problem Uncertainty in expert voting labels affects CP guarantees.
method Develops Monte Carlo CP procedures approximating true posterior.
result Monte Carlo CP closes coverage gap with expert annotations.
Learning from demonstration (LfD) is the process of building behavioral models of a task from demonstrations provided by an expert. These models can be used e.g. for system control by generalizing the expert demonstrations to previously unencountered situations. Most LfD methods, however, make strong assumptions about …
Model explains capital allocation and wealth distribution dynamics in a frictional economy.
problem Understanding capital allocation and wealth distribution dynamics in a frictional economy.
method Mean-field game approach to model interactions between expert and household groups.
result Experts accumulate capital during booms and quickly reverse behavior in busts, even without macro-shocks.
Learning Pattern-Specific Experts for Time Series Forecasting Under Patch-level Distribution Shiftcs.LG
TFPS improves time series forecasting by learning pattern-specific experts.
problem Challenges in forecasting time series data with varying patterns across segments.
method Dual-domain encoder, subspace clustering, pattern-specific experts.
result Significantly improved forecasting accuracy, especially in long-term forecasting.
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…
EBBS integrates expert assessments into MIO best-subsets problem.
problem Identifying relevant features in statistical models.
method Expert-implied Bayesian approach using MIO.
result Reduces to classical best-subsets when experts are silent.
This paper investigates a financial market where returns depend on an unobservable Gaussian drift process. While the observation of returns yields information about the underlying drift, we also incorporate discrete-time expert opinions as an external source of information. For estimating the hidden drift it is crucial…
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.