Proceedings of the 30th ACM International Conference on Information &Amp; Knowledge Management 2021
DOI: 10.1145/3459637.3482326
|View full text |Cite
|
Sign up to set email alerts
|

CIExplore

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…• For learning algorithm : ICM method has been implemented with some other algorithms, like COMA (Delos Reyes et al, 2022;Yang et al, 2021), PPO (Zhang et al, 2022). We could implement I-Go-Explore with such different learning algorithms.…”
Section: Concluding Remarks and Future Workmentioning
confidence: 99%
“…• For learning algorithm : ICM method has been implemented with some other algorithms, like COMA (Delos Reyes et al, 2022;Yang et al, 2021), PPO (Zhang et al, 2022). We could implement I-Go-Explore with such different learning algorithms.…”
Section: Concluding Remarks and Future Workmentioning
confidence: 99%
“…Reward sparsity is often a pervasive challenge [18] in multi-agent systems. Consequently, investigating techniques to ensure the stability or enhancement of algorithmic performance in such environments becomes essential for addressing real-world tasks [4,33,30]. The trial-and-error reward model in reinforcement learning typically involves substantial overhead costs during strategy revisions.…”
Section: Introductionmentioning
confidence: 99%
“…This approach can also be extended to multi-agent exploration problems as a joint curiosity reward shared by all agents [138]. When the ensemble of dynamics models makes consistent predictions of the next states, the agent is less curious, as it has explored the state space with low uncertainty.…”
Section: Surprisingness-and-incongruity Based Curiositymentioning
confidence: 99%