The Natural Language Processing Reading Group at Stony Brook University meets weekly to discuss recent research papers in NLP and related fields.
Join the Google Group here.

Title: Mechanistic Interpretability, Verbalizable Representations Form a Global Workspace in Language Models

Abstract, Mechanistic Interpretability: The rise of the term mechanistic interpretability has accompanied increasing interest in understanding neural models -- particularly language models. However, this jargon has also led to a fair amount of confusion. So, what does it mean to be mechanistic? We describe four uses of the term in interpretability research. The most narrow technical definition requires a claim of causality, while a broader technical definition allows for any exploration of a model's internals. However, the term also has a narrow cultural definition describing a cultural movement. To understand this semantic drift, we present a history of the NLP interpretability community and the formation of the separate, parallel mechanistic interpretability community. Finally, we discuss the broad cultural definition -- encompassing the entire field of interpretability -- and why the traditional NLP interpretability community has come to embrace it. We argue that the polysemy of mechanistic is the product of a critical divide within the interpretability community.

Abstract, Verbalizable Representations Form a Global Workspace in Language Models: If the mind is an ocean, we spend our lives floating at the surface. Beneath us, an enormous amount of processing takes place without our knowledge: our visual systems parsing the contours of a face, our motor circuits maintaining our posture. At any given moment, only a small fraction of this neural activity is accessible to us. Yet it is this privileged sliver of activity that we rely on to reason deliberately: to plan what ingredients to buy for a recipe, or to puzzle out why an engine won't start. Such thoughts can be articulated out loud, deliberately held in mind, and brought to bear on whatever task the moment demands. This distinction, between our accessible thoughts and our unconscious processing, is perhaps the most striking feature of human cognition.
In this paper, we present evidence that an analogous functional distinction has emerged in modern AI models. Specifically, we observe that language models maintain a privileged set of internal representations, available for report, modulation, and flexible internal reasoning, atop a much larger volume of automatic processing. We identify these representations using a new interpretability technique, which surfaces the concepts a model is poised to verbalize at any point in its processing. Measuring and intervening on these representations provides us a window into a model's thought processes, uncovering internal reasoning and reactions that do not appear in its output.

Location: NCS 220

Zoom Link: https://stonybrook.zoom.us/j/92942833294?pwd=ysKMaQx7Hp0lkq5nOb3zJ9ivNZVvLv.1&jst=2

Abstract: How do humans learn the sound patterns of their language? Despite a variety of methods and advances in phonotactic learning, there is still a paucity of computational research, methods and data for languages with tones. In this talk, I will explore this question specifically in light of tone languages, where pitch plays a crucial role in distinguishing words' meaning. I provide an implementation of the Bottom-Up Factor Inference Algorithm over Autosegmental Representations (BUFIA-AR), which learns the rules governing possible tone patterns. Using a dataset of Hausa, a West African tone language, the algorithm successfully identifies patterns that are not permitted in the language. These results (i) confirm long-standing linguistic generalizations, (ii) make more specific predictions about exceptional cases, and (iii) reveal previously unnoticed patterns. The results show how mathematical models of sound structure can be brought into dialogue with both linguistic theory and computational learning, highlighting the broader potential of formal approaches to capture human linguistic knowledge.

Bio: Han Li is a fifth-year Ph.D. student in Linguistics department, specializing in computational linguistics under the supervision of Professor Jeff Heinz. Her research focuses on how sound patterns in language can be formally represented and computationally learned, bridging theoretical linguistics and computer science.

Location: Institute for Advanced Computational Science, Seminar Room

Zoom Meeting: https://stonybrook.zoom.us/j/94043459206?pwd=3ra47h8HghOFRfobRBjZaDMyTwialr.1
Meeting ID: 940 4345 9206
Passcode: 332717

Join the Conversation: Share Your Thoughts about Learning, Academics, and AI

The world of college is changing fast, and Artificial Intelligence (AI) is at the center of it. We are part of the Institute on AI, Pedagogy, and the Curriculum with AAC&U, and we need to hear from the people AI affects most: you!

This is an open discussion for all students to share their honest experiences, their top concerns, and their best ideas about AI in our academic environment. We'll be diving into these key questions:
  • How can AI actually make learning better or easier? What opportunities do you see for using AI tools to enhance your assignments, research, or skills?
  • What are your biggest worries about AI? Is it about cheating, being graded fairly, or preparing for the job market? How is AI impacting your workload or stress levels?
  • What specific tools, workshops, or policies would help you use AI responsibly and successfully? (Think training, software, or clear rules.)
Date: Monday, December 1st
Time: 12:30pm-1:45pm
Location: West Campus - Location TBD
or
Date: Wednesday, December 3rd
Time: 10:30am-11:45am
Location: East Campus - HSC 2-154B

Please register in advance so we can confirm the room.

Note: Videos will not be shared publicly and comments will only be shared in aggregate.

