Africa
Turkey promises to keep grain moving despite Russian withdrawal
Turkey says it is determined that Ukraine continues its food exports despite Russia announcing its withdrawal from a UN-brokered grain deal, a move that has heightened concerns for nations desperate for food assistance. Russia pulled out of the deal on Saturday after what it said was a major Ukrainian drone attack on its naval fleet in annexed Crimea. Despite Moscow's decision, cargo ships set sail carrying 354,500 tonnes of grain, the most dispatched in one day since the programme began in August. Turkey, which helped broker the agreement, remained committed to the deal. "Even if Russia behaves hesitantly because it didn't receive the same benefits, we will continue decisively our efforts to serve humanity," President Recep Tayyip Erdogan said.
Explosions Rock Kyiv Days After Russia Blames Ukraine For Black Sea Attack
Several blasts shook Kyiv on Monday, days after Russia blamed Ukraine for drone attacks on its Crimea fleet in the Black Sea. At least five explosions were heard in the Ukrainian capital between 8:00 am (0600 GMT) and 8:20 am, according to AFP journalists. Kyiv had already been hit on October 10 and 17 by drones. After Monday's blasts, mayor Vitali Klitschko said in a Telegram message: "An area of Kyiv is without electricity and certain areas without water following Russian strikes." Monday's attack on the Ukrainian capital comes after Russia pulled out of a landmark agreement that allowed vital grain shipments via a maritime safety corridor.
Artificial Intelligence to play major role in patient care
Nellore: The conference on Futuristic Nursing being held at Narayana Nursing College here has discussed at length aspects of patient safety as also use of artificial intelligence and tele-medicine, apart from mobile health and sensor-based technologies (smartphones, smartphone apps and wearable technologies). More than 800 nurses are participating in the meet and around 40 eminent nursing leaders across the globe discussing the latest in nursing practices during the 3-day conference from Saturday. In a paper on'Artificial Intelligence in Nursing' presented jointly by Dr Ramesh M.Sc Phd, HoD Medical Surgical Nursing, St Paul's Hospital Millennium Medical College, Ethiopia, and Dr S. Indira, Dean of Narayana Nursing College, said AI offers three advantages over traditional methods -- the ability to quickly consider large volumes of data in risk prediction, increased intervention specificity (accurately flagging patients most at-risk) and automated adjustments in variable selection and calculation. "AI can help detect which patient features are most important in public health applications, allowing for more focused preventive interventions. Robots may aid nursing care tasks in hazardous clinical environments and they have the potential to automate some tasks."
Graphemic Normalization of the Perso-Arabic Script
Doctor, Raiomond, Gutkin, Alexander, Johny, Cibu, Roark, Brian, Sproat, Richard
Since its original appearance in 1991, the Perso-Arabic script representation in Unicode has grown from 169 to over 440 atomic isolated characters spread over several code pages representing standard letters, various diacritics and punctuation for the original Arabic and numerous other regional orthographic traditions. This paper documents the challenges that Perso-Arabic presents beyond the best-documented languages, such as Arabic and Persian, building on earlier work by the expert community. We particularly focus on the situation in natural language processing (NLP), which is affected by multiple, often neglected, issues such as the use of visually ambiguous yet canonically nonequivalent letters and the mixing of letters from different orthographies. Among the contributing conflating factors are the lack of input methods, the instability of modern orthographies, insufficient literacy, and loss or lack of orthographic tradition. We evaluate the effects of script normalization on eight languages from diverse language families in the Perso-Arabic script diaspora on machine translation and statistical language modeling tasks. Our results indicate statistically significant improvements in performance in most conditions for all the languages considered when normalization is applied. We argue that better understanding and representation of Perso-Arabic script variation within regional orthographic traditions, where those are present, is crucial for further progress of modern computational NLP techniques especially for languages with a paucity of resources.
Teacher-student curriculum learning for reinforcement learning
Reinforcement learning (rl) is a popular paradigm for sequential decision making problems. The past decade's advances in rl have led to breakthroughs in many challenging domains such as video games, board games, robotics, and chip design. The sample inefficiency of deep reinforcement learning methods is a significant obstacle when applying rl to real-world problems. Transfer learning has been applied to reinforcement learning such that the knowledge gained in one task can be applied when training in a new task. Curriculum learning is concerned with sequencing tasks or data samples such that knowledge can be transferred between those tasks to learn a target task that would otherwise be too difficult to solve. Designing a curriculum that improves sample efficiency is a complex problem. In this thesis, we propose a teacher-student curriculum learning setting where we simultaneously train a teacher that selects tasks for the student while the student learns how to solve the selected task. Our method is independent of human domain knowledge and manual curriculum design. We evaluated our methods on two reinforcement learning benchmarks: grid world and the challenging Google Football environment. With our method, we can improve the sample efficiency and generality of the student compared to tabula-rasa reinforcement learning.
Exploring the effectiveness of surrogate-assisted evolutionary algorithms on the batch processing problem
Variawa, Mohamed Z., Van Zyl, Terence L., Woolway, Matthew
Real-world optimisation problems typically have objective functions which cannot be expressed analytically. These optimisation problems are evaluated through expensive physical experiments or simulations. Cheap approximations of the objective function can reduce the computational requirements for solving these expensive optimisation problems. These cheap approximations may be machine learning or statistical models and are known as surrogate models. This paper introduces a simulation of a well-known batch processing problem in the literature. Evolutionary algorithms such as Genetic Algorithm (GA), Differential Evolution (DE) are used to find the optimal schedule for the simulation. We then compare the quality of solutions obtained by the surrogate-assisted versions of the algorithms against the baseline algorithms. Surrogate-assistance is achieved through Probablistic Surrogate-Assisted Framework (PSAF). The results highlight the potential for improving baseline evolutionary algorithms through surrogates. For different time horizons, the solutions are evaluated with respect to several quality indicators. It is shown that the PSAF assisted GA (PSAF-GA) and PSAF-assisted DE (PSAF-DE) provided improvement in some time horizons. In others, they either maintained the solutions or showed some deterioration. The results also highlight the need to tune the hyper-parameters used by the surrogate-assisted framework, as the surrogate, in some instances, shows some deterioration over the baseline algorithm.
Edgeless-GNN: Unsupervised Representation Learning for Edgeless Nodes
Shin, Yong-Min, Tran, Cong, Shin, Won-Yong, Cao, Xin
We study the problem of embedding edgeless nodes such as users who newly enter the underlying network, while using graph neural networks (GNNs) widely studied for effective representation learning of graphs. Our study is motivated by the fact that GNNs cannot be straightforwardly adopted for our problem since message passing to such edgeless nodes having no connections is impossible. To tackle this challenge, we propose Edgeless-GNN, a novel inductive framework that enables GNNs to generate node embeddings even for edgeless nodes through unsupervised learning. Specifically, we start by constructing a proxy graph based on the similarity of node attributes as the GNN's computation graph defined by the underlying network. The known network structure is used to train model parameters, whereas a topology-aware loss function is established in such a way that our model judiciously learns the network structure by encoding positive, negative, and second-order relations between nodes. For the edgeless nodes, we inductively infer embeddings by expanding the computation graph. By evaluating the performance of various downstream machine learning tasks, we empirically demonstrate that Edgeless-GNN exhibits (a) superiority over state-of-the-art inductive network embedding methods for edgeless nodes, (b) effectiveness of our topology-aware loss function, (c) robustness to incomplete node attributes, and (d) a linear scaling with the graph size.
Domain Curricula for Code-Switched MT at MixMT 2022
In multilingual colloquial settings, it is a habitual occurrence to compose expressions of text or speech containing tokens or phrases of different languages, a phenomenon popularly known as code-switching or code-mixing (CMX). We present our approach and results for the Code-mixed Machine Translation (MixMT) shared task at WMT 2022: the task consists of two subtasks, monolingual to code-mixed machine translation (Subtask-1) and code-mixed to monolingual machine translation (Subtask-2). Most non-synthetic code-mixed data are from social media but gathering a significant amount of this kind of data would be laborious and this form of data has more writing variation than other domains, so for both subtasks, we experimented with data schedules for out-of-domain data. We jointly learn multiple domains of text by pretraining and fine-tuning, combined with a sentence alignment objective. We found that switching between domains caused improved performance in the domains seen earliest during training, but depleted the performance on the remaining domains. A continuous training run with strategically dispensed data of different domains showed a significantly improved performance over fine-tuning.
VertiBayes: Learning Bayesian network parameters from vertically partitioned data with missing values
van Daalen, Florian, Ippel, Lianne, Dekker, Andre, Bermejo, Inigo
Federated learning makes it possible to train a machine learning model on decentralized data. Bayesian networks are probabilistic graphical models that have been widely used in artificial intelligence applications. Their popularity stems from the fact they can be built by combining existing expert knowledge with data and are highly interpretable, which makes them useful for decision support, e.g. in healthcare. While some research has been published on the federated learning of Bayesian networks, publications on Bayesian networks in a vertically partitioned or heterogeneous data setting (where different variables are located in different datasets) are limited, and suffer from important omissions, such as the handling of missing data. In this article, we propose a novel method called VertiBayes to train Bayesian networks (structure and parameters) on vertically partitioned data, which can handle missing values as well as an arbitrary number of parties. For structure learning we adapted the widely used K2 algorithm with a privacy-preserving scalar product protocol. For parameter learning, we use a two-step approach: first, we learn an intermediate model using maximum likelihood by treating missing values as a special value and then we train a model on synthetic data generated by the intermediate model using the EM algorithm. The privacy guarantees of our approach are equivalent to the ones provided by the privacy preserving scalar product protocol used. We experimentally show our approach produces models comparable to those learnt using traditional algorithms and we estimate the increase in complexity in terms of samples, network size, and complexity. Finally, we propose two alternative approaches to estimate the performance of the model using vertically partitioned data and we show in experiments that they lead to reasonably accurate estimates.