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

Methods for k-subset selection #107

Open
sscardapane opened this issue Jan 12, 2023 · 0 comments
Open

Methods for k-subset selection #107

sscardapane opened this issue Jan 12, 2023 · 0 comments

Comments

@sscardapane
Copy link

Hi, this looks like a very nice project and I apologize if the question is trivial, but I have not found a clear answer in the documentation. Do you have methods already implemented for $k$-subset sampling from a set? For example, with Gumbel-Softmax we can easily sample an ordered sequence of $k$ elements without replacement by computing top-k on the sample [1], and ignoring the ordering to obtain subset sampling. I was wondering what methods in the library can be used to this end and if you have some tutorial code.

[1] https://www.ijcai.org/Proceedings/2019/0544.pdf

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