This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 2Machine Learning
- 1Approximate Value/Policy Iteration
- 1Costly Observations
- 1Error Propagation
- 1Model Selection
- 1Online Learning
-
Spring 2013
This work introduces the “online probing” problem: In each round, the learner is able to purchase the values of a subset of features for the current instance. After the learner uses this information to produce a prediction for this instance, it then has the option of paying for seeing the full...
-
Fall 2011
This thesis studies the reinforcement learning and planning problems that are modeled by a discounted Markov Decision Process (MDP) with a large state space and finite action space. We follow the value-based approach in which a function approximator is used to estimate the optimal value function....