用可解释约束提升交通政策模型准确率
DeepLogit: A sequentially constrained explainable deep learning modeling approach for transport policy analysis
- 先训练线性CNN,再约束参数引入深度模型
- 准确率显著优于传统选择模型,保留关键参数可解释性
- 适合需要可解释性的交通政策与城市规划研究
尽管深度学习在众多领域取得进展,但在规划与政策领域仍因黑箱特性而应用受限。本文提出一种名为DeepLogit的序列约束方法,用于交通政策分析中的深度学习建模。首先构建仅含线性项的卷积神经网络(CNN),等价于线性参数的多元逻辑回归模型;随后在该模型参数基础上,约束需解释的参数值,引入高阶项或Transformer等先进架构,以提升模型精度。该方法在新加坡真实公交刷卡数据上验证,既保持关键参数可解释性,又显著优于传统离散选择模型。研究展示了理论驱动的离散选择模型(DCM)与数据驱动的AI模型在可解释性与预测力上的协同潜力。随着数据规模扩大和结构复杂化,此方法有望实现更精准且适用于政策场景的建模。代码已开源。
原文摘要 · Abstract (English)
Despite the significant progress of deep learning models in multitude of applications, their adaption in planning and policy related areas remains challenging due to the black-box nature of these models. In this work, we develop a set of DeepLogit models that follow a novel sequentially constrained approach in estimating deep learning models for transport policy analysis. In the first step of the proposed approach, we estimate a convolutional neural network (CNN) model with only linear terms, which is equivalent of a linear-in-parameter multinomial logit model. We then estimate other deep learning models by constraining the parameters that need interpretability at the values obtained in the linear-in-parameter CNN model and including higher order terms or by introducing advanced deep learning architectures like Transformers. Our approach can retain the interpretability of the selected parameters, yet provides significantly improved model accuracy than the discrete choice model. We demonstrate our approach on a transit route choice example using real-world transit smart card data from Singapore. This study shows the potential for a unifying approach, where theory-based discrete choice model (DCM) and data-driven AI models can leverage each other's strengths in interpretability and predictive power. With the availability of larger datasets and more complex constructions, such approach can lead to more accurate models using discrete choice models while maintaining its applicability in planning and policy-related areas. Our code is available on https://github.com/jeremyoon/route-choice/ .
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。