Skip to content

[Exploration] More efficient ways of branch routing a discretization function for MAE #33

Description

@josh-lee-MIE2t5

A major bottleneck with MAE fitting is the branch routing ran post discretizer fit. Right now it is using coordinate descent with no summary stats on leaf partitions. This results in O(n log n) any time we try to add or remove a leaf to a partition which occurs many times on a single execution of coordinate descent.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    enhancementNew feature or request

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions