Search Constraints

Start Over
Filtering by: Creator Rossignol, P. A. Remove constraint Creator: Rossignol, P. A. Advisor Dietterich, Thomas G. Remove constraint Advisor: Dietterich, Thomas G. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Monte Carlo Tree Search with Fixed and Adaptive Abstractions

    Creator:
    Hostetler, Jesse A.
    Abstract:
    Monte Carlo tree search (MCTS) is a class of online planning algorithms for Markov decision processes (MDPs) and related models that has found success in challenging applications. In the online planning approach, the agent makes a decision in the current state by performing a limited forward search over possible futures...
    Resource Type:
    Dissertation
    Full Text:
    uncertainty. We consider MDPs of the formM = 〈S,A, P,R, γ〉, where S andA are finite sets of states and

  • A Benchmarking Study of Unsupervised Anomaly Detection Algorithms

    Creator:
    Emmott, Andrew F.
    Abstract:
    It is common practice in the unsupervised anomaly detection literature to create experimental benchmarks by sampling from existing supervised learning datasets. We seek to improve this practice by identifying four dimensions important to real-world anomaly detection applications --- point difficulty, clusteredness of anomalies, relevance of features, and relative frequency of...
    Resource Type:
    Masters Thesis
    Full Text:
    ]) to fit a probabilistic classifier that estimates the probability P (ŷi = nominal|xi). The point

  • Correct abstraction in counter-planning : a knowledge compilation approach

    Creator:
    Flann, Nicholas S.
    Abstract:
    Knowledge compilation improves search-intensive problem-solvers that are easily specified but inefficient. One promising approach improves efficiency by constructing a database of problem-instance/best-action pairs that replace problem-solving search with efficient lookup. The database is constructed by reverse enumeration- expanding the complete search space backwards, from the terminal problem instances. This approach...
    Resource Type:
    Dissertation
    Full Text:
    Correct abstraction in counter-planning : a knowledge

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    learn- ing algorithm. In our approach, we learn the models P (s′|s, a) and R(s′|s, a), and then use

  • Learning MDP action models via discrete mixture trees

    Creator:
    Wynkoop, Michael S.
    Abstract:
    This thesis addresses the problem of learning dynamic Bayesian network (DBN) models to support reinforcement learning. It focuses on learning regression tree models of the conditional probability distributions of the DBNs. Existing algorithms presume that the stochasticity in the domain can be modeled as a deterministic function with additive noise....
    Resource Type:
    Masters Thesis
    Full Text:
    tree representation for P (x1(t + 1)|x1(t), x2(t), x3(t)) with relational internal nodes and a

  • Activity recognition in desktop environments

    Creator:
    Shen, Jianqiang
    Abstract:
    Knowledge workers are struggling in the information flood. There is a growing interest in intelligent desktop environments that help knowledge workers organize their daily life. Intelligent desktop environments allow the desktop user to define a set of “activities” that characterize the user’s desktop work. These environments then attempt to identify...
    Resource Type:
    Dissertation
    Full Text:
    i s i n g s t u d e n t s h e n p r o j e c t T a s k T r a c e r c o m m e n t s o n t h e s i

  • Machine learning in engineering : techniques to speed up numerical optimization

    Creator:
    Cerbone, G. (Giuseppe)
    Abstract:
    Many important application problems in engineering can be formalized as nonlinear optimization tasks. However, numerical methods for solving such problems are brittle and do not scale well. For example, these methods depend critically on choosing a good starting point from which to perform the optimization search. In high-dimensional spaces, numerical...
    Resource Type:
    Dissertation
    Full Text:
    (x, y) = r21(y113)2 82 23. A point C in polar coordinates a and p 84 24. The bisector example. 84

  • Simulator-Defined MDP Planning with Applications in Natural Resource Management

    Creator:
    Alkaee Taleghan, Majid
    Abstract:
    This work is inspired by problems in natural resource management centered on the challenge of invasive species. Computing optimal management policies for maintaining ecosystem sustainable is challenging. Many ecosystem management problems can be formulated as MDP (Markov Decision Process) planning problems. In a simulator-defined MDP, the Markovian dynamics and rewards...
    Resource Type:
    Dissertation
    Full Text:
    distribution. Let the MDP be defined byM = 〈S,A, P,R, γ, P0〉, where S is a finite set of (discrete) states of

  • Explanations and Processes to Enable Humans to Assess AI with Respect to Manipulable Properties

    Creator:
    Dodge, Jonathan E.
    Abstract:
    Assessing AI systems is difficult. Humans rely on AI systems in increasing ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools (e.g., a professional auditor, a developer, and an end user all have different needs). We posit that it is possible to provide...
    Resource Type:
    Dissertation
    Full Text:
    ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools

  • Protein secondary structure prediction using conditional random fields and profiles

    Creator:
    Shen, Rongkun
    Abstract:
    Protein secondary structure prediction plays a pivotal role in predicting protein folding in three-dimensions. Its task is to assign each residue one of the three secondary structure classes helix, strand, or random coil. This is an instance of the problem of sequential supervised learning in machine learning. This thesis describes...
    Resource Type:
    Masters Thesis
    Full Text:
    , , ( , )i i k i iki P y y X f X y y Z y X κ− −− ⎡ ⎤= λ⎢ ⎥⎣ ⎦ ∑ , where 1( , )iZ y X− is a normalizing