Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

CCO: A RL-based optimization algorithm #42

Open
ilya-kolchinsky opened this issue Apr 17, 2022 · 0 comments
Open

CCO: A RL-based optimization algorithm #42

ilya-kolchinsky opened this issue Apr 17, 2022 · 0 comments

Comments

@ilya-kolchinsky
Copy link
Collaborator

The currently used B&B optimization algorithm might be extremely slow for large workloads due to its worst case exponential runtime.
A local search-based algorithm (#37) could be a good intermediate solution, however it is based on a meta-heuristic and thus highly sensitive to the solution space topology and neighborhood definition. A more promising approach could be to utilize a reinforcement learning framework.
Implement an optimization algorithm based on one of the well-known reinforcement learning approaches (e.g., DQN, DDPG, TRPO, etc.).

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

No branches or pull requests

1 participant