pith. sign in
Pith Number

pith:7PLKTR26

pith:2026:7PLKTR2662WNWTJZQ2K7EX5S5S
not attested not anchored not stored refs resolved

Decision-Aware Proximal Bridge Learning for Optimal Treatment Selection

Alejandro Almod\'ovar, Axel Brando, Eduard Serrahima de Cambra, Gerard Sanz, Juan Parras, Tom\`as Garriga

A policy-targeted weighted bridge loss controls treatment-selection regret through a weighted ill-posedness constant in proximal causal inference.

arxiv:2605.16989 v1 · 2026-05-16 · cs.LG

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{7PLKTR2662WNWTJZQ2K7EX5S5S}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We prove a regret bound showing that the proposed weighted bridge loss controls treatment-selection regret through a weighted ill-posedness constant.

C2weakest assumption

The proximal causal inference identification assumptions hold, including the existence of suitable bridge functions and proxy variables that recover causal effects despite hidden confounding, and that the decision-aware weighting preserves identification.

C3one line summary

Introduces decision-aware proximal bridge learning using a weighted loss and regret bound to enhance optimal treatment selection in settings with hidden confounding.

References

51 extracted · 51 resolved · 0 Pith anchors

[1] Optuna: A next-generation hyperparameter optimization framework 2019
[2] DeCaFlow: A deconfounding causal generative model.arXiv preprint arXiv:2503.15114, 2025 2025
[3] Algorithms for hyper- parameter optimization 2011
[4] Alaa, James Jordon, and Mihaela van der Schaar 2020
[5] Estimating the effects of continuous- valued interventions using generative adversarial networks.Advances in neural information processing systems, 2020 2020

Formal links

3 machine-checked theorem links

Receipt and verification
First computed 2026-05-20T00:03:34.779483Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

fbd6a9c75ef6acdb4d398695f25fb2ec8581d1cc6d731b82b4c50b7243e80404

Aliases

arxiv: 2605.16989 · arxiv_version: 2605.16989v1 · doi: 10.48550/arxiv.2605.16989 · pith_short_12: 7PLKTR2662WN · pith_short_16: 7PLKTR2662WNWTJZ · pith_short_8: 7PLKTR26
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/7PLKTR2662WNWTJZQ2K7EX5S5S \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: fbd6a9c75ef6acdb4d398695f25fb2ec8581d1cc6d731b82b4c50b7243e80404
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "d487646a115efb53f416e9fcb2c34d909c67749ecce4939c63d75b43cb83b7b7",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.LG",
    "submitted_at": "2026-05-16T13:20:03Z",
    "title_canon_sha256": "447417b130ff6be53c9c0a4eb35a30fbf262069d7204d24137934180acf1fa83"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.16989",
    "kind": "arxiv",
    "version": 1
  }
}