Erkin Çilden
Orcid: 0000-0003-3451-7326
According to our database1,
Erkin Çilden
authored at least 22 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Faster MIL-based Subgoal Identification for Reinforcement Learning by Tuning Fewer Hyperparameters.
ACM Trans. Auton. Adapt. Syst., June, 2024
2023
Correction: Landmark based guidance for reinforcement learning agents under partial observability.
Int. J. Mach. Learn. Cybern., April, 2023
Landmark based guidance for reinforcement learning agents under partial observability.
Int. J. Mach. Learn. Cybern., April, 2023
2022
Using chains of bottleneck transitions to decompose and solve reinforcement learning tasks with hidden states.
Future Gener. Comput. Syst., 2022
2019
Knowl. Eng. Rev., 2019
Adv. Complex Syst., 2019
A reference architecture for military simulations with experimentation and analysis features.
Proceedings of the 2019 Summer Simulation Conference, 2019
Proceedings of the 2019 Summer Simulation Conference, 2019
Proceedings of the PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
2018
Proceedings of the 26th Signal Processing and Communications Applications Conference, 2018
A Generic Distributed Architecture to Integrate Simulated Participants with Modular Avionics.
Proceedings of the 22nd IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, 2018
2017
A Concept Filtering Approach for Diverse Density to Discover Subgoals in Reinforcement Learning.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017
Using Transitional Bottlenecks to Improve Learning in Nearest Sequence Memory Algorithm.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017
2016
Local Roots: A Tree-Based Subgoal Discovery Method to Accelerate Reinforcement Learning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016
A History Tree Heuristic to Generate Better Initiation Sets for Options in Reinforcement Learning.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
2015
Toward Generalization of Automated Temporal Abstraction to Partially Observable Reinforcement Learning.
IEEE Trans. Cybern., 2015
Proceedings of the 2nd IEEE International Conference on Cybernetics, 2015
2014
Abstraction in reinforcement learning in partially observable environments ; Kısmi gözlemlenebilir ortamlar için pekiştirmeli öğrenmede soyutlama.
PhD thesis, 2014
Employing Automatic Temporal Abstractions to Accelerate Utile Suffix Memory Algorithm.
Proceedings of the Multiagent System Technologies - 12th German Conference, 2014
2013
Generating Memoryless Policies Faster Using Automatic Temporal Abstractions for Reinforcement Learning with Hidden State.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013
2012
Abstraction in Model Based Partially Observable Reinforcement Learning Using Extended Sequence Trees.
Proceedings of the 2012 IEEE/WIC/ACM International Conferences on Intelligent Agent Technology, 2012