A Unified Perspective on Regularization and Perturbation in Differentiable Subset Selection

Xiangqian Sun, Cheuk Hang Leung, Yijun Li, Qi Wu

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


Subset selection, i.e., finding a bunch of items from a collection to achieve specific goals, has wide applications in information retrieval, statistics, and machine learning. To implement an end-to-end learning framework, different relaxed differentiable operators of subset selection are proposed. Most existing work relies on either regularization method or perturbation method. In this work, we provide a probabilistic interpretation for regularization relaxation and unify two schemes. Besides, we build some concrete examples to show the generic connection between these two relaxations. Finally, we evaluate the perturbed selector as well as the regularized selector on two tasks: the maximum entropy sampling problem and the feature selection problem. The experimental results show that these two methods can achieve competitive performance against other benchmarks.

Original languageEnglish
Pages (from-to)4629-4642
Number of pages14
JournalProceedings of Machine Learning Research
Publication statusPublished - 2023
Externally publishedYes
Event26th International Conference on Artificial Intelligence and Statistics, AISTATS 2023 - Valencia, Spain
Duration: 25 Apr 202327 Apr 2023


Dive into the research topics of 'A Unified Perspective on Regularization and Perturbation in Differentiable Subset Selection'. Together they form a unique fingerprint.

Cite this