Optimal Value of Information in Graphical Models
From MaRDI portal
Publication:3651472
DOI10.1613/jair.2737zbMath1192.68645arXiv1401.3474OpenAlexW3106409394MaRDI QIDQ3651472
Carlos Guestrin, Andreas Krause
Publication date: 10 December 2009
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3474
Related Items (27)
Reinforcement learning-based design of sampling policies under cost constraints in Markov random fields: application to weed map reconstruction ⋮ Same-decision probability: a confidence measure for threshold-based decisions ⋮ Experimental Design for Nonparametric Correction of Misspecified Dynamical Models ⋮ A new greedy strategy for maximizing monotone submodular function under a cardinality constraint ⋮ Maximizing a non-decreasing non-submodular function subject to various types of constraints ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ FPT approximation schemes for maximizing submodular functions ⋮ Active inference for binary symmetric hidden Markov models ⋮ Two-stage non-submodular maximization ⋮ Two-stage BP maximization under \(p\)-matroid constraint ⋮ Constrained Submodular Maximization via a Nonsymmetric Technique ⋮ Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity ⋮ Actively learning to infer social ties ⋮ Rough set methods in feature selection via submodular function ⋮ A Hilbert Space Embedding for Distributions ⋮ Unnamed Item ⋮ Efficient designs for Bayesian networks with sub-tree bounds ⋮ Sparse optimization in feature selection: application in neuroimaging ⋮ Soft arc consistency revisited ⋮ Scheduling networked state estimators based on value of information ⋮ Information gathering in Bayesian networks applied to petroleum prospecting ⋮ Informed production optimization in hydrocarbon reservoirs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Improved algorithms for non-submodular function maximization problem ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards ⋮ A tight analysis of the submodular-supermodular procedure
This page was built for publication: Optimal Value of Information in Graphical Models
