Zeroth Order Non-convex optimization with Dueling-Choice BanditsDownload PDFOpen Website

2020 (modified: 16 Nov 2022)UAI 2020Readers: Everyone
Abstract: We consider a novel setting of zeroth order non-convex optimization, where in addition to querying the function value at a given point, we can also duel two points and get the point with the larger...
0 Replies

Loading