Distinguished Colloquium Series Speaker

Corey Sanders, CVP, Microsoft Cloud for Industry, will join us to share how Microsoft is building the infrastructure requirements for scaling AI and Large Language Model (LLM) services, with a specific focus on Azure, GPU sourcing and the architecture of OpenAI-specific data centers.

Corey will highlight the impact of advanced AI models, such as Github CoPilot, including the workings and quality of these tools and models with real-world examples of how advanced AI models are already transforming the software development landscape.

Bio: Corey Sanders is the Corporate Vice President for Microsoft Cloud for Industry, an organization dedicated to serving our customers with tailored industry solutions as they transform into successful digital businesses.  

Prior to this role, Corey led Microsoft Commercial Solution Areas, owning sales strategy and corporate technical sales across Solution Areas and Teams that include Digital Application Innovation, Azure Infrastructure & IoT, Azure Data & AI, Business Applications, Security, and Modern Workplace. His focus also included selling the full value of Microsoft cross-cloud solutions and advancing the technical depth of the Microsoft Solutions team.   

Earlier, Corey was Head of Product for Azure Compute and the founder of Microsoft Azure’s Infrastructure as a Service (IaaS) business. During that time, he was responsible for products, strategy and technical vision aligned to core Azure compute services. He also led program management for multiple Azure services. Earlier in his career, Corey was a developer in the Windows Serviceability team with ownership across the networking and kernel stack for Windows. 

In his first role at Microsoft in 2003, Corey served as an intern on the Windows team, after graduating from Princeton University, where he earned his Bachelor S.E. in Computer Science.  

Today, Corey resides with his family in New Jersey. 

---

To request accommodations for a disability please contact Emily Lawrence, emilyl@cs.princeton.edu, at least one week prior to the event.

I will present a unified perspective on the field of machine learning, following the structure of my recent book, "Probabilistic Machine Learning: Advanced Topics" which is centered on the "4 pillars of ML": predictions, decisions, discovery and generation. For each of these tasks, I will give a brief summary of some recent methods, including a few of my own contributions.

Bio: Kevin was born in Ireland, but grew up in England. He got his BA from U. Cambridge, his MEng from U. Pennsylvania, and his PhD from UC Berkeley. He then did a postdoc at MIT, and was an associate professor of computer science and statistics at the University of British Columbia in Vancouver, Canada, from 2004 to 2012. After getting tenure, he went to Google in California on his sabbatical and then ended up staying. He currently runs a team of 6 researchers inside of Google Brain; the team works on generative models, Bayesian inference, and various other topics. Kevin has published over 125 papers in refereed conferences and journals, as well 3 textbooks on machine learning published in 2012, 2022 and 2023 by MIT Press. (The 2012 book was awarded the DeGroot Prize for best book in the field of Statistical Science.) Kevin was also the (co) Editor-in-Chief of JMLR 2014--2017.

---

This talk will be live streamed here: https://mediacentrallive.princeton.edu/

To request accommodations for a disability please contact Emily Lawrence, emilyl@cs.princeton.edu, at least one week prior to the event.

From mobile and cloud apps to video games to driverless vehicle control, more and more software is time-constrained: it must deliver reliable results seamlessly, consistently, and virtually instantaneously. If it doesn't, customers are unhappy--and sometimes lives are put at risk. When complex software underperforms or fails, identifying the root causes is difficult and, historically, few tools have been available to help, leaving application developers to guess what might be happening. How can we do better?

The key is to have low-overhead observation tools that can show exactly where all the  elapsed time goes in both normal responses and in delayed responses. Doing so makes visible each of the seven possible reasons for such delays, as we show.

Bio: Richard L. Sites wrote his first computer program in 1959 and has spent most of his career at the boundary between hardware and software, with a particular interest in CPU/software performance interactions. His past work includes VAX microcode, DEC Alpha co-architect, and inventing the performance counters found in nearly all processors today. He has done low-overhead microcode and software tracing at DEC, Adobe, Google, and Tesla. Dr. Sites earned his PhD at Stanford in 1974; he holds 66 patents and is a member of the US National Academy of Engineering.

