Papers › Kernel Conditional Moment Constraints for Confounding Robust Inference

Kernel Conditional Moment Constraints for Confounding Robust Inference

26 Feb 2023arXiv:2302.13348archive 2025-07-28

Kei Ishikawa, Niao He

We study policy evaluation of offline contextual bandits subject to unobserved confounders. Sensitivity analysis methods are commonly used to estimate the policy value under the worst-case confounding over a given uncertainty set. However, existing work often resorts to some coarse relaxation of the uncertainty set for the sake of tractability, leading to overly conservative estimation of the policy value. In this paper, we propose a general estimator that provides a sharp lower bound of the policy value. It can be shown that our estimator contains the recently proposed sharp estimator by Dorn and Guo (2022) as a special case, and our method enables a novel extension of the classical marginal sensitivity model using f-divergence. To construct our estimator, we leverage the kernel method to obtain a tractable approximation to the conditional moment constraints, which traditional non-sharp estimators failed to take into account. In the theoretical analysis, we provide a condition for the choice of the kernel which guarantees no specification error that biases the lower bound estimation. Furthermore, we provide consistency guarantees of policy evaluation and learning. In the experiments with synthetic and real-world data, we demonstrate the effectiveness of the proposed method.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2302.13348")

Code

Syntology Ran 0 of 17 code samples harvested from 2 repositories linked to this paper; 17 have no recorded run.

By repository: official repository: 9 samples from 1 repository, 0 ran; community (archive-listed): 8 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

kstoneriv3/confounding-robust-inference-old officialmentioned in papermentioned on GitHubpytorchMIT report
kstoneriv3/confounding-robust-inference mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

17 samples harvested; 0 ran; 0 honoured the contract we drafted; 17 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

17unverified

Licence: 0 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

estimate_p_t kstoneriv3/confounding-robust-inference-old/kcmc/data_binary.py official repository unverified MIT (permissive) · d668cc89fa16f23f · report
estimate_p_t kstoneriv3/confounding-robust-inference-old/kcmc/data_continuous.py official repository unverified MIT (permissive) · c2b0de5d429130d0 · report
evaluate_policy kstoneriv3/confounding-robust-inference-old/kcmc/data_binary.py official repository unverified MIT (permissive) · 212507fb5a1cb43c · report
evaluate_policy kstoneriv3/confounding-robust-inference-old/kcmc/data_continuous.py official repository unverified MIT (permissive) · 92802e330a871651 · report
generate_data kstoneriv3/confounding-robust-inference-old/kcmc/data_binary.py official repository unverified MIT (permissive) · 7183e20cd75cfd98 · report
generate_data kstoneriv3/confounding-robust-inference-old/kcmc/data_continuous.py official repository unverified MIT (permissive) · c7f42d4663c6fe4d · report
get_data kstoneriv3/confounding-robust-inference-old/kcmc/experiment_policy_evaluation.py official repository unverified MIT (permissive) · 14d72f0a39adc134 · report
hajek kstoneriv3/confounding-robust-inference-old/kcmc/estimators.py official repository unverified MIT (permissive) · 0fb486d9a4b3bf40 · report
ipw kstoneriv3/confounding-robust-inference-old/kcmc/estimators.py official repository unverified MIT (permissive) · b1404ab21db97d52 · report
apply_black_magic kstoneriv3/confounding-robust-inference/confounding_robust_inference/estimators/kcmc.py community (archive-listed) unverified MIT (permissive) · 7796c220a2ef55ef · report
as_tensor kstoneriv3/confounding-robust-inference/confounding_robust_inference/utils/types.py community (archive-listed) unverified MIT (permissive) · d9d53255711b0de6 · report
find_method_names kstoneriv3/confounding-robust-inference/confounding_robust_inference/utils/docs.py community (archive-listed) unverified MIT (permissive) · 85c21527f1667191 · report
find_methods kstoneriv3/confounding-robust-inference/confounding_robust_inference/utils/docs.py community (archive-listed) unverified MIT (permissive) · 6bf9c395e73ff0c4 · report
find_parent_classes_with_method_docstring kstoneriv3/confounding-robust-inference/confounding_robust_inference/utils/docs.py community (archive-listed) unverified MIT (permissive) · efa0b6a8184124f0 · report
get_hajek_constraints kstoneriv3/confounding-robust-inference/confounding_robust_inference/estimators/constraints.py community (archive-listed) unverified MIT (permissive) · 27ab0086abac400d · report
get_multipliers kstoneriv3/confounding-robust-inference/confounding_robust_inference/estimators/ncmc.py community (archive-listed) unverified MIT (permissive) · acada98a30d3ca55 · report
get_normal_ci kstoneriv3/confounding-robust-inference/confounding_robust_inference/estimators/misc.py community (archive-listed) unverified MIT (permissive) · 1bccadf4ce63ff7b · report

Tasks

Multi-Armed BanditsSensitivity

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections