Two Carnegie Mellon Professors Win Sloan Research Fellowships-CMU News - Carnegie Mellon University

Tuesday, February 23, 2016

Two Carnegie Mellon Professors Win Sloan Research Fellowships

By Jocelyn Duffy / 412-268-9982 / jhduffy@andrew.cmu.edu

Two Carnegie Mellon University faculty members have been awarded 2016 Sloan Research Fellowships. Computer scientist Abhinav Gupta and mathematician Wesley Pegden are among 126 early-career scientists and scholars from 52 colleges and universities in the U.S. and Canada who will receive $55,000 to further their research.

Sloan Fellows
Abhinav Gupta and Wesley Pegden

“Getting early-career support can be a make-or-break moment for a young scholar,” said Paul L. Joskow, president of the Alfred P. Sloan Foundation. “In an increasingly competitive academic environment, it can be difficult to stand out, even when your work is first rate. The Sloan Research Fellowships have become an unmistakable marker of quality among researchers. Fellows represent the best-of-the-best among young scientists.”

Gupta, an assistant professor of robotics, specializes in computer vision and large-scale visual learning. His research interests include developing methods for computers to gain a deep understanding of visual scenes, including how elements of the scene relate to each other physically and functionally. He also studies the role of language in visual learning and how people interact with their environments. Among the research projects he leads is the Never Ending Image Learner (NEIL), in which a computer program constantly searches the Web for images, doing its best to identify objects and characterize scenes on its own.

Pegden, an assistant professor in the Department of Mathematical Sciences, studies problems in combinatorics, including discrete geometry, probabilistic combinatorics and graph theory. Among other things, Pegden and colleagues have established a new paradigm for understanding the Abelian Sandpile Process from statistical mechanics, and have developed new perspective on the hardness of geometric cases of the Traveling Salesman Problem.