TL;DR
This paper introduces the HAMABS hybrid adaptive batch size stochastic algorithm, significantly improving the efficiency of estimating large-scale discrete choice models with big data, reducing computation time substantially.
Contribution
It proposes novel stochastic optimization algorithms, including the use of a stochastic Hessian and adaptive batch sizes, specifically tailored for discrete choice model estimation with big data.
Findings
HAMABS outperforms existing algorithms in speed and efficiency.
The new algorithms reduce estimation time by up to 23 times.
Extensive testing across ten benchmark cases validates the effectiveness of HAMABS.
Abstract
The emergence of Big Data has enabled new research perspectives in the discrete choice community. While the techniques to estimate Machine Learning models on a massive amount of data are well established, these have not yet been fully explored for the estimation of statistical Discrete Choice Models based on the random utility framework. In this article, we provide new ways of dealing with large datasets in the context of Discrete Choice Models. We achieve this by proposing new efficient stochastic optimization algorithms and extensively testing them alongside existing approaches. We develop these algorithms based on three main contributions: the use of a stochastic Hessian, the modification of the batch size, and a change of optimization algorithm depending on the batch size. A comprehensive experimental comparison of fifteen optimization algorithms is conducted across ten benchmark…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
