<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Behav. Neurosci.</journal-id>
<journal-title>Frontiers in Behavioral Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Behav. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-5153</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnbeh.2024.1386723</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Behavioral Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Analysis of goal, feedback and rewards on sustained attention via machine learning</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Fernando</surname> <given-names>Nethali</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2646215/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Robison</surname> <given-names>Matthew</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1194277/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Maia</surname> <given-names>Pedro D.</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c002"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/408703/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Mathematics, University of Texas at Arlington</institution>, <addr-line>Arlington, TX</addr-line>, <country>United States</country></aff>
<aff id="aff2"><sup>2</sup><institution>Division of Data Science, College of Science, University of Texas at Arlington</institution>, <addr-line>Arlington, TX</addr-line>, <country>United States</country></aff>
<aff id="aff3"><sup>3</sup><institution>Department of Psychology, University of Notre Dame</institution>, <addr-line>Notre Dame, IN</addr-line>, <country>United States</country></aff>
<aff id="aff4"><sup>4</sup><institution>Department of Psychology, University of Texas at Arlington</institution>, <addr-line>Arlington, TX</addr-line>, <country>United States</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Liana Fattore, CNR Neuroscience Institute (IN), Italy</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Shinya Sakai, Hokkaido University, Japan</p>
<p>Eric Schumacher, Georgia Institute of Technology, United States</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Nethali Fernando <email>qtk8nr&#x00040;virginia.edu</email></corresp>
<corresp id="c002">Pedro D. Maia <email>pedro.maia&#x00040;uta.edu</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>19</day>
<month>12</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>18</volume>
<elocation-id>1386723</elocation-id>
<history>
<date date-type="received">
<day>15</day>
<month>02</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>25</day>
<month>11</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2024 Fernando, Robison and Maia.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Fernando, Robison and Maia</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<sec>
<title>Introduction</title>
<p>Sustaining attention is a notoriously difficult task as shown in a recent experiment where reaction times (RTs) and pupillometry data were recorded from 350 subjects in a 30-min vigilance task. Subjects were also presented with different types of goal, feedback, and reward.</p></sec>
<sec>
<title>Methods</title>
<p>In this study, we revisit this experimental data and solve three families of machine learning problems: (i) RT-regression problems, to predict subjects&#x00027; RTs using all available data, (ii) RT-classification problems, to classify responses more broadly as attentive, semi-attentive, and inattentive, and (iii) to predict the subjects&#x00027; experimental conditions from physiological data.</p></sec>
<sec>
<title>Results</title>
<p>After establishing that regressing RTs is in general a difficult task, we achieve better results classifying them in broader categories. We also successfully disambiguate subjects who received goals and rewards from those who did not. Finally, we quantify changes in accuracy when coarser features (averaged throughout multiple trials) are used. Interestingly, the machine learning pipeline selects different features depending on their resolution, suggesting that predictive physiological features are also resolution-specific.</p></sec>
<sec>
<title>Discussion</title>
<p>These findings highlight the potential of machine learning to advance research on sustained attention and behavior, particularly in studies incorporating pupillometry or other physiological measurements, offering new avenues for understanding and analysis.</p></sec></abstract>
<kwd-group>
<kwd>sustained attention</kwd>
<kwd>pupillometry data</kwd>
<kwd>reward</kwd>
<kwd>reaction time</kwd>
<kwd>machine learning</kwd>
<kwd>classification</kwd>
<kwd>regression</kwd>
<kwd>feature selection</kwd>
</kwd-group>
<counts>
<fig-count count="7"/>
<table-count count="4"/>
<equation-count count="1"/>
<ref-count count="30"/>
<page-count count="12"/>
<word-count count="7341"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Motivation and Reward</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<sec>
<title>1.1 Background</title>
<p>Sustained attention is an umbrella term used in the field of cognitive psychology generally referring to a subject&#x00027;s readiness to detect unpredictably occurring signals over prolonged periods (Sarter et al., <xref ref-type="bibr" rid="B25">2001</xref>). Studies dating back from over a century have addressed the difficulties of remaining vigilant when performing trivial or repetitive tasks (Bills, <xref ref-type="bibr" rid="B2">1931a</xref>,<xref ref-type="bibr" rid="B3">b</xref>; Thorndike, <xref ref-type="bibr" rid="B26">1912</xref>). Since then, several authors have explored the pitfalls of human inattentiveness in a variety of contexts, from driving accidents (National Highway Traffic Safety Administration, <xref ref-type="bibr" rid="B19">2020</xref>) to in-class pedagogical activities (Bligh, <xref ref-type="bibr" rid="B4">2000</xref>; Wang et al., <xref ref-type="bibr" rid="B30">2021</xref>). This remains an active research topic in experimental psychology, with ongoing efforts to identify effective strategies to mitigate decrements in vigilance and task engagement (Massar et al., <xref ref-type="bibr" rid="B16">2016</xref>; Hopstaken et al., <xref ref-type="bibr" rid="B12">2015a</xref>,<xref ref-type="bibr" rid="B13">b</xref>; Esterman et al., <xref ref-type="bibr" rid="B7">2016</xref>).</p>
<p>In a recent study, Robison et al. (<xref ref-type="bibr" rid="B24">2021</xref>) examined the specific effects of goal-setting, feedback, and incentives to counter attention deficits in a psychomotor vigilance task. Although some of the experimental manipulations were effective in mitigating slower Reaction Times (RTs) at later trials, none eliminated it. Specifically, both providing participants with a specific goal to strive toward and giving them performance feedback mitigated the a worsening of task performance across time. Further, participants in these conditions self-reported feeling more motivated and exhibited greater evoked pupillary responses. Traditionally, pupil diameter has been used as a measure of attentional effort (Beatty, <xref ref-type="bibr" rid="B1">1982</xref>). In recent years, pupillometry has become an increasingly common psychophysiological tool, as we learn more about its neurobiological derivations and the psychological processes it accompanies. For example, it has been demonstrated that the pupil is sensitive to cognitive conflict (van der Wel and van Steenbergen, <xref ref-type="bibr" rid="B29">2018</xref>), momentary lapses of attention (Unsworth and Robison, <xref ref-type="bibr" rid="B27">2016</xref>, <xref ref-type="bibr" rid="B28">2018</xref>), successful/unsuccessful memory retrieval (Papesh et al., <xref ref-type="bibr" rid="B21">2012</xref>; Goldinger and Papesh, <xref ref-type="bibr" rid="B10">2012</xref>), and can even be used to determine whether or not an individual is mind-wandering (Franklin et al., <xref ref-type="bibr" rid="B9">2013</xref>; Mittner et al., <xref ref-type="bibr" rid="B18">2016</xref>). Further, eye-gaze based detection of mind-wandering has been successfully employed while people read (Foulsham et al., <xref ref-type="bibr" rid="B8">2013</xref>), watch films and video lectures (Mills et al., <xref ref-type="bibr" rid="B17">2016</xref>; Hutt et al., <xref ref-type="bibr" rid="B14">2017</xref>) and engage with online learning systems (Hutt et al., <xref ref-type="bibr" rid="B15">2019</xref>). Therefore, we had reason to believe we could leverage state-of-the-art machine learning tools to predict an individual&#x00027;s psychological state, momentary level of attentiveness, and behavior via pupillometry and gaze positions during a simple sustained attention task.</p></sec>
<sec>
<title>1.2 Objectives</title>
<p>The objective of this work is to revisit the extensive pupillometry and reaction time (RT) data collected in Robison et al. (<xref ref-type="bibr" rid="B24">2021</xref>) and create new predictive models of attentiveness using a modern machine learning (ML) framework. In ML, a typical model (estimator) starts with a set of preprocessed features (explanatory variables) and is trained to predict a target variable from these features. If the target variable is continuous, the task is considered a regression problem. If the target variable is categorical, the task is a classification problem. The richness of the original study allows us to propose multiple ML problems of interest by varying the corresponding target variable and the composition of the feature set. We will solve:</p>
<list list-type="order">
<list-item><p>RT-regression problems: for these models, the target variable is the continuous, raw RT value. The differences in problems arise from the initial feature list, which can vary in size from 12 to 360 features.</p></list-item>
<list-item><p>RT-classification problems: for these models, each RT value is categorized into attentive, semi-attentive, or inattentive. Broadly classifying responses in this manner is more feasible than predicting exact RT values. In these models, the number of initial features can vary from 7 to 12.</p></list-item>
<list-item><p>EC-classification problems: for this third family of problems, we propose a radically different approach. In the previous problems, the experimental conditions (EC) were used as explanatory variables. However, in these problems, the ECs become the target variables. For instance, we study whether it is possible to predict, based on the RTs, whether a subject received an incentive or not.</p></list-item>
</list>
<p>RT predictions similar to the first family of problems were attempted in Robison et al. (<xref ref-type="bibr" rid="B24">2021</xref>). However, here we explore various initial feature lists and regressors available in scikit-learn. The last two families of ML problems have not been explored yet. The outline of the paper is as follows: First, we review the experimental setup of the psychomotor vigilance task from Robison et al. (<xref ref-type="bibr" rid="B24">2021</xref>), describing how eye measurements were collected throughout the trials and detailing the various experimental manipulations that subjects underwent, which could impact their motivation and, consequently, their RTs. Next, we explain our pipeline for pre-processing the features that will be used in the subsequent models and carefully define the three families of machine learning problems investigated in our study. Third, we describe the feature matrices and pipelines used in each case. In the results section, we summarize the balanced accuracy scores and <italic>R</italic>-squared values for all classification and regression problems, along with a ranking of features according to their importance. Finally, we discuss and interpret our results in light of modern psychological theories.</p></sec></sec>
<sec sec-type="methods" id="s2">
<title>2 Methods</title>
<sec>
<title>2.1 Psychomotor vigilance task</title>
<p><xref ref-type="fig" rid="F1">Figure 1</xref> illustrates the psychomotor vigilance task described in Robison et al. (<xref ref-type="bibr" rid="B24">2021</xref>). Briefly, subjects (<italic>N</italic> = 353) in a dark room stare at a blank screen that is first replaced by a fixation screen and then by a screen that displays zeroes for a random interval between 2&#x02013;10 s. After this delay, the zeroes begin counting forward like a stopwatch. Subjects were instructed to press the space bar as soon as the stopwatch starts (timer phase). Once pressed, the counting stops, the screen freezes for 1 s (in some cases displaying a feedback screen), the RT is recorded, the screen resets, and a new trial begins. The subject&#x00027;s eye movements (diameter of left/right pupils and their gaze positions) are recorded throughout the process (140 trials).</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Schematics of the Psychomotor vigilance task. Screen undergoes different phases, changing from fixation, zeroes, timer, to feedback. The zeroes phase consists of a random interval of 2&#x02013;10 s. Subjects were asked to press the space bar as soon as the stopwatch starts and have their Reaction Time (RT) recorded for that trial. See Robison et al. (<xref ref-type="bibr" rid="B24">2021</xref>) and text for details.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbeh-18-1386723-g0001.tif"/>
</fig>
<p>As listed in <xref ref-type="table" rid="T1">Table 1</xref> (top left), the experimental conditions varied among subjects in terms of the type of goal (easy, hard, or none), feedback (yes/no), and reward conditions (time incentive, cash incentive, or none). Subjects in group <italic>G</italic><sub>0</sub> were asked to respond to the cue as quickly as possible. For subjects in group <italic>G</italic><sub>1</sub>, the average reaction time (RT) was provided every 28 trials. Subjects in group <italic>G</italic><sub>2</sub> were asked to keep their RT below 800 ms (easy goal). Subjects in groups <italic>G</italic><sub>3</sub> and <italic>G</italic><sub>4</sub> were asked to keep their RT below 300 ms (hard goal), with <italic>G</italic><sub>4</sub> subjects receiving the same feedback as those in <italic>G</italic><sub>1</sub>. Subjects in group <italic>G</italic><sub>5</sub> were told they could leave early if they met the goal, while group <italic>G</italic><sub>6</sub> subjects were promised $10 upon reaching the goal. In reality, all groups completed the same number of trials, regardless of performance. <xref ref-type="table" rid="T1">Table 1</xref> (right) lists all measurements collected during the experiment and the derived features used in our study.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Subject groups, reaction-time labels, and (derived) features.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th/>
<th valign="top" align="left"><bold>Group</bold></th>
<th valign="top" align="left"><bold>Goal</bold></th>
<th valign="top" align="left"><bold>Feedback</bold></th>
<th valign="top" align="left"><bold>Reward</bold></th>
<th valign="top" align="left"><bold>Subjects</bold></th>
<th valign="top" align="left"><bold>Measurement</bold></th>
<th valign="top" align="left"><bold>Features</bold></th>
<th valign="top" align="left"><bold>Description</bold></th>
<th/>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><bold>Exp. conditions</bold></td>
<td valign="top" align="left">G0</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">68</td>
<td valign="top" align="left">Subject IDs</td>
<td valign="top" align="left">Subject IDs</td>
<td valign="top" align="left">348 categorical variables to encode different IDs</td>
<td valign="top" align="left"><bold>Data</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="left">G1</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">Yes</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">34</td>
<td valign="top" align="left">Trial number</td>
<td valign="top" align="left">Trial number</td>
<td valign="top" align="left">Integers ranging from 1&#x02013;140</td>
<td/>
</tr>
 <tr>
