Artificial intelligence promises to expertly diagnose disease in medical images and scans. However, a close look at the data used to train algorithms for diagnosing eye conditions suggests these powerful new tools may perpetuate health inequalities. A team of researchers in the UK analyzed 94 data sets--with more than 500,000 images--commonly used to train AI algorithms to spot eye diseases. They found that almost all of the data came from patients in North America, Europe, and China. Just four data sets came from South Asia, two from South America, and one from Africa; none came from Oceania.

In 2018, Alphabet's X lab said it was in the process of exploring how it could use artificial intelligence to improve farming. On Monday, X announced that its "computational agriculture" project is called Mineral. The Mineral team has spent the last several years "developing and testing a range of software and hardware prototypes based on breakthroughs in artificial intelligence, simulation, sensors, robotics and more." One of the tools that has come out of the project is a robotic plant buggy. Powered by solar panels, the machine makes its way across a farmer's field, examining every plant it passes along the way with an array of cameras and sensors.

The world's small-scale farmers now can see a path to solving global hunger over the next decade, with solutions – such as adopting climate-resilient crops through improving extension services – all culled rapidly via artificial intelligence from more than 500,000 scientific research articles. The results are synthesized in 10 new research papers – authored by 77 scientists, researchers and librarians in 23 countries – as part of Ceres2030: Sustainable Solutions to End Hunger. The project is headquartered at Cornell, with partners from the International Food Policy Research Institute (IFPRI) and the International Institute for Sustainable Development (IISD). The papers were published concurrently on Oct. 12 in four journals – Nature Plants, Nature Sustainability, Nature Machine Intelligence and Nature Food – and assembled in a comprehensive package online: Sustainable Solutions to End Hunger. Ceres2030 employed machine learning, librarian savvy and research synthesis methods to quickly scan a trove of thousands of scientific journals for ideas and websites from more than 60 agencies that can help eradicate world hunger.

Hitachi Construction Machinery (HCM) and its consolidated subsidiary, Wenco International Mining Systems, have jointly developed "ConSite Mine", a new technology platform that helps resolve problems at mine sites by remotely monitoring mining machines on a 24/7 basis through the use of IoT and AI based analysis of equipment operations data. According to Hitachi, it has developed this technology to help customers and HCM dealers predict costly maintenance issues before they occur, such as the occurrence of cracks in excavator booms or arms, by utilising machine learning and applied analysis technologies. Detailed information from these predictive alerts are provided on the web-based ConSite Mine dashboard and other items. Currently, Hitachi is piloting the technology in Australia, Zambia and Indonesia. "ConSite Mine" will be further modified based on customer feedback before wider commercial release in 2021.

How globally diverse are AI Ethics boards? An article published by MIT shows that Americans and Europeans occupy most seats on these boards. If these compositions remain like this, we run the risk that bias in AI will perpetuate. An excellent example of different views can be seen in the question of what intelligence is. While we can't scientifically explain what intelligence is, there are vastly different perceptions of how intelligent behavior expresses itself.

We present the Zero Resource Speech Challenge 2020, which aims at learning speech representations from raw audio signals without any labels. It combines the data sets and metrics from two previous benchmarks (2017 and 2019) and features two tasks which tap into two levels of speech representation. The first task is to discover low bit-rate subword representations that optimize the quality of speech synthesis; the second one is to discover word-like units from unsegmented raw speech. We present the results of the twenty submitted models and discuss the implications of the main findings for unsupervised speech learning.

Stochastic gradient descent (SGD) and its variants are mainstream methods to train deep neural networks. Since neural networks are non-convex, more and more works study the dynamic behavior of SGD and the impact to its generalization, especially the escaping efficiency from local minima. However, these works take the over-simplified assumption that the covariance of the noise in SGD is (or can be upper bounded by) constant, although it is actually state-dependent. In this work, we conduct a formal study on the dynamic behavior of SGD with state-dependent noise. Specifically, we show that the covariance of the noise of SGD in the local region of the local minima is a quadratic function of the state. Thus, we propose a novel power-law dynamic with state-dependent diffusion to approximate the dynamic of SGD. We prove that, power-law dynamic can escape from sharp minima exponentially faster than flat minima, while the previous dynamics can only escape sharp minima polynomially faster than flat minima. Our experiments well verified our theoretical results. Inspired by our theory, we propose to add additional state-dependent noise into (large-batch) SGD to further improve its generalization ability. Experiments verify that our method is effective.

