The Hierarchical Hidden Markov Model: Analysis and Applications
Machine Learning
Neuro-Dynamic Programming
Exploiting belief bounds: practical POMDPs for personal assistant agents
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Learning first-order probabilistic models with combining rules
ICML '05 Proceedings of the 22nd international conference on Machine learning
Who's asking for help?: a Bayesian approach to intelligent assistance
Proceedings of the 11th international conference on Intelligent user interfaces
PRL: A probabilistic relational language
Machine Learning
Machine Learning
Hierarchical reinforcement learning with the MAXQ value function decomposition
Journal of Artificial Intelligence Research
Policy recognition in the abstract hidden Markov model
Journal of Artificial Intelligence Research
A decision-theoretic model of assistance
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A decision-theoretic approach to task assistance for persons with dementia
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Getting from here to there: interactive planning and agent execution for optimizing travel
IAAI'02 Proceedings of the 14th conference on Innovative applications of artificial intelligence - Volume 1
The lumière project: Bayesian user modeling for inferring the goals and needs of software users
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Logical Hierarchical Hidden Markov Models for Modeling User Activities
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
Case-Based Reasoning in Transfer Learning
ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Hi-index | 0.00 |
Building intelligent assistants has been a long-cherished goal of AI and many were built and fine-tuned to specific application domains. In recent work, a domain-independent decision-theoretic model of assistance was proposed, where the task is to infer the user's goal and take actions that minimize the expected cost of the user's policy. In this paper, we extend this work to domains where the user's policies have rich relational and hierarchical structure. Our results indicate that relational hierarchies allow succinct encoding of prior knowledge for the assistant, which in turn enables the assistant to start helping the user after a relatively small amount of experience.