Revisiting Score Function Estimators for $k$-Subset Sampling
<|reference_start|>Revisiting Score Function Estimators for $k$-Subset Sampling: Are score function estimators an underestimated approach to learning with $k$-subset sampling? Sampling $k$-subsets is a fundamental operation in many machine learning tasks that is not amenable to differentiable parametrization, impeding gradient-based optimization. Prior work has focused on relaxed sampling or pathwise gradient estimators. Inspired by the success of score function estimators in variational inference and reinforcement learning, we revisit them within the context of $k$-subset sampling. Specifically, we demonstrate how to efficiently compute the $k$-subset distribution's score function using a discrete Fourier transform, and reduce the estimator's variance with control variates. The resulting estimator provides both exact samples and unbiased gradient estimates while also applying to non-differentiable downstream models, unlike existing methods. Experiments in feature selection show results competitive with current methods, despite weaker assumptions.<|reference_end|>
@article{wijk2024revisiting,
    title={Revisiting Score Function Estimators for $k$-Subset Sampling},
    author={Klas Wijk and Ricardo Vinuesa and Hossein Azizpour},
    journal={arXiv preprint arXiv:2407.16058},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.16058},
    primaryClass={cs.LG stat.ML}
}