Optimization algorithms are rarely mentioned in the discrete choice literature. One reason may be that classic Newton-Raphson methods have been rather successful in estimating discrete choice parameters on available data sets of limited size. However, thanks to recent advances in data collection, abundant data about choice situations become more and more available, and state-of-the-art algorithms can be computationally burdensome on these massive datasets. In this paper, inspired by the good practices from the machine learning field, we introduce a Stochastic Newton Method (SNM) for the estimation of discrete choice models parameters. Our preliminary results indicate that our method outperforms (stochastic) first-order and quasi-newton methods.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    SNM: Stochastic Newton Methodfor Optimization of Discrete Choice Models


    Contributors:


    Publication date :

    2018-11-01


    Size :

    727789 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    POWER STEERING DEVICE AND METHODFOR MANUFACTURING POWER STEERING DEVICE

    KITAMURA KEISUKE / MARUYAMA TATSUYOSHI / SUGIYAMA HIROYUKI | European Patent Office | 2015

    Free access

    Body for a vehicleand methodfor mountingsucha body

    COURCIMEAUX ERIC | European Patent Office | 2021

    Free access

    Safety System and Methodfor Monitoring of Forklift Truck

    YANG SOO YUNG | European Patent Office | 2019

    Free access


    Accounting for stochastic variables in discrete choice models

    Díaz, Federico / Cantillo, Víctor / Arellana, Julian et al. | Elsevier | 2015