---

To request accommodations for a disability, please contact Emily Lawrence at emilyl@cs.princeton.edu at least one week prior to the event.

This talk will be recorded and live streamed on Princeton University Media Central.  See link here.

A major challenge in using computer graphics for movies and games is to create a rendering system that can create realistic pictures of a virtual world. The system must handle the variety and complexity of the shapes, materials, and lighting that combine to create what we see every day. The images must also be free of artifacts, emulate cameras to create depth of field and motion blur, and compose seamlessly with photographs of live action.

Pixar's RenderMan was created for this purpose, and has been widely used in feature film production. A key innovation in the system is to use a shading language to procedurally describe appearance. Shading languages were subsequently extended to run in real-time on graphics processing units (GPUs), and now shading languages are widely used in game engines. The final step was the realization that the GPU is a data-parallel computer, and the the shading language could be extended into a general-purpose data-parallel programming language. This enabled a wide variety of applications in high performance computing, such as physical simulation and machine learning, to be run on GPUs. Nowadays, GPUs are the fastest computers in the world. This talk will review the history of shading languages and GPUs, and discuss the broader implications for computing.

Bio: Pat Hanrahan is the Canon Professor of Computer Science and Electrical Engineering in the Computer Graphics Laboratory at Stanford University. His research focuses on rendering algorithms, graphics systems, and visualization.

Hanrahan received a Ph.D. in biophysics from the University of Wisconsin-Madison in 1985. As a founding employee at Pixar Animation Studios in the 1980s, Hanrahan led the design of the RenderMan Interface Specification and the RenderMan Shading Language. In 1989, he joined the faculty of Princeton University. In 1995, he moved to Stanford University. More recently, Hanrahan served as a co-founder and CTO of Tableau Software.  He has received three Academy Awards for Science and Technology, the SIGGRAPH Computer Graphics Achievement Award, the SIGGRAPH Stephen A. Coons Award, and the IEEE Visualization Career Award. He is a member of the National Academy of Engineering and the American Academy of Arts and Sciences. In 2019, he received the ACM A. M. Turing Award.

---

To request accommodations for a disability, please contact Emily Lawrence at emilyl@cs.princeton.edu at least one week prior to the event.

This talk will be recorded and live streamed on Princeton University Media Central.  See link here.

Recording available here

---

The recent demonstration of quantum supremacy by Google is a first step towards the era of small to medium scale quantum computers. In this talk I will explain what the experiment accomplished and the theoretical work it is based on, as well as what it did not accomplish and the many theoretical and practical challenges that remain. I will also describe recent breakthroughs in the design of protocols for the testing and benchmarking of quantum computers, a task that has deep computational and philosophical implications. Specifically, this leads to protocols for scalable and verifiable quantum supremacy, certifiable quantum random generation and verification of quantum computation.

Bio:
Umesh Vazirani is Strauch Distinguished Professor of Computer Science at UC Berkeley, and Director of the Berkeley Quantum Computing Center (BQIC). His 1993 paper with Ethan Bernstein laid the foundations of quantum complexity theory, and his research has touched on many facets of quantum computation, including Quantum Algorithms, Quantum Hamiltonian Complexity and Interactive classical testing of quantum devices. Vazirani is co-inventor of the Bid Scaling algorithm for the AdWords auction which is widely used by Internet search companies, and co-winner of the Fulkerson Prize for the ARV graph partitioning algorithm. He is member of the NAS, and co-author of two books: An Introduction to Computational Learning Theory (MIT Press) and Algorithms (McGraw-Hill).

To request accommodations for a disability please contact Emily Lawrence, emilyl@cs.princeton.edu, at least one week prior to the event.

