Electronic Resource

Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings

---

Penilaian

---

In this paper, we concentrate on a stochastic non-monotone DR-submodular maximization problem over a convex constraint
, where the objective function arises as an expectation of a set of stochastic functions. We develop an algorithm named SPIDER-FW, which is a stochastic version of the classical Frank-Wolfe algorithm with
(in expectation) approximation guarantee, the best guarantee so far for the above setting, achieved with
iterations, and
first-order oracle calls.

---

Availability

Inventory Code	Barcode	Call Number	Location	Status
2008000207	EB0004535	004.6 Com	Central Library (Database Springer E-Book)	Available

Detail Information

Series Title

Lecture Notes in Computer Science

Call Number

004.6 Com

Publisher

Switzerland : Springer Cham., 2023

Collation

xiv, 586p.: Ill.

Language

English

ISBN/ISSN

978-3-031-22105-7

Classification

004.6

Content Type

Ebook

Media Type

-

Carrier Type

online resource

Edition

1

Subject(s)

Numeric Computing

Specific Detail Info

-

Statement of Responsibility

RTS

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment