activity
20182026
most citedSafe global optimization of expensive noisy black-box functions in the -Lipschitz framework

36 citations · 48 across the 22 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

math.OC2019★ 36 cited

Safe global optimization of expensive noisy black-box functions in the -Lipschitz framework

Yaroslav D. Sergeyev, Antonio Candelieri, Dmitri E. Kvasov +1

In this paper, the problem of safe global maximization (it should not be confused with robust optimization) of expensive noisy black-box functions satisfying the Lipschitz conditio…

cs.LG2019

Efficient Kernel-based Subsequence Search for User Identification from Walking Activity

Antonio Candelieri, Stanislav Fedorov, Enza Messina

This paper presents an efficient approach for subsequence search in data streams. The problem consists in identifying coherent repetitions of a given reference time-series, eventua…