低预测误差未必能准确归因,该研究揭示了神经营销模型的归因失效问题。
Forecasting Is Not Attribution: Localizing Decoder Bypass in Graph-Based Neural Marketing Mix Models

- 设计DICE框架,通过图结构约束解码器通信路径,分离预测与归因任务。
- 实验证明:即使预测误差仅0.004,归因指标nAUPRC仍接近零。
- 适用于关注归因可信度的营销建模研究者,尤其重视图结构有效性。
营销组合模型用于预测业务结果并归因于各渠道,但这两者并非等价。本文研究图神经网络营销模型中的归因绕行现象:高容量解码器可通过目标自回归、密集通信、共同变动、上下文或隐式记忆实现低预测误差,却无法将反事实敏感性通过作为归因对象的图结构传递。为此提出DICE-MMM,一个受控诊断与训练框架。不声称观测模型能识别因果效应,而是将图恢复、预测精度和扰动影响是否与图对齐三个问题分离。第一阶段使用受限图引导解码器训练图编码器;第二阶段冻结编码器,训练图安全潜在解码器,其跨节点通信必须经由给定图。通过CIG、AR-CIG和图交换测试评估解码器性能。在控制的R/d/T变量替换及外部多图原始日志压力测试中,DICE相比CausalMMM提升了稳定图恢复能力。实验表明,预测精度不能作为归因有效性的证明:在稀疏目标基准上,无图与全图解码器均达到MSE@7≈0.004,而AR-CIG nAUPRC接近或低于零;而理想图可达到0.807±0.129,且预测误差相当。固定图交换测试显示,同一解码器在学习图输入下nAUPRC为-0.044±0.006,在理想图输入下提升至0.894±0.027。贡献在于揭示低预测误差可能掩盖归因失败,并指出未解决瓶颈是图支持选择,而非预测或解码器容量。
原文摘要 · Abstract (English)
Marketing mix models are used to forecast business outcomes and to attribute those outcomes to marketing channels, but these goals are not equivalent. We study a failure mode in graph-based neural MMM called attribution bypass: a high-capacity decoder can obtain low forecasting error through target autoregression, dense communication, co-movement, context, or latent memory while failing to route counterfactual sensitivity through the graph used as the attribution object. We introduce DICE-MMM as a bounded diagnostic and training framework. We do not claim that observational neural MMM identifies causal effects. Instead, DICE separates three questions often conflated in graph-based MMM: graph recovery, forecasting accuracy, and whether the trained decoder's perturbation-induced influence is graph aligned. Stage 1 trains a graph encoder with a restricted graph-mediated decoder. Stage 2 freezes the selected encoder and trains a graph-safe latent decoder whose cross-node communication must pass through the supplied graph. Decoder use is evaluated with CIG, AR-CIG, and graph-swap tests. Across controlled R/d/T swaps and an external multi-graph rawlog stress test, DICE improves stable graph recovery over CausalMMM. The experiments show that forecasting accuracy is not an attribution certificate: in a sparse-target benchmark, no-graph and full-graph decoders achieve MSE@7 around 0.004 while AR-CIG nAUPRC remains near or below zero, whereas an oracle graph reaches 0.807 +/- 0.129 at comparable MSE. Frozen graph-swap localizes the bottleneck: the same DICE-hard-trained decoder moves from nAUPRC -0.044 +/- 0.006 under learned graph inputs to 0.894 +/- 0.027 with the oracle graph. The contribution is a stress test and failure-localization framework showing that low MSE can hide attribution bypass and that the unresolved bottleneck is graph-support selection, not forecasting or decoder capacity.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。