Goto

Collaborating Authors

 Africa


Data Science Engineer, ML Ops at Gro Intelligence - New York City, United States

#artificialintelligence

Gro Intelligence is tackling two of the biggest problems facing the world today: food security and climate change. We understand and quantify the complex interplay between food, weather, trade, agriculture, and macroeconomic conditions in a world upended by climate change, a growing population, and more. The team at Gro has built a platform that allows businesses, non-profits, and governments to better plan for and adapt to these changes. With offices in Nairobi, New York, and Singapore Gro has the financial backing of prominent investors such as TPG Growth, Intel Capital, Data Collective, and GGV. Gro is a diverse, intellectually curious team of technologists, scientists, and business professionals united by a shared commitment to build AI that addresses agriculture, food, and our climate on the most fundamental level.


Korea to have 30% of businesses utilize AI technologies by 2030

#artificialintelligence

Korea plans to have 30 percent of local companies adopt artificial intelligence (AI) technologies by 2030 to beef up competitiveness of local industries, the industry ministry said Friday.


Using machine learning to map where sharks face the most risk from longline fishing

#artificialintelligence

The ocean can be a dangerous place, even for a shark. Despite sitting at the top of the food chain, these predators are now reeling from destructive human activities like overfishing, pollution and climate change. Researchers at UC Santa Barbara focused on a particularly troublesome issue for sharks: tangles with the longline tuna fishery. Using data from regional fisheries management organizations and machine learning algorithms, the scientists were able to map out hotspots where shark species face the greatest threat from longline fishing. The findings, published in Frontiers in Marine Science, highlight key regions where sharks can be protected with minimal impact on tuna fisheries.


Scalable Estimation for Structured Additive Distributional Regression

arXiv.org Machine Learning

Recently, fitting probabilistic models have gained importance in many areas but estimation of such distributional models with very large data sets is a difficult task. In particular, the use of rather complex models can easily lead to memory-related efficiency problems that can make estimation infeasible even on high-performance computers. We therefore propose a novel backfitting algorithm, which is based on the ideas of stochastic gradient descent and can deal virtually with any amount of data on a conventional laptop. The algorithm performs automatic selection of variables and smoothing parameters, and its performance is in most cases superior or at least equivalent to other implementations for structured additive distributional regression, e.g., gradient boosting, while maintaining low computation time. Performance is evaluated using an extensive simulation study and an exceptionally challenging and unique example of lightning count prediction over Austria. A very large dataset with over 9 million observations and 80 covariates is used, so that a prediction model cannot be estimated with standard distributional regression methods but with our new approach.


Explicit Temporal Embedding in Deep Generative Latent Models for Longitudinal Medical Image Synthesis

arXiv.org Artificial Intelligence

Medical imaging plays a vital role in modern diagnostics and treatment. The temporal nature of disease or treatment progression often results in longitudinal data. Due to the cost and potential harm, acquiring large medical datasets necessary for deep learning can be difficult. Medical image synthesis could help mitigate this problem. However, until now, the availability of GANs capable of synthesizing longitudinal volumetric data has been limited. To address this, we use the recent advances in latent space-based image editing to propose a novel joint learning scheme to explicitly embed temporal dependencies in the latent space of GANs. This, in contrast to previous methods, allows us to synthesize continuous, smooth, and high-quality longitudinal volumetric data with limited supervision. We show the effectiveness of our approach on three datasets containing different longitudinal dependencies.


First Three Years of the International Verification of Neural Networks Competition (VNN-COMP)

arXiv.org Artificial Intelligence

This paper presents a summary and meta-analysis of the first three iterations of the annual International Verification of Neural Networks Competition (VNN-COMP) held in 2020, 2021, and 2022. In the VNN-COMP, participants submit software tools that analyze whether given neural networks satisfy specifications describing their input-output behavior. These neural networks and specifications cover a variety of problem classes and tasks, corresponding to safety and robustness properties in image classification, neural control, reinforcement learning, and autonomous systems. We summarize the key processes, rules, and results, present trends observed over the last three years, and provide an outlook into possible future developments.


Trends in Explainable AI (XAI) Literature

