Information-guided planning: an online approach for partially observable problems

MA do Carmo Alves, A Varma… - Advances in …, 2023 - proceedings.neurips.cc
This paper presents IB-POMCP, a novel algorithm for online planning under partial
observability. Our approach enhances the decision-making process by using estimations of …

[HTML][HTML] Likelihood-free inference with deep Gaussian processes

A Aushev, H Pesonen, M Heinonen, J Corander… - … Statistics & Data …, 2022 - Elsevier
Surrogate models have been successfully used in likelihood-free inference to decrease the
number of simulator evaluations. The current state-of-the-art performance for this task has …

Distributionally-aware kernelized bandit problems for risk aversion

S Takemori - International conference on machine learning, 2022 - proceedings.mlr.press
The kernelized bandit problem is a theoretically justified framework and has solid
applications to various fields. Recently, there is a growing interest in generalizing the …

[PDF][PDF] No-regret reinforcement learning with value function approximation: a kernel embedding approach

SR Chowdhury, R Oliveira - … of Machine Learning Research vol xxx, 2021 - bibbase.org
We consider the regret minimization problem in reinforcement learning (RL) in the episodic
setting. In many real-world RL environments, the state and action spaces are continuous or …

Indirect Query Bayesian Optimization with Integrated Feedback

M Zhang, S Bouabid, CS Ong, S Flaxman… - arxiv preprint arxiv …, 2024 - arxiv.org
We develop the framework of Indirect Query Bayesian Optimization (IQBO), a new class of
Bayesian optimization problems where the integrated feedback is given via a conditional …

Value function approximations via kernel embeddings for no-regret reinforcement learning

SR Chowdhury, R Oliveira - Asian Conference on Machine …, 2023 - proceedings.mlr.press
We consider the regret minimization problem in reinforcement learning (RL) in the episodic
setting. In many real-world RL environments, the state and action spaces are continuous or …

Conditional mean embeddings and optimal feature selection via positive definite kernels

PET Jorgensen, MS Song, J Tian - arxiv preprint arxiv:2305.08100, 2023 - arxiv.org
Motivated by applications, we consider here new operator theoretic approaches to
Conditional mean embeddings (CME). Our present results combine a spectral analysis …

Sequential Decision Making on Unmatched Data using Bayesian Kernel Embeddings

D Martinez-Taboada, D Sejdinovic - arxiv preprint arxiv:2210.13692, 2022 - arxiv.org
The problem of sequentially maximizing the expectation of a function seeks to maximize the
expected value of a function of interest without having direct control on its features. Instead …

Monte-Carlo Based Online planning Under Partial Observability: Solving Single and Multi-Agent Problems

MA do Carmo Alves - 2024 - search.proquest.com
This thesis thoroughly explores the integration of statistical and reinforcement learning
techniques, aiming to provide fresh perspectives and solutions for enhancing the current …

Information-guided Planning: An Online Approach for Partially Observable Problems

MADC Alves, A Varma, Y Elkhatib… - Thirty-seventh Conference … - openreview.net
This paper presents IB-POMCP, a novel algorithm for online planning under partial
observability. Our approach enhances the decision-making process by using estimations of …