Biometrics adoption is being encouraged in the public sector for digital ID and online government applications, as it continues to rise in the private sector from smartphones, where Fingerprint Cards has announced new wins to airport processes, where NEC technology is being deployed and Vision-Box is positioning for more growth. National digital ID programs are under the microscope, while Thales has signed a major deal in Vietnam, and a debate has broken out on facial recognition ethics between Oosto and Clearview AI. The potential for digital identity to boost national economies is examined by the World Economic Forum in a new white paper. The WEF sees digital ID as benefitting people by easing access to a range of services, helping small and medium-sized businesses with easier access to financing, and help establish robust growth in digital service industries, with China's digital wealth-management market offered as an example. Research ICT Africa has released a series of extensive reports delving into the digital identity systems in 10 African countries.

With the increasing adoption of artificial intelligence (AI) applications at the workplace, the debate about the future of work, workers, and the workplace has intensified. The polarised nature of debate ranges from job losses versus new-technology job creation through performance efficiency versus performance effectiveness to liberating humans from drudgery versus being controlled by machines. While several other polarities are evident in this debate, the truth always lies somewhere in between. In addition, there are other dark-side debates in the field about ethical, legal, and moral issues in the design and implementation of AI technologies for work and society. While popular discourse presents AI as a new phenomenon, the development of AI as an academic discipline dates back to 1956.

A well-crafted police patrol route design is vital in providing community safety and security in the society. Previous works have largely focused on predicting crime events with historical crime data. The usage of large-scale mobility data collected from Location-Based Social Network, or check-ins, and Point of Interests (POI) data for designing an effective police patrol is largely understudied. Given that there are multiple police officers being on duty in a real-life situation, this makes the problem more complex to solve. In this paper, we formulate the dynamic crime patrol planning problem for multiple police officers using check-ins, crime, incident response data, and POI information. We propose a joint learning and non-random optimisation method for the representation of possible solutions where multiple police officers patrol the high crime risk areas simultaneously first rather than the low crime risk areas. Later, meta-heuristic Genetic Algorithm (GA) and Cuckoo Search (CS) are implemented to find the optimal routes. The performance of the proposed solution is verified and compared with several state-of-art methods using real-world datasets.

As \emph{artificial intelligence} (AI) systems are increasingly involved in decisions affecting our lives, ensuring that automated decision-making is fair and ethical has become a top priority. Intuitively, we feel that akin to human decisions, judgments of artificial agents should necessarily be grounded in some moral principles. Yet a decision-maker (whether human or artificial) can only make truly ethical (based on any ethical theory) and fair (according to any notion of fairness) decisions if full information on all the relevant factors on which the decision is based are available at the time of decision-making. This raises two problems: (1) In settings, where we rely on AI systems that are using classifiers obtained with supervised learning, some induction/generalization is present and some relevant attributes may not be present even during learning. (2) Modeling such decisions as games reveals that any -- however ethical -- pure strategy is inevitably susceptible to exploitation. Moreover, in many games, a Nash Equilibrium can only be obtained by using mixed strategies, i.e., to achieve mathematically optimal outcomes, decisions must be randomized. In this paper, we argue that in supervised learning settings, there exist random classifiers that perform at least as well as deterministic classifiers, and may hence be the optimal choice in many circumstances. We support our theoretical results with an empirical study indicating a positive societal attitude towards randomized artificial decision-makers, and discuss some policy and implementation issues related to the use of random classifiers that relate to and are relevant for current AI policy and standardization initiatives.

Modularity is a compelling solution to continual learning (CL), the problem of modeling sequences of related tasks. Learning and then composing modules to solve different tasks provides an abstraction to address the principal challenges of CL including catastrophic forgetting, backward and forward transfer across tasks, and sub-linear model growth. We introduce local module composition (LMC), an approach to modular CL where each module is provided a local structural component that estimates a module's relevance to the input. Dynamic module composition is performed layer-wise based on local relevance scores. We demonstrate that agnosticity to task identities (IDs) arises from (local) structural learning that is module-specific as opposed to the task- and/or model-specific as in previous works, making LMC applicable to more CL settings compared to previous works. In addition, LMC also tracks statistics about the input distribution and adds new modules when outlier samples are detected. In the first set of experiments, LMC performs favorably compared to existing methods on the recent Continual Transfer-learning Benchmark without requiring task identities. In another study, we show that the locality of structural learning allows LMC to interpolate to related but unseen tasks (OOD), as well as to compose modular networks trained independently on different task sequences into a third modular network without any fine-tuning. Finally, in search for limitations of LMC we study it on more challenging sequences of 30 and 100 tasks, demonstrating that local module selection becomes much more challenging in presence of a large number of candidate modules. In this setting best performing LMC spawns much fewer modules compared to an oracle based baseline, however, it reaches a lower overall accuracy. The codebase is available under https://github.com/oleksost/LMC.

