Unified model for prediction and deferral selects top-k entities efficiently.
problem Efficiently selecting top-k entities for deferral in machine learning.
method One-stage Top- k k k Learning-to-Defer framework with a convex surrogate. result Unified model achieves superior accuracy-cost trade-offs.
The paper proposes a method to improve prediction accuracy by querying expert knowledge sequentially.
problem Prediction in high-dimensional settings with limited samples and costly expert consultation.
method Formulates knowledge elicitation as a probabilistic inference process, sequentially querying experts to improve predictions.
result The method shows improved prediction accuracy with minimal expert effort.
YRC-Bench benchmarks AI agents learning to collaborate with experts.
problem Learning to recognize when to consult an expert in novel situations.
method Validation strategy and proposer-validator decomposition.
result Insights for future AI safety research.
HabitatAgent offers a multi-agent system for transparent housing consultation.
problem Opaque reasoning and brittle multi-constraint handling in housing recommendation systems.
method HabitatAgent is a multi-agent architecture with specialized roles for memory, retrieval, generation, and validation.
result HabitatAgent achieves 95% accuracy in real user consultation scenarios, significantly outperforming a strong baseline.
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- k k k Learning-to-Defer framework, including adaptive Top- k ( x ) k(x) k ( x ) variant. result Superior accuracy-cost trade-offs with multi-expert deferral.
End-to-end CAD system for thyroid nodule classification using multimodal data and expert guidance.
problem Improving accuracy in thyroid nodule classification for clinicians.
method Knowledge-driven DenseNet framework using multimodal ultrasound data and expert cues.
result The proposed system achieves relevant performances in thyroid nodule classification.
A study ranks critical Lean Six Sigma tools for implementation in Portuguese companies.
problem Identifying the most important tools for successful Lean Six Sigma implementation in Portugal.
method An online survey with Portuguese consultants evaluated 37 tools based on frequency of use, difficulty, importance, and impact. A ranking was developed using a procedure to assess consultants' know-how.
result Honshin Kanri, VOC, VSM were identified as the most important tools for Lean Six Sigma implementation.
Hybrid system matches patients with family doctors based on trust and history.
problem Matching patients with suitable family doctors in primary care.
method Hybrid recommender system combining patient trust from consultation histories and temporal dynamics.
result Predictive accuracy is higher than heuristic and collaborative filtering approaches, and trust measure improves performance.
The Canonical Regression Quantile method predicts CEO compensation and future performance.
problem Determining fair CEO compensation and its impact on company performance.
method Canonical Regression Quantile method to assess CEO pay and performance.
result The method can predict future CEO performance and distinguish over/underpaid CEOs.
Unified model predicts disease spread using EMD and ensemble learning.
problem Predicting fluctuating disease spread and individual behavior.
method SEIS-A framework, EMD decomposition, ensemble learning, on-line query data.
result The method outperforms other methods in predicting HFMD consultation rates.
Bayesian principles improve agentic AI decision-making.
problem Decision-making under uncertainty in agentic AI systems.
method Bayesian decision theory applied to the orchestration layer of agentic AI.
result Bayesian principles enhance agentic AI's ability to make decisions under uncertainty.
The three-state agent-based 2D model of financial markets as proposed by Giulia Iori has been extended by introducing increasing trust in the correctly predicting agents, a more realistic consultation procedure as well as a formal validation mechanism. This paper shows that such a model correctly reproduces the three f…
Framework improves ML performance by identifying high-quality data.
problem Poor data quality hampers ML performance.
method Intelligent data-centric evaluation framework combining quality measurements and unsupervised learning.
result Framework improves ML system performance in real-world use case.
This survey treats the problem of ruin in a risk model when assets earn investment income. In addition to a general presentation of the problem, topics covered are a presentation of the relevant integro-differential equations, exact and numerical solutions, asymptotic results, bounds on the ruin probability and also th…
In this paper, we investigate the structure of the Gardiner-Masur boundary of Teichmuller space. Indeed, we will give a geometric description of boundary comparing to the Duchin-Leininger-Rafi compactification of the space of singular flat structures. We will obtain the coincidence between the Gardiner-Masur boundary a…
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.
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.
New UCB algorithms tackle contextual bandits with stochastic experts, achieving instance-dependent regret bounds.
problem Contextual bandits with stochastic experts, a variation of traditional stochastic contextual bandits.
method Proposes UCB algorithms using importance sampling to estimate mean rewards from multiple experts.
result Achieves instance-dependent regret bounds of $\mathcal{O}\left(λ(\pmbμ)\mathcal{M}\log T/Δ
ight)$ , with λ ( μ ) λ(\pmbμ) λ ( μ ) typically O ( log N ) \mathcal{O}(\log N) O ( log N ) . 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.
Model fills missing sensor data by capturing complex temporal dynamics.
problem Missing sensor data complicates analysis and visualization.
method Iterative Imputing Network that summarizes context and captures latent dynamics.
result Significantly outperforms previous methods on benchmark datasets.
This paper formed part of a preliminary research report for a risk consultancy and academic research. Stochastic Programming models provide a powerful paradigm for decision making under uncertainty. In these models the uncertainties are represented by a discrete scenario tree and the quality of the solutions obtained i…
HS-MoE selects sparse experts using adaptive priors and data-adaptive gating.
problem Sparse expert selection in mixture-of-experts architectures.
method Combines horseshoe prior with input-dependent gating for data-adaptive sparsity.
result Data-adaptive sparsity in expert usage.
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.
The influence of additional information on the decision making of agents, who are interacting members of a society, is analyzed within the mathematical framework based on the use of quantum probabilities. The introduction of social interactions, which influence the decisions of individual agents, leads to a generalizat…
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.
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.
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 i l d e O ( i ∗ K + K T ) ilde{\mathcal{O}} \big( i^*K + \sqrt{KT} \big) i l d e O ( i ∗ K + K T ) on regret. New algorithm reduces expert prediction regret for two experts.
problem Efficient prediction with two experts under fixed time constraints.
method Optimal algorithm based on stochastic calculus techniques.
result Achieves optimal regret of sqrt(T/2π) + O(1) with O(1) per-turn processing time.
The article improves prediction by aggregating Kalman recursions online.
problem Improving expert aggregation in prediction models.
method Using exponential weights and state-space models to aggregate Kalman recursions.
result New algorithms outperform existing methods in Kalman recursion expert aggregation.
System uses conformal prediction to help experts make accurate decisions without understanding when to trust it.
problem Helping experts make accurate decisions in multiclass classification tasks.
method Develops an automated decision support system using conformal prediction to provide precise prediction sets and an efficient search method.
result System improves expert predictions by providing precise prediction sets and forcing experts to predict from these sets.
RCAM-based ensemble combines binary classifiers using similarity and vote scheme.
problem Improving binary classification accuracy through ensemble methods.
method RCAM-based ensemble combining classifiers using similarity and recurrent consult-vote scheme.
result RCAM-based ensemble outperforms individual classifiers and majority voting.
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.
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.
Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are allowed to ask for advice of a limited number M M M out of N N N experts. This setting is especially interesting when asking for advice of ever…
Reinforcement learning mimics expert behavior.
problem Learning from expert demonstrations in reinforcement learning.
method Reduction to reinforcement learning with a stationary reward.
result Expert reward can be recovered and imitation learning is bounded.
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.
Dynamic partition models learn compact binary representations from data.
problem Learning accurate distributed representations of high-dimensional data.
method The approach involves partitioning variables into expert supports, dynamically adapting partitions based on active experts, and using a smoothed version of the model with separate mixtures for each data dimension.
result Accurate reconstructions of high-dimensional data points achieved with a dozen experts.
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.
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.
Optimal algorithm found for anytime regret with two experts.
problem Minimizing regret in prediction with two experts when time horizon is unknown.
method Designing a minimax optimal algorithm using ideas from stochastic calculus.
result Proved the optimal regret is γ√t / 2 for all time steps t.
Non-experts design prediction tasks and train models on the data they collect.
problem Leveraging non-expert contributions in AI prediction tasks.
method Crowdsourcing platform for task design, automatic model training and evaluation.
result Non-experts can design useful prediction tasks and train models on the data they collect.
Hybrid RL learns from expert state sequences without full action data.
problem Learning from expert state sequences without full action data.
method Tensor-based model to infer unobserved actions; hybrid RL objective.
result Hybrid RL outperforms pure RL and tensor-based action inference.
A model learns new tasks sequentially, using gating autoencoders to select relevant experts.
problem Learning new tasks without storing previous data, ensuring scalability and relevance.
method Sequential learning with gating autoencoders to select relevant experts for new tasks.
result The method selects the most relevant expert for a new task, improving efficiency and scalability.
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.
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 O ( ( n + n e ) T 2 / 3 ) O((n+n_e)T^{2/3}) O (( n + n e ) T 2/3 ) and O ( ( n + n e ) T ) O((n+n_e)\sqrt{T}) O (( n + n e ) T ) regret guarantees. result Effective extension of standard L2D to settings with varying expert availability and reliability.
A new method for multi-expert learning-to-defer avoids optimization issues.
problem Optimization issues in multi-expert learning-to-defer systems.
method A decoupled surrogate with a softmax classifier head and independent sigmoid heads per expert.
result First multi-expert L2D guarantee with a constant not growing with the expert pool.
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.