Click here for recording 

---

Algorithms are increasingly used to aid decision-making in high-stakes settings including employment, lending, healthcare, and the legal system. This development has led to an ecosystem of growing complexity in which algorithms and people interact around consequential decisions, often mediated by organizations and firms that may be in competition with one another.

We consider two related sets of issues that arise in this setting. First, concerns have been raised about the effects of algorithmic monoculture, in which multiple decision-makers all rely on the same algorithm. In a set of models drawing on minimal assumptions, we show that when competing decision-makers converge on the use of the same algorithm as part of a decision pipeline, the result can potentially be harmful for social welfare even when the algorithm is more accurate than any decision-maker acting on their own. Second, we consider some of the canonical ways in which data is simplified over the course of these decision-making pipelines, showing how this process of simplification can introduce sources of bias in ways that connect to principles from the psychology of stereotype formation.

The talk will be based on joint work with Sendhil Mullainathan and Manish Raghavan.

Bio:
Jon Kleinberg is the Tisch University Professor in the Departments of Computer Science and Information Science at Cornell University. His research focuses on the interaction of algorithms and networks, the roles they play in large-scale social and information systems, and their broader societal implications. He is a member of the National Academy of Sciences and the National Academy of Engineering, and the recipient of MacArthur, Packard, Simons, Sloan, and Vannevar Bush research fellowships, as well awards including the Harvey Prize, the Nevanlinna Prize, and the ACM Prize in Computing.

---

To request accommodations for a disability please contact Emily Lawrence, emilyl@cs.princeton.edu, at least one week prior to the event.

Watch the recording here

---

How does the brain beget the mind?  How do molecules, cells and synapses effect reasoning, intelligence, language?   Despite dazzling progress in experimental neuroscience, as well as in cognitive science at the other extreme of scale, we do not seem to be making progress in the overarching question -- the gap is huge and a completely new approach seems to be required.  As Richard Axel recently put it:  "We don't have a logic for the transformation of neural activity into thought [...]."  

What kind of formal system would qualify as this "logic"? 

I will introduce the Assembly Calculus, a computational system whose basic data structure is the assembly -- assemblies are large populations of neurons representing concepts, words, ideas, episodes, etc.,

The Assembly Calculus is biologically plausible in the following two orthogonal senses: Its primitives are properties of assemblies observed in experiments or useful for explaining experiments, and can be provably (through both mathematical proof and simulations) "compiled down" to the activity of neurons and synapses.  I will also explain why the Assembly Calculus is especially powerful in exploring how language happens in the brain.

Bio: Christos Harilaos Papadimitriou is the Donovan Family Professor of Computer Science at Columbia University.  Before joining Columbia in 2017, he was a professor at UC Berkeley for the previous 22 years, and before that he taught at Harvard, MIT, NTU Athens, Stanford, and UCSD.  He has written five textbooks and many articles on algorithms and complexity, and their applications to optimization, databases, control, AI, robotics, economics and game theory, the Internet, evolution, and the brain.  He holds a PhD from Princeton (1976), and eight honorary doctorates, including from ETH, University of Athens, EPFL, and Univ. de Paris Dauphine.  He is a member of the National Academy of Sciences of the US, the American Academy of Arts and Sciences, and the National Academy of Engineering, and he has received the Knuth prize, the Go"del prize, the von Neumann medal, as well as the 2018 Harvey Prize by Technion.  In 2015 the president of the Hellenic republic named him commander of the order of the Phoenix.  He has also written three novels: “Turing ,” “Logicomix”  and his latest “Independence.”

---

This talk will be recorded.  To request accommodations for a disability please contact Emily Lawrence, emilyl@cs.princeton.edu, at least one week prior to the event.

*This talk is open only to Princeton University faculty, staff, and students. 
Please register for this webinar here.

---

