1 code implementation • 19 May 2023 • Ben Tu, Nikolas Kantas, Robert M. Lee, Behrang Shafei
In order to solve this vector-valued optimization problem, practitioners often appeal to the use of scalarization functions in order to transform the multi-objective problem into a collection of single-objective problems.
no code implementations • 1 Feb 2023 • Anastasia Borovykh, Nikolas Kantas, Panos Parpas, Greg Pavliotis
The privacy preserving properties of Langevin dynamics with additive isotropic noise have been extensively studied.
1 code implementation • 6 Oct 2022 • Ben Tu, Axel Gandy, Nikolas Kantas, Behrang Shafei
Many real-world problems can be phrased as a multi-objective optimization problem, where the goal is to identify the best set of compromises between the competing objectives.
no code implementations • 15 Jul 2020 • Anastasia Borovykh, Nikolas Kantas, Panos Parpas, Grigorios A. Pavliotis
A second alternative is to use a fixed step-size and run independent replicas of the algorithm and average these.
no code implementations • 10 May 2019 • Nikolas Kantas, Panos Parpas, Grigorios A. Pavliotis
As a first step towards understanding this question we formalize it as an optimization problem with weakly interacting agents.
no code implementations • 8 Dec 2017 • Xue Lu, Niall Adams, Nikolas Kantas
In this paper, we overcome the shortcoming of slow response to change by deploying adaptive estimation in the standard methods and propose a new family of algorithms, which are adaptive versions of $\epsilon$-Greedy, UCB, and Thompson sampling.