7 citations · 10 across the 6 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2022★ 1 cited
Fast Feature Selection with Fairness Constraints
Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch +4
We study the fundamental problem of selecting optimal features for model construction. This problem is computationally challenging on large datasets, even with the use of greedy al…
cs.LG2019★ 1 cited
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
Vanja Doskoč, Tobias Friedrich, Andreas Göbel +3
We study the problem of maximizing a non-monotone submodular function under multiple knapsack constraints. We propose a simple discrete greedy algorithm to approach this problem, a…