Goto

Collaborating Authors

 Energy


Robotics and Artificial Intelligence in solar energy - ELE Times

#artificialintelligence

A one of a kind opportunity exists to apply AI to a particular part of the clean energy value chain: materials. Materials fill in as the structure blocks of clean energy, for example, the solar cells that make up the photovoltaic panels found on rooftops. Enhancing the materials used to manufacture parts of clean energy is significant on the grounds that current materials are frequently lethal, non-earth rich, and require carbon-concentrated processing. Without getting excessively technical, basically, the entire reason of AI is a machine emulating the human brain. The machine can learn and adjust to various situations, and as time passes, the machine gets smarter and responds diversely to accomplish better outcomes.


Mining User Behaviour from Smartphone data, a literature review

arXiv.org Machine Learning

To study users' travel behaviour and travel time between origin and destination, researchers employ travel surveys. Although there is consensus in the field about the potential, after over ten years of research and field experimentation, Smartphone-based travel surveys still did not take off to a large scale. Here, computer intelligence algorithms take the role that operators have in Traditional Travel Surveys; since we train each algorithm on data, performances rest on the data quality, thus on the ground truth. Inaccurate validations affect negatively: labels, algorithms' training, travel diaries precision, and therefore data validation, within a very critical loop. Interestingly, boundaries are proven burdensome to push even for Machine Learning methods. To support optimal investment decisions for practitioners, we expose the drivers they should consider when assessing what they need against what they get. This paper highlights and examines the critical aspects of the underlying research and provides some recommendations: (i) from the device perspective, on the main physical limitations; (ii) from the application perspective, the methodological framework deployed for the automatic generation of travel diaries; (iii)from the ground truth perspective, the relationship between user interaction, methods, and data.


Robust Group Synchronization via Cycle-Edge Message Passing

arXiv.org Machine Learning

We propose a general framework for group synchronization with adversarial corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that uses cycle consistency information in order to estimate the corruption levels of group ratios and consequently infer the corrupted group ratios and solve the synchronization problem. We first explain why the group cycle consistency information is essential for effectively solving group synchronization problems. We then establish exact recovery and linear convergence guarantees for the proposed message passing procedure under a deterministic setting with adversarial corruption. These guarantees hold as long as the ratio of corrupted cycles per edge is bounded by a reasonable constant. We also establish the stability of the proposed procedure to sub-Gaussian noise. We further show that under a uniform corruption model, the recovery results are sharp in terms of an information-theoretic bound.


Enterprise technology predictions for 2020 from 20 industry experts

#artificialintelligence

In 2019 digital technologies continued to transform enterprises. Businesses have embraced artificial intelligence, explored blockchain and grappled growing privacy concerns. But what predictions do experts have for enterprise technology in 2020? We heard from experts from a range of sectors about their enterprise tech predictions for 2020, from edge computing to sustainable data centres. In 2020, organisations will begin to fully exploit the potential of edge computing.


Facebook's AI Chief Talks AR Glasses, AI, And Machine Learning

#artificialintelligence

Facebook AI Research chief AI scientist Yann LeCun believes augmented reality glasses are an ideal challenge for machine learning (ML) practitioners -- a "killer app" -- because they involve a confluence of unsolved problems. Perfect AR glasses will require the combination of conversational AI, computer vision, and other complex systems capable of operating with a form factor as small as a pair of spectacles. Low-power AI will be necessary to ensure reasonable battery life so users can wear and use the glasses for long periods of time. Alongside companies like Apple, Niantic, and Qualcomm, Facebook this fall confirmed plans to make augmented reality glasses by 2025. "This is a huge challenge for hardware because you might have glasses with cameras that track your vision in real time at variable latency, so when you move โ€ฆ that requires quite a bit of computation. You want to be able to interact with an assistant through voice by talking to it so it listens to you all the time, and it will talk to you as well. You want to have gesture [recognition] so the assistant [can perform] real-time hand tracking," he said.


Monte-Carlo Tree Search for Policy Optimization

arXiv.org Artificial Intelligence

