2020
DOI: 10.1016/j.eswa.2020.113695
|View full text |Cite
|
Sign up to set email alerts
|

Genetic state-grouping algorithm for deep reinforcement learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…The pseudocode of the RLHO method for the TDL model is shown in Algorithm 1, where Q(•,•) refers to the set of state-action values at all time points, and the value of Q t+1 (s t , a t ) is the Q value at time point t + 1. An episode with different number of time steps is one complete play of the agents interacting with the environment in the general reinforcement learning setting [41]. end for 17: end for Figure 1 and Algorithm 1 show the main process of the RLHO method, which can be described as follows:…”
Section: Reinforcement-learning-based Hyperparameter Optimization Met...mentioning
confidence: 99%
“…The pseudocode of the RLHO method for the TDL model is shown in Algorithm 1, where Q(•,•) refers to the set of state-action values at all time points, and the value of Q t+1 (s t , a t ) is the Q value at time point t + 1. An episode with different number of time steps is one complete play of the agents interacting with the environment in the general reinforcement learning setting [41]. end for 17: end for Figure 1 and Algorithm 1 show the main process of the RLHO method, which can be described as follows:…”
Section: Reinforcement-learning-based Hyperparameter Optimization Met...mentioning
confidence: 99%
“…Several works have ascertained that the GA is more suitable for solving complex and constrained optimization problems in the area of machine learning and data mining [33], [34]. Man-Je et al [35] devised a novel genetic algorithm based on deep reinforcement learning and used it to solve long initial learning times and an overwhelming number of branching factors. Nagar et al [36] adopted a genetic algorithm for efficient feature selection to reduce the dataset dimensions and enhance the classifier pace of a knearest-neighbors technique, which was employed for diagnosing the stage of patients' disease.…”
Section: Genetic Algorithmsmentioning
confidence: 99%
“…Various specific implementation strategies of modern heuristic algorithms have been proposed independently, and there are significant differences between them. The modern heuristic algorithms include simulated annealing (SA) algorithm (Duan, 2012;Leite, Melício, and Rosa, 2019;Nino-Ruiz and Yang, 2019), genetic algorithm (GA) (Chekanin and Kulikova, 2017;Kim et al, 2020;Pandey, 2020), Tabu search (TS) algorithm (Ben Abdellafou, Hadda, and Korbaa, 2019;Mohammed and Duffuaa, 2020;Zhang et al, 2020), ant colony algorithm (ACO) (Jalali et al, 2020;Martin et al, 2020;Niu et al, 2007;Srichandum and Pothiya, 2020) and artificial neural network (ANN) (Amari, 1971;Leong et al, 2020). In recent years, an important trend related to computational intelligence has been to establish a new search mechanism based on sports competitions (Bouchekara et al, 2018;Chagwiza et al, 2016;Jaramillo et al, 2016a;Kashan, 2014a;Khattab, Sharieh, and Mahafzah, 2019;Moghdani and Salimifard, 2018;Purnomo and Wee, 2015), through which effective optimization algorithms can be designed.…”
Section: Introductionmentioning
confidence: 99%