Search Results for author: JunKyu Lee

Found 6 papers, 2 papers with code

Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning

1 code implementation1 Apr 2024 Michael Katz, JunKyu Lee, Jungkoo Kang, Shirin Sohrabi

The ability to generate multiple plans is central to using planning in real-life applications.

Unifying and Certifying Top-Quality Planning

no code implementations5 Mar 2024 Michael Katz, JunKyu Lee, Shirin Sohrabi

We show that task transformations found in the existing literature can be employed for the efficient certification of various top-quality planning problems and propose a novel transformation to efficiently certify loopless top-quality planning.

Foundation Model Sherpas: Guiding Foundation Models through Knowledge and Reasoning

no code implementations2 Feb 2024 Debarun Bhattacharjya, JunKyu Lee, Don Joven Agravante, Balaji Ganesan, Radu Marinescu

Foundation models (FMs) such as large language models have revolutionized the field of AI by showing remarkable performance in various tasks.

ROMA: Run-Time Object Detection To Maximize Real-Time Accuracy

no code implementations28 Oct 2022 JunKyu Lee, Blesson Varghese, Hans Vandierendonck

This paper analyzes the effects of dynamically varying video contents and detection latency on the real-time detection accuracy of a detector and proposes a new run-time accuracy variation model, ROMA, based on the findings from the analysis.

object-detection Real-Time Object Detection

Hierarchical Reinforcement Learning with AI Planning Models

1 code implementation1 Mar 2022 JunKyu Lee, Michael Katz, Don Joven Agravante, Miao Liu, Geraud Nangue Tasse, Tim Klinger, Shirin Sohrabi

Our approach defines options in hierarchical reinforcement learning (HRL) from AIP operators by establishing a correspondence between the state transition model of AI planning problem and the abstract state transition system of a Markov Decision Process (MDP).

Decision Making Hierarchical Reinforcement Learning +2

Cannot find the paper you are looking for? You can Submit a new open access paper.