Your voice matters. Come tell us how AI is affecting your studies, your stress, and your success!
  • Dr. Rose Tirotta-Esposito (Assistant Provost; Director of CELT)
  • Dr. Elizabeth Hewitt (Associate Professor in the Department of Technology and Society (DTS) in the College of Engineering and Applied Sciences)
  • Chris Kretz (Associate Librarian and Head of Academic Engagement at SBU Libraries)
  • Prof. Rajiv Lajmi (Assistant Professor in the School of Health Professions and Chair of Applied Health Informatics)
  • Dr. Matthew Salzano (Assistant Professor in the Department of Communication in the School of Communication and Journalism)
Professor Nanpeng Yu from UC Riverside present Machine Learning and Big Data Analytics in Power Distribution Systems.

Abstract: The electric utility industry is being swamped by petabytes of data coming from various sources such as smart meters, phasor measurement units, SCADA systems, geographical information systems and customer management systems. The primary and secondary value embedded in the complex and heterogeneous data sets from power distribution systems is immense. However, algorithms and applications for unlocking the potential of big data in power systems are at an early stage of development. This talk discusses the recent advancement of machine learning algorithms and big data analytics methods in power distribution systems. In particular, we will explain how to develop hybrid algorithms, which synergistically combine the merits of state-of-the-art machine learning algorithms and physical model-based methods. We will take a deep dive into the following applications: network topology identification, electricity theft detection, estimation of behind-the-meter solar generation and data-driven distribution system controls.

Bio: Dr. Nanpeng Yu received his B.S. in Electrical Engineering from Tsinghua University, Beijing, China, in 2006. Dr. Yu received his M.S. degrees in Electrical Engineering and Economics and Ph.D. degree from Iowa State University in 2010. Before joining University of California, Riverside, Dr. Yu was a senior power system planner and project manager at Southern California Edison from Jan, 2011 to July 2014.

Currently, he is an Associate Professor in the Department of Electrical and Computer Engineering at the University of California, Riverside, CA. Dr. Yu is the recipient of the Regents Faculty Fellowship and Regents Faculty Development award from University of California. He received multiple best paper awards from IEEE Power and Energy Society General Meeting, IEEE Power and Energy Society Grand International Conference and Exposition Asia and the Second International Conference on Green Communications, Computing and Technologies.

Dr. Yu is the director of Smart City Innovation Laboratory at UC Riverside. He currently serves as the vice chair of the distribution system operation and planning subcommittee of IEEE Power and Energy Society and the co-chair for IEEE Big Data Applications in Power Distribution Networks Task Force. Dr. Yu currently serves as the associate editor for IEEE Transactions on Smart Grid and International Transactions on Electrical Energy Systems.
Abstract: Modern language agents often need to solve tasks requiring long-horizon, multi-turn interactions, where they retrieve external information, adapt to observations, and answer interdependent queries. Yet, most LLM systems rely on full-context prompting, appending all past turns regardless of their relevance. This leads to un-bounded memory growth, increased computational costs, and degraded reasoning performance on out-of-distribution input lengths due to LLM forgetting the context. We introduce MEM1, an end-to-end reinforcement learning framework that enables agents to operate with constant context size when solving long multi-turn tasks. At each turn, MEM1 updates a compact shared internal state that jointly supports memory consolidation and reasoning. Leveraging reinforcement learning (RL) and rollout trajectory truncation, we train a MEM1 agent to develop internal states that integrate prior memory with new observations from the environment while strategically discarding irrelevant or redundant information. Experiments across three domains, including internal retrieval QA, open-domain web QA, and multi-turn web shopping, show that MEM1-7B improves performance by 3.5x while reducing memory usage by 3.7x compared to Qwen2.5-14B-Instruct on an augmented multi-hop QA dataset with 16 objectives in each task, and generalizes beyond the training horizon. Our results demonstrate the promise of reasoning-driven memory consolidation as a scalable alternative to existing solutions for training long-horizon task-solving agents that involve multiple interactions, where both efficiency and performance are optimized.

Speaker: Yiyang Feng

Location: CS2311
Educational objectives:

1. Explain how AI represents a Cognitive Revolution in academic medicine, redefining thefundamental limits of human cognition and knowledge work.
2. Differentiate between superficial AI adoption (innovation theatre) and truetransformationthrough AI-native institutional design.
3. Analyze how AI fundamentally reshapes clinical, research, and educational work-from dataentry to verification, recall to recognition, and hypothesis generation to evaluation-andidentify implications for redesigning academic health systems.

Speaker: Jiajie Zhang, Ph.D.,Dean, Professor, and Glassell Family FoundationDistinguished Chair in Informatics Excellence,D. Bradley McWilliams School of BiomedicalInformatics, UTHealth Houston

Location: MART Building, Room: 7M-0602 (7th Floor)
CSE 600 Talk: Securing Software-Defined Networking Infrastructure by Dr. Guofei Gu

