On the Benefits of Progressively Increasing Sampling Sizes in Stochastic Greedy Weak Submodular Maximization
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Signal Processing"
DOI: 10.1109/tsp.2022.3195089
Abstract: Many problems in signal processing and machine learning can be formalized as weak submodular optimization tasks. For such problems, a simple greedy algorithm (Greedy) is guaranteed to find a solution achieving the objective with a… read more here.
Keywords: greedy; tex math; inline formula; sampling strategies ... See more keywords