Shashank Singh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Shashank Singh has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Jaeah Kim
Carnegie Mellon University
3 shared publications - Anna Fisher
Carnegie Mellon University
2 shared publications - Erik D. Thiessen
Carnegie Mellon University
2 shared publications - Shailendra Narayan Singh
Amity University
2 shared publications Anna Fisher
1 shared publicationAnna V. Fisher
Department of Psychology, Carnegie Mellon University, Pittsburgh, PA, 15213, USA
1 shared publication
Latest Publications
- Open Access
- 16 September 2021
- Published by Center for Open Science in PsyArXiv
Staying and Returning Dynamics of Young Children's Attention
In this paper, we decompose sustained attending behavior into components of continuous attention maintenance and attentional transitions and study how each of these components develops in young children. Our results in two experiments suggest that changes in children's ability to return attention to a target locus after distraction (“Returning”) play a crucial role in the development of sustained attention between the ages of 3.5-6 years, perhaps to a greater extent than changes in the ability to continuously maintain attention on the target (“Staying”). We further distinguish Returning from the behavior of transitioning attention away from task (“Leaving”) and provide evidence that Leaving is more strongly influenced by bottom-up factors, while Returning is invariant to these same bottom-up factors, suggesting a potentially greater contribution of top-down factors in Returning. Overall, these results (a) suggest the importance of understanding the cognitive process of transitioning attention for understanding sustained attention and its development, (b) provide an empirical paradigm within which to study this process, and (c) begin to characterize basic features of this process, namely its development and its relative dependence on top-down and bottom-up influences on attention.
- 16 September 2021
- Published by Center for Open Science in PsyArXiv
Open AccessStaying and Returning Dynamics of Young Children's Attention
In this paper, we decompose sustained attending behavior into components of continuous attention maintenance and attentional transitions and study how each of these components develops in young children. Our results in two experiments suggest that changes in children's ability to return attention to a target locus after distraction (“Returning”) play a crucial role in the development of sustained attention between the ages of 3.5-6 years, perhaps to a greater extent than changes in the ability to continuously maintain attention on the target (“Staying”). We further distinguish Returning from the behavior of transitioning attention away from task (“Leaving”) and provide evidence that Leaving is more strongly influenced by bottom-up factors, while Returning is invariant to these same bottom-up factors, suggesting a potentially greater contribution of top-down factors in Returning. Overall, these results (a) suggest the importance of understanding the cognitive process of transitioning attention for understanding sustained attention and its development, (b) provide an empirical paradigm within which to study this process, and (c) begin to characterize basic features of this process, namely its development and its relative dependence on top-down and bottom-up influences on attention.
- 1 September 2020
- Published by Springer Nature in Neural Computing and Applications
- Vol. 33 (8) , 3825-3840
HINDIA: a deep-learning-based model for spell-checking of Hindi language
- 1 September 2020
- Published by Springer Nature in Neural Computing and Applications
- Vol. 33 (8) , 3825-3840
HINDIA: a deep-learning-based model for spell-checking of Hindi language
- 2 January 2020
- Published by Springer Nature in Behavior Research Methods
- Vol. 52 (3) , 1225-1243
A hidden Markov model for analyzing eye-tracking of moving objects
Eye-tracking provides an opportunity to generate and analyze high-density data relevant to understanding cognition. However, while events in the real world
- 2 January 2020
- Published by Springer Nature in Behavior Research Methods
- Vol. 52 (3) , 1225-1243
A hidden Markov model for analyzing eye-tracking of moving objects
Eye-tracking provides an opportunity to generate and analyze high-density data relevant to understanding cognition. However, while events in the real world
- 14 November 2019
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 53 (6) , 4051-4092
Systematic review of spell-checkers for highly inflectional languages
- 14 November 2019
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 53 (6) , 4051-4092
Systematic review of spell-checkers for highly inflectional languages
- Open Access
- 9 June 2019
- Published by Center for Open Science in PsyArXiv
A Hidden Markov Model for Analyzing Eye-Tracking of Moving Objects
Eye-tracking provides an opportunity to generate and analyze high-density data relevant to understanding cognition. However, while events in the real world are often dynamic, eye-tracking paradigms are typically limited to assessing gaze toward static objects. In this study, we propose a generative framework, based on a hidden Markov model (HMM), for using eye-tracking data to analyze behavior in the context of multiple moving objects of interest. We apply this framework to analyze data from a recent visual object tracking task paradigm, TrackIt, for studying selective sustained attention in children. Within this paradigm, we present two validation experiments to show that the HMM provides a viable approach to studying eye-tracking data with moving stimuli, and to illustrate the benefits of the HMM approach over some more naive possible approaches. The first experiment utilizes a novel `supervised' variant of TrackIt, while the second compares directly with judgments made by human coders using data from the original TrackIt task. Our results suggest that the HMM-based method provides a robust analysis of eye-tracking data with moving stimuli, both for adults and for children as young as 3.5-6 years old.
- 9 June 2019
- Published by Center for Open Science in PsyArXiv
Open AccessA Hidden Markov Model for Analyzing Eye-Tracking of Moving Objects
Eye-tracking provides an opportunity to generate and analyze high-density data relevant to understanding cognition. However, while events in the real world are often dynamic, eye-tracking paradigms are typically limited to assessing gaze toward static objects. In this study, we propose a generative framework, based on a hidden Markov model (HMM), for using eye-tracking data to analyze behavior in the context of multiple moving objects of interest. We apply this framework to analyze data from a recent visual object tracking task paradigm, TrackIt, for studying selective sustained attention in children. Within this paradigm, we present two validation experiments to show that the HMM provides a viable approach to studying eye-tracking data with moving stimuli, and to illustrate the benefits of the HMM approach over some more naive possible approaches. The first experiment utilizes a novel `supervised' variant of TrackIt, while the second compares directly with judgments made by human coders using data from the original TrackIt task. Our results suggest that the HMM-based method provides a robust analysis of eye-tracking data with moving stimuli, both for adults and for children as young as 3.5-6 years old.
- Open Access
- 30 May 2019
- Published by Center for Open Science in PsyArXiv
A Hidden Markov Model for Analyzing Eye-Tracking of Moving Objects
Eye-tracking provides an opportunity to generate and analyze high-density data relevant to understanding cognition. However, while events in the real world are often dynamic, eye-tracking paradigms are typically limited to assessing gaze toward static objects. In this study, we propose a generative framework, based on a hidden Markov model (HMM), for using eye-tracking data to analyze behavior in the context of multiple moving objects of interest. We apply this framework to analyze data from a recent visual object tracking task paradigm, TrackIt, for studying selective sustained attention in children. Within this paradigm, we present two validation experiments to show that the HMM provides a viable approach to studying eye-tracking data with moving stimuli, and to illustrate the benefits of the HMM approach over some more naive possible approaches. The first experiment utilizes a novel `supervised' variant of TrackIt, while the second compares directly with judgments made by human coders using data from the original TrackIt task. Our results suggest that the HMM-based method provides a robust analysis of eye-tracking data with moving stimuli, both for adults and for children as young as 3.5-6 years old.
- 30 May 2019
- Published by Center for Open Science in PsyArXiv
Open AccessA Hidden Markov Model for Analyzing Eye-Tracking of Moving Objects
Eye-tracking provides an opportunity to generate and analyze high-density data relevant to understanding cognition. However, while events in the real world are often dynamic, eye-tracking paradigms are typically limited to assessing gaze toward static objects. In this study, we propose a generative framework, based on a hidden Markov model (HMM), for using eye-tracking data to analyze behavior in the context of multiple moving objects of interest. We apply this framework to analyze data from a recent visual object tracking task paradigm, TrackIt, for studying selective sustained attention in children. Within this paradigm, we present two validation experiments to show that the HMM provides a viable approach to studying eye-tracking data with moving stimuli, and to illustrate the benefits of the HMM approach over some more naive possible approaches. The first experiment utilizes a novel `supervised' variant of TrackIt, while the second compares directly with judgments made by human coders using data from the original TrackIt task. Our results suggest that the HMM-based method provides a robust analysis of eye-tracking data with moving stimuli, both for adults and for children as young as 3.5-6 years old.
- 24 May 2019
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 116 (24) , 11770-11775
Adjustment in tumbling rates improves bacterial chemotaxis on obstacle-laden terrains
Significance: Bacterial chemotaxis is the process of bacterial migration in the direction of food and/or a chemoattractant and away from chemorepellents. Several models have been proposed for this process and these predict that their migration across obstacle-laden terrains would be slower when compared with terrains that do not contain obstacles. However, our experiments show that the presence of obstacles does not alter the average time it takes Escherichia coli cells to reach the food source. We show, both theoretically and experimentally, that a modified model that relies on adaptive movement following collisions with obstacles accurately explains this surprising result. These findings imply operational short-term memory of bacteria and motivate improved algorithms for self-autonomous robotic swarms.
- 24 May 2019
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 116 (24) , 11770-11775
Adjustment in tumbling rates improves bacterial chemotaxis on obstacle-laden terrains
Significance: Bacterial chemotaxis is the process of bacterial migration in the direction of food and/or a chemoattractant and away from chemorepellents. Several models have been proposed for this process and these predict that their migration across obstacle-laden terrains would be slower when compared with terrains that do not contain obstacles. However, our experiments show that the presence of obstacles does not alter the average time it takes Escherichia coli cells to reach the food source. We show, both theoretically and experimentally, that a modified model that relies on adaptive movement following collisions with obstacles accurately explains this surprising result. These findings imply operational short-term memory of bacteria and motivate improved algorithms for self-autonomous robotic swarms.
- Open Access
Analysis of k-Nearest Neighbor Distances with Application to Entropy Estimation
Estimating entropy and mutual information consistently is important for many machine learning applications. The Kozachenko-Leonenko (KL) estimator (Kozachenko & Leonenko, 1987) is a widely used nonparametric estimator for the entropy of multivariate continuous random variables, as well as the basis of the mutual information estimator of Kraskov et al. (2004), perhaps the most widely used estimator of mutual information in this setting. Despite the practical importance of these estimators, major theoretical questions regarding their finite-sample behavior remain open. This paper proves finite-sample bounds on the bias and variance of the KL estimator, showing that it achieves the minimax convergence rate for certain classes of smooth functions. In proving these bounds, we analyze finite-sample behavior of k-nearest neighbors (k-NN) distance statistics (on which the KL estimator is based). We derive concentration inequalities for k-NN distances and a general expectation bound for statistics of k-NN distances, which may be useful for other analyses of k-NN methods.
Open AccessAnalysis of k-Nearest Neighbor Distances with Application to Entropy Estimation
Estimating entropy and mutual information consistently is important for many machine learning applications. The Kozachenko-Leonenko (KL) estimator (Kozachenko & Leonenko, 1987) is a widely used nonparametric estimator for the entropy of multivariate continuous random variables, as well as the basis of the mutual information estimator of Kraskov et al. (2004), perhaps the most widely used estimator of mutual information in this setting. Despite the practical importance of these estimators, major theoretical questions regarding their finite-sample behavior remain open. This paper proves finite-sample bounds on the bias and variance of the KL estimator, showing that it achieves the minimax convergence rate for certain classes of smooth functions. In proving these bounds, we analyze finite-sample behavior of k-nearest neighbors (k-NN) distance statistics (on which the KL estimator is based). We derive concentration inequalities for k-NN distances and a general expectation bound for statistics of k-NN distances, which may be useful for other analyses of k-NN methods.