This paper aims to unify spatial dependency and temporal dependency in a non-Euclidean space while capturing the inner spatial-temporal dependencies for spatial-temporal graph data. For spatial-temporal attribute entities with topological structure, the space-time is consecutive and unified while each node's current status is influenced by its neighbors' past states over variant periods of each neighbor. Most spatial-temporal neural networks study spatial dependency and temporal correlation separately in processing, gravely impaired the space-time continuum, and ignore the fact that the neighbors' temporal dependency period for a node can be delayed and dynamic. To model this actual condition, we propose TraverseNet, a novel spatial-temporal graph neural network, viewing space and time as an inseparable whole, to mine spatial-temporal graphs while exploiting the evolving spatial-temporal dependencies for each node via message traverse mechanisms. Experiments with ablation and parameter studies have validated the effectiveness of the proposed TraverseNets, and the detailed implementation can be found from https://github.com/nnzhan/TraverseNet.

Background & Purpose: Chest X-Ray (CXR) use in pre-MRI safety screening for Lead-Less Implanted Electronic Devices (LLIEDs), easily overlooked or misidentified on a frontal view (often only acquired), is common. Although most LLIED types are "MRI conditional": 1. Some are stringently conditional; 2. Different conditional types have specific patient- or device- management requirements; and 3. Particular types are "MRI unsafe". This work focused on developing CXR interpretation-assisting Artificial Intelligence (AI) methodology with: 1. 100% detection for LLIED presence/location; and 2. High classification in LLIED typing. Materials & Methods: Data-mining (03/1993-02/2021) produced an AI Model Development Population (1,100 patients/4,871 images) creating 4,924 LLIED Region-Of-Interests (ROIs) (with image-quality grading) used in Training, Validation, and Testing. For developing the cascading neural network (detection via Faster R-CNN and classification via Inception V3), "ground-truth" CXR annotation (ROI labeling per LLIED), as well as inference display (as Generated Bounding Boxes (GBBs)), relied on a GPU-based graphical user interface. Results: To achieve 100% LLIED detection, probability threshold reduction to 0.00002 was required by Model 1, resulting in increasing GBBs per LLIED-related ROI. Targeting LLIED-type classification following detection of all LLIEDs, Model 2 multi-classified to reach high-performance while decreasing falsely positive GBBs. Despite 24% suboptimal ROI image quality, classification was correct in 98.9% and AUCs for the 9 LLIED-types were 1.00 for 8 and 0.92 for 1. For all misclassification cases: 1. None involved stringently conditional or unsafe LLIEDs; and 2. Most were attributable to suboptimal images. Conclusion: This project successfully developed a LLIED-related AI methodology supporting: 1. 100% detection; and 2. Typically 100% type classification.

Travel-time prediction constitutes a task of high importance in transportation networks, with web mapping services like Google Maps regularly serving vast quantities of travel time queries from users and enterprises alike. Further, such a task requires accounting for complex spatiotemporal interactions (modelling both the topological properties of the road network and anticipating events -- such as rush hours -- that may occur in the future). Hence, it is an ideal target for graph representation learning at scale. Here we present a graph neural network estimator for estimated time of arrival (ETA) which we have deployed in production at Google Maps. While our main architecture consists of standard GNN building blocks, we further detail the usage of training schedule methods such as MetaGradients in order to make our model robust and production-ready. We also provide prescriptive studies: ablating on various architectural decisions and training regimes, and qualitative analyses on real-world situations where our model provides a competitive edge. Our GNN proved powerful when deployed, significantly reducing negative ETA outcomes in several regions compared to the previous production baseline (40+% in cities like Sydney).

The integration of learning and reasoning is one of the key challenges in artificial intelligence and machine learning today, and various communities have been addressing it. That is especially true for the field of neural-symbolic computation (NeSy) [10, 21], where the goal is to integrate symbolic reasoning and neural networks. NeSy already has a long tradition, and it has recently attracted a lot of attention from various communities (cf. the keynotes of Y. Bengio and H. Kautz on this topic at AAAI 2020, the AI Debate [9] between Y. Bengio and G. Marcus). Another domain that has a rich tradition in integrating learning and reasoning is that of statistical relational learning and artificial intelligence (StarAI) [39, 85]. But rather than focusing on integrating logic and neural networks, it is centred around the question of integrating logic with probabilistic reasoning, more specifically probabilistic graphical models. Despite the common interest in combining symbolic reasoning with a basic paradigm for learning, i.e., probabilistic graphical models or neural networks, it is surprising that there are not more interactions between these two fields.

