ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Bayesian experts”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.GTcs.DSTheoreticalRecentJul 9, 2026

Algorithmic Expert Aggregation

Wei Tang, Hanrui Zhang

This paper studies the problem of aggregating calibrated Bayesian experts into a new calibrated expert.

View →
cs.AIcs.LGRecentJun 1, 2026

Evidence-Gated LLM Priors for Multi-Objective Bayesian Optimization

Jiangyu Chen, Banyi

The paper proposes an objective-wise reputation-market mechanism to dynamically calibrate and gate LLM-generated expert priors in multi-objective Bayesian optimization, showing that dynamic calibratio…

View →
math.OCcs.AIcs.LGRecentJun 1, 2026

MINTS: Minimalist Thompson Sampling

Kaizheng Wang

The paper introduces MINTS, a minimalist Bayesian framework that simplifies sequential decision-making by placing priors only on the optimum location, allowing for the incorporation of structural cons…

View →
cs.AIcs.LGEmpiricalRecentJun 18, 2026

Toward Calibrated Mixture-of-Experts Under Distribution Shift

Gina Wong, Drew Prinster, Suchi Saria, Rama Chellappa +1 more

This paper studies the behavior of mixture-of-experts (MoE) models under distribution shift and proposes an adversarial reweighting method to improve their calibration.

View →
stat.MLcs.LGmath.STRecentJun 3, 2026

Bayesian learning for the stochastic shortest path problem

Chon Wai Ho, Sumeetpal S. Singh, Jiaqi Guo

The paper proposes a novel Bayesian framework to learn the optimal decision strategy for the stochastic shortest path problem by directly constructing the posterior beliefs for the action-value functi…

View →
cs.LGcs.AIRecentJun 1, 2026

ProbMoE: Differentiable Probabilistic Routing for Mixture-of-Experts

Heng Zhao, Zilei Shao, Guy Van den Broeck, Zhe Zeng

The paper introduces ProbMoE, a probabilistic routing framework that tackles the non-differentiability of top-$k$ routing in Mixture-of-Experts (MoE) models, achieving strong performance with improved…

View →
cs.NEcs.AIcs.LGEmpiricalRecentJul 26, 2026

Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds

Jin Wang, Xi Lin, Handing Wang

This paper proposes a learning-based framework, CBA-BO, for solving expensive constrained optimization problems with continuously varying threshold settings by learning a parametric constraint model.

View →
cs.CRcs.PLRecentMay 28, 2026

A Bayesian Approach to Membership Inference for Statistical Release

Lisa Oakley, Sam Stites, Cameron Moy, Steven Holtzen +2 more

This paper proposes a Bayesian framework to enhance membership inference attacks against released statistics by incorporating prior knowledge about the population's attribute dependency structure, out…

View →
cs.AIcs.LGstat.MERecentMay 29, 2026

Industrializing Prediction-Powered Inference: The GLIDE Library for Reliable GenAI and Agentic Systems Evaluation

Grégoire Martinon, Ibrahim Merad, Mohammed Raki

The paper introduces GLIDE, an open-source Python library that unifies multiple state-of-the-art Prediction-Powered Inference (PPI) estimators and samplers to provide reliable, debiased estimates and…

View →
cs.AIRecentMay 31, 2026

DAG-MoE: From Simple Mixture to Structural Aggregation in Mixture-of-Experts

Jiarui Feng, Hanqing Zeng, Karish Grover, Ruizhong Qiu +10 more

The paper proposes DAG-MoE, a novel sparse Mixture-of-Experts framework that replaces standard weighted-sum aggregation with structural aggregation to enhance model performance and enable multi-step r…

View →
stat.MLcs.AIcs.LGTheoreticalRecentJul 18, 2026

A Causal Markov Condition for Value

Olav Benjamin Vassend

This paper introduces the Value Causal Markov Condition (v-CMC) for linking causality and utility, and develops its foundations.

View →
cs.CLRecentJun 1, 2026

When Knowledge Is Not Free: Cost-Aware Evidence Selection in Retrieval-Augmented Generation

Mingyan Wu, Han Yang, Omer Ben-Porat, Yftah Ziser

This paper introduces cost-aware Retrieval-Augmented Generation (RAG), demonstrating that fixed evidence selection is brittle and that adaptive, agentic controllers are necessary for effective knowled…

View →
cs.ITcs.LGmath.STTheoreticalRecentJul 3, 2026

Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation?

Ivan Lau, Jonathan Scarlett

This paper investigates the necessity of interaction for order-optimal 1-bit mean estimation in nonparametric finite-moment classes.

View →
cs.CLEmpiricalRecentJul 9, 2026

It Takes a MAESTRO To Prune Bad Experts

Palaash Goel, Ayush Maheshwari, Tanmoy Chakraborty

MAESTRO is a structured pruning framework designed for MoE language models that models autoregressive expert activation trajectories as Ergodic Markov chains, yielding a globally aware importance heur…

View →
cs.DSmath.PRTheoreticalRecentJul 24, 2026

HyperLogLog for probabilists

Lucas Gerin

This paper provides non-asymptotic and explicit estimates for the exponential deviation inequalities of the HyperLogLog estimator.

View →
cs.LGstat.MLRecentJun 1, 2026

Local Preferential Bayesian Optimization

Johanna Menn, Miriam Kober, Paul Brunzema, David Stenger +1 more

The paper introduces local Preferential Bayesian Optimization (PBO) methods that adapt high-dimensional Bayesian Optimization techniques, such as trust-region and derivative-informed local search, to…

View →
cs.CLRecentMay 29, 2026

MoG: Mixture of Experts for Graph-based Retrieval-Augmented Generation

Zheng Yuan, Chuang Zhou, Linhao Luo, Siyu An +3 more

MoG proposes a novel Mixture of Experts framework for graph-based RAG, which uses hub graphs to guide the sparse activation of domain-specific expert graphs, significantly improving retrieval accuracy…

View →