Skip to content

Refactorize code related with AMSS #203

@shizejin

Description

@shizejin

We want to refactorize the code related with AMSS including a series of lectures including opt_tax_recur and amss (and potentially amss2 and amss3 in the near future) by a collaboration with @QBatista and @thomassargent30.

The parts to modify are mainly two Python classes

  1. Sequential Allocation problem
    • SequentialAllocation both in opt_tax_recur and amss
  2. Recursive Allocation problem
    • RecursiveAllocation in opt_tax_recur
    • RecursiveAllocationAMSS in amss

Our goal is to improve the quality of the code in several aspects:

  1. readability
    1. math notations of model parameters and variables
    2. make the code closely and clearly related with the computational algorithm described using math and avoid inconsistency
  2. efficiency
    1. optimize the root finding procedure

@QBatista would you please add on your thoughts if I missed anything? I remember that you wanted to jit the class. For me the performance of the current code is quite acceptable but it would be great to discuss if jitting would be needed.

We need to notice that these two lectures share a large fraction of the code so it would be great if we could avoid "copy and paste". We would appreciate it a lot if @mmcky has some suggestions on this issue.

I created a new branch mod_amss and we will modify the .rst files and make a PR from there.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions