Observation Subset Selection as Local Compilation of Performance Profiles

06/13/2012
by   Yan Radovilsky, et al.
0

Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of measurements, under a dependency structure modeled by a tree-shaped Bayesian network (BN). Our approach is a generalization of composing anytime algorithm represented by conditional performance profiles. This is done by relaxing the input monotonicity assumption, and extending the local compilation technique to more general classes of performance profiles (PPs). We apply the extended scheme to selecting a subset of measurements for choosing a maximum expectation variable in a binary valued BN, and for minimizing the worst variance in a Gaussian BN.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2017

On the Unreported-Profile-is-Negative Assumption for Predictive Cheminformatics

In cheminformatics, compound-target binding profiles has been a main sou...
research
09/08/2022

Generating Contextual Load Profiles Using a Conditional Variational Autoencoder

Generating power system states that have similar distribution and depend...
research
07/27/2021

Subset selection for linear mixed models

Linear mixed models (LMMs) are instrumental for regression analysis with...
research
02/05/2020

Locally-Adaptive Nonparametric Online Learning

One of the main strengths of online algorithms is their ability to adapt...
research
09/21/2020

Multi-Gaussian random variables

A generalization of the classic Gaussian random variable to the family o...
research
05/02/2023

Multidimensional Fairness in Paper Recommendation

To prevent potential bias in the paper review and selection process for ...
research
06/17/2009

Semi-Myopic Sensing Plans for Value Optimization

We consider the following sequential decision problem. Given a set of it...

Please sign up or login with your details

Forgot password? Click here to reset