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
[FEATURE REQUEST] Archive of Classes #287
Comments
Hi @whitead, thanks for using pyribs. I think it may help to first formalize your problem a bit so that I can better understand it. What are your objectives, measures / behaviors, and solution vectors? Right now, it seems like your binary vector of labels may either be the measures or the solution vectors. I am also not familiar with the QDL algorithm; would you mind sharing the relevant paper? |
Thanks for the quick response! Sorry QDL meant Quality Diversity. Not sure what the L was supposed to stand for in my head... In my setting, the features/actions The objective is a value between 0 and 1. After running my simulator given I was thinking then my archive could be a grid, where the two bins are 0/1, but that might not behave well with D = 100 I think. Another possibility is the My question for you is if this sounds reasonable and have you come across a case where the behaviors are binary vectors. And, if CVTArchive is reasonable, how I might modify the distance for comparing the vectors. Thanks! |
Your approach certainly sounds reasonable. If you have a 100-dimensional archive, CVTArchive is a good choice. I'm not sure how useful our CMA-based algorithms will be since we have not really used them with binary behaviors, only discrete ones, but it is certainly worth a try. I'd suggest running with the bounds set to (0, 1) in each dimension. Maybe try out CMA-ME (I assume you're using v0.4.0, but we'll have CMA-MAE in v0.5.0) and MAP-Elites. I would not suggest modifying the CVTArchive's distance metric immediately as that would be very involved (we designed everything around Euclidean distance in that archive). |
Thanks for your help @btjanaka - I'll reopen if I have additional questions. |
Description
I'm not sure if this makes sense for the
QDLQD algorithm, but I would like to generate diversity for multi-label classification. That is, each samplex
has a binary vector of labels (length ~15-50). I would like to generate a diversity of these binary vectors. I can probably just use theCVTArchive
with one-hot vectors, but I was curious if there is a better way, or if this will make sense with theQDLQD algorithm.Thank you!
The text was updated successfully, but these errors were encountered: