Goto

Collaborating Authors

 Country


Robots Can Do Our Jobs? No: That's Algorithmic Pseudoscience at Work

#artificialintelligence

Ironically, algorithms are telling us that machines will soon be able to do most of our jobs, but those conclusions perfectly illustrate what's non-scientific about turning human reasoning over to computers. Barely a month passes without a news story about how robots and artificial intelligence (AI) are going to devastate a significant number of the jobs in the workplace, sweeping away solid salary paying employment for factory workers and white-collar clerks alike. Just this month, the UK Parliament reported on the future of work in the face of automation, declaring that over 70% of jobs were at medium to high risk of displacement. While the report draws on a "more optimistic" study by the ONS to arrive at this prediction, the ONS used methods inspired by the even-more-frightening results in a 2013 paper by Oxford economist Carl Frey and machine learning expert Michael Osbourne, which found that almost half of jobs were at high risk, and two-thirds at medium risk. The paper was so important that in addition to shaping the methodologies of later reports (like those of the ONS, the OECD, and others), it informed a speech of the Bank of England's Chief Economist to the Trades Union Congress in 2015, prompted the "Fourth Industrial Revolution" theme of the 2016 Davos Forum, provided the basis of the WEF "Future of Jobs" report, and generated a subsequent sea of articles by journalists who rarely questioned the numbers.


Top ten IoT influencers in Q3 2019, revealed by GlobalData - GlobalData

#artificialintelligence

From Ronald van Loon to Sandy Carter, leading data and analytics company GlobalData has identified the top influencers in Internet of Things (IoT) in Q3 2019, based on data research from the company's Influencer platform. Ronald van Loon currently works as the Director at Advertisement and is recognised as a top influencer of disruptive technologies such as IoT, artificial intelligence (AI), and big data. Fabienne Neymarck is a reverse logistic manager at ascendeo France, a consumer electronics company. He provides transport relations to the INNOV8 group and has been involved in the pilotage of service providers, including invoicing, implementation of projects, and providing quality service. Evan Kirstel is a social media influencer who helps clients to leverage social media channels to improve sales and networking.


Workforce 4.0: The Human Side of Digital Transformation - Chemical Engineering

#artificialintelligence

Chemical process industries (CPI) companies are entering a critical stage in the movement toward digitalization (Industry 4.0), in which the majority of organizations are now initiating pilot projects aimed at improving operations with advanced digital tools. This includes a wide range of technologies, including data analytics, cloud computing, machine learning, artificial intelligence and many others. As the digitalization transformation of the CPI gains momentum, it has become clear that the movement is as much about people as it is about technology. The acceptance and involvement of workers is critical to the successful adoption and expansion of digital tools, as they are asked to adapt to new work practices. He emphasizes: "Companies don't adopt new technologies; people do."


Andrew Yang Is Right โ€“ The US Is Losing The AI Arms Race

#artificialintelligence

The Chinese have a very public, very-deep, extremely well-funded commitment to AI. Air Force General VeraLinn Jamieson says it plainly: "We estimate the total spending on artificial intelligence systems in China in 2017 was $12 billion. We also estimate that it will grow to at least $70 billion by 2020." According to the Obama White House Report in 2016, China publishes more journal articles on deep learning than the US and has increased its number of AI patents by 200%. China is determined to be the world leader in AI by 2030.


Building a machine learning classifier model for diabetes

#artificialintelligence

The Pima Indians of Arizona and Mexico have the highest reported prevalence of diabetes of any population in the world. A small study has been conducted to analyse their medical records to assess if it is possible to predict the onset of diabetes based on diagnostic measures. The dataset is downloaded from Kaggle, where all patients included are females at least 21 years old of Pima Indian heritage. The objective of this project is to build a predictive machine learning model to predict based on diagnostic measurements whether a patient has diabetes. This is a binary (2-class) classification project with supervised learning. Jupyter Notebook (Python) could be used to follow the process below.


Structure Learning with Similarity Preserving

arXiv.org Machine Learning

Leveraging on the underlying low-dimensional structure of data, low-rank and sparse modeling approaches have achieved great success in a wide range of applications. However, in many applications the data can display structures beyond simply being low-rank or sparse. Fully extracting and exploiting hidden structure information in the data is always desirable and favorable. To reveal more underlying effective manifold structure, in this paper, we explicitly model the data relation. Specifically, we propose a structure learning framework that retains the pairwise similarities between the data points. Rather than just trying to reconstruct the original data based on self-expression, we also manage to reconstruct the kernel matrix, which functions as similarity preserving. Consequently, this technique is particularly suitable for the class of learning problems that are sensitive to sample similarity, e.g., clustering and semisupervised classification. To take advantage of representation power of deep neural network, a deep auto-encoder architecture is further designed to implement our model. Extensive experiments on benchmark data sets demonstrate that our proposed framework can consistently and significantly improve performance on both evaluation tasks. We conclude that the quality of structure learning can be enhanced if similarity information is incorporated. Introduction With the advancements in information technology, high-dimensional data become very common for representing the data. However, it is difficult to deal Preprint submitted to Elsevier December 4, 2019 arXiv:1912.01197v1 Fortunately, in practice data are not unstructured.


