Regularized Unconstrained Weakly Submodular Maximization

Submodular optimization finds applications in machine learning and data mining. In this paper, we study the problem of maximizing functions of the form \(h = f-c\), where \(f\) is a monotone, non-negative, weakly submodular set function and \(c\) is a modular function. We design a deterministic appr...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Zhu, Yanhui, Basu, Samik, Pavan, A
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 19.08.2024
Predmet:	Algorithms Approximation Data mining Machine learning Maximization Optimization
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!