<td/>
<td valign="top" align="left">G2</td>
<td valign="top" align="left">Easy</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">34</td>
<td valign="top" align="left">Pupil diameter</td>
<td/>
<td valign="top" align="left">Time series recording of right eye&#x00027;s pupil diameter (in mm) throughout trial</td>
<td/>
</tr>
 <tr>
<td/>
<td valign="top" align="left">G3</td>
<td valign="top" align="left">Hard</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">70</td>
<td/>
<td valign="top" align="left">Mean_DIAM</td>
<td valign="top" align="left">Mean of the right pupil diameter.</td>
<td/>
</tr>
 <tr>
<td/>
<td valign="top" align="left">G4</td>
<td valign="top" align="left">Hard</td>
<td valign="top" align="left">Yes</td>
<td valign="top" align="left">No</td>
<td valign="top" align="left">71</td>
<td/>
<td valign="top" align="left">Var_DIAM</td>
<td valign="top" align="left">Var. of the right pupil diameter.</td>
<td/>
</tr>
 <tr>
<td/>
<td valign="top" align="left">G5</td>
<td valign="top" align="left">Hard</td>
<td valign="top" align="left">Yes</td>
<td valign="top" align="left">Time</td>
<td valign="top" align="left">35</td>
<td valign="top" align="left">Left-eye Gaze</td>
<td/>
<td valign="top" align="left">Time series recording of left eye&#x00027;s gaze in <italic>x</italic>&#x02212;<italic>y</italic> directions</td>
<td/>
</tr>
 <tr>
<td/>
<td valign="top" align="left">G6</td>
<td valign="top" align="left">Hard</td>
<td valign="top" align="left">Yes</td>
<td valign="top" align="left">Cash</td>
<td valign="top" align="left">37</td>
<td/>
<td valign="top" align="left">Mean_LDEV</td>
<td valign="top" align="left">Mean of left eye&#x00027;s deviation</td>
<td/>
</tr>
 <tr>
<td/>
<td/>
<td/>
<td/>
<td/>
<td/>
<td/>
<td valign="top" align="left">Var_LDEV</td>
<td valign="top" align="left">Variance of left eye&#x00027;s deviation.</td>
<td/>
</tr>
 <tr>
<td/>
<td/>
<td/>
<td/>
<td/>
<td/>
<td valign="top" align="left">Right-eye Gaze</td>
<td/>
<td valign="top" align="left">Time series recording of right eye&#x00027;s gaze in <italic>x</italic>&#x02212;<italic>y</italic> directions</td>
<td/>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><bold>Problem</bold></td>
<td valign="top" align="left"><bold>Clustering Method</bold></td>
<td valign="top" align="left"><bold>Attentive (Att.)</bold></td>
<td valign="top" align="left"><bold>Semi-Attentive (semi-Att.)</bold></td>
<td valign="top" align="left"><bold>Inattentive (Inatt.)</bold></td>
<td/>
<td valign="top" align="left">mean_LDEV</td>
<td valign="top" align="left">Mean of right eye&#x00027;s deviation.</td>
<td/>
</tr>
 <tr>