This paper investigates the use of nonparametric kernel-regression to obtain a tasksimilarity aware meta-learning algorithm. Our hypothesis is that the use of tasksimilarity helps meta-learning when the available tasks are limited and may contain outlier/ dissimilar tasks. While existing meta-learning approaches implicitly assume the tasks as being similar, it is generally unclear how this task-similarity could be quantified and used in the learning. As a result, most popular metalearning approaches do not actively use the similarity/dissimilarity between the tasks, but rely on availability of huge number of tasks for their working. Our contribution is a novel framework for meta-learning that explicitly uses task-similarity in the form of kernels and an associated meta-learning algorithm. We model the task-specific parameters to belong to a reproducing kernel Hilbert space where the kernel function captures the similarity across tasks. The proposed algorithm iteratively learns a meta-parameter which is used to assign a task-specific descriptor for every task. The task descriptors are then used to quantify the task-similarity through the kernel function. We show how our approach conceptually generalizes the popular meta-learning approaches of model-agnostic meta-learning (MAML) and Meta-stochastic gradient descent (Meta-SGD) approaches. Numerical experiments with regression tasks show that our algorithm outperforms these approaches when the number of tasks is limited, even in the presence of outlier or dissimilar tasks. This supports our hypothesis that task-similarity helps improve the metalearning performance in task-limited and adverse settings.

Reinforcement learning (RL) [5] studies the problem of how to make sequential decisions to learn and act in unknown environments (which is usually modeled by a Markov Decision Process (MDP)) and maximize the collected rewards. There are mainly two types of algorithms to approach the RL problems: model-based algorithms and model-free algorithms. Model-based RL algorithms keep explicit description of the learned model and make decisions based on this model. In contrast, modelfree algorithms only maintain a group of value functions instead of the complete model of the system dynamics. Due to their space-and time-efficiency, model-free RL algorithms have been getting popular in a wide range of practical tasks (e.g., DQN [16], TRPO [18], and A3C [15]). In RL theory, model-free algorithms are explicitly defined to be the ones whose space complexity is always sublinear relative to the space required to store the MDP parameters [12]. For tabular MDPs (i.e., MDPs with finite number of states and actions, usually denoted by S and A respectively), this requires that the space complexity to be opS

The Endoscopy Computer Vision Challenge (EndoCV) is a crowd-sourcing initiative to address eminent problems in developing reliable computer aided detection and diagnosis endoscopy systems and suggest a pathway for clinical translation of technologies. Whilst endoscopy is a widely used diagnostic and treatment tool for hollow-organs, there are several core challenges often faced by endoscopists, mainly: 1) presence of multi-class artefacts that hinder their visual interpretation, and 2) difficulty in identifying subtle precancerous precursors and cancer abnormalities. Artefacts often affect the robustness of deep learning methods applied to the gastrointestinal tract organs as they can be confused with tissue of interest. EndoCV2020 challenges are designed to address research questions in these remits. In this paper, we present a summary of methods developed by the top 17 teams and provide an objective comparison of state-of-the-art methods and methods designed by the participants for two sub-challenges: i) artefact detection and segmentation (EAD2020), and ii) disease detection and segmentation (EDD2020). Multi-center, multi-organ, multi-class, and multi-modal clinical endoscopy datasets were compiled for both EAD2020 and EDD2020 sub-challenges. An out-of-sample generalisation ability of detection algorithms was also evaluated. Whilst most teams focused on accuracy improvements, only a few methods hold credibility for clinical usability. The best performing teams provided solutions to tackle class imbalance, and variabilities in size, origin, modality and occurrences by exploring data augmentation, data fusion, and optimal class thresholding techniques.