arXiv AI By Matthew Shorvon, Frederik Mallmann-Trenn, David S. Watson

Probably Approximately Correct Maximum A Posteriori Inference

Read the original on arXiv AI →

arXiv:2601. 16083v2 Announce Type: replace-cross Abstract: Computing the conditional mode of a distribution, better known as the maximum a posteriori (MAP) assignment, is a fundamental task in probabilistic inference.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv AI.

arXiv AI
Jun 2

MINTS: Minimalist Thompson Sampling

arXiv:2606. 01655v1 Announce Type: cross Abstract: The Bayesian paradigm offers principled tools for sequential decision-making under uncertainty, but its reliance on a probabilistic model for all parameters can hinder the incorporation of complex structural constraints.

By Kaizheng Wang
arXiv AI
Jun 2

Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors

arXiv:2602. 03972v3 Announce Type: replace-cross Abstract: The best-arm identification (BAI) problem is one of the most fundamental problems in interactive machine learning, which has two flavors: the fixed-budget setting (FB) and the fixed-confidence setting (FC).

By Kapilan Balagopalan, Yinan Li, Yao Zhao, Tuan Nguyen, Anton Daitche, Houssam Nassif, Kwang-Sung Jun
arXiv AI
Jul 7

Fixed-Confidence Best-Arm Identification for Causal Mediation Analysis

arXiv:2607. 04315v1 Announce Type: cross Abstract: This paper studies the problem of identifying the treatment that maximizes the expected natural direct potential outcome (NDPO), which captures the potential outcome of an intervention while excluding the pathway transmitted through a mediator that researchers may wish to remove from evaluation.

By Harsh Shrivastava, Yuta Kawakami, Junpei Komiyama, Jin Tian