Explainable artificial intelligence model to predict acute critical illness from electronic health records

arXiv.org Artificial Intelligence

We developed an explainable artificial intelligence (AI) early warning score (xAI-EWS) system for early detection of acute critical illness. While maintaining a high predictive performance, our system explains to the clinician on which relevant electronic health records (EHRs) data the prediction is grounded. Acute critical illness is often preceded by deterioration of routinely measured clinical parameters, e.g., blood pressure and heart rate. Early clinical prediction is typically based on manually calculated screening metrics that simply weigh these parameters, such as Early Warning Scores (EWS). The predictive performance of EWSs yields a tradeoff between sensitivity and specificity that can lead to negative outcomes for the patient. Previous work on EHR-trained AI systems offers promising results with high levels of predictive performance in relation to the early, real-time prediction of acute critical illness. However, without insight into the complex decisions by such system, clinical translation is hindered. In this letter, we present our xAI-EWS system, which potentiates clinical translation by accompanying a prediction with information on the EHR data explaining it.


Machine learning and serving of discrete field theories -- when artificial intelligence meets the discrete universe

arXiv.org Artificial Intelligence

A method for machine learning and serving of discrete field theories in physics is developed. The learning algorithm trains a discrete field theory from a set of observational data on a spacetime lattice, and the serving algorithm uses the learned discrete field theory to predict new observations of the field for new boundary and initial conditions. The approach to learn discrete field theories overcomes the difficulties associated with learning continuous theories by artificial intelligence. The serving algorithm of discrete field theories belongs to the family of structure-preserving geometric algorithms, which have been proven to be superior to the conventional algorithms based on discretization of differential equations. The effectiveness of the method and algorithms developed is demonstrated using the examples of nonlinear oscillations and the Kepler problem. In particular, the learning algorithm learns a discrete field theory from a set of data of planetary orbits similar to what Kepler inherited from Tycho Brahe in 1601, and the serving algorithm correctly predicts other planetary orbits, including parabolic and hyperbolic escaping orbits, of the solar system without learning or knowing Newton's laws of motion and universal gravitation. The proposed algorithms are also applicable when effects of special relativity and general relativity are important. The illustrated advantages of discrete field theories relative to continuous theories in terms of machine learning compatibility are consistent with Bostrom's simulation hypothesis.


Physically Interpretable Neural Networks for the Geosciences: Applications to Earth System Variability

arXiv.org Artificial Intelligence

Neural networks have become increasingly prevalent within the geosciences for applications ranging from numerical model parameterizations to the prediction of extreme weather. A common limitation of neural networks has been the lack of methods to interpret what the networks learn and how they make decisions. As such, neural networks have typically been used within the geosciences to accurately identify a desired output given a set of inputs, with the interpretation of what the network learns being used - if used at all - as a secondary metric to ensure the network is making the right decision for the right reason. Network interpretation techniques have become more advanced in recent years, however, and we therefore propose that the ultimate objective of using a neural network can also be the interpretation of what the network has learned rather than the output itself. We show that the interpretation of a neural network can enable the discovery of scientifically meaningful connections within geoscientific data. By training neural networks to use one or more components of the earth system to identify another, interpretation methods can be used to gain scientific insights into how and why the two components are related. In particular, we use two methods for neural network interpretation. These methods project the decision pathways of a network back onto the original input dimensions, and are called "optimal input" and layerwise relevance propagation (LRP). We then show how these interpretation techniques can be used to reliably infer scientifically meaningful information from neural networks by applying them to common climate patterns. These results suggest that combining interpretable neural networks with novel scientific hypotheses will open the door to many new avenues in neural network-related geoscience research.


Decentralised Sparse Multi-Task Regression

arXiv.org Machine Learning

We consider a sparse multi-task regression framework for fitting a collection of related sparse models. Representing models as nodes in a graph with edges between related models, a framework that fuses lasso regressions with the total variation penalty is investigated. Under a form of restricted eigenvalue assumption, bounds on prediction and squared error are given that depend upon the sparsity of each model and the differences between related models. This assumption relates to the smallest eigenvalue restricted to the intersection of two cone sets of the covariance matrix constructed from each of the agents' covariances. We show that this assumption can be satisfied if the constructed covariance matrix satisfies a restricted isometry property. In the case of a grid topology high-probability bounds are given that match, up to log factors, the no-communication setting of fitting a lasso on each model, divided by the number of agents. A decentralised dual method that exploits a convex-concave formulation of the penalised problem is proposed to fit the models and its effectiveness demonstrated on simulations against the group lasso and variants.