A Recursive Partitioning Approach for Dynamic Discrete Choice Modeling in High Dimensional Settings

• URL: http://arxiv.org/abs/2208.01476v1
• Date: Tue, 2 Aug 2022 14:13:25 GMT
• Title: A Recursive Partitioning Approach for Dynamic Discrete Choice Modeling in High Dimensional Settings
• Authors: Ebrahim Barzegary, Hema Yoganarasimhan
• Abstract summary: estimation of dynamic discrete choice models is often computationally intensive and/or infeasible in high-dimensional settings. We present a semi-parametric formulation of dynamic discrete choice models that incorporates a high-dimensional set of state variables.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dynamic discrete choice models are widely employed to answer substantive and policy questions in settings where individuals' current choices have future implications. However, estimation of these models is often computationally intensive and/or infeasible in high-dimensional settings. Indeed, even specifying the structure for how the utilities/state transitions enter the agent's decision is challenging in high-dimensional settings when we have no guiding theory. In this paper, we present a semi-parametric formulation of dynamic discrete choice models that incorporates a high-dimensional set of state variables, in addition to the standard variables used in a parametric utility function. The high-dimensional variable can include all the variables that are not the main variables of interest but may potentially affect people's choices and must be included in the estimation procedure, i.e., control variables. We present a data-driven recursive partitioning algorithm that reduces the dimensionality of the high-dimensional state space by taking the variation in choices and state transition into account. Researchers can then use the method of their choice to estimate the problem using the discretized state space from the first stage. Our approach can reduce the estimation bias and make estimation feasible at the same time. We present Monte Carlo simulations to demonstrate the performance of our method compared to standard estimation methods where we ignore the high-dimensional explanatory variable set.

Related papers

• A Statistical Machine Learning Approach for Adapting Reduced-Order Models using Projected Gaussian Process [4.658371840624581]
  Proper Orthogonal Decomposition (POD) computes optimal basis modes that span a low-dimensional subspace where the Reduced-Order Models (ROMs) reside. This paper proposes a Projected Gaussian Process (pGP) and formulates the problem of adapting POD basis as a supervised statistical learning problem. Numerical examples are presented to demonstrate the advantages of the proposed pGP for adapting POD basis against parameter changes.
  arXiv  Detail & Related papers  (2024-10-18T00:02:43Z)
• A statistical approach to latent dynamic modeling with differential equations [0.0]
  Ordinary differential equations (ODEs) can provide mechanistic models of temporally local changes of processes. We propose to use each observation in the course of time as the initial value to obtain multiple local ODE solutions. We illustrate the proposed approach in an application with spinal muscular atrophy patients and a corresponding simulation study.
  arXiv  Detail & Related papers  (2023-11-27T20:02:55Z)
• Dimensionless Policies based on the Buckingham $\pi$ Theorem: Is This a Good Way to Generalize Numerical Results? [66.52698983694613]
  This article explores the use of the Buckingham $pi$ theorem as a tool to encode the control policies of physical systems into a generic form of knowledge. We show, by restating the solution to a motion control problem using dimensionless variables, that (1) the policy mapping involves a reduced number of parameters and (2) control policies generated numerically for a specific system can be transferred exactly to a subset of dimensionally similar systems by scaling the input and output variables appropriately. It remains to be seen how practical this approach can be to generalize policies for more complex high-dimensional problems, but the early results show that it is a
  arXiv  Detail & Related papers  (2023-07-29T00:51:26Z)
• A Data-Driven State Aggregation Approach for Dynamic Discrete Choice Models [7.7347261505610865]
  We present a novel algorithm that provides a data-driven method for selecting and aggregating states. The proposed two-stage approach mitigates the curse of dimensionality by reducing the problem dimension. We demonstrate the empirical performance of the algorithm in two classic dynamic discrete choice estimation applications.
  arXiv  Detail & Related papers  (2023-04-11T01:07:24Z)
• Numerical Methods for Convex Multistage Stochastic Optimization [86.45244607927732]
  We focus on optimisation programming (SP), Optimal Control (SOC) and Decision Processes (MDP) Recent progress in solving convex multistage Markov problems is based on cutting planes approximations of the cost-to-go functions of dynamic programming equations. Cutting plane type methods can handle multistage problems with a large number of stages, but a relatively smaller number of state (decision) variables.
  arXiv  Detail & Related papers  (2023-03-28T01:30:40Z)
• Extension of Dynamic Mode Decomposition for dynamic systems with incomplete information based on t-model of optimal prediction [69.81996031777717]
  The Dynamic Mode Decomposition has proved to be a very efficient technique to study dynamic data. The application of this approach becomes problematic if the available data is incomplete because some dimensions of smaller scale either missing or unmeasured. We consider a first-order approximation of the Mori-Zwanzig decomposition, state the corresponding optimization problem and solve it with the gradient-based optimization method.
  arXiv  Detail & Related papers  (2022-02-23T11:23:59Z)
• A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors [60.489902135153415]
  This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors. The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement.
  arXiv  Detail & Related papers  (2021-11-26T06:33:29Z)
• Stein Variational Model Predictive Control [130.60527864489168]
  Decision making under uncertainty is critical to real-world, autonomous systems. Model Predictive Control (MPC) methods have demonstrated favorable performance in practice, but remain limited when dealing with complex distributions. We show that this framework leads to successful planning in challenging, non optimal control problems.
  arXiv  Detail & Related papers  (2020-11-15T22:36:59Z)
• Nonparametric Variable Screening with Optimal Decision Stumps [19.493449206135296]
  We derive finite sample performance guarantees for variable selection in nonparametric models using a single-level CART decision tree. Unlike previous marginal screening methods that attempt to directly estimate each marginal projection via a truncated basis expansion, the fitted model used here is a simple, parsimonious decision stump.
  arXiv  Detail & Related papers  (2020-11-05T06:56:12Z)
• Variable selection for Gaussian process regression through a sparse projection [0.802904964931021]
  This paper presents a new variable selection approach integrated with Gaussian process (GP) regression. The choice of tuning parameters and the accuracy of the estimation are evaluated with the simulation some chosen benchmark approaches.
  arXiv  Detail & Related papers  (2020-08-25T01:06:10Z)
• Implicit differentiation of Lasso-type models for hyperparameter optimization [82.73138686390514]
  We introduce an efficient implicit differentiation algorithm, without matrix inversion, tailored for Lasso-type problems. Our approach scales to high-dimensional data by leveraging the sparsity of the solutions.
  arXiv  Detail & Related papers  (2020-02-20T18:43:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.