Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

In this work, we present, analyze, and implement a class of multilevel Markov chain Monte Carlo(ML-MCMC) algorithms based on independent Metropolis--Hastings proposals for Bayesian inverse problems. In this context, the likelihood function involves solving ...

Learning-based outlier (mismatched correspondence) rejection for robust 3D registration generally formulates the outlier removal as an inlier/outlier classification problem. The core for this to be successful is to learn the discriminative inlier/outlier f ...

The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting para ...

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view. Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B invol ...

The ability to predict the spatial distribution of tree root system variables (e.g., the Root system Area (RA), the maximum root diameter, the number of roots in diameter classes, the density of fine roots, etc.) under different environmental conditions is ...

Tree-related microhabitats (TreMs) have been identified as key features for forest-dwelling taxa and are often employed as measures for biodiversity conservation in integrative forest management. However, managing forests to ensure an uninterrupted resourc ...

In glacier-fed streams, ecological windows of opportunity allow complex microbial biofilms to develop and transiently form the basis of the food web, thereby controlling key ecosystem processes. Using metagenome-assembled genomes, we unravel strategies tha ...

Decision trees have been widely used as classifiers in many machine learning applications thanks to their lightweight and interpretable decision process. This paper introduces Tree in Tree decision graph (TnT), a framework that extends the conventional dec ...

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...

Understanding the diffusion patterns of sequences of interdependent events is a central question for a variety of disciplines. Temporal point processes are a class of elegant and powerful models of such sequences; these processes have become popular across ...

Poor decisions and selfish behaviors give rise to seemingly intractable global problems, such as the lack of transparency in democratic processes, the spread of conspiracy theories, and the rise in greenhouse gas emissions. However, people are more predict ...

In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the least number of distance queries possible. In the j-th step of the game, the player queries a single node v_j and receives, as an answer to their query, th ...

Temporal point-processes are often used for mathematical modeling of sequences of discrete events with asynchronous timestamps. We focus on a class of temporal point-process models called multivariate Wold processes (MWP). These processes are well suited t ...

The increasing integration of intermittent renewable generation, especially at the distribution level, necessitates advanced planning and optimisation methodologies contingent on the knowledge of the admittance matrix, capturing the topology and line param ...

Surprise-based learning allows agents to rapidly adapt to nonstationary stochastic environments characterized by sudden changes. We show that exact Bayesian inference in a hierarchical model gives rise to a surprise-modulated trade-off between forgetting o ...

We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i, j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generate ...

Making decisions is part and parcel of being human. Among a set of actions, we want to choose the one that has the highest reward. But the uncertainty of the outcome prevents us from always making the right decision. Making decisions under uncertainty can ...

The application of Bayesian modeling techniques is increasingly common in neuroscience due to the coherent and principled way in which the paradigm deals with uncertainty. The Bayesian framework is particularly valuable in the context of complex, ill-posed ...

Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

Chattez avec Graph Search

Fairness and Explainability in Clustering Problems

Analysis of a Class of Multilevel Markov Chain Monte Carlo Algorithms Based on Independent Metropolis–Hastings

Robust Outlier Rejection for 3D Registration with Variational Bayes

Phenomenological theory of variational quantum ground-state preparation

From Trees to Barcodes and Back Again: A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem

Tree root distribution modelling in different environmental conditions

Key factors determining the presence of Tree-related Microhabitats: A synthesis of potential factors at site, stand and tree scales, with perspectives for further research

Genomic and metabolic adaptations of biofilms to ecological windows of opportunity in glacier-fed streams

Tree in Tree: from Decision trees to Decision Graphs

Bayesian Decision Making in Groups is Hard

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Learning Self-Exciting Temporal Point Processes Under Noisy Observations

Discrete-Choice Mining of Social Processes

Sequential metric dimension for random graphs

A Variational Inference Approach to Learning Multivariate Wold Processes

Bayesian Methods for the Identification of Distribution Networks

Learning in Volatile Environments With the Bayes Factor Surprise

Scalable and Efficient Comparison-based Search without Features

Multi-armed Bandits in Action

Bayesian modeling of brain function and behavior