no code implementations • 10 Feb 2024 • Hannes Nilsson, Rikard Johansson, Niklas Åkerblom, Morteza Haghir Chehreghani
We propose a novel framework for contextual multi-armed bandits based on tree ensembles.
no code implementations • 20 Dec 2023 • Jack Sandberg, Niklas Åkerblom, Morteza Haghir Chehreghani
We consider a combinatorial Gaussian process semi-bandit problem with time-varying arm availability.
no code implementations • 21 Aug 2023 • Arman Rahbar, Niklas Åkerblom, Morteza Haghir Chehreghani
In this paper, we provide a novel formulation of the online decision making problem based on combinatorial multi-armed bandits and take the (possibly stochastic) cost of performing tests into account.
no code implementations • 17 Jan 2023 • Niklas Åkerblom, Morteza Haghir Chehreghani
In this work, we address the problem of long-distance navigation for battery electric vehicles (BEVs), where one or more charging sessions are required to reach the intended destination.
no code implementations • 28 Oct 2022 • Tobias Lindroth, Axel Svensson, Niklas Åkerblom, Mitra Pourabdollah, Morteza Haghir Chehreghani
One way to mitigate these issues is by performing battery thermal preconditioning, which increases the energy efficiency of the battery.
no code implementations • 16 Jun 2022 • Fazeleh Hoseini, Niklas Åkerblom, Morteza Haghir Chehreghani
Bottleneck identification is a challenging task in network analysis, especially when the network is not fully specified.
no code implementations • 4 Mar 2022 • Federica Comuni, Christopher Mészáros, Niklas Åkerblom, Morteza Haghir Chehreghani
To address the first challenge, passive learning of driver behavior, we investigate non-recurrent architectures such as self-attention models and convolutional neural networks with joint recurrence plots (JRP), and compare them with recurrent models.
no code implementations • 3 Nov 2021 • Niklas Åkerblom, Yuxin Chen, Morteza Haghir Chehreghani
In order to learn the model parameters, we develop an online learning framework and investigate several exploration strategies such as Thompson Sampling and Upper Confidence Bound.
no code implementations • 17 Sep 2021 • Niklas Åkerblom, Fazeleh Sadat Hoseini, Morteza Haghir Chehreghani
In this paper, we study bottleneck identification in networks via extracting minimax paths.
no code implementations • 3 Mar 2020 • Niklas Åkerblom, Yuxin Chen, Morteza Haghir Chehreghani
In order to learn the model parameters, we develop an online learning framework and investigate several exploration strategies such as Thompson Sampling and Upper Confidence Bound.