We present the first approach for checking the internal validity of online experiments statically, that is, from code alone.
Emma Tosch, Eytan Bakshy, Emery D. Berger, David D. Jensen, J. Eliot B. Moss From Communications of the ACM | September 2021
"Optimal Auctions Through Deep Learning," by Paul Dütting et al., contributes a very interesting and forward-looking new take on the optimal multi-item mechanism...Constantinos Daskalakis From Communications of the ACM | August 2021
We overview recent research results that show how tools from deep learning are shaping up to become a powerful tool for the automated design of near-optimal auctions...Paul Dütting, Zhe Feng, Harikrishna Narasimhan, David C. Parkes, Sai S. Ravindranath From Communications of the ACM | August 2021
"Robustness Meets Algorithms," by Ilias Diakonikolas, et al., represents the beginning of a long and productive line of work on robust statistics in high dimensions...Jacob S. Steinhardt From Communications of the ACM | May 2021
We give the first efficient algorithm for estimating the parameters of a high-dimensional Gaussian that is able to tolerate a constant fraction of corruptions that...Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart From Communications of the ACM | May 2021
In "Isomorphism, Canonization, and Definability for Graphs of Bounded Rank Width," Grohe and Neuen show that the Weisfeiler-Leman algorithm in its plain form solves...Pascal Schweitzer From Communications of the ACM | May 2021
In this paper we study the graph isomorphism problem and the closely related graph canonization problem as well as logical definability and descriptive complexity...Martin Grohe, Daniel Neuen From Communications of the ACM | May 2021
"Understanding Deep Learning (Still) Requires Rethinking Generalization," Chiyuan Zhang, et al., brings a fundamental new theoretical challenge: Why don't today's...Sanjeev Arora From Communications of the ACM | March 2021
In this work, we presented a simple experimental framework for interrogating purported measures of generalization.
Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, Oriol Vinyals From Communications of the ACM | March 2021
The approach taken in "BioScript," by Jason Ott, et al., is an example of how programming languages can help develop executable protocols that are conforming, understandable...Nada Amin From Communications of the ACM | February 2021
This paper introduces BioScript, a domain-specific language for programmable biochemistry that executes on emerging microfluidic platforms.
Jason Ott, Tyson Loveless, Chris Curtis, Mohsen Lesani, Philip Brisk From Communications of the ACM | February 2021
"SkyCore," by Mehrdad Moradi, et al., addresses an exciting use case for Unmanned Aerial Vehicles in which UAVs can act as mobile base stations for the cellular...Richard Han From Communications of the ACM | January 2021
We argue for and propose an alternate, radical edge evolved packet core design, called SkyCore, that pushes the EPC functionality to the extreme edge of the core...Mehrdad Moradi, Karthikeyan Sundaresan, Eugene Chai, Sampath Rangarajan, Z. Morley Mao From Communications of the ACM | January 2021
What is the right leak oracle that can precisely capture the behavior of leaks in Web applications? "BLeak: Automatically Debugging Memory Leaks in Web Applications...Harry Xu From Communications of the ACM | November 2020
This paper introduces BLeak (Browser Leak debugger), the first system for automatically debugging memory leaks in web applications.
John Vilk, Emery D. Berger From Communications of the ACM | November 2020
"MadMax: Analyzing the Out-of-Gas World of Smart Contracts," by Neville Grech et al., effectively discovers a new smart contract vulnerability, and proposes a detection...Benjamin Livshits From Communications of the ACM | October 2020
We identify gas-focused vulnerabilities and present MadMax: a static program analysis technique that automatically detects gas-focused vulnerabilities with very...Neville Grech, Michael Kong, Anton Jurisevic, Lexi Brent, Bernhard Scholz, Yannis Smaragdakis From Communications of the ACM | October 2020
"Lower Bounds for External Memory Integer Sorting via Network Coding" proves a remarkable connection between how efficiently computers can perform sorting and transmitting...Paul Beame From Communications of the ACM | October 2020
In this paper, we present a tight conditional lower bound on the complexity of external memory sorting of integers.
Alireza Farhadi, Mohammad Taghi Hajiaghayi, Kasper Green Larsen, Elaine Shi From Communications of the ACM | October 2020