Gradient-based methods are often used for policy optimization in deep reinforcement learning, despite being vulnerable to local optima and saddle points. Although gradient-free methods (e.g., genetic algorithms or evolution strategies) help mitigate these issues, poor initialization and local optima are still concerns in highly nonconvex spaces. This paper presents a method for policy optimization based on Monte-Carlo tree search and gradient-free optimization. Our method, called Monte-Carlo tree search for policy optimization (MCTSPO), provides a better exploration-exploitation trade-off through the use of the upper confidence bound heuristic. We demonstrate improved performance on reinforcement learning tasks with deceptive or sparse reward functions compared to popular gradient-based and deep genetic algorithm baselines.


Sparse Polynomial Chaos expansions using Variational Relevance Vector Machines

arXiv.org Machine Learning

These challenges can be addressed by enforcing sparsity in the series representation through retaining only the most important basis terms. In this work, we present a novel sparse Bayesian learning technique for obtaining sparse Polynomial Chaos expansions which is based on a Relevance Vector Machine model and is trained using Variational Inference. The methodology shows great potential in high-dimensional data-driven settings using relatively few data points and achieves user-controlled sparse levels that are comparable to other methods such as compressive sensing. The proposed approach is illustrated on two numerical examples, a synthetic response function that is explored for validation purposes and a low-carbon steel plate with random Young's modulus and random loading, which is modelled by stochastic finite element with 38 input random variables.


Layerwise Noise Maximisation to Train Low-Energy Deep Neural Networks

arXiv.org Machine Learning

--Deep neural networks (DNNs) depend on the storage of a large number of parameters, which consumes an important portion of the energy used during inference. This paper considers the case where the energy usage of memory elements can be reduced at the cost of reduced reliability. A training algorithm is proposed to optimize the reliability of the storage separately for each layer of the network, while incurring a negligible complexity overhead compared to a conventional stochastic gradient descent training. For an exponential energy-reliability model, the proposed training approach can decrease the memory energy consumption of a DNN with binary parameters by 3.3 at isoaccuracy, compared to a reliable implementation. I NTRODUCTION Deep learning [1] has attracted a lot of interest since 2012 and AlexNet's achievements on ImageNet [2], sparking a rapid improvement of the state-of-the-art in diverse fields. However the tradeoff for such results is an antagonizing growth in resource requirements.


Tensor Basis Gaussian Process Models of Hyperelastic Materials

arXiv.org Machine Learning

In this work, we develop Gaussian process regression (GPR) models of hyperelastic material behavior. First, we consider the direct approach of modeling the components of the Cauchy stress tensor as a function of the components of the Finger stretch tensor in a Gaussian process. We then consider an improvement on this approach that embeds rotational invariance of the stress-stretch constitutive relation in the GPR representation. This approach requires fewer training examples and achieves higher accuracy while maintaining invariance to rotations exactly. Finally, we consider an approach that recovers the strain-energy density function and derives the stress tensor from this potential. Although the error of this model for predicting the stress tensor is higher, the strain-energy density is recovered with high accuracy from limited training data. The approaches presented here are examples of physics-informed machine learning. They go beyond purely data-driven approaches by embedding the physical system constraints directly into the Gaussian process representation of materials models.


Plug and Play Language Models: A Simple Approach to Controlled Text Generation

arXiv.org Artificial Intelligence

Large transformer-based language models (LMs) trained on huge text corpora have shown unparalleled generation capabilities. However, controlling attributes of the generated language (e.g. switching topic or sentiment) is difficult without modifying the model architecture or fine-tuning on attribute-specific data and entailing the significant cost of retraining. We propose a simple alternative: the Plug and Play Language Model (PPLM) for controllable language generation, which combines a pretrained LM with one or more simple attribute classifiers that guide text generation without any further training of the LM. In the canonical scenario we present, the attribute models are simple classifiers consisting of a user-specified bag of words or a single learned layer with 100,000 times fewer parameters than the LM. Sampling entails a forward and backward pass in which gradients from the attribute model push the LM's hidden activations and thus guide the generation. Model samples demonstrate control over a range of topics and sentiment styles, and extensive automated and human annotated evaluations show attribute alignment and fluency. PPLMs are flexible in that any combination of differentiable attribute models may be used to steer text generation, which will allow for diverse and creative applications beyond the examples given in this paper.