Deep Learning
Autonomous discovery in the chemical sciences part II: Outlook
Coley, Connor W., Eyke, Natalie S., Jensen, Klavs F.
This two-part review examines how automation has contributed to different aspects of discovery in the chemical sciences. In this second part, we reflect on a selection of exemplary studies. It is increasingly important to articulate what the role of automation and computation has been in the scientific process and how that has or has not accelerated discovery. One can argue that even the best automated systems have yet to ``discover'' despite being incredibly useful as laboratory assistants. We must carefully consider how they have been and can be applied to future problems of chemical discovery in order to effectively design and interact with future autonomous platforms. The majority of this article defines a large set of open research directions, including improving our ability to work with complex data, build empirical models, automate both physical and computational experiments for validation, select experiments, and evaluate whether we are making progress toward the ultimate goal of autonomous discovery. Addressing these practical and methodological challenges will greatly advance the extent to which autonomous systems can make meaningful discoveries.
Coronavirus Optimization Algorithm: A bioinspired metaheuristic based on the COVID-19 propagation model
Martรญnez-รlvarez, F., Asencio-Cortรฉs, G., Torres, J. F., Gutiรฉrrez-Avilรฉs, D., Melgar-Garcรญa, L., Pรฉrez-Chacรณn, R., Rubio-Escudero, C., Riquelme, J. C., Troncoso, A.
A novel bioinspired metaheuristic is proposed in this work, simulating how the Coronavirus spreads and infects healthy people. From an initial individual (the patient zero), the coronavirus infects new patients at known rates, creating new populations of infected people. Every individual can either die or infect and, afterwards, be sent to the recovered population. Relevant terms such as re-infection probability, super-spreading rate or traveling rate are introduced in the model in order to simulate as accurately as possible the coronavirus activity. The Coronavirus Optimization Algorithm has two major advantages compared to other similar strategies. First, the input parameters are already set according to the disease statistics, preventing researchers from initializing them with arbitrary values. Second, the approach has the ability of ending after several iterations, without setting this value either. Infected population initially grows at an exponential rate but after some iterations, the high number recovered and dead people starts decreasing the number of infected people in new iterations. As application case, it has been used to train a deep learning model for electricity load forecasting, showing quite remarkable results after few iterations.
Deep Reinforcement Learning with Weighted Q-Learning
Cini, Andrea, D'Eramo, Carlo, Peters, Jan, Alippi, Cesare
Overestimation of the maximum action-value is a well-known problem that hinders Q-Learning performance, leading to suboptimal policies and unstable learning. Among several Q-Learning variants proposed to address this issue, Weighted Q-Learning (WQL) effectively reduces the bias and shows remarkable results in stochastic environments. WQL uses a weighted sum of the estimated action-values, where the weights correspond to the probability of each action-value being the maximum; however, the computation of these probabilities is only practical in the tabular settings. In this work, we provide the methodological advances to benefit from the WQL properties in Deep Reinforcement Learning (DRL), by using neural networks with Dropout Variational Inference as an effective approximation of deep Gaussian processes. In particular, we adopt the Concrete Dropout variant to obtain calibrated estimates of epistemic uncertainty in DRL. We show that model uncertainty in DRL can be useful not only for action selection, but also action evaluation. We analyze how the novel Weighted Deep Q-Learning algorithm reduces the bias w.r.t. relevant baselines and provide empirical evidence of its advantages on several representative benchmarks.
Python Engineer
KNN (K Nearest Neighbors) in Python - Machine Learning From Scratch 01 - Python Tutorial 7,679 views 6 months ago In this Machine Learning from Scratch Tutorial, we are going to implement the K Nearest Neighbors (KNN) algorithm, using only built-in Python modules and numpy. We will also learn about the concept and the math behind this popular ML algorithm. If you enjoyed this video, please subscribe to the channel! The code can be found here: https://github.com/python-e...... You can find me here: Website: https://www.python-engineer... Twitter: https://twitter.com/python_... GitHub: https://github.com/python-e... #Python #MachineLearning Show less Read more Uploads Play all Complete FREE Study Guide for Machine Learning and Deep Learning - Duration: 12 minutes, 21 seconds.
Primer: Demystifying Data Science - The New Stack
This is the first part of a series by Levon Paradzhanyan that demystifies data science, machine learning, deep learning, and artificial intelligence down while explaining how they all tie into one another. Artificial Intelligence emerged in our lives many years ago. First, as science fiction and today embedded in real products. It has since been followed by newer buzzwords such as data science, machine learning, and deep learning. Yet there are many misconceptions related to these terms.
Researchers propose paradigm that trains AI agents through evolution
A paper published by researchers at Carnegie Mellon University, San Francisco research firm OpenAI, Facebook AI Research, the University of California at Berkeley, and Shanghai Jiao Tong University describes a paradigm that scales up multi-agent reinforcement learning, where AI models learn by having agents interact within an environment such that the agent population increases in size over time. By maintaining sets of agents in each training stage and performing mix-and-match and fine-tuning steps over these sets, the coauthors say the paradigm -- Evolutionary Population Curriculum -- is able to promote agents with the best adaptability to the next stage. In computer science, evolutionary computation is the family of algorithms for global optimization inspired by biological evolution. Instead of following explicit mathematical gradients, these models generate variants, test them, and retain the top performers. They've shown promise in early work by OpenAI, Google, Uber, and others, but they're somewhat tough to prototype because there's a dearth of tools targeting evolutionary algorithms and natural evolution strategies (NES).
End to End Chatbot using Sequence to Sequence Architecture
Ever felt bored when you are all alone? Had a thought of talking to someone who could give you witty replies? If that is the case why not train one to be? I mean a deep learning model. Yes, since the past half-decade deep learning has grown humongously powerful with evolution of state-of-the-art architectures and algorithms that were brought up into the limelight as part of tons of research that's happening around the world.