Autonomous driving relies on a huge volume of real-world data to be labeled to high precision. Alternative solutions seek to exploit driving simulators that can generate large amounts of labeled data with a plethora of content variations. However, the domain gap between the synthetic and real data remains, raising the following important question: What are the best ways to utilize a self-driving simulator for perception tasks? In this work, we build on top of recent advances in domain-adaptation theory, and from this perspective, propose ways to minimize the reality gap. We primarily focus on the use of labels in the synthetic domain alone. Our approach introduces both a principled way to learn neural-invariant representations and a theoretically inspired view on how to sample the data from the simulator. Our method is easy to implement in practice as it is agnostic of the network architecture and the choice of the simulator. We showcase our approach on the bird's-eye-view vehicle segmentation task with multi-sensor data (cameras, lidar) using an open-source simulator (CARLA), and evaluate the entire framework on a real-world dataset (nuScenes). Last but not least, we show what types of variations (e.g.

Applications of Reinforcement Learning (RL) in robotics are often limited by high data demand. On the other hand, approximate models are readily available in many robotics scenarios, making model-based approaches like planning a data-efficient alternative. Still, the performance of these methods suffers if the model is imprecise or wrong. In this sense, the respective strengths and weaknesses of RL and model-based planners are. In the present work, we investigate how both approaches can be integrated into one framework that combines their strengths. We introduce Learning to Execute (L2E), which leverages information contained in approximate plans to learn universal policies that are conditioned on plans. In our robotic manipulation experiments, L2E exhibits increased performance when compared to pure RL, pure planning, or baseline methods combining learning and planning.

You are free to share this article under the Attribution 4.0 International license. Using artificial intelligence, researchers have developed a genetic model for the "ultimate" chickpea, with the potential to lift crop yields by up to 12%. Researchers genetically mapped thousands of chickpea varieties, and then used this information to identify the most valuable gene combinations using artificial intelligence (AI). Researchers wanted to to develop a "haplotype" genomic prediction crop breeding strategy, for enhanced performance for seed weight. "Most crop species only have a few varieties sequenced, so it was a massive undertaking by the international team to analyze more than 3,000 cultivated and wild varieties," says Ben Hayes, professor at the University of Queensland.

London (CNN Business)When you're in pain, you can usually tell someone about it. But for people with communication difficulties, that isn't always an option, meaning pain often goes undetected, misinterpreted or wrongly treated. To give a voice to those who can't report their suffering, such as people with dementia, PainChek, an Australian startup, has developed an app that uses facial analysis and artificial intelligence (AI) to assess and score pain levels. A carer records a short video of the subject's face using a smartphone and answers questions about their behavior, movements and speech. The app's AI recognizes facial muscle movements that are associated with pain and combines this with the carer's observations to calculate an overall pain score.

We demonstrate that extremely low resolution quantized (nominally 5-state) synapses with large stochastic variations in Domain Wall (DW) position can be both energy efficient and achieve reasonably high testing accuracies compared to Deep Neural Networks (DNNs) of similar sizes using floating precision synaptic weights. Specifically, voltage controlled DW devices demonstrate stochastic behavior as modeled rigorously with micromagnetic simulations and can only encode limited states; however, they can be extremely energy efficient during both training and inference. We show that by implementing suitable modifications to the learning algorithms, we can address the stochastic behavior as well as mitigate the effect of their low-resolution to achieve high testing accuracies. In this study, we propose both in-situ and ex-situ training algorithms, based on modification of the algorithm proposed by Hubara et al. [1] which works well with quantization of synaptic weights. We train several 5-layer DNNs on MNIST dataset using 2-, 3- and 5-state DW device as synapse. For in-situ training, a separate high precision memory unit is adopted to preserve and accumulate the weight gradients, which are then quantized to program the low precision DW devices. Moreover, a sizeable noise tolerance margin is used during the training to address the intrinsic programming noise. For ex-situ training, a precursor DNN is first trained based on the characterized DW device model and a noise tolerance margin, which is similar to the in-situ training. Remarkably, for in-situ inference the energy dissipation to program the devices is only 13 pJ per inference given that the training is performed over the entire MNIST dataset for 10 epochs.