Skip to content
This repository has been archived by the owner on Oct 31, 2023. It is now read-only.

Discrete Search Space #28

Open
thiagotei opened this issue May 30, 2023 · 1 comment
Open

Discrete Search Space #28

thiagotei opened this issue May 30, 2023 · 1 comment

Comments

@thiagotei
Copy link

Hello,
I'd like to apply LaMCTS to a discrete but highly dimensional search space (e.g., 200 dimensions).
Each dimension, however, has only four options.
Would LaMCTS be suitable for this? How hard is it to adapt the code for this?

@Jzjerry
Copy link

Jzjerry commented May 31, 2023

@thiagotei Hi, I'm working on a discrete search space problem as well but with less than 50 dimensions.
I just use a floor function to convert the continuous floating-point data to discrete interger data, and it works quite well.
I'm not sure if it can achieve good performance in your high-dimensional case, but I think it is not so hard to apply it on discrete problems.
Hope this helps.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants