Accuracy
Fast convolutional neural networks on FPGAs with hls4ml
Aarrestad, Thea, Loncar, Vladimir, Pierini, Maurizio, Summers, Sioni, Ngadiuba, Jennifer, Petersson, Christoffer, Linander, Hampus, Iiyama, Yutaro, Di Guglielmo, Giuseppe, Duarte, Javier, Harris, Philip, Rankin, Dylan, Jindariani, Sergo, Pedro, Kevin, Tran, Nhan, Liu, Mia, Kreinar, Edward, Wu, Zhenbin, Hoang, Duc
The hls4ml library [1, 2] is an open source software designed to facilitate the deployment of machine learning (ML) models on field-programmable gate arrays (FPGAs), targeting low-latency and low-power edge applications. Taking as input a neural network model, hls4ml generates C/C code designed to be transpiled into FPGA firmware by processing it with a high-level synthesis (HLS) library. The development of hls4ml was historically driven by the need to integrate ML algorithms in the first stage of the real-time data processing of particle physics experiments operating at the CERN Large Hadron Collider (LHC). The LHC produces high-energy proton collisions (or events) every 25 ns, each consisting of about 1 MB of raw data. Since this throughput is overwhelming for the currently available processing and storage resources, the LHC experiments run a real-time event selection system, the so-called Level-1 trigger (L1T), to reduce the event rate from 40 MHz to 100 kHz [3-6]. Due to the size of the buffering system, the L1T system operates with a fixed latency of O(1 µs). While hls4ml excels as a tool to automatically generate low-latency ML firmware for L1T applications, it also offers interesting opportunities for edge-computing applications beyond particle physics whenever efficient, e.g.
How AI Developers Overcome Communication Challenges in a Multidisciplinary Team: A Case Study
Piorkowski, David, Park, Soya, Wang, April Yi, Wang, Dakuo, Muller, Michael, Portnoy, Felix
The development of AI applications is a multidisciplinary effort, involving multiple roles collaborating with the AI developers, an umbrella term we use to include data scientists and other AI-adjacent roles on the same team. During these collaborations, there is a knowledge mismatch between AI developers, who are skilled in data science, and external stakeholders who are typically not. This difference leads to communication gaps, and the onus falls on AI developers to explain data science concepts to their collaborators. In this paper, we report on a study including analyses of both interviews with AI developers and artifacts they produced for communication. Using the analytic lens of shared mental models, we report on the types of communication gaps that AI developers face, how AI developers communicate across disciplinary and organizational boundaries, and how they simultaneously manage issues regarding trust and expectations.
Top Program Construction and Reduction for polynomial time Meta-Interpretive Learning
Patsantzis, Stassa, Muggleton, Stephen H.
Meta-Interpretive Learners, like most ILP systems, learn by searching for a correct hypothesis in the hypothesis space, the powerset of all constructible clauses. We show how this exponentially-growing search can be replaced by the construction of a Top program: the set of clauses in all correct hypotheses that is itself a correct hypothesis. We give an algorithm for Top program construction and show that it constructs a correct Top program in polynomial time and from a finite number of examples. We implement our algorithm in Prolog as the basis of a new MIL system, Louise, that constructs a Top program and then reduces it by removing redundant clauses. We compare Louise to the state-of-the-art search-based MIL system Metagol in experiments on grid world navigation, graph connectedness and grammar learning datasets and find that Louise improves on Metagol's predictive accuracy when the hypothesis space and the target theory are both large, or when the hypothesis space does not include a correct hypothesis because of "classification noise" in the form of mislabelled examples. When the hypothesis space or the target theory are small, Louise and Metagol perform equally well.
Video action recognition for lane-change classification and prediction of surrounding vehicles
Biparva, Mahdi, Fernández-Llorca, David, Izquierdo-Gonzalo, Rubén, Tsotsos, John K.
In highway scenarios, an alert human driver will typically anticipate early cut-in/cut-out maneuvers of surrounding vehicles using visual cues mainly. Autonomous vehicles must anticipate these situations at an early stage too, to increase their safety and efficiency. In this work, lane-change recognition and prediction tasks are posed as video action recognition problems. Up to four different two-stream-based approaches, that have been successfully applied to address human action recognition, are adapted here by stacking visual cues from forward-looking video cameras to recognize and anticipate lane-changes of target vehicles. We study the influence of context and observation horizons on performance, and different prediction horizons are analyzed. The different models are trained and evaluated using the PREVENTION dataset. The obtained results clearly demonstrate the potential of these methodologies to serve as robust predictors of future lane-changes of surrounding vehicles proving an accuracy higher than 90% in time horizons of between 1-2 seconds.
Bootstrapping Motor Skill Learning with Motion Planning
Abbatematteo, Ben, Rosen, Eric, Tellex, Stefanie, Konidaris, George
Learning a robot motor skill from scratch is impractically slow; so much so that in practice, learning must be bootstrapped using a good skill policy obtained from human demonstration. However, relying on human demonstration necessarily degrades the autonomy of robots that must learn a wide variety of skills over their operational lifetimes. We propose using kinematic motion planning as a completely autonomous, sample efficient way to bootstrap motor skill learning for object manipulation. We demonstrate the use of motion planners to bootstrap motor skills in two complex object manipulation scenarios with different policy representations: opening a drawer with a dynamic movement primitive representation, and closing a microwave door with a deep neural network policy. We also show how our method can bootstrap a motor skill for the challenging dynamic task of learning to hit a ball off a tee, where a kinematic plan based on treating the scene as static is insufficient to solve the task, but sufficient to bootstrap a more dynamic policy. In all three cases, our method is competitive with human-demonstrated initialization, and significantly outperforms starting with a random policy. This approach enables robots to to efficiently and autonomously learn motor policies for dynamic tasks without human demonstration.
Machine Learning Towards Intelligent Systems: Applications, Challenges, and Opportunities
Injadat, MohammadNoor, Moubayed, Abdallah, Nassif, Ali Bou, Shami, Abdallah
The emergence and continued reliance on the Internet and related technologies has resulted in the generation of large amounts of data that can be made available for analyses. However, humans do not possess the cognitive capabilities to understand such large amounts of data. Machine learning (ML) provides a mechanism for humans to process large amounts of data, gain insights about the behavior of the data, and make more informed decision based on the resulting analysis. ML has applications in various fields. This review focuses on some of the fields and applications such as education, healthcare, network security, banking and finance, and social media. Within these fields, there are multiple unique challenges that exist. However, ML can provide solutions to these challenges, as well as create further research opportunities. Accordingly, this work surveys some of the challenges facing the aforementioned fields and presents some of the previous literature works that tackled them. Moreover, it suggests several research opportunities that benefit from the use of ML to address these challenges.
An Unsupervised Normalization Algorithm for Noisy Text: A Case Study for Information Retrieval and Stance Detection
Roy, Anurag, Ghosh, Shalmoli, Ghosh, Kripabandhu, Ghosh, Saptarshi
A large fraction of textual data available today contains various types of 'noise', such as OCR noise in digitized documents, noise due to informal writing style of users on microblogging sites, and so on. To enable tasks such as search/retrieval and classification over all the available data, we need robust algorithms for text normalization, i.e., for cleaning different kinds of noise in the text. There have been several efforts towards cleaning or normalizing noisy text; however, many of the existing text normalization methods are supervised and require language-dependent resources or large amounts of training data that is difficult to obtain. We propose an unsupervised algorithm for text normalization that does not need any training data / human intervention. The proposed algorithm is applicable to text over different languages, and can handle both machine-generated and human-generated noise. Experiments over several standard datasets show that text normalization through the proposed algorithm enables better retrieval and stance detection, as compared to that using several baseline text normalization methods. Implementation of our algorithm can be found at https://github.com/ranarag/UnsupClean.
FDA warns UK coronavirus variant may result in false-negative tests
Former CDC Director Dr. Tom Frieden says the new strain increases the urgency for vaccines and wearing masks. The Food and Drug Administration (FDA) on Friday issued an alert about the impact viral mutations of the coronavirus may have, including the potential to result in false negative tests. The variant, B.1.1.7 was first discovered in the U.K. several weeks ago, and has been confirmed in over 50 cases in the U.S. so far. "The Food and Drug Administration is alerting clinical laboratory staff and health care providers that the FDA is monitoring the potential impact of viral mutations, including an emerging variant from the United Kingdom known as the B.1.1.7 variant, on authorized SARS-CoV-2 molecular tests, and that false negative results can occur with any molecular test for the detection of SARS-CoV-2 if a mutation occurs on the part of the virus's genome assessed by that test," the FDA said. "The SARS-CoV-2 virus can mutate over time, like all viruses, resulting in genetic variation in the population of circulating viral strains, as seen with the B.1.1.7 variant."
L.A. using coronavirus test that FDA warns may produce false negatives
The coronavirus test being provided daily to tens of thousands of residents in Los Angeles and other parts of California may be producing inaccurate results, according to a warning from federal officials that could raise questions about the accuracy of infection data shaping the pandemic response. The guidance from the Food and Drug Administration warns healthcare providers and patients that the test made by Curative, a year-old Silicon Valley start-up that supplies the oral-swab tests at L.A.'s 10 drive-through testing sites, carries a "risk of false results, particularly false negative results." To reduce the risk of false negatives, the Curative test should be used only on "symptomatic individuals within 14 days of COVID-19 symptom onset," and the swab should be observed and directed by a healthcare worker, the FDA said. The guidance, issued Monday, repeats the instructions that the FDA issued when the test was first granted an emergency-use authorization. The FDA warning appears to sharply contradict Los Angeles Mayor Eric Garcetti, who in April made coronavirus testing available to anyone, regardless of symptoms.
Approaching Neural Network Uncertainty Realism
Sicking, Joachim, Kister, Alexander, Fahrland, Matthias, Eickeler, Stefan, Hüger, Fabian, Rüping, Stefan, Schlicht, Peter, Wirtz, Tim
Statistical models are inherently uncertain. Quantifying or at least upper-bounding their uncertainties is vital for safety-critical systems such as autonomous vehicles. While standard neural networks do not report this information, several approaches exist to integrate uncertainty estimates into them. Assessing the quality of these uncertainty estimates is not straightforward, as no direct ground truth labels are available. Instead, implicit statistical assessments are required. For regression, we propose to evaluate uncertainty realism -- a strict quality criterion -- with a Mahalanobis distance-based statistical test. An empirical evaluation reveals the need for uncertainty measures that are appropriate to upper-bound heavy-tailed empirical errors. Alongside, we transfer the variational U-Net classification architecture to standard supervised image-to-image tasks. We adopt it to the automotive domain and show that it significantly improves uncertainty realism compared to a plain encoder-decoder model.