ABSTRACT: Today's network and computing infrastructure rests on inadequate  foundations. An emerging, promising new foundation for computing is software-defined infrastructure (SDI), which offers a range of  
technologies including: compute, storage and network virtualization;  novel separation of concerns at the systems level; and new approaches to system and device management. As a representative example of SDI,  
software-defined networking (SDN) is a new networking paradigm that decouples the control logic from the closed and proprietary implementations of traditional network data plane infrastructure. SDN is now becoming the networking foundation for data-center/cloud, future Internet and 5G infrastructures.  

We believe that SDN is an impactful technology to drive a variety of innovations in network management and security. It is now clear that security will be a top concern, as well as a new killer app, for SDN. In this talk, I will discuss some new opportunities, as well as challenges, in this new direction and demonstrate with our recent  
research results. I will discuss how SDN can enhance network security. And I will also discuss some unique new security problems inside SDN and introduce some of our work to enhance the security of SDN. Finally, I will share my vision on programmable system security in a software-defined world.  

BIO: Dr. Guofei Gu is a professor in the Department of Computer Science & Engineering at Texas A&M University (TAMU). Before coming to Texas A&M, he received his PhD degree in Computer Science from the College  
of Computing, Georgia Institute of Technology. His research interests are in network and systems security.  
Dr. Gu is a recipient of 2010 NSF CAREER Award, 2013 AFOSR Young  Investigator Award, 2010 IEEE S&P Best Student Paper Award, 2015 ICDCS Best Paper Award, Texas A&M Dean of Engineering Excellence Award,  
Presidential Impact Fellow, Charles H. Barclay Jr. '45 Faculty Fellow and the Google Faculty Research Award. He is an active member of the security research community and has pioneered several new research directions such as botnet detection/defense and SDN security. Dr. Gu has served on the program committees of top-tier security conferences such as IEEE S&P, ACM CCS, USENIX Security and NDSS. He is an ACM Distinguished Member, an Associate Editor for IEEE Transactions on Information Forensics and Security (T-IFS), and the Steering Committee co-chair for SecureComm. He is currently directing the SUCCESS Lab at TAMU.
DeepMath Conference on the Mathematical Theory of Deep Neural Networks Recent advances in deep neural networks (DNNs), combined with open, easily-accessible implementations, have made DNNs a powerful, versatile method used widely in both machine learning and neuroscience. These advances in practical results, however, have far outpaced a formal understanding of these networks and their training. The dearth of rigorous analysis for these techniques limits their usefulness in addressing scientific questions and, more broadly, hinders systematic design of the next generation of networks. Recently, long-past-due theoretical results have begun to emerge from researchers in a number of fields. The purpose of this conference is to give visibility to these results, and those that will follow in their wake, to shed light on the properties of large, adaptive, distributed learning architectures, and to revolutionize our understanding of these systems.​​​
Abstract: The capacity to adapt machine learning models to various contexts, information, and objectives is particularly valuable. In this thesis, I focus on developing Class Conditional Guided Models. These are models that can be adaptively biased towards a class of interest via a conditional input. My primary focus lies in the efficiency of these models. They are constructed to require training only once, with the ability to quickly and conveniently adapt during testing time without necessitating fine-tuning or retraining.
Firstly, I propose RelationVAE, a novel generative model designed for few-shot scenarios, utilizing the prior knowledge of class similarity relationships. RelationVAE is designed to condition on the embeddings of the neighbor classes (i.e. classes with similarity relationships), to generate more reliable samples by making them more similar to the neighbor class. This enables adaptation of the generative model to the provided prior knowledge about class relationships.
As a second focus, I introduce scGAN, a shadow segmentation technique that enables adaptation to varying shadow distributions in different testing environments. scGAN is designed to condition on a sensitivity parameter, a scalar, to control the amount of the shadow detected. In the testing phase, the parameter is set to appropriate values, allowing the model to quickly adapt to specific test environments.
In my third contribution, I propose S-SEG, a methodology for fine-grained counting allowing adaptation to different granularities of fine-grained classes. In fine-grained problems, the distinction between classes is subtle and inconsistent across images, leading to variations in the granularity of the target class from one image to another. S-SEG is designed to be conditioned on an additional input, the sensitivity parameter, to control the granularities of the target class during inference.
My fourth contribution is a text-to-image synthesis method which allows controlling the number of the generated objects of a target class. I propose to generate an intermediate condition, the density map, which reflects the number of objects, together with their layout. This intermediate condition is used to effectively guide the generative model to generate objects with accurate counts.

Speaker: Vu Nguyen

Zoom: https://stonybrook.zoom.us/j/97114455337?pwd=Z4rB9dWcstlahUIs8PRrvQ9b2ZK2Df.1
Meeting ID: 971 1445 5337
Passcode: 272300