Communications of the ACM
Latest Research
From Communications of the ACM
Technical Perspective: Leveraging Social Context for Fake News Detection
In "FANG," the authors focus on a strategy of automatically detecting disinformation campaigns on online media with a new graph-based, contextual technique for...
From Communications of the ACM
FANG: Leveraging Social Context for Fake News Detection Using Graph Representation
We propose Factual News Graph (FANG), a novel graphical social context representation and learning framework for fake news detection.
From Communications of the ACM
Technical Perspective: How Do Experts Learn New Programming Languages?
"Here We Go Again: Why Is It Difficult for Developers to Learn Another Programming Language?" by Shrestha et al. provides insight into the difficulty of learning...
From Communications of the ACM
Here We Go Again: Why Is It Difficult for Developers to Learn Another Programming Language?
Our findings demonstrate that interference is a widespread phenomenon, forcing programmers to adopt suboptimal, opportunistic learning strategies.
From Communications of the ACM
Technical Perspective: Applying Design-Space Exploration to Quantum Architectures
"Toward Systematic Architectural Design of Near-Term Trapped Ion Quantum Computers" presents a study on scaling trapped-ion quantum architectures, and challenges...
From Communications of the ACM
Toward Systematic Architectural Design of Near-Term Trapped Ion Quantum Computers
Toward realizing QCCD-based trapped ion systems with 50-100 qubits, we perform an extensive application-driven architectural study evaluating the key design choices...
From Communications of the ACM
Technical Perspective: On Proofs, Entanglement, and Games
"MIP* = RE," by Zhengfeng Ji et al., studies quantum interactive proofs.
From Communications of the ACM
MIP* = RE
In this work, we study a fourth modification to the notion of efficient verification that originates in the study of quantum entanglement.
From Communications of the ACM
Technical Perspective: Finding the Sweet Spot Amid Accuracy and Performance
"Multi-Itinerary Optimization as Cloud Service," by Alexandru Cristian et al., makes accessible an end-to-end cloud service that produces traffic-aware, real-time...
From Communications of the ACM
Multi-Itinerary Optimization as Cloud Service
We describe multi-itinerary optimization, a novel Bing Maps service that automates the process of building itineraries for multiple agents while optimizing their...
From Communications of the ACM
Technical Perspective: Does Your Experiment Smell?
"PlanAlyzer," by Emma Tosch et al., details PlanAlyzer software, the first tool to statically check the validity of online experiments.
From Communications of the ACM
PlanAlyzer: Assessing Threats to the Validity of Online Experiments
We present the first approach for checking the internal validity of online experiments statically, that is, from code alone.
From Communications of the ACM
Technical Perspective: The Quest for Optimal Multi-Item Auctions
"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...
From Communications of the ACM
Optimal Auctions Through Deep Learning
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...
From Communications of the ACM
Technical Perspective: Robust Statistics Tackle New Problems
"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...
From Communications of the ACM
Robustness Meets Algorithms
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...
From Communications of the ACM
Technical Perspective: A Logical Step Toward the Graph Isomorphism Problem
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...
From Communications of the ACM
Isomorphism, Canonization, and Definability for Graphs of Bounded Rank Width
In this paper we study the graph isomorphism problem and the closely related graph canonization problem as well as logical definability and descriptive complexity...
From Communications of the ACM
Technical Perspective: Why Don't Today's Deep Nets Overfit to Their Training Data?
"Understanding Deep Learning (Still) Requires Rethinking Generalization," Chiyuan Zhang, et al., brings a fundamental new theoretical challenge: Why don't today's...
From Communications of the ACM