Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-021-00719-z
Abstract: Emerging applications in machine learning have imposed the problem of monotone non-submodular maximization subject to a cardinality constraint. Meanwhile, parallelism is prevalent for large-scale optimization problems in bigdata scenario while adaptive complexity is an important… read more here.
Keywords: non submodular; monotone; monotone non; cardinality constraint ... See more keywords