In this lecture, I show how considering the intersection of collaborative and social scenarios with other domains of computing can reveal end-user needs and result in innovative technical systems. I give examples of this approach from my work in gesture interaction, information retrieval, and accessibility, focusing particularly on the topics of creating more efficient and expressive augmentative and alternative communication technologies and of making social media more accessible to screen reader users. I close by identifying future opportunities for creating inclusive collaborative and social technologies.

Bio:
Meredith Ringel Morris is a Sr. Principal Researcher at Microsoft Research and Research Area Manager for Interaction, Accessibility, and Mixed Reality. She founded Microsoft Research’s Ability research group and is a member of the lab’s Leadership Team. She is also an Affiliate Professor at the University of Washington in the Allen School of Computer Science & Engineering and in The Information School. Dr. Morris is an expert in Human-Computer Interaction; in 2020, she was inducted into the ACM SIGCHI Academy in recognition of her research in collaborative and social computing. Her research on collaboration and social technologies has contributed new systems, methods, and insights to diverse areas of computing including gesture interaction, information retrieval, and accessibility. Dr. Morris earned her Sc.B. in Computer Science from Brown University and her M.S. and Ph.D. in Computer Science from Stanford University.

---

To request accommodations for a disability please contact Emily Lawrence, emilyl@cs.princeton.edu at least one week prior to the event.

The internal design of software—how the code is structured—is powered by familiar abstractions (such as abstract types, classes and modules). But the external design—how the software actually behaves—is usually viewed informally, without the guidance of robust abstractions.

For the last few years, I have been exploring a new abstraction that can shape how we think about software applications and systems, and that provides a way to organize behaviors, encapsulate reusable ideas, and evaluate designs.

In this talk, I’ll define this abstraction and show how it can be used to explain a variety of flaws in familiar applications. I’ll also present some general principles that attempt to capture some key aspects of good software design.

Bio: Daniel Jackson is a professor of computer science and MacVicar teaching fellow at MIT, and associate director of the Computer Science and Artificial Intelligence Laboratory. His research has focused primarily on software modeling and design, most notably the Alloy modeling language. He is also a photographer whose most recent project brings to light the experiences of those with depression and other mental health issues (http://portraitsofresilience.com).

Lunch for talk attendees will be available at 12:00pm. 
To request accommodations for a disability, please contact Emily Lawrence, emilyl@cs.princeton.edu, 609-258-4624 at least one week prior to the event.

Just as you wouldn't want to be in a car without seat belts, even if it's a self-driving car, you probably don't want your Self-Driving Network (SelfDN) to rely completely on control-theory or ML, no matter how sophisticated or formally verified.   While autonomous systems promise to solve many problems that afflict networks, just as they promise to solve many problems that afflict our roadways, they are not immune from a multitude of practical problems and unexpected consequences. At Google, we have been moving towards highly-automated networking, and along the way we have learned a lot about the risks involved, and how to build robust networks in spite of the wonders of automation.  I will talk about some of the problems that are likely to afflict SelfDNs as they enter the real world.

Bio:
Jeff Mogul works on fast, cheap, reliable, and flexible networking infrastructure for Google. Until 2013, he was a Fellow at HP Labs, doing research primarily on computer networks and operating systems issues for enterprise and cloud computer systems; previously, he worked at the DEC/Compaq Western Research Lab. He received his PhD from Stanford in 1986, an MS from Stanford in 1980, and an SB from MIT in 1979. He is an ACM Fellow. Jeff is the author or co-author of several Internet Standards; he contributed extensively to the HTTP/1.1 specification. He was an associate editor of Internetworking: Research and Experience, and has been the chair or co-chair of a variety of conferences and workshops, including SIGCOMM, OSDI, NSDI, USENIX, HotOS, and ANCS.

Lunch for talk attendees will be available at 12:00pm. 
To request accommodations for a disability, please contact Emily Lawrence, emilyl@cs.princeton.edu, 609-258-4624 at least one week prior to the event.