<td valign="top" align="left"><bold>RTs labels</bold></td>
<td valign="top" align="left"><inline-formula><mml:math id="M5"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">GMM</td>
<td valign="top" align="left">83.3% RT &#x0003C; 441</td>
<td valign="top" align="left">15.7% 441 &#x0003C; RT &#x0003C; 769</td>
<td valign="top" align="left">0.01% RT&#x0003E;769</td>
<td/>
<td valign="top" align="left">var_LDEV</td>
<td valign="top" align="left">Variance of right eye&#x00027;s deviation.</td>
<td/>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M6"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">KNN</td>
<td valign="top" align="left">84.1% RT &#x0003C; 445</td>
<td valign="top" align="left">15.6% 445 &#x0003C; RT &#x0003C; 1,207</td>
<td valign="top" align="left">0.003% RT &#x0003C; 1,207</td>
<td valign="top" align="left">Exp. Conditions</td>
<td/>
<td valign="top" align="left">Goal (3), Feedback (2), Reward (3)</td>
<td/>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M7"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Naive</td>
<td valign="top" align="left">33.4% RT &#x0003C; 330</td>
<td valign="top" align="left">33.3% 330 &#x0003C; RT &#x0003C; 386</td>
<td valign="top" align="left">33.2% RT &#x0003C; 386</td>
<td/>
<td valign="top" align="left">Dummy_vars</td>
<td valign="top" align="left">5 categorical variables to encode different ECs</td>
<td/>
</tr></tbody>
</table>
<table-wrap-foot>
<p><bold>(Left top)</bold> Experimental Conditions (EC) varied from subject to subject, giving rise to seven different patient EC groups (<italic>G</italic>0, &#x02026;<italic>G</italic>6). <bold>(Left bottom)</bold> Reaction Time (RT) responses were labeled as attentive, semi-attentive or inattentive according to three methods (GMM, KNN and Naive method). The RT range for the labels are also presented (see text for details). (Right) Measurements and derived features used in all regression and classification problems are also described.</p>
</table-wrap-foot>
</table-wrap></sec>
<sec>
<title>2.2 Description of the problems</title>
<p>In our study, we solve three families of machine learning problems: (i) four RT-regression problems at the population level, (ii) three RT-classification problems at both individual and population levels, and (iii) six Experimental Condition (EC) classification problems at group levels. See <xref ref-type="table" rid="T2">Table 2</xref> for details.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Description of the machine learning problems.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left" colspan="2"><bold>Problem</bold></th>
<th valign="top" align="left"><bold>Label</bold></th>
<th valign="top" align="left"><bold>Comparisons</bold></th>
<th valign="top" align="left"><bold>Features</bold></th>
<th valign="top" align="left"><bold>Initial feature list</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><bold>RT regression</bold></td>
<td valign="top" align="left"><inline-formula><mml:math id="M8"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">349</td>
<td valign="top" align="left"><italic>348 subject IDs<sup>a</sup> &#x0002B; trial no</italic>.</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M9"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">355</td>
<td valign="top" align="left"><italic>348 subject IDs &#x0002B; trial no. &#x0002B; 6 eye features</italic>.</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M10"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">-</td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">360</td>
<td valign="top" align="left"><italic>as above &#x0002B; 5 EC variables.<sup>b</sup></italic></td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M11"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left"><italic>trial no. &#x0002B; 6 eye features &#x0002B; 5 EC variables</italic>.</td>
</tr> <tr>
<td valign="top" align="left"><bold>RT three-way classification</bold></td>
<td valign="top" align="left"><inline-formula><mml:math id="M12"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">via GMM</td>
<td valign="top" align="left">[Att.] &#x000D7; [Semi-att.] &#x000D7; [Inatt.]</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left"><italic>trial no. &#x0002B; 6 eye features &#x0002B; 5 EC variables</italic>.</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M13"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">via KNN</td>
<td valign="top" align="left">[Att.] &#x000D7; [Semi-att.] &#x000D7; [Inatt.]</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left"><italic>Trial no. &#x0002B; 6 eye features &#x0002B; 5 EC variables</italic>.</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M14"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Naive</td>
<td valign="top" align="left">[Att.] &#x000D7; [Semi-att.] &#x000D7; [Inatt.]</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left"><italic>Trial no. &#x0002B; 6 eye features &#x0002B; 5 EC variables</italic>.</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M15"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">via GMM</td>
<td valign="top" align="left">[Att.] &#x000D7; [Semi-att.] &#x000D7; [Inatt.]</td>
<td valign="top" align="left">7</td>
<td valign="top" align="left"><italic>Trial no. &#x0002B; 6 eye features</italic>.</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M16"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">via KNN</td>
<td valign="top" align="left">[Att.] &#x000D7; [Semi-att.] &#x000D7; [Inatt.]</td>
<td valign="top" align="left">7</td>
<td valign="top" align="left"><italic>Trial no. &#x0002B; 6 eye features</italic>.</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M17"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Naive</td>
<td valign="top" align="left">[Att.] &#x000D7; [Semi-att.] &#x000D7; [Inatt.]</td>
<td valign="top" align="left">7</td>
<td valign="top" align="left"><italic>Trial no. &#x0002B; 6 eye features</italic>.</td>
</tr> <tr>
<td valign="top" align="left"><bold>EC classification</bold></td>
<td valign="top" align="left"><inline-formula><mml:math id="M18"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Binary Goal</td>
<td valign="top" align="left">[G0] x [G2 &#x0002B; G3]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">[RT &#x0002B; 6 eye features] x 140 trials</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M19"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Binary feedback</td>
<td valign="top" align="left">[G0] &#x000D7; [G1]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">[RT &#x0002B; 6 eye features] &#x000D7; 140 trials</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M20"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Binary reward</td>
<td valign="top" align="left">[G4] &#x000D7; [G5 &#x0002B; G6]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">[RT &#x0002B; 6 eye features] &#x000D7; 140 trials</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M21"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Tertiary goal</td>
<td valign="top" align="left">[G0] &#x000D7; [G2] &#x000D7; [G3]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">[RT &#x0002B; 6 eye features] &#x000D7; 140 trials</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M22"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Tertiary reward</td>
<td valign="top" align="left">[G4] &#x000D7; [G5] &#x000D7; [G6]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">[RT &#x0002B; 6 eye features] &#x000D7; 140 trials</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M23"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">All seven subgroups</td>
<td valign="top" align="left">[G0] &#x000D7; [G1] &#x000D7; ... &#x000D7; [G6]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">[RT &#x0002B; 6 eye features] &#x000D7; 140 trials</td>
</tr></tbody>
</table>
<table-wrap-foot>
<fn id="TN1"><p>For RT regression and RT three-way classification problems we use data collected in fixation phase only. For EC classification problems we use the data from the full trial. In our notation, <italic>R</italic> and <italic>C</italic> stand for Regression and Classification problems respectively. The subscripts <italic>RT</italic> and <italic>EC</italic> indicate if the goal of the problem is predict the Reaction Time or the experimental conditions used to classify the subjects into their groups. Finally, the superscripts <italic>pop, ind</italic>, and <italic>group</italic> stand for population, individual or group levels respectively.</p></fn>
<fn id="TN2"><p><sup>a</sup>Subject ID&#x00027;s are dummy variables.</p></fn>
<fn id="TN3"><p><sup>b</sup>EC variables are dummy variables.</p></fn>
</table-wrap-foot>
</table-wrap>
<sec>
<title>2.2.1 RT-regression problems <inline-formula><mml:math id="M1"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></title>
<p>For task (i), we regress reaction times at the population level using the experimental conditions and pupillometry data collected during the fixation phase. As shown in <xref ref-type="table" rid="T2">Table 2</xref>, the initial feature list varies between problems 1&#x02013;4, containing 349, 355, 360, and 12 features respectively. This is a challenging ML task because we do not use eye measurements collected during the random interval (2&#x02013;10 s) between the fixation phase and the start of the stopwatch that records the RT for the trial.</p></sec>
<sec>
<title>2.2.2 RT-classification problems <inline-formula><mml:math id="M2"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M3"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></title>
<p>For (ii), we classify RT responses into three classes: attentive, semi- attentive, and inattentive using three labeling methods listed in <xref ref-type="table" rid="T1">Table 1</xref>: Gaussian Mixture Model (GMM), K-Nearest Neighbors (KNN), and the naive method (see <xref ref-type="supplementary-material" rid="SM1">Supplementary material</xref> for details). This can be viewed as a coarser reformulation of the regression problems, where instead of predicting the exact RT values we try to predict broader RT categories. These classification problem are solved both at the population (pop) level and at the individual (ind) level. Here again, we do not utilize any eye measurements collected during the zeroes phase.</p></sec>
<sec>
<title>2.2.3 EC-classification problems <inline-formula><mml:math id="M4"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></title>
<p>For (iii), we classify subjects according to labels given by experimental conditions. We use pupillometry data collected throughout the entire experiment as well as RTs as features to predict the label. The labels are based on the subject&#x00027;s group and the classification problem that we solve. For some binary classification problems, for example, we merge two groups into one label. See <xref ref-type="table" rid="T2">Table 2</xref> for details.</p></sec></sec>
<sec>
<title>2.3 Machine-learning pipelines</title>
<p><xref ref-type="fig" rid="F2">Figure 2</xref> depicts the seven key steps in the general pipeline used in the regression and classification problems: data curation, feature engineering, data imputation, data standardization, feature selection, model selection, and hyper parameter tuning. See the paragraphs below for some details.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Overview of the machine learning pipeline. We tailor this general outline for the RT-regression problems, for the RT three-way classification problems, and for the EC-classification problems. See text for details.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbeh-18-1386723-g0002.tif"/>
</fig>
<sec>
<title>2.3.1 Data curation and feature engineering</title>
<p>We curate the data by (i) removing subjects 1,041, 1,191, 1,192, and 1,205 who lacked eye-related measurements. (ii) by capping RT values at 3,000 ms to avoid outlying RTs from having an outsized influence on the results. To avoid redundancies in the feature list, we disregard the left-pupil measurements as they are highly correlated with the right-pupil ones. See the pairwise correlation matrix between the original features in <xref ref-type="supplementary-material" rid="SM1">Supplementary Figure 8</xref>. We also combine the eye gazes in the <italic>x</italic>&#x02212;<italic>y</italic> directions (capped at 10 mm) to create an overall deviation feature denoting how much they deviate from the center of the screen located at (0.5, 0.5):</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M24"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Deviation</mml:mtext><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Gaze x</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Gaze y</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msqrt></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The eye-tracker used in this study (Tobii T300) reports the position of visual gaze using a coordinate system where (0.5, 0.5) represents the center of the screen (half the screen width, half the screen height). Since numerical values are standardized later in the pipeline, this choice of coordinate system does not affect the results. For each subject, we calculate the means and variances of all eye-derived features throughout trials.</p></sec>
<sec>
<title>2.3.2 Data imputation and standardization</title>
<p>The filling of missing eye data is done using sklearn&#x00027;s k-neighbors imputer, and values are subsequently standardized (individually) to stay within a 0&#x02013;1 range via min-max scaler.</p></sec>
<sec>
<title>2.3.3 Inclusion of categorical data in feature list</title>
<p>We use dummy encoding to account for categorical data (subject IDs and experimental conditions) in the RT-regression and classification problems. This is not necessary for the EC-classification problems as they only consider numerical features.</p></sec>
<sec>
<title>2.3.4 Wrapper for multiple classifiers and regressors</title>
<p>There are numerous models to solve classification and regression problems. Instead of manually implementing each model, we use a wrapper called <italic>lazy predict</italic> (Pandala, <xref ref-type="bibr" rid="B20">2021</xref>) that automatically tests 42 regressors or 32 classifiers available in scikit-learn (Pedregosa et al., <xref ref-type="bibr" rid="B22">2011</xref>) to your data. This allows us to automatically get <italic>R</italic>-squared values or balanced accuracy scores for all listed models. We adjust the original wrapper to also return the Akaike Information Criterion (AIC) values to help us select the most informative models. Since the wrapper results may vary depending on the splitting of the train/test subsets, we perform five-fold cross-validation and consider the mean of the results.</p></sec>
<sec>
<title>2.3.5 Hyperparameter tuning</title>
<p>Once we identify the best model using the lazy wrapper, we further optimize all parameters used by the chosen regressor or classifier to improve the results. We report our final <italic>R</italic>-squared and balanced accuracy scores for five-fold (stratified) cross validations.</p></sec>
<sec>
<title>2.3.6 Pipeline adjustments for RT-problems</title>
<p>We use step-wise backward regression in our feature selection step for problems <inline-formula><mml:math id="M42"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M43"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M44"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. These problems have initially fewer features compared to the EC-classification problems, and this choice provides us with a reasonable number of features to work with. <inline-formula><mml:math id="M45"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> problems use <italic>p</italic>-value = 0.05, but <inline-formula><mml:math id="M46"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> uses <italic>p</italic>-value = 0.9 as the algorithm fails to converge at lower values. We use a more stringent <italic>p</italic>-value of 0.01 for <inline-formula><mml:math id="M47"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. For the individual level classification problems, we start with a <italic>p</italic>-value = 0.05, but we relax this value (up to 50%) for three subjects who did not have any features selected.</p></sec>
<sec>
<title>2.3.7 Pipeline adjustments for EC-problems</title>
<p>Problems <inline-formula><mml:math id="M48"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> have initially a large number of features (<italic>n</italic> &#x0003D; 980), which we first reduce and sort using a combination of LASSO lars and Ridge regression. See <xref ref-type="supplementary-material" rid="SM1">Supplementary material</xref> for details. We run the wrapper five times (with different train/test splittings of the data) for every subset of features. We select the classifier that provides the highest (mean) balanced accuracy and lowest (mean) AIC to avoid overfitting,</p></sec></sec></sec>
<sec sec-type="results" id="s3">
<title>3 Results</title>
<sec>
<title>3.1 Summary of results</title>
<p><xref ref-type="table" rid="T3">Table 3</xref> summarizes the results for the three families of machine learning problems that we solve: (i) four RT-regression problems at the population level <inline-formula><mml:math id="M49"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, (ii) six RT-classification problems <inline-formula><mml:math id="M50"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M51"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, and (iii) six experimental Condition (EC) classification problems at group levels <inline-formula><mml:math id="M52"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. We list the number of features before and after feature selection, the best classifier or regressor for each problem, and the corresponding balanced accuracy or <italic>R</italic>-squared score. We favor balanced accuracy scores over (simple) accuracy for all classification problems to account for differences in group sizes for the different labels. Note that the scores for all classification problems surpass random guessing by a significant margin.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Summary of results for regression and classification problems.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th valign="top" align="left" colspan="2"><bold>Problem</bold></th>
<th valign="top" align="left"><bold>Labels</bold></th>
<th valign="top" align="left"><bold>Initial Features</bold></th>
<th valign="top" align="left"><bold>Selected No. of Features</bold></th>
<th valign="top" align="left"><bold>Class./Reg. Method</bold></th>
<th valign="top" align="left"><bold><italic>R</italic><sup>2</sup></bold></th>
<th valign="top" align="left"><bold>Balanced Accuracy</bold></th>
<th valign="top" align="left"><bold>Random Guess</bold></th>
<th valign="top" align="left"><bold>AIC</bold></th>
<th valign="top" align="left"><bold>CrossVals</bold>.</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><bold>RT regression</bold></td>
<td valign="top" align="left"><inline-formula><mml:math id="M25"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">349</td>
<td valign="top" align="left">232</td>
<td valign="top" align="left">MLPRegressor</td>
<td valign="top" align="left"><bold>0.24</bold></td>
<td valign="top" align="left"><bold>-</bold></td>
<td valign="top" align="left"><bold>-</bold></td>
<td valign="top" align="left">273083</td>
<td valign="top" align="left">6</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M26"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">355</td>
<td valign="top" align="left">237</td>
<td valign="top" align="left">MLPRegressor</td>
<td valign="top" align="left"><bold>0.25</bold></td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left">272,620</td>
<td valign="top" align="left">6</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M27"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">360</td>
<td valign="top" align="left">343</td>
<td valign="top" align="left">MLPRegressor</td>
<td valign="top" align="left"><bold>0.25</bold></td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left">272,888</td>
<td valign="top" align="left">6</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M28"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left">9</td>
<td valign="top" align="left">MLPRegressor</td>
<td valign="top" align="left"><bold>0.04</bold></td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left">279,952</td>
<td valign="top" align="left">6</td>
</tr> <tr>
<td valign="top" align="left"><bold>RT three-way classification</bold></td>
<td valign="top" align="left"><inline-formula><mml:math id="M29"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">via GMM</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left">7</td>
<td valign="top" align="left">Nearest centroid</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.42</bold></td>
<td valign="top" align="left"><bold>0.33</bold></td>
<td valign="top" align="left">&#x02013;121,941</td>
<td valign="top" align="left">20</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M30"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">via KNN</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left">7</td>
<td valign="top" align="left">Nearest centroid</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.44</bold></td>
<td valign="top" align="left"><bold>0.33</bold></td>
<td valign="top" align="left">&#x02013;121,998</td>
<td valign="top" align="left">20</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M31"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Naive</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left">10</td>
<td valign="top" align="left">Linear Dis. analysis</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.42</bold></td>
<td valign="top" align="left"><bold>0.33</bold></td>
<td valign="top" align="left">&#x02013;116,086</td>
<td valign="top" align="left">20</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M32"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">via GMM</td>
<td valign="top" align="left">7</td>
<td valign="top" align="left">3</td>
<td valign="top" align="left">Nearest centroid</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.7</bold></td>
<td valign="top" align="left"><bold>0.33</bold></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">5</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M33"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">via KNN</td>
<td valign="top" align="left">7</td>
<td valign="top" align="left">3</td>
<td valign="top" align="left">Adaboost classifier</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.58</bold></td>
<td valign="top" align="left"><bold>0.33</bold></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">5</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M34"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">Naive</td>
<td valign="top" align="left">7</td>
<td valign="top" align="left">2</td>
<td valign="top" align="left">Adaboost classifier</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.49</bold></td>
<td valign="top" align="left"><bold>0.33</bold></td>
<td valign="top" align="left">&#x02013;</td>
<td valign="top" align="left">5</td>
</tr> <tr>
<td valign="top" align="left"><bold>EC classification</bold></td>
<td valign="top" align="left"><inline-formula><mml:math id="M35"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">[G0] &#x000D7; [G2 &#x0002B; G3]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">8</td>
<td valign="top" align="left">SGD classifier</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.69</bold></td>
<td valign="top" align="left"><bold>0.5</bold></td>
<td valign="top" align="left">&#x02013;665</td>
<td valign="top" align="left">400</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M36"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">[G0] &#x000D7; [G1]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">3</td>
<td valign="top" align="left">Linear dis. anaysis</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.64</bold></td>
<td valign="top" align="left"><bold>0.5</bold></td>
<td valign="top" align="left">&#x02013;406</td>
<td valign="top" align="left">400</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M37"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">[G4] &#x000D7; [G5 &#x0002B; G6]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">5</td>
<td valign="top" align="left">Calibrated class. cv</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.7</bold></td>
<td valign="top" align="left"><bold>0.5</bold></td>
<td valign="top" align="left">&#x02013;549</td>
<td valign="top" align="left">400</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M38"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">[G0] &#x000D7; [G2] &#x000D7; [G3]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">8</td>
<td valign="top" align="left">Ridge classifier</td>
<td valign="top" align="left"><bold>-</bold></td>
<td valign="top" align="left"><bold>0.51</bold></td>
<td valign="top" align="left"><bold>0.33</bold></td>
<td valign="top" align="left">&#x02013;616</td>
<td valign="top" align="left">400</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M39"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">[G4] &#x000D7; [G5] &#x000D7; [G6]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">8</td>
<td valign="top" align="left">Linear SVC</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.48</bold></td>
<td valign="top" align="left"><bold>0.33</bold></td>
<td valign="top" align="left">&#x02013;499</td>
<td valign="top" align="left">400</td>
</tr>
 <tr>
<td/>
<td valign="top" align="left"><inline-formula><mml:math id="M40"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="left">[G0] &#x000D7; [G1] &#x000D7; ... &#x000D7; [G6]</td>
<td valign="top" align="left">980</td>
<td valign="top" align="left">13</td>
<td valign="top" align="left">Linear SVC</td>
<td valign="top" align="left"><bold>&#x02013;</bold></td>
<td valign="top" align="left"><bold>0.24</bold></td>
<td valign="top" align="left"><bold>0.14</bold></td>
<td valign="top" align="left">&#x02013;1,069</td>
<td valign="top" align="left">400</td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>All classification problems beat the random guess. The feature selection method for RT regression and RT three-way classification problems is stepwise-backward. LASSO lars and Ridge regression are used for EC classification problems. For problems, <inline-formula><mml:math id="M41"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> selected number of features and the balanced accuracy values are averaged across individuals. The classifier method for these problems is the classifiers that provided the highest median balanced accuracy for the majority of the individuals.</p>
</table-wrap-foot>
</table-wrap></sec>
<sec>
<title>3.2 Subject ID as key regressor for predicting RTs at population level</title>
<p>The box-plots in <xref ref-type="fig" rid="F3">Figure 3</xref> depicts <italic>R</italic>-squared values over 400 cross-validations for problems <inline-formula><mml:math id="M53"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> using our top model, the Multi-layer Perceptron regressor (MLP regressor). Problems <inline-formula><mml:math id="M54"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> include 348 subject IDs in the initial feature list, and their mean <italic>R</italic>-squared are 0.25 &#x000B1; 0.03, 0.25 &#x000B1; 0.03, 0.24 &#x000B1; 0.03 respectively. Contrasting, the mean <italic>R</italic>-squared for problem <inline-formula><mml:math id="M55"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> (that does not include subject IDs) is 0.04 &#x000B1; 0.01, demonstrating the importance of IDs as RT predictors. Interestingly, the addition of categorical variables encoding experimental conditions (problem <inline-formula><mml:math id="M56"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> vs. <inline-formula><mml:math id="M57"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>) did not lead to any improvement in the predictions.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Regression results. Box plots depicting mean, median, and standard deviation of <italic>R</italic><sup>2</sup> values in cross validations for <inline-formula><mml:math id="M58"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> regression problems.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbeh-18-1386723-g0003.tif"/>
</fig></sec>
<sec>
<title>3.3 Results for RT-classification problems</title>
<p><xref ref-type="table" rid="T4">Table 4</xref> lists the selected features for problems <inline-formula><mml:math id="M61"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. Note that the trial number and the categorical variable encoding the presence of a goal were selected by all problems. All problems select at least one of the pupillometry features and an experimental condition, with the Nearest centroid classifier being the best method for problems <inline-formula><mml:math id="M62"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. Many classifiers provide similar balanced accuracy scores for <inline-formula><mml:math id="M63"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> (adaboost, label propagation, linear discriminant, LGBM, random forest, SVC), so we chose linear discriminant as it is simpler to hyper-tune. We run five cross-validations with the wrapper (testing all methods) and 20 cross-validations for the best one.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Selected features for classification problems.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:#ffffff">
<th/>
<th valign="top" align="left"><bold>Trial</bold></th>
<th valign="top" align="left"><bold>Mean</bold></th>
<th valign="top" align="left"><bold>Var</bold>.</th>
<th valign="top" align="left"><bold>Mean</bold></th>
<th valign="top" align="left"><bold>Var</bold>.</th>
<th valign="top" align="left"><bold>Mean</bold></th>
<th valign="top" align="left"><bold>Var</bold>.</th>
<th valign="top" align="left"><bold>Feed-</bold></th>
<th valign="top" align="left"><bold>Goal</bold></th>
<th valign="top" align="left"><bold>Goal</bold></th>
<th valign="top" align="left"><bold>Reward</bold></th>
</tr>
<tr>
<th/>
<th valign="top" align="left"><bold>no</bold>.</th>
<th valign="top" align="left"><bold>Diam</bold>.</th>
<th valign="top" align="left"><bold>Diam</bold>.</th>
<th valign="top" align="left"><bold>LDEV</bold></th>
<th valign="top" align="left"><bold>LDEV</bold></th>
<th valign="top" align="left"><bold>RDEV</bold></th>
<th valign="top" align="left"><bold>RDEV</bold></th>
<th valign="top" align="left"><bold>back</bold></th>
<th valign="top" align="left"><bold>1</bold></th>
<th valign="top" align="left"><bold>2</bold></th>
<th valign="top" align="left"><bold>1</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">GMM</td>
<td valign="top" align="left">&#x02713;</td>
<td/>
<td/>
<td/>
<td/>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
</tr> <tr>
<td valign="top" align="left">KNN</td>
<td valign="top" align="left">&#x02713;</td>
<td/>
<td/>
<td/>
<td/>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
</tr> <tr>
<td valign="top" align="left">Naive</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td/>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
<td valign="top" align="left">&#x02713;</td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>List of selected features for problems <inline-formula><mml:math id="M59"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> with <italic>p</italic>-value &#x02264; 0.01 in stepwise regression for the three labeling methods. None of the methods selected the dummy variable Reward 2.</p>
</table-wrap-foot>
</table-wrap>
<p>We solve the RT-classification problems also at the individual level, i.e., trying to classify RT responses as attentive, semi-attentive, and inattentive for each subject in turn. For these problems (<inline-formula><mml:math id="M64"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>), the experimental conditions are not included in the feature list. <xref ref-type="table" rid="T3">Table 3</xref> shows the mean of the balanced accuracy scores (using the best method) over all subjects. We run five cross-validations with the wrapper (testing all methods) and rank the methods according to the median of the balanced accuracy scores. <xref ref-type="fig" rid="F4">Figure 4</xref> shows histograms for the frequency of selected features for problem <inline-formula><mml:math id="M65"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. Similar to the results obtained at the population level, the trial number was also the most frequently selected feature for most subjects.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>Frequency of features for individual, RT-classification problems <inline-formula><mml:math id="M60"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> under each clustering method. Majority of the individuals selected less than three out of the seven features.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbeh-18-1386723-g0004.tif"/>
</fig></sec>
<sec>
<title>3.4 Identifying experimental conditions from physiological data</title>
<p>The last family of machine learning problems examined in this study is significantly different from the other two; while <inline-formula><mml:math id="M66"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M67"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> try to predict or categorize RT responses, problems <inline-formula><mml:math id="M68"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> try to disambiguate subjects exposed to different experimental conditions. As shown in <xref ref-type="table" rid="T1">Table 1</xref>, subjects were binned into groups <italic>G</italic><sub>0</sub>, &#x02026;, <italic>G</italic><sub>6</sub> depending on the presented type of goal (easy, hard, or none), feedback (yes/no), and reward (time incentive, cash incentive, or none). For these problems, experimental conditions are no longer features used to predict RTs. In fact, RTs are now themselves features used in the six n-way classification tasks (see label type in <xref ref-type="table" rid="T2">Table 2</xref>). Also, the eye-derived features are no longer collected solely at the fixation phase of the experiment, but instead, throughout the entire trial.</p>
<p>With this different setup, we can now investigate if differences in experimental conditions imprint noticeable changes in the collected physiological data. In problem <inline-formula><mml:math id="M69"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, for example, we combine subjects who received either easy or hard goals into a single group [<italic>G</italic><sub>2</sub>&#x0002B;<italic>G</italic><sub>3</sub>] and compare them with those who received none [<italic>G</italic><sub>0</sub>]. This leads to a binary classification problem, [<italic>G</italic><sub>0</sub>] &#x000D7; [<italic>G</italic><sub>2</sub>&#x0002B;<italic>G</italic><sub>3</sub>]. In problem <inline-formula><mml:math id="M70"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, we keep <italic>G</italic><sub>2</sub> and <italic>G</italic><sub>3</sub> separate, which lead to a three-way classification problem instead, [<italic>G</italic><sub>0</sub>] &#x000D7; [<italic>G</italic><sub>2</sub>] &#x000D7; [<italic>G</italic><sub>3</sub>]. The setup for the other <inline-formula><mml:math id="M71"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> problems follows the same rationale, and our best classification results are listed in the bottom part of <xref ref-type="table" rid="T3">Table 3</xref>.</p>
<p>Problems <inline-formula><mml:math id="M72"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> consist of binary classification tasks for one type of experimental condition (vs. control group). Top balanced accuracy scores for the presence of goal, feedback, and reward are 0.69, 0.70, and 0.64 respectively. Problems <inline-formula><mml:math id="M73"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> consist of three-way classification tasks for goal and reward with top scores of 0.51 and 0.48. Finally, <inline-formula><mml:math id="M74"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is a seven-way classification task for all groups, for which we achieve a 0.24 score. All scores surpass random guessing by a significant margin, and in all problems except <inline-formula><mml:math id="M75"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, the most accurate model was also the most informative (using AIC).</p>
<p><xref ref-type="fig" rid="F5">Figure 5</xref> depicts the selected features for problems <inline-formula><mml:math id="M76"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. Since their initial feature list is very large (with 980 features), it is expected that in some cases, the pipeline&#x00027;s original feature-selection step might provide sub-optimal solutions. In an effort to improve our results, we empirically complemented the list of selected features of some problems with features selected by others. Specifically, <inline-formula><mml:math id="M77"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> improved when we added features from <inline-formula><mml:math id="M78"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M79"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> improved when we added features from <inline-formula><mml:math id="M80"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M81"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> improved when we added features from <inline-formula><mml:math id="M82"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. As expected, the number of features is proportional to the complexity of the task, with significant overlap between the corresponding binary and three-way tasks (<inline-formula><mml:math id="M83"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M84"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>).</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Features selected for the six classification problems. There were common features among the binary and three-way problems of goal and reward experimental conditions. The binary classification problems are on the top row. The three-way problems for goal and reward are placed under their respective binary problems.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbeh-18-1386723-g0005.tif"/>
</fig></sec>
<sec>
<title>3.5 Accuracy vs. feature resolution for EC-classification problems</title>
<p>The initial feature list for problems <inline-formula><mml:math id="M86"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is large because we collect six pupillometry features along with the RT per trial (7 &#x000D7; 140 &#x0003D; 980). In what follows, we investigate how well can we classify subjects using coarser measurements. Instead of collecting features at every trial, we average them over 10, 20, and 35 trials, thus obtaining physiological data with decreasing resolution. We use the same feature sorting and selection methods used in the original <inline-formula><mml:math id="M87"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> problems.</p>
<p><xref ref-type="fig" rid="F6">Figure 6</xref> displays the mean of the balanced accuracy scores over 400 cross-validations (repeated stratified k fold with 20 splits and 20 repeats) for the best method found by the wrapper. In general, scores tend to slowly decrease as we average features over more trials. Problems <inline-formula><mml:math id="M88"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>5</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> have similar decay rates in balanced accuracy (&#x02248;&#x02212;0.005), while <inline-formula><mml:math id="M89"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is slightly more robust (&#x02248;&#x02212;0.002). We report the number of selected features, the exact scores, the standard deviations, the best classifiers, and the AIC values for all problems (at different resolutions) in the <xref ref-type="supplementary-material" rid="SM1">Supplementary material</xref>.</p>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>Balanced accuracy for problems at different resolutions. Average balanced accuracy for problems <inline-formula><mml:math id="M85"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> at different resolution levels (1, 10, 20, and 35). We used repeated Stratified K-Fold with 20 folds and 20 repeats totaling 400 cross-validations. Best fit lines are given by <italic>y</italic><sub>1</sub> = &#x02212;0.006<italic>x</italic> &#x0002B; 0.69, <italic>y</italic><sub>2</sub> = &#x02212;0.005<italic>x</italic> &#x0002B; 0.67, <italic>y</italic><sub>3</sub> = &#x02212;0.005<italic>x</italic> &#x0002B; 0.66, <italic>y</italic><sub>4</sub> &#x0003D; &#x02212;0.004<italic>x</italic>&#x0002B;0.47, <italic>y</italic><sub>5</sub> &#x0003D; &#x02212;0.005<italic>x</italic> &#x0002B; 0.46 and <italic>y</italic><sub>6</sub> = &#x02013;0.002<italic>x</italic> &#x0002B; 0.24 respectively.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbeh-18-1386723-g0006.tif"/>
</fig>
<p><xref ref-type="fig" rid="F7">Figure 7</xref> shows the important features for problems <inline-formula><mml:math id="M90"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, with green/blue blocks representing features selected once/twice under any resolution level. Moreover, if a selected feature is averaged over k trials, we color all corresponding k trials in the matrix plot. Note that there are no overlaps for more than two resolution levels, indicating that predictive features at the highest resolution level are not optimal at the lower ones.</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Key features selected for each problem under different resolutions. If a feature was selected for a combined trial (10, 20, and 35), then the whole block was colored. The dark green color indicated overlaps in features in different resolutions.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbeh-18-1386723-g0007.tif"/>
</fig>
</sec></sec>
<sec sec-type="discussion" id="s4">
<title>4 Discussion</title>
<p>Sustaining attention is difficult, and it has been made perhaps more difficult by the dynamic environments in which we live and work. As people complete their daily tasks, they experience failures of sustained attention, caused by both internal (e.g., mind-wandering) and external distraction (e.g., from smartphone notifications). Many situations, like driving a car, learning in a classroom, and screening baggage for dangerous items, require sustained attention. Cognitive psychologistsv and cognitive neuroscientists still do not have a firm grasp on precisely why humans find sustaining attention so challenging. Modern machine learning methods may reveal, via data-driven approaches, moment-to-moment psychological and physiological features that are indicative of greater versus letter attentiveness. Our goal here was to determine whether we could categorize attentiveness using both psychological (i.e., goal state, feedback presence, reward) and physiological (i.e., eye-tracking) features of individuals.</p>
<p>Specifically, we revisit the psychomotor vigilance experiment from Robison et al. (<xref ref-type="bibr" rid="B24">2021</xref>) through the lens of modern machine learning techniques. Specifically, we solve three families of machine learning problems: (i) four RT-regression problems at the population level <inline-formula><mml:math id="M91"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, (ii) three RT-classification problems <inline-formula><mml:math id="M92"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> at the population level and <inline-formula><mml:math id="M93"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> at the individual level, and (iii) six Experimental Condition (EC) classification problems at group levels <inline-formula><mml:math id="M94"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>In (i), we find that predicting RTs is a notoriously difficult task (<italic>R</italic>-squared &#x02248;0.24, see <xref ref-type="table" rid="T3">Table 3</xref>). The best models for <inline-formula><mml:math id="M95"><mml:msubsup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> did not select any eye-related features from the fixation phase as predictors, instead choosing a combination of subject IDs, trial number, and experimental conditions. During the experiment, subjects first stared at a blank screen, followed by a fixation screen, and then a screen displaying zeroes for a random interval between 2&#x02013;10 s. After this delay, the zeroes began counting forward like a stopwatch, and subjects pressed the space bar as soon as the stopwatch started (timer phase). Our analysis utilized eye-derived features from the fixation phase, where subjects could still be attentive and preparing for the task ahead. Any signs of inattention may not have developed yet. In contrast, during the random interval, subjects might experience a drop in attentiveness or their eyes might wander off the screen, which could be more predictive of slower RTs. This interval represents a period of waiting and uncertainty, potentially leading to lapses in attention that could be more indicative of the subject&#x00027;s state and performance. Therefore, future analyses might benefit from incorporating eye-derived features from this interval to improve RT predictions. We also note that including Subject ID in the RT-regression model significantly improved its performance, underscoring the importance of individual differences in experiments on sustained attention using RT measures. This finding aligns with existing literature, which shows that these are nested observations, and RTs naturally cluster within individuals, as some people tend to respond faster than others (Unsworth and Robison, <xref ref-type="bibr" rid="B28">2018</xref>).</p>
<p>In (ii), instead of trying to predict exact RT values, we settle for a less ambitious classification of RT-responses as attentive, semi-attentive, and inattentive. We use four different clustering methods to define these broader categories, which lead to balanced accuracy scores of &#x02248;0.43 at the population level and &#x02248;0.6 at the individual level. The trial number feature was the most frequently-selected feature across all problems (see <xref ref-type="fig" rid="F4">Figure 4</xref>), which is compatible with the natural, growing inattentiveness reported in Robison et al. (<xref ref-type="bibr" rid="B24">2021</xref>). The analysis also revealed that pupil and eye-tracking measures were not key predictors of RT in both RT-regression and RT-classification models. This could be due to the restricted time period of eye measures or because RT and pupil measures index different aspects of attention. Existing literature supports the latter possibility, suggesting that post-stimulus dilations and RT have different sensitivities to task demands (Hershman and Henik, <xref ref-type="bibr" rid="B11">2019</xref>; Richer and Beatty, <xref ref-type="bibr" rid="B23">1987</xref>). Therefore, including wider windows of pupil data may not have straightforwardly predicted RTs.</p>
<p>In (iii), we solve a much different type of machine learning problem. Instead of trying to categorize or predict RTs, we try to classify subjects that exposed to different experimental conditions, such as the presence of a goal, feedback, and reward. This led to the six n-way classification problems <inline-formula><mml:math id="M96"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>6</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. Contrary to the previous problems, RTs are now themselves features and eye-measurements are no longer restricted to the fixation phase (they are averaged throughout the entire trial). Our good classification scores (see <xref ref-type="table" rid="T3">Table 3</xref>) suggest that manipulations in experimental conditions do imprint noticeable changes in the recorded physiological data, although predictors may vary according to the resolution of the features (see <xref ref-type="fig" rid="F6">Figures 6</xref>, <xref ref-type="fig" rid="F7">7</xref>). The analysis showed that pupil measures are key predictors of task type in the EC-classification problem, with prediction accuracy decreasing when measures are averaged across trials rather than using individual trial-level data. This suggests that while broad pupil/eye data can indicate the overall arousal or attentional state of participants, trial-level data offers a weaker prediction with temporal resolution. We believe this finding may help guide future research methodology in cognitive psychology, reinforcing the importance of maintaining data resolution throughout the experiment.</p>
<p>Overall, our machine-leaning approach indicates that the behavioral and physiological measures we used accurately predicted the experimental conditions, demonstrating that global, qualitative changes in attentional state are detectable. In this design, participants were assigned to various conditions, and it is plausible that similar techniques could predict natural states of extreme stress, anxiety, fatigue, or their opposites like contentment, calm, and alertness. These states would manifest as distinct patterns in eye movements, pupillary dynamics, and behavior. However, the same model might be less effective in predicting specific moments of stress or fatigue, as evidenced by our lower success rate in predicting specific RTs.</p>
<sec>
<title>4.1 Outlook</title>
<p>The application of ML to analyze sustained attention data presents significant theoretical, analytical, and practical benefits. Theoretically, ML allows us to identify complex patterns and relationships within the data, enhancing our understanding of cognitive processes in sustained attention. This analytical approach is particularly valuable in behavioral neuroscience and psychology, providing deeper insights into complex behaviors.</p>
<p>Analytically, ML offers robust and flexible tools to handle high-dimensional data, enabling the development of predictive models with high accuracy and generalizability. Our study demonstrates the potential of these models to classify attentional states and predict RTs. The experimental setup led to multiple ML problems, highlighting the importance of carefully defining problems, as the initial feature list and target variable may change. For the same setup, we proposed three families of ML problems. However, predicting human responses remains challenging, even in controlled setups, illustrating the necessity of sophisticated ML pipelines.</p>
<p>Practically, predicting and understanding attentiveness through ML has far-reaching implications. In education, predictive models can inform personalized learning strategies to maintain engagement. In occupational health, these models can monitor and enhance productivity and safety by identifying periods of low attentiveness and implementing timely interventions. Additionally, adaptive user interfaces and assistive technologies can respond to users&#x00027; attentional states, improving overall user experience and performance.</p>
<p>The present results are a first step toward leveraging pupil diameter and gaze position data to predict moments of inattentiveness. Recent work has pursued similar goals with more dynamic environments and additional data (e.g., body movement, blinking) (D&#x00027;Mello et al., <xref ref-type="bibr" rid="B6">2022</xref>; Bosch and D&#x00027;Mello, <xref ref-type="bibr" rid="B5">2022</xref>). In future work, we aim to design tasks that produce robust indices of inattentiveness using eye data and additional sensors for multidimensional data collection. Ultimately, our goal is to build a reproducible and generalizable model that detects attentional lapses in real time, mitigating failures of sustained attention. Portable and accurate wearable eye-tracking technology could be especially useful in air traffic control, baggage screening, life-guarding, and others.</p></sec></sec>
</body>
<back>
<sec sec-type="data-availability" id="s5">
<title>Data availability statement</title>
<p>The machine learning code supporting this study is available upon reasonable request by contacting <email>netznana&#x00040;gmail.com</email>. Access to the dataset can be obtained by contacting <email>mrobison&#x00040;nd.edu</email>.</p>
</sec>
<sec sec-type="ethics-statement" id="s6">
<title>Ethics statement</title>
<p>Ethical approval was not required for the study involving humans in accordance with the local legislation and institutional requirements. Written informed consent to participate in this study was not required from the participants or the participants&#x00027; legal guardians/next of kin in accordance with the national legislation and the institutional requirements. Written informed consent was obtained from the individual(s) for the publication of any potentially identifiable images or data included in this article.</p>
</sec>
<sec sec-type="author-contributions" id="s7">
<title>Author contributions</title>
<p>NF: Data curation, Formal analysis, Investigation, Methodology, Validation, Visualization, Writing &#x02013; original draft, Writing &#x02013; review &#x00026; editing. MR: Conceptualization, Investigation, Methodology, Resources, Supervision, Validation, Writing &#x02013; review &#x00026; editing. PM: Conceptualization, Formal analysis, Resources, Supervision, Validation, Writing &#x02013; review &#x00026; editing, Investigation, Methodology, Project administration, Software, Visualization.</p>
</sec>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>The author(s) declare that no financial support was received for the research, authorship, and/or publication of this article.</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<sec sec-type="supplementary-material" id="s10">
<title>Supplementary material</title>
<p>The Supplementary Material for this article can be found online at: <ext-link ext-link-type="uri" xlink:href="https://www.frontiersin.org/articles/10.3389/fnbeh.2024.1386723/full#supplementary-material">https://www.frontiersin.org/articles/10.3389/fnbeh.2024.1386723/full#supplementary-material</ext-link></p>
<supplementary-material xlink:href="Data_Sheet_1.pdf" id="SM1" mimetype="application/pdf" xmlns:xlink="http://www.w3.org/1999/xlink"/></sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Beatty</surname> <given-names>J.</given-names></name></person-group> (<year>1982</year>). <article-title>Task-evoked pupillary responses, processing load, and the structure of processing resources</article-title>. <source>Psychol. Bull</source>. <volume>91</volume>, <fpage>276</fpage>&#x02013;<lpage>292</lpage>. <pub-id pub-id-type="doi">10.1037/0033-2909.91.2.276</pub-id><pub-id pub-id-type="pmid">7071262</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bills</surname> <given-names>A. G.</given-names></name></person-group> (<year>1931a</year>). <article-title>Mental work</article-title>. <source>Psychol. Bull</source>. <volume>28</volume>, <fpage>505</fpage>&#x02013;<lpage>532</lpage>. <pub-id pub-id-type="doi">10.1037/h0074511</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bills</surname> <given-names>A. G.</given-names></name></person-group> (<year>1931b</year>). <article-title>Blocking: A new principle of mental fatigue</article-title>. <source>Am. J. Psychol</source>. <volume>43</volume>, <fpage>230</fpage>&#x02013;<lpage>245</lpage>. <pub-id pub-id-type="doi">10.2307/1414771</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Bligh</surname> <given-names>D.</given-names></name></person-group> (<year>2000</year>). <source>What&#x00027;s the Use of Lectures</source>? <publisher-loc>San Francisco, CA</publisher-loc>: <publisher-name>Jossey-Bass</publisher-name>.</citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bosch</surname> <given-names>N.</given-names></name> <name><surname>D&#x00027;Mello</surname> <given-names>S. K.</given-names></name></person-group> (<year>2022</year>). <article-title>Can computers outperform humans in detecting user zone-outs? Implications for intelligent interfaces</article-title>. <source>ACM Trans. Comput. Hum. Interact</source>. <volume>29</volume>, <fpage>1</fpage>&#x02013;<lpage>33</lpage>. <pub-id pub-id-type="doi">10.1145/3481889</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>D&#x00027;Mello</surname> <given-names>S. K.</given-names></name> <name><surname>Tay</surname> <given-names>L.</given-names></name> <name><surname>Southwell</surname> <given-names>R.</given-names></name></person-group> (<year>2022</year>). <article-title>Psychological measurement in the information age: machine-learned computational models</article-title>. <source>Curr. Dir. Psychol. Sci</source>. <volume>31</volume>, <fpage>76</fpage>&#x02013;<lpage>87</lpage>. <pub-id pub-id-type="doi">10.1177/09637214211056906</pub-id></citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Esterman</surname> <given-names>M.</given-names></name> <name><surname>Grosso</surname> <given-names>M.</given-names></name> <name><surname>Liu</surname> <given-names>G.</given-names></name> <name><surname>Mitko</surname> <given-names>A.</given-names></name> <name><surname>Morris</surname> <given-names>R.</given-names></name> <name><surname>DeGutis</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Anticipation of monetary reward can attenuate the vigilance decrement</article-title>. <source>PLoS ONE</source> <volume>11</volume>:<fpage>e0159741</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0159741</pub-id><pub-id pub-id-type="pmid">27472785</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Foulsham</surname> <given-names>T.</given-names></name> <name><surname>Farley</surname> <given-names>J.</given-names></name> <name><surname>Kingstone</surname> <given-names>A.</given-names></name></person-group> (<year>2013</year>). <article-title>Mind wandering in sentence reading: Decoupling the link between mind and eye</article-title>. <source>Can. J. Exp. Psychol</source>. <volume>67</volume>:<fpage>51</fpage>. <pub-id pub-id-type="doi">10.1037/a0030217</pub-id><pub-id pub-id-type="pmid">23458551</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Franklin</surname> <given-names>M. S.</given-names></name> <name><surname>Broadway</surname> <given-names>J. M.</given-names></name> <name><surname>Mrazek</surname> <given-names>M. D.</given-names></name> <name><surname>Smallwood</surname> <given-names>J.</given-names></name> <name><surname>Schooler</surname> <given-names>J. W.</given-names></name></person-group> (<year>2013</year>). <source>Window to the Wandering Mind: Pupillometry of Spontaneous thought While Reading</source>. London: Sage. <pub-id pub-id-type="doi">10.1080/17470218.2013.858170</pub-id><pub-id pub-id-type="pmid">24313285</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Goldinger</surname> <given-names>S. D.</given-names></name> <name><surname>Papesh</surname> <given-names>M. H.</given-names></name></person-group> (<year>2012</year>). <article-title>Pupil dilation reflects the creation and retrieval of memories</article-title>. <source>Curr. Dir. Psychol. Sci</source>. <volume>21</volume>, <fpage>90</fpage>&#x02013;<lpage>95</lpage>. <pub-id pub-id-type="doi">10.1177/0963721412436811</pub-id><pub-id pub-id-type="pmid">29093614</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hershman</surname> <given-names>R.</given-names></name> <name><surname>Henik</surname> <given-names>A.</given-names></name></person-group> (<year>2019</year>). <article-title>Dissociation between reaction time and pupil dilation in the stroop task</article-title>. <source>J. Exp. Psychol. Learn. Mem. Cogn</source>. <volume>45</volume>:<fpage>1899</fpage>. <pub-id pub-id-type="doi">10.1037/xlm0000690</pub-id><pub-id pub-id-type="pmid">30816765</pub-id></citation></ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hopstaken</surname> <given-names>J. F.</given-names></name> <name><surname>Van Der Linden</surname> <given-names>D.</given-names></name> <name><surname>Bakker</surname> <given-names>A. B.</given-names></name> <name><surname>Kompier</surname> <given-names>M. A.</given-names></name></person-group> (<year>2015a</year>). <article-title>A multifaceted investigation of the link between mental fatigue and task disengagement</article-title>. <source>Psychophysiology</source> <volume>52</volume>, <fpage>305</fpage>&#x02013;<lpage>315</lpage>. <pub-id pub-id-type="doi">10.1111/psyp.12339</pub-id><pub-id pub-id-type="pmid">25263028</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hopstaken</surname> <given-names>J. F.</given-names></name> <name><surname>Van Der Linden</surname> <given-names>D.</given-names></name> <name><surname>Bakker</surname> <given-names>A. B.</given-names></name> <name><surname>Kompier</surname> <given-names>M. A.</given-names></name></person-group> (<year>2015b</year>). <article-title>The window of my eyes: task disengagement and mental fatigue covary with pupil dynamics</article-title>. <source>Biol. Psychol</source>. <volume>110</volume>, <fpage>100</fpage>&#x02013;<lpage>106</lpage>. <pub-id pub-id-type="doi">10.1016/j.biopsycho.2015.06.013</pub-id><pub-id pub-id-type="pmid">26196899</pub-id></citation></ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hutt</surname> <given-names>S.</given-names></name> <name><surname>Hardey</surname> <given-names>J.</given-names></name> <name><surname>Bixler</surname> <given-names>R.</given-names></name> <name><surname>Stewart</surname> <given-names>A.</given-names></name> <name><surname>Risko</surname> <given-names>E.</given-names></name> <name><surname>D&#x00027;Mello</surname> <given-names>S. K.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>Gaze-based detection of mind wandering during lecture viewing</article-title>. <source>Int. Educ. Data Mining Soc</source>.<pub-id pub-id-type="pmid">39543376</pub-id></citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hutt</surname> <given-names>S.</given-names></name> <name><surname>Krasich</surname> <given-names>K.</given-names></name> <name><surname>Mills</surname> <given-names>C.</given-names></name> <name><surname>Bosch</surname> <given-names>N.</given-names></name> <name><surname>White</surname> <given-names>S.</given-names></name> <name><surname>Brockmole</surname> <given-names>J. R.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>Automated gaze-based mind wandering detection during computerized learning in classrooms</article-title>. <source>User Model. User-adapt. Interact</source>. <volume>29</volume>, <fpage>821</fpage>&#x02013;<lpage>867</lpage>. <pub-id pub-id-type="doi">10.1007/s11257-019-09228-5</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Massar</surname> <given-names>S. A.</given-names></name> <name><surname>Lim</surname> <given-names>J.</given-names></name> <name><surname>Sasmita</surname> <given-names>K.</given-names></name> <name><surname>Chee</surname> <given-names>M. W.</given-names></name></person-group> (<year>2016</year>). <article-title>Rewards boost sustained attention through higher effort: a value-based decision making approach</article-title>. <source>Biol. Psychol</source>. <volume>120</volume>, <fpage>21</fpage>&#x02013;<lpage>27</lpage>. <pub-id pub-id-type="doi">10.1016/j.biopsycho.2016.07.019</pub-id><pub-id pub-id-type="pmid">27498294</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mills</surname> <given-names>C.</given-names></name> <name><surname>Bixler</surname> <given-names>R.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name> <name><surname>D&#x00027;Mello</surname> <given-names>S. K.</given-names></name></person-group> (<year>2016</year>). <article-title>Automatic gaze-based detection of mind wandering during narrative film comprehension</article-title>. <source>Int. Educ. Data Mining Soc</source>.</citation>
</ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mittner</surname> <given-names>M.</given-names></name> <name><surname>Hawkins</surname> <given-names>G. E.</given-names></name> <name><surname>Boekel</surname> <given-names>W.</given-names></name> <name><surname>Forstmann</surname> <given-names>B. U.</given-names></name></person-group> (<year>2016</year>). <article-title>A neural model of mind wandering</article-title>. <source>Trends Cogn. Sci</source>. <volume>20</volume>, <fpage>570</fpage>&#x02013;<lpage>578</lpage>. <pub-id pub-id-type="doi">10.1016/j.tics.2016.06.004</pub-id><pub-id pub-id-type="pmid">27353574</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="book"><person-group person-group-type="author"><collab>National Highway Traffic Safety Administration</collab></person-group> (<year>2020</year>). <source>Distracted driving 2018. National Center for Statistics and Analysis, Research Note Report DOT HS 812 926</source>. <publisher-loc>Washington, DC</publisher-loc>: <publisher-name>National Highway Traffic Safety Administration</publisher-name>.</citation>
</ref>
<ref id="B20">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Pandala</surname> <given-names>S.</given-names></name></person-group> (<year>2021</year>). <source>Lazy predict</source>. Available at: <ext-link ext-link-type="uri" xlink:href="https://github.com/shankarpandala/lazypredict">https://github.com/shankarpandala/lazypredict</ext-link></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Papesh</surname> <given-names>M. H.</given-names></name> <name><surname>Goldinger</surname> <given-names>S. D.</given-names></name> <name><surname>Hout</surname> <given-names>M. C.</given-names></name></person-group> (<year>2012</year>). <article-title>Memory strength and specificity revealed by pupillometry</article-title>. <source>Int. J. Psychophysiol</source>. <volume>83</volume>, <fpage>56</fpage>&#x02013;<lpage>64</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijpsycho.2011.10.002</pub-id><pub-id pub-id-type="pmid">22019480</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pedregosa</surname> <given-names>F.</given-names></name> <name><surname>Varoquaux</surname> <given-names>G.</given-names></name> <name><surname>Gramfort</surname> <given-names>A.</given-names></name> <name><surname>Michel</surname> <given-names>V.</given-names></name> <name><surname>Thirion</surname> <given-names>B.</given-names></name> <name><surname>Grisel</surname> <given-names>O.</given-names></name> <etal/></person-group>. (<year>2011</year>). <article-title>Scikit-learn: machine learning in Python</article-title>. <source>J. Mach. Learn. Res</source>. <volume>12</volume>, <fpage>2825</fpage>&#x02013;<lpage>2830</lpage>.</citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Richer</surname> <given-names>F.</given-names></name> <name><surname>Beatty</surname> <given-names>J.</given-names></name></person-group> (<year>1987</year>). <article-title>Contrasting effects of response uncertainty on the task-evoked pupillary response and reaction time</article-title>. <source>Psychophysiology</source> <volume>24</volume>, <fpage>258</fpage>&#x02013;<lpage>262</lpage>. <pub-id pub-id-type="doi">10.1111/j.1469-8986.1987.tb00291.x</pub-id><pub-id pub-id-type="pmid">3602280</pub-id></citation></ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Robison</surname> <given-names>M.</given-names></name> <name><surname>Unsworth</surname> <given-names>N.</given-names></name> <name><surname>Brewer</surname> <given-names>G.</given-names></name></person-group> (<year>2021</year>). <article-title>Examining the effects of goal-setting, feedback, and incentives on sustained attention</article-title>. <source>J. Exp. Psychol. Hum. Percept. Perform</source>. 47. <pub-id pub-id-type="doi">10.31234/osf.io/97t8w</pub-id><pub-id pub-id-type="pmid">34383546</pub-id></citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sarter</surname> <given-names>M.</given-names></name> <name><surname>Givens</surname> <given-names>B.</given-names></name> <name><surname>Bruno</surname> <given-names>J. P.</given-names></name></person-group> (<year>2001</year>). <article-title>The cognitive neuroscience of sustained attention: where top-down meets bottom-up</article-title>. <source>Brain Res. Rev</source>. <volume>35</volume>, <fpage>146</fpage>&#x02013;<lpage>160</lpage>. <pub-id pub-id-type="doi">10.1016/S0165-0173(01)00044-3</pub-id><pub-id pub-id-type="pmid">11336780</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Thorndike</surname> <given-names>E. L.</given-names></name></person-group> (<year>1912</year>). <article-title>The curve of work and the curve of satisfyingness</article-title>. <source>J. Appl. Psychol</source>. <volume>1</volume>, <fpage>165</fpage>&#x02013;<lpage>194</lpage>. <pub-id pub-id-type="doi">10.1037/h0073541</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Unsworth</surname> <given-names>N.</given-names></name> <name><surname>Robison</surname> <given-names>M. K.</given-names></name></person-group> (<year>2016</year>). <article-title>Pupillary correlates of lapses of sustained attention</article-title>. <source>Cogn. Affect. Behav. Neurosci</source>. <volume>16</volume>, <fpage>601</fpage>&#x02013;<lpage>615</lpage>. <pub-id pub-id-type="doi">10.3758/s13415-016-0417-4</pub-id><pub-id pub-id-type="pmid">27038165</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Unsworth</surname> <given-names>N.</given-names></name> <name><surname>Robison</surname> <given-names>M. K.</given-names></name></person-group> (<year>2018</year>). <article-title>Tracking arousal state and mind wandering with pupillometry</article-title>. <source>Cogn. Affect. Behav. Neurosci</source>. <volume>18</volume>, <fpage>638</fpage>&#x02013;<lpage>664</lpage>. <pub-id pub-id-type="doi">10.3758/s13415-018-0594-4</pub-id><pub-id pub-id-type="pmid">29654476</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>van der Wel</surname> <given-names>P.</given-names></name> <name><surname>van Steenbergen</surname> <given-names>H.</given-names></name></person-group> (<year>2018</year>). <article-title>Pupil dilation as an index of effort in cognitive control tasks: a review</article-title>. <source>Psychon. Bull. Rev</source>. <volume>25</volume>, <fpage>2005</fpage>&#x02013;<lpage>2015</lpage>. <pub-id pub-id-type="doi">10.3758/s13423-018-1432-y</pub-id><pub-id pub-id-type="pmid">29435963</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Lu</surname> <given-names>S.</given-names></name> <name><surname>Harter</surname> <given-names>D.</given-names></name></person-group> (<year>2021</year>). <article-title>Multi-sensor eye-tracking systems and tools for capturing student attention and understanding engagement in learning: a review</article-title>. <source>IEEE Sens. J.</source> <fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/JSEN.2021.3105706</pub-id></citation>
</ref>
</ref-list>
</back>
</article> 