842 resultados para Reinforcement Learning,Deep Neural Networks,Python,Stable Baseline,Gym
Resumo:
Learning Bayesian networks with bounded tree-width has attracted much attention recently, because low tree-width allows exact inference to be performed efficiently. Some existing methods \cite{korhonen2exact, nie2014advances} tackle the problem by using $k$-trees to learn the optimal Bayesian network with tree-width up to $k$. Finding the best $k$-tree, however, is computationally intractable. In this paper, we propose a sampling method to efficiently find representative $k$-trees by introducing an informative score function to characterize the quality of a $k$-tree. To further improve the quality of the $k$-trees, we propose a probabilistic hill climbing approach that locally refines the sampled $k$-trees. The proposed algorithm can efficiently learn a quality Bayesian network with tree-width at most $k$. Experimental results demonstrate that our approach is more computationally efficient than the exact methods with comparable accuracy, and outperforms most existing approximate methods.
Resumo:
The focus of this work is to develop the knowledge of prediction of the physical and chemical properties of processed linear low density polyethylene (LLDPE)/graphene nanoplatelets composites. Composites made from LLDPE reinforced with 1, 2, 4, 6, 8, and 10 wt% grade C graphene nanoplatelets (C-GNP) were processed in a twin screw extruder with three different screw speeds and feeder speeds (50, 100, and 150 rpm). These applied conditions are used to optimize the following properties: thermal conductivity, crystallization temperature, degradation temperature, and tensile strength while prediction of these properties was done through artificial neural network (ANN). The three first properties increased with increase in both screw speed and C-GNP content. The tensile strength reached a maximum value at 4 wt% C-GNP and a speed of 150 rpm as this represented the optimum condition for the stress transfer through the amorphous chains of the matrix to the C-GNP. ANN can be confidently used as a tool to predict the above material properties before investing in development programs and actual manufacturing, thus significantly saving money, time, and effort.
Resumo:
Traditional heuristic approaches to the Examination Timetabling Problem normally utilize a stochastic method during Optimization for the selection of the next examination to be considered for timetabling within the neighbourhood search process. This paper presents a technique whereby the stochastic method has been augmented with information from a weighted list gathered during the initial adaptive construction phase, with the purpose of intelligently directing examination selection. In addition, a Reinforcement Learning technique has been adapted to identify the most effective portions of the weighted list in terms of facilitating the greatest potential for overall solution improvement. The technique is tested against the 2007 International Timetabling Competition datasets with solutions generated within a time frame specified by the competition organizers. The results generated are better than those of the competition winner in seven of the twelve examinations, while being competitive for the remaining five examinations. This paper also shows experimentally how using reinforcement learning has improved upon our previous technique.
Resumo:
Can neural networks learn to select an alternative based on a systematic aggregation of convicting individual preferences (i.e. a 'voting rule')? And if so, which voting rule best describes their behavior? We show that a prominent neural network can be trained to respect two fundamental principles of voting theory, the unanimity principle and the Pareto property. Building on this positive result, we train the neural network on profiles of ballots possessing a Condorcet winner, a unique Borda winner, and a unique plurality winner, respectively. We investigate which social outcome the trained neural network chooses, and find that among a number of popular voting rules its behavior mimics most closely the Borda rule. Indeed, the neural network chooses the Borda winner most often, no matter on which voting rule it was trained. Neural networks thus seem to give a surprisingly clear-cut answer to one of the most fundamental and controversial problems in voting theory: the determination of the most salient election method.
Resumo:
LOPES, Jose Soares Batista et al. Application of multivariable control using artificial neural networks in a debutanizer distillation column.In: INTERNATIONAL CONGRESS OF MECHANICAL ENGINEERING - COBEM, 19, 5-9 nov. 2007, Brasilia. Anais... Brasilia, 2007
Resumo:
[EN]In this paper an architecture for an estimator of short-term wind farm power is proposed. The estimator is made up of a Linear Machine classifier and a set of k Multilayer Perceptrons, training each one for a specific subspace of the input space. The splitting of the input dataset into the k clusters is done using a k-means technique, obtaining the equivalent Linear Machine classifier from the cluster centroids...
Resumo:
LOPES, Jose Soares Batista et al. Application of multivariable control using artificial neural networks in a debutanizer distillation column.In: INTERNATIONAL CONGRESS OF MECHANICAL ENGINEERING - COBEM, 19, 5-9 nov. 2007, Brasilia. Anais... Brasilia, 2007
Resumo:
Las dificultades a las que los estudiantes se enfrentan y su lucha por dominar los temas, podría aumentar como consecuencia de la inadecuada utilización de materiales de evaluación. Generalmente se encuentran en el aula alumnos que hacen buen uso del material de los cursos y de una manera rápida, mientras que otros presentan dificultades con el aprendizaje del material. Esta situación es fácilmente visto en los resultados de los exámenes, un grupo de estudiantes podrían obtener buenas calificaciones animándoles, mientras que otros obtendrían la mala percepción de que los temas son difíciles, y en algunos casos, obligándolos a abandonar el curso o en otros casos a cambiar de carrera. Creemos que mediante el uso de técnicas de aprendizaje automático, y en nuestro caso la utilización de redes neuronales, sería factible crear un entorno de evaluación que podrían ajustarse a las necesidades de cada estudiante. Esto último disminuiría la sensación de insatisfacción de los alumnos y el abandono de los cursos.
Resumo:
Virtual Screening (VS) methods can considerably aid clinical research, predicting how ligands interact with drug targets. Most VS methods suppose a unique binding site for the target, but it has been demonstrated that diverse ligands interact with unrelated parts of the target and many VS methods do not take into account this relevant fact. This problem is circumvented by a novel VS methodology named BINDSURF that scans the whole protein surface to find new hotspots, where ligands might potentially interact with, and which is implemented in massively parallel Graphics Processing Units, allowing fast processing of large ligand databases. BINDSURF can thus be used in drug discovery, drug design, drug repurposing and therefore helps considerably in clinical research. However, the accuracy of most VS methods is constrained by limitations in the scoring function that describes biomolecular interactions, and even nowadays these uncertainties are not completely understood. In order to solve this problem, we propose a novel approach where neural networks are trained with databases of known active (drugs) and inactive compounds, and later used to improve VS predictions.
Resumo:
In this paper we study the effect of two distinct discrete delays on the dynamics of a Wilson-Cowan neural network. This activity based model describes the dynamics of synaptically interacting excitatory and inhibitory neuronal populations. We discuss the interpretation of the delays in the language of neurobiology and show how they can contribute to the generation of network rhythms. First we focus on the use of linear stability theory to show how to destabilise a fixed point, leading to the onset of oscillatory behaviour. Next we show for the choice of a Heaviside nonlinearity for the firing rate that such emergent oscillations can be either synchronous or anti-synchronous depending on whether inhibition or excitation dominates the network architecture. To probe the behaviour of smooth (sigmoidal) nonlinear firing rates we use a mixture of numerical bifurcation analysis and direct simulations, and uncover parameter windows that support chaotic behaviour. Finally we comment on the role of delays in the generation of bursting oscillations, and discuss natural extensions of the work in this paper.
Resumo:
Ultra-slow fluctuations (0.01-0.1 Hz) are a feature of intrinsic brain activity of as yet unclear origin. We propose a candidate mechanism based on retrograde endocannabinoid signaling in a synaptically coupled network of excitatory neurons. This is known to cause depolarization-induced suppression of excitation (DISE), which we model phenomenologically. We construct emergent network oscillations in a globally coupled network and show that for strong synaptic coupling DISE can lead to a synchronized population burst at the frequencies of resting brain rhythms.
Resumo:
Dissertação de Mestrado, Engenharia Eletrónica e Telecomunicações, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2016