Energy
No-PASt-BO: Normalized Portfolio Allocation Strategy for Bayesian Optimization
Vasconcelos, Thiago de P., de Souza, Daniel A. R. M. A., Mattos, César L. C., Gomes, João P. P.
Bayesian Optimization (BO) is a framework for black-box optimization that is especially suitable for expensive cost functions. Among the main parts of a BO algorithm, the acquisition function is of fundamental importance, since it guides the optimization algorithm by translating the uncertainty of the regression model in a utility measure for each point to be evaluated. Considering such aspect, selection and design of acquisition functions are one of the most popular research topics in BO. Since no single acquisition function was proved to have better performance in all tasks, a well-established approach consists of selecting different acquisition functions along the iterations of a BO execution. In such an approach, the GP-Hedge algorithm is a widely used option given its simplicity and good performance. Despite its success in various applications, GP-Hedge shows an undesirable characteristic of accounting on all past performance measures of each acquisition function to select the next function to be used. In this case, good or bad values obtained in an initial iteration may impact the choice of the acquisition function for the rest of the algorithm. This fact may induce a dominant behavior of an acquisition function and impact the final performance of the method. Aiming to overcome such limitation, in this work we propose a variant of GP-Hedge, named No-PASt-BO, that reduce the influence of far past evaluations. Moreover, our method presents a built-in normalization that avoids the functions in the portfolio to have similar probabilities, thus improving the exploration. The obtained results on both synthetic and real-world optimization tasks indicate that No-PASt-BO presents competitive performance and always outperforms GP-Hedge.
Learning When to Drive in Intersections by Combining Reinforcement Learning and Model Predictive Control
Tram, Tommy, Batkovic, Ivo, Ali, Mohammad, Sjöberg, Jonas
Learning When to Drive in Intersections by Combining Reinforcement Learning and Model Predictive Control Tommy Tram 1, 2, 3, Ivo Batkovic 1, 2, 3, Mohammad Ali 1, and Jonas Sj oberg 2 Abstract -- In this paper, we propose a decision making algorithm intended for automated vehicles that negotiate with other possibly non-automated vehicles in intersections. The decision algorithm is separated into two parts: a high-level decision module based on reinforcement learning, and a low-level planning module based on model predictive control. Traffic is simulated with numerous predefined driver behaviors and intentions, and the performance of the proposed decision algorithm was evaluated against another controller . The results show that the proposed decision algorithm yields shorter training episodes and an increased performance in success rate compared to the other controller . Interactions between road users in intersections is a complex problem to solve, making it difficult to address using conventional rule based systems. Many advancements aim to solve this problem by trying to imitate human drivers [1] or predicting what other drivers in traffic are planning to do [2]. In [3], the authors show that by modeling the decision process as a partially observable Markov decision process, the model can account for uncertainty in sensing the environment and [4] showed some probabilistic guarantees when solving the problem using reinforcement learning (RL).
Machine Learning at the Network Edge: A Survey
Murshed, M. G. Sarwar, Murphy, Christopher, Hou, Daqing, Khan, Nazar, Ananthanarayanan, Ganesh, Hussain, Faraz
Devices comprising the Internet of Things, such as sensors and small cameras, usually have small memories and limited computational power. The proliferation of such resource-constrained devices in recent years has led to the generation of large quantities of data. These data-producing devices are appealing targets for machine learning applications but struggle to run machine learning algorithms due to their limited computing capability. They typically offload input data to external computing systems (such as cloud servers) for further processing. The results of the machine learning computations are communicated back to the resource-scarce devices, but this worsens latency, leads to increased communication costs, and adds to privacy concerns. Therefore, efforts have been made to place additional computing devices at the edge of the network, i.e close to the IoT devices where the data is generated. Deploying machine learning systems on such edge devices alleviates the above issues by allowing computations to be performed close to the data sources. This survey describes major research efforts where machine learning has been deployed at the edge of computer networks.
Calculating Route: Where Is Artificial Intelligence Propelling Work?
The World Economic Forum predicts that while some jobs will be eliminated due to Artificial Intelligence, many will change or be added, with a net gain. While on my morning commute, I noticed a bumper sticker in front of me read "Where are we going? And why am I in a handbasket?" With intelligent tech on my mind, my optimistic self instinctively responded: "No, we are not heading to our doom in a handbasket! We will soon live in a world where intelligent technologies will create jobs, clean the oceans, save lives and we'll all live happily ever after."
Time Series Analysis of Big Data for Electricity Price and Demand to Find Cyber-Attacks part 2: Decomposition Analysis
Rakhshandehroo, Mohsen, Rajabdorri, Mohammad
-- In this paper, in following of the first part (which ADF tests using ACI evaluation) has conducted, Time Series (TSs) are analyzed using decomposition analysis. In fact, TSs are composed of four components including trend (long term be - haviour or progression of series), cyclic component ( non - periodic fluctuation behaviour which are usually long term), seasonal component (periodic fluctuations due to seasonal variations like temperature, weather condition and etc.) and error term. The first method is additive decomposition and the second is mu ltiplicative method to decompose a TS into its components. After decomposition, the error term is tested using Durbin - Watson and Breusch - Godfrey test to see whether the error follows any predictable pattern, it can be concluded that there is a chance of cy ber - attack to the system. In this paper, to find out that TS errors (or called residual's interchangeably)follows any particular patterns or not and to obtain t he residual values of TSs, we conducted two classical methods of TS decomposition and then we analyzed the residual terms of TSs for both decomposition method to find anomaly in residual distributions.
A Temporal Clustering Algorithm for Achieving the trade-off between the User Experience and the Equipment Economy in the Context of IoT
Ponte, Caio, Caminha, Carlos, Bomfim, Rafael, Moreira, Ronaldo, Furtado, Vasco
We present here the Temporal Clustering Algorithm (TCA), an incremental learning algorithm applicable to problems of anticipatory computing in the context of the Internet of Things. This algorithm was tested in a specific prediction scenario of consumption of an electric water dispenser typically used in tropical countries, in which the ambient temperature is around 30-degree Celsius. In this context, the user typically wants to drinking iced water therefore uses the cooler function of the dispenser. Real and synthetic water consumption data was used to test a forecasting capacity on how much energy can be saved by predicting the pattern of use of the equipment. In addition to using a small constant amount of memory, which allows the algorithm to be implemented at the lowest cost, while using microcontrollers with a small amount of memory (less than 1Kbyte) available on the market. The algorithm can also be configured according to user preference, prioritizing comfort, keeping the water at the desired temperature longer, or prioritizing energy savings. The main result is that the TCA achieved energy savings of up to 40% compared to the conventional mode of operation of the dispenser with an average success rate higher than 90% in its times of use.
A Mathematical Model for Linguistic Universals
W e present a Markov model at the discourse level for Steven Pinker's "mentalese", or chains of mental states that transcend the spoken/written forms. Such (potentially) universal temporal structures of textual pa tterns lead us to a language-independent semantic representation, or a translationally-invariant word embe dding, thereby forming the common ground for both comprehensibility within a given language and transla tability between different languages. Applying our model to documents of moderate lengths, without relying on external knowledge bases, we reconcile Noam Chomsky's "poverty of stimulus" paradox with statisti cal learning of natural languages. W e human beings distinguish ourselves from other animals ( 1-3), in that our brain development ( 4-6) enables us to convey sophisticated ideas and to share individual experience s, via languages ( 7-9). Texts written in natural languages constitute a major medium that perpetuates our civilizations ( 10), as a cumulative body of knowledge.
Digital Transformation And The AI Advantage
Wait, the artificial intelligence (AI) advantage is already here and gone? That's what Deloitte warns in the report "Future in the balance? How countries are pursuing an AI advantage." "There are indications that the window for competitive differentiation with AI is rapidly closing. As AI technologies become easier to consume and get embedded in an increasing number of products and services, the early-mover advantage will rapidly diminish."
Artificial Intelligence Set Loose On Old Scientific Papers Discovers Something Humans Missed
Researchers at Lawrence Berkeley National Laboratory have developed an artificial intelligence (AI) that, with very little training, has made discoveries in material science. To spot what scientists had missed, all the AI had to do was read millions of previously published scientific papers. The AI approach is known as machine learning. It is an algorithm capable of being trained on a particular task until, after many iterations, it can produce something that makes sense. Machine-learning approaches are being used to solve many problems, and this team used it to look for latent knowledge in the world of materials science.
Microsoft and Schneider Electric launch AI for Green Energy
Microsoft and digital energy management and automation solution provider Schneider Electric have partnered to launch AI for Green Energy, a new accelerator programme for Microsoft's AI Factory. Through the programme, Microsoft and Schneider will help start-ups use artificial intelligence (AI) to transform the energy sector in Europe, decreasing consumption and increasing energy efficiency. These entrepreneurs will be able to learn from the technical and business expertise of the two companies during a three-month acceleration period. "We are delighted to leverage our ecosystem of partners to serve the most important causes to society, thanks to the start-ups of tomorrow," said Agnès Van de Walle, director of Microsoft's One Commercial Partner group. "Schneider Electric will bring in-depth expertise and personalised support, accelerating innovation across the energy sector."