A New Algorithm Makes It Faster to Find the Shortest Paths

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
IEEE

Linear Convergent Distributed Nash Equilibrium Seeking With Compression

Abstract: Information compression techniques are majorly employed to reduce communication cost over peer-to-peer links. In this article, we investigate distributed Nash equilibrium (NE) seeking ...
IEEE

Causal Adjacency Learning for Spatiotemporal Prediction Over Graphs

Abstract: Spatiotemporal prediction over graphs (STPG) is crucial for transportation systems. In existing STPG models, an adjacency matrix is an important component that captures the relations among ...
C&EN

Evaluating Machine Learning Models for Molecular Property Prediction: Performance and Robustness on Out-of-Distribution Data

Department of Pharmaceutical Sciences, Division of Pharmaceutical Chemistry, Faculty of Life Sciences, University of Vienna, Josef-Holaubek-Platz 2, 1090 Vienna, Austria Christian Doppler Laboratory ...