Oceania
Self-Awareness Safety of Deep Reinforcement Learning in Road Traffic Junction Driving
Autonomous driving has been at the forefront of public interest, and a pivotal debate to widespread concerns is safety in the transportation system. Deep reinforcement learning (DRL) has been applied to autonomous driving to provide solutions for obstacle avoidance. However, in a road traffic junction scenario, the vehicle typically receives partial observations from the transportation environment, while DRL needs to rely on long-term rewards to train a reliable model by maximising the cumulative rewards, which may take the risk when exploring new actions and returning either a positive reward or a penalty in the case of collisions. Although safety concerns are usually considered in the design of a reward function, they are not fully considered as the critical metric to directly evaluate the effectiveness of DRL algorithms in autonomous driving. In this study, we evaluated the safety performance of three baseline DRL models (DQN, A2C, and PPO) and proposed a self-awareness module from an attention mechanism for DRL to improve the safety evaluation for an anomalous vehicle in a complex road traffic junction environment, such as intersection and roundabout scenarios, based on four metrics: collision rate, success rate, freezing rate, and total reward. Our two experimental results in the training and testing phases revealed the baseline DRL with poor safety performance, while our proposed self-awareness attention-DQN can significantly improve the safety performance in intersection and roundabout scenarios.
Meta files hundreds of patents for technologies to track users' movements to improve its metaverse
Meta aims to make realistic avatars for its metaverse and plans to do so by tacking users' every move with customized technologies. The company recently filed a trove of patents for these innovations that monitor facial expressions, eye movements and body poses of players. The patents describe a device that sits around user's waist to track their body poses, sensor-packed gloves to monitor hand gestures and glasses to immerse players in the digital world. Another application shows images of an'avatar personalization engine' that creates 3-D avatars based on a user's photos using tools such as a so-called skin replicator. Meta aims to make realistic avatars for its metaverse and plans to do so by watching users' every move with customized technologies.
Quantum computers could finally be made at large scale after huge scientific breakthrough
Quantum computers could finally be made at large scale after a number of major breakthroughs, the scientists behind them have announced. The new research shows that it is possible to make robust and reliable silicon-based quantum computers, that would be compatible with the existing manufacturing technology we have. Three separate papers in Nature together show that such silicon-based quantum processors are dependable and efficient enough that they could be made and used in the real world. Each of the three papers show quantum computers that are more than 99.9 per cent error free, far above the 99 per cent threshold considered as the standard for fault-tolerant computers. As such, they could finally be ready to be used for actual applications.
Retinal age gap as a predictive biomarker for mortality risk
Aim To develop a deep learning (DL) model that predicts age from fundus images (retinal age) and to investigate the association between retinal age gap (retinal age predicted by DL model minus chronological age) and mortality risk. Methods A total of 80 169 fundus images taken from 46 969 participants in the UK Biobank with reasonable quality were included in this study. Of these, 19 200 fundus images from 11 052 participants without prior medical history at the baseline examination were used to train and validate the DL model for age prediction using fivefold cross-validation. A total of 35 913 of the remaining 35 917 participants had available mortality data and were used to investigate the association between retinal age gap and mortality. Results The DL model achieved a strong correlation of 0.81 (p<0·001) between retinal age and chronological age, and an overall mean absolute error of 3.55 years. Cox regression models showed that each 1 year increase in the retinal age gap was associated with a 2% increase in risk of all-cause mortality (hazard ratio (HR)=1.02, 95% CI 1.00 to 1.03, p=0.020) and a 3% increase in risk of cause-specific mortality attributable to non-cardiovascular and non-cancer disease (HR=1.03, 95% CI 1.00 to 1.05, p=0.041) after multivariable adjustments. No significant association was identified between retinal age gap and cardiovascular- or cancer-related mortality. Conclusions Our findings indicate that retinal age gap might be a potential biomarker of ageing that is closely related to risk of mortality, implying the potential of retinal image as a screening tool for risk stratification and delivery of tailored interventions. Data are available in a public, open access repository.
Your eyes hold the key to your true biological age, study finds
The eyes may offer a "window into the soul," as poets say, but they also have a lot to say about your health. Dry eyes can be a sign of rheumatoid arthritis. High levels of cholesterol can cause a white, gray or blue ring to form around the colored part of your eye, called the iris. A coppery gold ring circling the iris is a key sign of Wilson's disease, a rare genetic disorder that causes copper to build up in the brain, liver and other organs, slowing poisoning the body. And that's not all: Damage to blood vessels in the back of your eye, called the retina, can be early signs of nerve damage due to diabetes, high blood pressure, coronary artery disease, even cancer, as well as glaucoma and age-related macular degeneration.
Unsupervised Personalization of an Emotion Recognition System: The Unique Properties of the Externalization of Valence in Speech
Abstract--The prediction of valence from speech is an important, but challenging problem. The externalization of valence in speech has speaker-dependent cues, which contribute to performances that are often significantly lower than the prediction of other emotional attributes such as arousal and dominance. A practical approach to improve valence prediction from speech is to adapt the models to the target speakers in the test set. Adapting a speech emotion recognition (SER) system to a particular speaker is a hard problem, especially with deep neural networks (DNNs), since it requires optimizing millions of parameters. This study proposes an unsupervised approach to address this problem by searching for speakers in the train set with similar acoustic patterns as the speaker in the test set. Speech samples from the selected speakers are used to create the adaptation set. This approach leverages transfer learning using pre-trained models, which are adapted with these speech samples. We propose three alternative adaptation strategies: unique speaker, oversampling and weighting approaches. These methods differ on the use of the adaptation set in the personalization of the valence models. The results demonstrate that a valence prediction model can be efficiently personalized with these unsupervised approaches, leading to relative improvements as high as 13.52%. Index Terms--Speech emotion recognition, adaptation, transfer learning, emotional dimensions, valence. In potential in fields such as human-computer interactions particular, the emotional attribute valence is key (HCIs), healthcare [1], [2] and behavioral studies to understand many behavioral disorders [6], [7] [3], [4]. Although different is still a challenging task. The usual formulation approaches have been proposed to improve SER to describe emotions is with categorical descriptors systems, the prediction of valence using acoustic such as happiness, sadness, anger and neutral.
Roadmap for Cybersecurity in Autonomous Vehicles
Kukkala, Vipin Kumar, Thiruloga, Sooryaa Vignesh, Pasricha, Sudeep
Autonomous vehicles are on the horizon and will be transforming transportation safety and comfort. These vehicles will be connected to various external systems and utilize advanced embedded systems to perceive their environment and make intelligent decisions. However, this increased connectivity makes these vehicles vulnerable to various cyber-attacks that can have catastrophic effects. Attacks on automotive systems are already on the rise in today's vehicles and are expected to become more commonplace in future autonomous vehicles. Thus, there is a need to strengthen cybersecurity in future autonomous vehicles. In this article, we discuss major automotive cyber-attacks over the past decade and present state-of-the-art solutions that leverage artificial intelligence (AI). We propose a roadmap towards building secure autonomous vehicles and highlight key open challenges that need to be addressed.
Decoupling the Depth and Scope of Graph Neural Networks
Zeng, Hanqing, Zhang, Muhan, Xia, Yinglong, Srivastava, Ajitesh, Malevich, Andrey, Kannan, Rajgopal, Prasanna, Viktor, Jin, Long, Chen, Ren
State-of-the-art Graph Neural Networks (GNNs) have limited scalability with respect to the graph and model sizes. On large graphs, increasing the model depth often means exponential expansion of the scope (i.e., receptive field). Beyond just a few layers, two fundamental challenges emerge: 1. degraded expressivity due to oversmoothing, and 2. expensive computation due to neighborhood explosion. We propose a design principle to decouple the depth and scope of GNNs -- to generate representation of a target entity (i.e., a node or an edge), we first extract a localized subgraph as the bounded-size scope, and then apply a GNN of arbitrary depth on top of the subgraph. A properly extracted subgraph consists of a small number of critical neighbors, while excluding irrelevant ones. The GNN, no matter how deep it is, smooths the local neighborhood into informative representation rather than oversmoothing the global graph into "white noise". Theoretically, decoupling improves the GNN expressive power from the perspectives of graph signal processing (GCN), function approximation (GraphSAGE) and topological learning (GIN). Empirically, on seven graphs (with up to 110M nodes) and six backbone GNN architectures, our design achieves significant accuracy improvement with orders of magnitude reduction in computation and hardware cost.
Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results
Ceschia, Sara, Di Gaspero, Luca, Schaerf, Andrea
Educational Timetabling, in essence, consists in assigning teacher/student meetings to days, timeslots, and classrooms. Despite this apparent simplicity, experience teaches us that every single institution has its own rules, conventions, and fixations, thus making each specific problem almost unique. As a consequence, uncountably many different problem formulations have been proposed in the literature on Educational Timetabling, depending on the type of institution (high-school, university, or other), the type of meetings (lectures, exams,...), and the different settings, constraints, and objectives. Many papers in the literature tackle a specific problem using a selected search method. The authors normally claim the success of the application, though rarely dispelling the doubt over the readers that the method used was more the authors' "favorite" rather than the most suitable for the problem under consideration.
Mixed Nondeterministic-Probabilistic Automata: Blending graphical probabilistic models with nondeterminism
Benveniste, Albert, Raclet, Jean-Baptiste
Graphical models in probability and statistics are a core concept in the area of probabilistic reasoning and probabilistic programming-graphical models include Bayesian networks and factor graphs. In this paper we develop a new model of mixed (nondeterministic/probabilistic) automata that subsumes both nondeterministic automata and graphical probabilistic models. Mixed Automata are equipped with parallel composition, simulation relation, and support message passing algorithms inherited from graphical probabilistic models. Segala's Probabilistic Automatacan be mapped to Mixed Automata.