On the Convergence and Sample Complexity Analysis of Deep Q-Networks with ε-Greedy Exploration.
Shuai ZhangHongkang LiMeng WangMiao LiuPin-Yu ChenSongtao LuSijia LiuKeerthiram MurugesanSubhajit ChaudhuryPublished in: CoRR (2023)
Keyphrases
- complexity analysis
- theoretical analysis
- lower bound
- greedy algorithm
- first order logic
- social networks
- convergence rate
- randomly selected
- network model
- complex networks
- machine learning
- heterogeneous networks
- network design
- dynamic programming
- computational complexity
- search algorithm
- sample size
- bayesian networks
- case study
- data sets
- information visualization
- small sample
- iterative algorithms
- global convergence