arXiv.org Artificial Intelligence

The XAI literature is decentralized, both in terminology and in publication venues, but recent years saw the community converge around keywords that make it possible to more reliably discover papers automatically. We use keyword search using the SemanticScholar API and manual curation to collect a well-formatted and reasonably comprehensive set of 5199 XAI papers, available at https://github.com/alonjacovi/XAI-Scholar . We use this collection to clarify and visualize trends about the size and scope of the literature, citation trends, cross-field trends, and collaboration trends. Overall, XAI is becoming increasingly multidisciplinary, with relative growth in papers belonging to increasingly diverse (non-CS) scientific fields, increasing cross-field collaborative authorship, increasing cross-field citation activity. The collection can additionally be used as a paper discovery engine, by retrieving XAI literature which is cited according to specific constraints (for example, papers that are influential outside of their field, or influential to non-XAI research).


A Solver-Free Framework for Scalable Learning in Neural ILP Architectures

arXiv.org Artificial Intelligence

There is a recent focus on designing architectures that have an Integer Linear Programming (ILP) layer within a neural model (referred to as Neural ILP in this paper). Neural ILP architectures are suitable for pure reasoning tasks that require data-driven constraint learning or for tasks requiring both perception (neural) and reasoning (ILP). A recent SOTA approach for end-to-end training of Neural ILP explicitly defines gradients through the ILP black box (Paulus et al. 2021) - this trains extremely slowly, owing to a call to the underlying ILP solver for every training data point in a minibatch. In response, we present an alternative training strategy that is solver-free, i.e., does not call the ILP solver at all at training time. Neural ILP has a set of trainable hyperplanes (for cost and constraints in ILP), together representing a polyhedron. Our key idea is that the training loss should impose that the final polyhedron separates the positives (all constraints satisfied) from the negatives (at least one violated constraint or a suboptimal cost value), via a soft-margin formulation. While positive example(s) are provided as part of the training data, we devise novel techniques for generating negative samples. Our solution is flexible enough to handle equality as well as inequality constraints. Experiments on several problems, both perceptual as well as symbolic, which require learning the constraints of an ILP, show that our approach has superior performance and scales much better compared to purely neural baselines and other state-of-the-art models that require solver-based training. In particular, we are able to obtain excellent performance in 9 x 9 symbolic and visual sudoku, to which the other Neural ILP solver is not able to scale.


Medical schools are missing the mark on artificial intelligence

#artificialintelligence

Ready or not, health care is undergoing a massive transformation driven by artificial intelligence. But medical schools have barely started to teach about AI and machine learning -- creating knowledge gaps that could compound the damage caused by flawed algorithms and biased decision-support systems. "We're going to be at a point where we're not going to be able to catch up and be able to call out the technology defects or flaws," said Erkin Ötleş, a machine learning researcher working toward his medical degree and Ph.D. at the University of Michigan. "Without being armed with that set of foundational knowledge into how these things work, we're going to be at a disadvantage." In a recent commentary published in Cell Reports Medicine, Ötleş and a group of physicians and educators from the University of Michigan called for medical educators to make AI less of an afterthought and more of a core concept in undergraduate medical training.


Contrast with Major Classifier Vectors for Federated Medical Relation Extraction with Heterogeneous Label Distribution

arXiv.org Artificial Intelligence

Federated medical relation extraction enables multiple clients to train a deep network collaboratively without sharing their raw medical data. In order to handle the heterogeneous label distribution across clients, most of the existing works only involve enforcing regularization between local and global models during optimization. In this paper, we fully utilize the models of all clients and propose a novel concept of \textit{major classifier vectors}, where a group of class vectors is obtained in an ensemble rather than the weighted average method on the server. The major classifier vectors are then distributed to all clients and the local training of each client is Contrasted with Major Classifier vectors (FedCMC), so the local model is not prone to overfitting to the local label distribution. FedCMC requires only a small amount of additional transfer of classifier parameters without any leakage of raw data, extracted representations, and label distributions. Our extensive experiments show that FedCMC outperforms the other state-of-the-art FL algorithms on three medical relation extraction datasets.