Titlebook: Analysis of Images, Social Networks and Texts; 8th International Co Wil M. P. van der Aalst,Vladimir Batagelj,Elena Tu Conference proceedin

Ballad

Optimizing Q-Learning with K-FAC AlgorithmBeing more expensive to compute than plain stochastic gradient descent, K-FAC allows the agent to converge a bit faster in terms of epochs compared to Adam on simple reinforcement learning tasks and tend to be more stable and less strict to hyperparameters selection. Considering the latest results w

影响

Evolutionary Algorithms for Constructing an Ensemble of Decision Treesral methods for induction of decision trees and their ensembles based on evolutionary algorithms. The main difference of our approach is using real-valued vector representation of decision tree that allows to use a large number of different optimization algorithms, as well as optimize the whole tree