Kleinberg featured in one-hour interview in Software Engineering Daily

Software Engineering Daily featured a one-hour interview with Jon Kleinberg about his work analyzing the Facebook network: http://softwareengineeringdaily.com/2016/09/06/facebook-relationship-algorithms-with-jon-kleinbergSoftware Engineering Daily is a podcast featuring technical topics with roughly 15,000 regular listeners. 

From the description of the interview: 
"Jon Kleinberg studied Facebook network structures together with Head of Facebook Newsfeed Lars Backstrom ’04, MS’08, PhD’09, creating a paper called "Romantic Partnerships and the Dispersion of Social Ties: A Network Analysis of Relationship Status on Facebook.” The goal of this study was to find a metric that could help rank the strength of relationships on Facebook, and the results have implications for sociology as well as the way that we think about building social networks."

Date Posted: 9/23/2016

Cardie invited as keynote speaker to WDSM 2017

WSDM (pronounced “wisdom”) 2017 is the 10th ACM International Conference on Web Search and Data Mining and is one of the premier conferences that features such web-inspired research. Claire Cardie will be a keynote speaker at the conference early next year in Cambridge, UK.

Date Posted: 9/23/2016

Emin Gun Sirer quoted in Washington Post on mining of bitcoin in China

Emin Gün Sirer has been quoted in a Washington Post article on the “mining” of the online currency bitcoin in China. He says in the September 12 article: “Some people in the Western world were painting Chinese miners with too broad a brush. It’s not the case that all Chinese miners are part of the same enterprise or are colluding…They would not be able to usurp funds, but they could stop the motion of funds.”

Additional press on this topic in CryptoCoinsNews.

Other recent bitcoin press coverage for Sirer:
Houston Chronicle

Date Posted: 9/23/2016

Thorsten grad students Shuo Chen and Tobias Schnabel receive awards at ACM Conferences

Kudos to grad student Shuo Chen, who received the 2016 KDD Best Student Research Paper Award – Runner Up at the ACM Conference for Knowledge Discovery and Data Mining. Chen is advised by CS Professor Thorsten Joachims. The paper describes a new learning method for representing pairwise preferences, even when these preferences are intransitive and when they depend on context. For example, the method can model that a user may prefer restaurant A over restaurant B for lunch, but that the preference is the other way around for a romantic dinner.

In addition, Joachims’ grad student Tobias Schnabel won the ICTIR Best Presentation Award for his talk at the ACM Conference on the Theory of Information Retrieval. He presented a paper, co-authored by Adith Swaminathan, Peter Frazier, and Thorsten Joachims, on a sampling-based method for comparing the quality of search engines and other AI systems. Unlike the conventional TREC evaluation methodology, the new method is unbiased and requires substantially fewer human relevance judgments to give reliable results.

Date Posted: 9/21/2016

Bracy wins ACSU Faculty of the Year Award

The Association of Computer Science Undergraduates (ACSU) is Cornell's chapter of the Association for Computing Machinery which “promotes educational, professional, and social interaction among students interested in computer science and facilitates student communication with faculty, alumni, and corporate representatives.” Anne Bracy has been awarded the 2015-2016 Faculty of the Year title for her excellence as a senior lecturer in computer science.

Date Posted: 9/21/2016

Selman and Halpern co-found new Center for Human-Compatible AI; Selman quoted on hell and handbaskets

Bart Selman and Joe Halpern are co-PIs on a new multi-university Center for Human-Compatible Artificial Intelligence, led by Stuart Russell of Berkeley and also including the University of Michigan. 

Selman was quoted by Inverse "about the Center, A.I.s that we should fear, and why the world probably isn’t headed to hell in a handbasket — yet."  When asked, "Is there anything else I should know about the Center, or about malevolent A.I. in general?" Selman replied, "It’s important to give the positive side. It’s easy to emphasize the risks — and, of course, that’s partly why these centers are established — but it’s also important to point out that a lot of researchers feel that this risk is manageable, and that the upsides will be tremendous."

See also: Open Philanthropy press release

Image: BRETT robot ties knot after seeing demonstation
Source: Berkeley News

Date Posted: 9/07/2016

Kleinberg quoted in Communications of the ACM article, "After 25 Years, a New Web"

Jon Kleinberg was quoted in a Communications of the ACM article on proposals by Brewster Kahle, Tim Berners-Lee, and others to re-architect some of the fundamental aspects of the Web. As the article writes, "The goals are to offer reliability, integrity, and privacy not easily obtained today, and to preserve a complete and accurate archive of all Web activity." 

From the article: 
Jon Kleinberg, a computer science professor at Cornell University who specializes in large-scale social and information networks, applauds these notions for ensuring the integrity and stability of Web content. "A lot of the technologies [Kahle] talks about are cryptographic at their heart," he says. "When I read something, I want to be confident of its authorship, and I want to read things without worrying that other people are monitoring what I'm reading." Yet Kleinberg warns of difficulties in achieving these goals. "The Web is a huge system; what sorts of systems at Web scale can realistically be built? It's hard to tell exactly what is going to be technologically feasible." 

Full article found here.

Date Posted: 9/07/2016

Paper by Luca, Kleinberg, and Mullainathan in Harvard Business Review's Best of 2017

An article by Mike Luca, Jon Kleinberg, and Sendhil Mullainathan -- "Algorithms Need Managers, Too" -- was selected by Harvard Business Review for its end-of-year highlights volume "HBR's 10 Must Reads 2017: The Definitive Management Ideas of the Year from Harvard Business Review." The volume consolidates "a year's worth of management wisdom, all in one place. [Harvard Business Review has] reviewed the ideas, insights, and best practices from the past year to keep you up-to-date on the most cutting-edge, influential thinking driving business today."

The article argues that many of the challenges that firms and organizations encounter in using algorithms arise from misunderstandings of where algorithms work well and where they don't, leading to difficulties in managing them effectively.

Date Posted: 9/06/2016

Foster, Kleinberg, and Kozen receive AiTF Grant from NSF

Nate Foster, Bobby Kleinberg, and Dexter Kozen received a grant from the National Science Foundation's Algorithms in the Field (AiTF) program. The goal of their project is to develop new techniques for routing traffic in communication networks that optimize for congestion, latency, fault tolerance, and other objectives. They plan to explore approaches based on randomization that provide strong performance guarantees while remaining simple to implement, and to develop new programming languages for expressing and reasoning about probabilistic algorithms. The AiTF program was created to encourage closer collaboration between theoretical and applied researchers—something that is already quite common in Cornell Computer Science!

Date Posted: 9/02/2016


Archived News: