{"title":"估计大规模树Logit模型","authors":"Srikanth Jagabathula, Paat Rusmevichientong, Ashwin Venkataraman, Xinyi Zhao","doi":"10.1287/opre.2023.2479","DOIUrl":null,"url":null,"abstract":"In “Estimating Large-Scale Tree Logit Models,” S. Jagabathula, P. Rusmevichientong, A. Venkataraman, and X. Zhao tackle the demand estimation problem under the tree logit model, also known as the nested logit or d-level nested logit model. The model is ideal for scenarios in which products can be grouped naturally based on their attributes into a hierarchy or taxonomy, such as flight itineraries grouped by departure time (morning or evening) and number of stops (nonstop or one stop). The current estimation methods are not practical for real-world applications that can involve hundreds or even thousands of products. The authors develop a fast, iterative method that computes a sequence of parameter estimates using simple closed-form updates by exploiting the structure of the negative log-likelihood objective. Numerical results on both synthetic and real data show that their proposed algorithm outperforms state-of-the-art optimization methods, especially for large-scale tree logit models with thousands of products.","PeriodicalId":49809,"journal":{"name":"Military Operations Research","volume":"462 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Estimating Large-Scale Tree Logit Models\",\"authors\":\"Srikanth Jagabathula, Paat Rusmevichientong, Ashwin Venkataraman, Xinyi Zhao\",\"doi\":\"10.1287/opre.2023.2479\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In “Estimating Large-Scale Tree Logit Models,” S. Jagabathula, P. Rusmevichientong, A. Venkataraman, and X. Zhao tackle the demand estimation problem under the tree logit model, also known as the nested logit or d-level nested logit model. The model is ideal for scenarios in which products can be grouped naturally based on their attributes into a hierarchy or taxonomy, such as flight itineraries grouped by departure time (morning or evening) and number of stops (nonstop or one stop). The current estimation methods are not practical for real-world applications that can involve hundreds or even thousands of products. The authors develop a fast, iterative method that computes a sequence of parameter estimates using simple closed-form updates by exploiting the structure of the negative log-likelihood objective. Numerical results on both synthetic and real data show that their proposed algorithm outperforms state-of-the-art optimization methods, especially for large-scale tree logit models with thousands of products.\",\"PeriodicalId\":49809,\"journal\":{\"name\":\"Military Operations Research\",\"volume\":\"462 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Military Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1287/opre.2023.2479\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2023.2479","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0
摘要
S. Jagabathula, P. Rusmevichientong, A. Venkataraman和X. Zhao在“估计大规模树Logit模型”中解决了树Logit模型下的需求估计问题,也称为嵌套Logit或d级嵌套Logit模型。该模型非常适合这样的场景,在这些场景中,产品可以根据其属性自然地分组到层次结构或分类法中,例如按起飞时间(早晨或晚上)和停靠次数(直飞或一站)分组的航班行程。当前的估计方法对于可能涉及数百甚至数千个产品的实际应用并不实用。作者开发了一种快速迭代的方法,通过利用负对数似然目标的结构,使用简单的封闭形式更新来计算参数估计序列。合成数据和实际数据的数值结果表明,该算法优于当前最先进的优化方法,特别是对于具有数千个产品的大型树logit模型。
In “Estimating Large-Scale Tree Logit Models,” S. Jagabathula, P. Rusmevichientong, A. Venkataraman, and X. Zhao tackle the demand estimation problem under the tree logit model, also known as the nested logit or d-level nested logit model. The model is ideal for scenarios in which products can be grouped naturally based on their attributes into a hierarchy or taxonomy, such as flight itineraries grouped by departure time (morning or evening) and number of stops (nonstop or one stop). The current estimation methods are not practical for real-world applications that can involve hundreds or even thousands of products. The authors develop a fast, iterative method that computes a sequence of parameter estimates using simple closed-form updates by exploiting the structure of the negative log-likelihood objective. Numerical results on both synthetic and real data show that their proposed algorithm outperforms state-of-the-art optimization methods, especially for large-scale tree logit models with thousands of products.
期刊介绍:
Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.