Category Archives: Lectures

ACSHF Forum Monday

Beth Veinott

One challenge affecting a variety of teams, such as software development, engineering, military, and crisis management, is overconfidence in the effectiveness of their plans.  Referred to as the planning fallacy, Buehler et al. (1994) suggests that ignoring past failures is a key cognitive element in this phenomenon. This talk summarizes recent experiments examinin the effect of counterfactual reasoning strategies, thinking about what might have happened under different circumstances, on people’s reasons, confidence and predictions.

Leveraging a collaborative, structured analytic technique called the Premortem, this project extends research on counterfactual reasoning to estimates in planning. The results will be discussed in the context of advances in machine learning, AI, and crowdsourcing that have changed the information available to teams.

Anna Little to Present Talk October 18, 1 p.m.

Anna Little

Dr. Anna Little, a postdoc in the Department of Computational Mathematics, Science, and Engineering at Michigan State University, will present her talk, “Robust Statistical Procedures for Clustering in High Dimensions,” on Friday, October 18, 2019, at 1:00 p.m., in Fisher Hall Room 327B.

Dr. Little completed a PhD in mathematics at Duke University in 2011. She has been at Michigan State since 2018.  Visit her website at

Lecture Abstract: This talk addresses multiple topics related to robust statistical procedures for clustering in high dimensions, including path-based spectral clustering (a new method), classical multidimensional scaling (an old method), and clustering in signal processing. Path-based spectral clustering is a novel approach which combines a data driven metric with graph-based clustering. Using a data driven metric allows for fast algorithms and strong theoretical guarantees when clusters concentrate around low-dimensional sets.

Another approach to high-dimensional clustering is classical multidimensional scaling (CMDS), a dimension reduction technique widely popular across disciplines due to its simplicity and generality. CMDS followed by a simple clustering algorithm can exactly recover all cluster labels with high probability when the signal to noise ratio is high enough. However, scaling conditions become increasingly restrictive as the ambient dimension increases, illustrating the need for robust unbiasing procedures in high dimensions.  Clustering in signal
processing is the final topic; in this context each data point corresponds to a corrupted signal. The classic multireference alignment problem is generalized to include random dilation in addition to random translation and additive noise, and a wavelet based approach is used to define an unbiased representation of the target signal(s) which is robust to high frequency perturbations.

Download the event flyer.