This paper unifies the design and simplifies the analysis of risk-averse Thompson sampling algorithms for the multi-armed bandit problem for a generic class of risk functionals \r{ho} that are continuous. Using the contraction principle in the theory of large deviations, we prove novel concentration bounds for these continuous risk functionals. In contrast to existing works in which the bounds depend on the samples themselves, our bounds only depend on the number of samples. This allows us to sidestep significant analytical challenges and unify existing proofs of the regret bounds of existing Thompson sampling-based algorithms. We show that a wide class of risk functionals as well as "nice" functions of them satisfy the continuity condition. Using our newly developed analytical toolkits, we analyse the algorithms $\rho$-MTS (for multinomial distributions) and $\rho$-NPTS (for bounded distributions) and prove that they admit asymptotically optimal regret bounds of risk-averse algorithms under the mean-variance, CVaR, and other ubiquitous risk measures, as well as a host of newly synthesized risk measures. Numerical simulations show that our bounds are reasonably tight vis-\`a-vis algorithm-independent lower bounds.

Glancing at Barcelona's still-unfinished Sagrada Família Roman Catholic basilica, with its famous sandcastle-like exterior, it is easy to get the wrong idea about its architect, Antoni Gaudí, as a carefree, loosey-goosey artist. The whimsical exterior hides a geometrically sophisticated, structurally advanced design--a big part of the reason this grand basilica, begun in 1882, has taken so many decades to build, remaining the world's longest-running ongoing architectural project. This complexity required an utterly different approach to modeling than what architects had typically deployed. Instead of using two-dimensional drawings to guide builders, Gaudí relied heavily on large, high-fidelity plaster models--models that needed to be reverse engineered and rebuilt after extensive damage during the Spanish Civil War. In a separate project, Gaudí pioneered the use of hanging-chain models that enable changes in real time; though he did not use these interactive models on the Sagrada Família, they guided his thinking and prefigured the so-called parametric design software that has been instrumental to the acceleration of the project's pace in recent years.

The ability to discover and experience world building is a relatively unique privilege afforded to computer programmers.

The Transform Technology Summits start October 13th with Low-Code/No Code: Enabling Enterprise Agility. Women in the AI field are making research breakthroughs, spearheading vital ethical discussions, and inspiring the next generation of AI professionals. We created the VentureBeat Women in AI Awards to emphasize the importance of their voices, work, and experience and to shine a light on some of these leaders. In this series, publishing Fridays, we're diving deeper into conversations with this year's winners, whom we honored recently at Transform 2021. Check out last week's interview with a winner of our AI responsibility and ethics award.

It's been three years since Google launched the Nest Hello, a wired video doorbell with facial recognition that helped set the standard for smart doorbells. In that time, many competitors have appeared, but few have come close to the quality and reliability of that device. The Nest Doorbell (battery) is a Google-made video doorbell that can run on battery power (it can also operate on wired power, if you have that infrastructure and wish to connect it to your existing doorbell chime). In our tests the device performed excellently, didn't give any problems, and proved itself to be a worthy sister device to the original Nest Hello. A large, round black circle with a camera in its center is at the top of the new Nest doorbell. A small LED below that indicates when the camera is recording or processing video.

Even the most skilled inspector might have an off day. Here it can be useful to outsource mundane or mechanical tasks to'intelligent' machines. Poorly defined quality-control procedures were blamed for one of the most extensive automotive parts recalls in history, involving the airbag manufacturer Takata. The firm's inflators, which contained the chemical ammonium nitrate, were found to be unsafe – leading 19 US carmakers to recall 69m of the products. Similar recalls were issued in Japan, China and Oceania.