SearcharxivSearch

arXiv subjects

Kentaro Sakamaki

Publications and source records attributed to Kentaro Sakamaki.

2 recordsLinked to original sources

Energy Balancing Weights for Mediation Analysis

Causal mediation analysis requires reconstruction of counterfactual distributions to estimate natural direct and indirect effects. Inverse probability weighting estimators rely on models for treatment assignment and mediator density ratios, whereas moment balancing approaches require researchers to specify in advance which functions of the covariates and mediators should be balanced. We propose Energy Balancing Weights for Mediation Analysis (EBWMA), which targets the joint mediator-covariate distribution used to identify counterfactual means such as E[Y(1, M(0))]. Under standard identification conditions for natural effects, EBWMA constructs weights whose weighted empirical distribution approximates this target, without modeling treatment assignment, mediator density ratios, or the outcome regression. The weights minimize energy distance through two quadratic programming problems solved sequentially. In simulations with nonlinearly transformed, skewed, or binary covariates and nonlinear mediator and outcome models, EBWMA generally achieved favorable bias and root mean squared error, with uniformly lower Monte Carlo variability than gradient boosting-based inverse probability weighting and moment balancing weights. In an illustrative analysis of the National Health and Nutrition Examination Survey I Epidemiologic Follow-up Study, EBWMA gave the smallest standardized mean differences for most covariates and for the mediator.

stat.ME

Good Arm Identification via Bandit Feedback

We consider a novel stochastic multi-armed bandit problem called {\em good arm identification} (GAI), where a good arm is defined as an arm with expected reward greater than or equal to a given threshold. GAI is a pure-exploration problem that a single agent repeats a process of outputting an arm as soon as it is identified as a good one before confirming the other arms are actually not good. The objective of GAI is to minimize the number of samples for each process. We find that GAI faces a new kind of dilemma, the {\em exploration-exploitation dilemma of confidence}, which is different difficulty from the best arm identification. As a result, an efficient design of algorithms for GAI is quite different from that for the best arm identification. We derive a lower bound on the sample complexity of GAI that is tight up to the logarithmic factor $\mathrm{O}(\log \frac{1}δ)$ for acceptance error rate $δ$. We also develop an algorithm whose sample complexity almost matches the lower bound. We also confirm experimentally that our proposed algorithm outperforms naive algorithms in synthetic settings based on a conventional bandit problem and clinical trial researches for rheumatoid arthritis.

stat.ML