Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01d504rn558
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorLeonard, Naomi Een_US
dc.contributor.advisorHolmes, Philip Jen_US
dc.contributor.authorReverdy, Paul Benjaminen_US
dc.contributor.otherMechanical and Aerospace Engineering Departmenten_US
dc.date.accessioned2014-09-25T22:43:17Z-
dc.date.available2014-09-25T22:43:17Z-
dc.date.issued2014en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01d504rn558-
dc.description.abstractSearch is a ubiquitous human activity. It is a rational response to the uncertainty inherent in the tasks we seek to accomplish in our daily lives, from retrieving information to making important decisions. Engineers have developed numerous tools to perform automated search, but many tasks have too much uncertainty for these tools to perform adequately without human intervention. Engineering solutions to such tasks therefore consist of human-machine hybrid systems, where human supervisors interact with automated tools and make high-level decisions to guide them. Novel rigorous models of human decision making in such situations are required to facilitate the principled design of human-machine systems. In this thesis, we develop a rigorous model of human decision-making behavior in search tasks. We formally model search using the <italic>multi-armed bandit</italic> problem from the machine learning literature, which allows us to derive bounds on optimal decision-making performance. We focus on spatial search, for which we introduce the <italic>spatial multi-armed bandit</italic> problem. We develop several models of human decision-making behavior in this problem by extending heuristics from the neuroscience and machine learning literatures, and prove conditions under which one model (UCL) achieves optimal performance. We study human-subject data from a spatial multi-armed bandit problem and show that human performance in this problem falls into several categories. Some humans outperformed standard algorithms for multi-armed bandit problems, which we attribute to humans having good intuition for spatial search. We show that the UCL model can achieve performance that falls in the different categories by tuning the model parameters. The model parameters quantify a human's intuition and make it available to a human-machine system. We develop a parameter estimator for the UCL model by relating it to the Generalized Linear Model from the statistics literature. The UCL model together with the estimator represent a plant--observer pair for human decision making which can be used for system design. Finally, we consider a so-called &ldquo;satisficing&rdquo; objective as an alternative to the maximizing objective of the standard multi-armed bandit problem. We derive performance bounds in terms of this new objective and develop an algorithm that achieves optimal performance.en_US
dc.language.isoenen_US
dc.publisherPrinceton, NJ : Princeton Universityen_US
dc.relation.isformatofThe Mudd Manuscript Library retains one bound copy of each dissertation. Search for these copies in the <a href=http://catalog.princeton.edu> library's main catalog </a>en_US
dc.subjectBayesian machine learningen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectHuman-in-the-loop systemen_US
dc.subjectMulti-armed banditen_US
dc.subject.classificationMechanical engineeringen_US
dc.subject.classificationNeurosciencesen_US
dc.subject.classificationElectrical engineeringen_US
dc.titleHuman-inspired Algorithms for Search: A Framework for Human-machine Multi-armed Bandit Problemsen_US
dc.typeAcademic dissertations (Ph.D.)en_US
pu.projectgrantnumber690-2143en_US
Appears in Collections:Mechanical and Aerospace Engineering

Files in This Item:
File Description SizeFormat 
Reverdy_princeton_0181D_11100.pdf1.17 MBAdobe PDFView/Download


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.