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...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Zhu, Yanhui, Basu, Samik, Pavan, A
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 19.08.2024
Subjects:	Algorithms Approximation Data mining Machine learning Maximization Optimization
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!