Events
Past Event
WED@NICO WEBINAR: Tina Eliassi-Rad, Northeastern University
Northwestern Institute on Complex Systems (NICO)
12:00 PM
Details
Speaker:
Tina Eliassi-Rad, Professor, Khoury College of Computer Sciences, Northeastern University
Title:
Geometric and Topological Graph Analysis for Machine Learning
Abstract:
This talk has two parts: (1) geometric analysis for graph embedding and (2) topological analysis for graph distances. First, graph embedding seeks to build an accurate low-dimensional representation of a graph. This low-dimensional representation is then used for various downstream tasks such as link prediction. One popular approach is Laplacian Eigenmaps, which constructs a graph embedding based on the spectral properties of the Laplacian matrix of a graph. The intuition behind it, and many other embedding techniques, is that the embedding of a graph must respect node similarity: similar nodes must have embeddings that are close to one another. We dispose of this distance-minimization assumption. In its place, we use the Laplacian matrix to find an embedding with geometric properties (instead of spectral ones) by leveraging the simplex geometry of the graph. We introduce Geometric Laplacian Eigenmap Embedding (or GLEE for short) and demonstrate that it outperforms various other techniques (including Laplacian Eigenmaps) in the tasks of graph reconstruction and link prediction. This work is joint with Leo Torres and Kevin Chan, and was published in the Journal of Complex Networks in March 2020. Second, measuring graph distance is a fundamental task in graph mining. For graph distance, determining the structural dissimilarity between networks is an ill-defined problem, as there is no canonical way to compare two networks. Indeed, many of the existing approaches for network comparison differ in their heuristics, efficiency, interpretability, and theoretical soundness. Thus, having a notion of distance that is built on theoretically robust first principles and that is interpretable with respect to features ubiquitous in complex networks would allow for a meaningful comparison between different networks. We rely on the theory of the length spectrum function from algebraic topology, and its relationship to the non-backtracking cycles of a graph, in order to introduce the Non-Backtracking Spectral Distance (NBD) for measuring the distance between undirected, unweighted graphs. NBD is interpretable in terms of features of complex networks such as presence of hubs and triangles. We showcase the ability of NBD to discriminate between networks in both real and synthetic data sets. This work is joint with Leo Torres and Pablo Suarez-Serrato, and was published in the Journal of Applied Network Science in June 2019.
Speaker Bio:
Tina Eliassi-Rad is a Professor of Computer Science at Northeastern University in Boston, MA. She is also a core faculty member at Northeastern's Network Science Institute. Prior to joining Northeastern, Tina was an Associate Professor of Computer Science at Rutgers University; and before that she was a Member of Technical Staff and Principal Investigator at Lawrence Livermore National Laboratory. Tina earned her Ph.D. in Computer Sciences (with a minor in Mathematical Statistics) at the University of Wisconsin-Madison. Her research is at the intersection data mining, machine learning, and network science. She has over 100 peer-reviewed publications (including a few best paper and best paper runner-up awardees); and has given over 200 invited talks and 14 tutorials. Tina's work has been applied to personalized search on the World-Wide Web, statistical indices of large-scale scientific simulation data, fraud detection, mobile ad targeting, cyber situational awareness, and ethics in machine learning. Her algorithms have been incorporated into systems used by the government and industry (e.g., IBM System G Graph Analytics) as well as open-source software (e.g., Stanford Network Analysis Project). In 2017, Tina served as the program co-chair for the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (a.k.a. KDD, which is the premier conference on data mining) and as the program co-chair for the International Conference on Network Science (a.k.a. NetSci, which is the premier conference on network science). In 2020, she served as the program co-chair for the International Conference on Computational Social Science (a.k.a. IC2S2, which is the premier conference on computational social science). Tina received an Outstanding Mentor Award from the Office of Science at the US Department of Energy in 2010; became a Fellow of the ISI Foundation in Turin Italy in 2019; and was named one of the 100 Brilliant Women in AI Ethics for 2021.
Webinar:
Webinar link: https://northwestern.zoom.us/j/95878198317
Passcode: nico
ID: 958 7819 8317
About the Speaker Series:
Wednesdays@NICO is a vibrant weekly seminar series focusing broadly on the topics of complex systems and data science. It brings together attendees ranging from graduate students to senior faculty who span all of the schools across Northwestern, from applied math to sociology to biology and every discipline in-between. Please visit: https://bit.ly/WedatNICO for information on future speakers.
Time
Wednesday, February 3, 2021 at 12:00 PM - 1:00 PM
Contact
Calendar
Northwestern Institute on Complex Systems (NICO)
WED@NICO SEMINAR: Lightning Talks with NU Scholars!
Northwestern Institute on Complex Systems (NICO)
12:00 PM
//
Lower Level, Chambers Hall
Details
May 20th Speakers:
Yulin Yu, Postdoctoral Fellow, Kellogg School of Management
Feihong Xu, PhD Candidate, McCormick School of Engineering
Maalvika Bhat, PhD Student, School of Communication
Rochana Chaturvedi, Postdoctoral Fellow, Kellogg School of Management
NICO Lightning talks are open to Northwestern graduate students, postdoctoral fellows, and visiting scholars! If you are interested in signing up for a future session, please fill out this short survey.
Talk Titles and Abstracts:
Yulin Yu
Postdoctoral Fellow
Kellogg School of Management &
Northwestern Institute on Complex Systems
Human–AI Creative Pathways: How People and Machines Differ in Creative Strategy
Generative AI offers the promise of amplifying creativity by recombining knowledge at a scale far beyond human capacity, yet humans still hold key advantages in flexibility and contextual reasoning. To understand how each achieves novelty, we analyzed more than 5,000 responses to the Divergent Association Task from both humans and AI systems using network-based methods. We find that while individual humans use fewer and simpler conceptual categories than machines, the collective diversity of human ideas is substantially higher. Human creative pathways tend to follow a one-directional but highly unpredictable trajectory, whereas AI systems rely on repetitive, back-and-forth exploration patterns. Finally, both humans and machines show anchoring effects—early ideas shape later responses—but in opposite ways: humans anchor low, while machines anchor high.
Feihong Xu
PhD Candidate
Engineering Sciences & Applied Mathematics
McCormick School of Engineering
A Well-Calibrated Model Similarity Measure for Arbitrary Neural Networks
Deep learning approaches have transformed biological and biomedical image analysis, but model opacity and fragility remain major obstacles to trustworthy use. One barrier is the lack of a well-calibrated measure of similarity across arbitrary neural networks trained with different architectures, checkpoints, random initializations, and training strategies. Existing notions of model similarity span functional and representational domains, often rely on heuristic assumptions, and are susceptible to spurious signals introduced by probing samples, making principled cross-model meta-analysis difficult. Here, we clarify prevailing notions of deep neural network similarity and benchmark their robustness under extensive out-of-distribution perturbations. We then introduce the Ahmad RV coefficient on chain weight matrices (wARV), a theoretically grounded weight-space similarity measure that combines chain-normalized weights with the RV coefficient. wARV is sample-agnostic, symmetric, computationally efficient, and better calibrated than current measures. Across benchmarks varying random initialization, training checkpoint, architecture, and training strategy, wARV more faithfully tracks functional similarity while avoiding confounding effects from probing data. Applying wARV to deep neural network models on both generic and medical image classification tasks, we uncover substantial learning heterogeneity and instability even among models with similar predictive performance.
Maalvika Bhat
PhD Student
Technology and Social Behavior
School of Communication &
McCormick School of Engineering
Scholars See Clickbait as a Greater Threat to Science Than to Their Own Work
As scientific research competes for attention in a media landscape driven by sensationalism, the risks of misrepresentation grow. This study examines whether academics, while widely recognizing clickbait as a threat to science broadly, tend to downplay its relevance to their own work. Surveying 5,603 U.S.-based researchers, we find a consistent perception gap between systemic and personal risk, one that varies by career stage and disciplinary context. Early-career scholars show a pronounced version of this asymmetry: they express heightened concern about clickbait’s harms to science while rating its relevance to their own work as comparatively lower, a pattern that leaves them most exposed at a stage when reputational stakes are highest.
Rochana Chaturvedi
Postdoctoral Fellow
Kellogg School of Management &
Northwestern Institute on Complex Systems
Who Gets the Callback? Generative Artificial Intelligence and Gender Bias
Large language models are increasingly embedded in hiring workflows, raising concerns about their potential to amplify societal biases — yet how these biases manifest within and across occupations, and the role of model 'personality' in shaping these biases, remains unexplored. We introduce a three-part attribution framework applied to 332,044 real-world job ads, measuring gender-based callback bias, associations of skills and traits with gendered stereotypes in LLMs, and the effect of simulated recruiter personas. We find that LLMs systematically favor men, especially in higher-wage roles, with their decisions tracking traditional gendered language cues in job postings. Notably, assigning a low-agreeableness persona reduces model bias, implicating sycophancy as a mechanism reinforcing societal stereotypes; at the same time, controversial personas trigger internal guardrails leading to more cautious and less-biased outputs. These findings highlight how alignment choices in AI-driven hiring systems shape bias, with important implications for fairness and diversity.
Location:
In person: Chambers Hall, 600 Foster Street, Lower Level
Remote option: https://northwestern.zoom.us/j/98031689779
About the Speaker Series:
Wednesdays@NICO is a vibrant weekly seminar series focusing broadly on the topics of complex systems, networks, and artificial intelligence. It brings together attendees ranging from graduate students to senior faculty who span all of the schools across Northwestern, from applied math to sociology to biology and every discipline in-between. Please visit: https://bit.ly/WedatNICO for information on future speakers.
Time
Wednesday, May 20, 2026 at 12:00 PM - 1:00 PM
Location
Lower Level, Chambers Hall Map
Contact
Calendar
Northwestern Institute on Complex Systems (NICO)