Partial observability and learnability
From MaRDI portal
Publication:991012
DOI10.1016/j.artint.2010.03.004zbMath1205.68301OpenAlexW2150384446MaRDI QIDQ991012
Publication date: 2 September 2010
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.03.004
reductionpartial observabilitysensingmissing informationrealityinformation recoveryappearanceautodidactic learningmasking processprobably approximately correct
Related Items (2)
Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Evolvability via the Fourier transform
Cites Work
- Unnamed Item
- Unnamed Item
- Prediction-preserving reducibility
- Occam's razor
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Learning with restricted focus of attention
- Efficient distribution-free learning of probabilistic concepts
- A formal model of hierarchical concept learning
- Learning from examples with unspecified attribute values.
- Efficient noise-tolerant learning from statistical queries
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Computational limitations on learning from examples
- On Learning Ring-Sum-Expansions
- Learning Integer Lattices
- Probability Inequalities for Sums of Bounded Random Variables
- Evolvability
- Robust logics
This page was built for publication: Partial observability and learnability
