Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Student Research Symposium

2024

Computer Science

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

Integration Of Agent Models And Meta Reinforcement Learning (Meta-Rl) Algorithms For Car Racing Experiment, Vidyavarshini Holenarasipur Jayashankar May 2024

Integration Of Agent Models And Meta Reinforcement Learning (Meta-Rl) Algorithms For Car Racing Experiment, Vidyavarshini Holenarasipur Jayashankar

Student Research Symposium

Introduction: Achieving optimal performance in 2D racing games presents unique challenges, requiring adaptive strategies and advanced learning algorithms. This research explores the integration of sophisticated agent models with Meta Reinforcement Learning (Meta-RL) techniques, specifically Model-Agnostic Meta-Learning (MAML) and Proximal Policy Optimization (PPO), to enhance decision-making and adaptability within these simulated environments. We hypothesize that this innovative approach will lead to marked improvements in game performance and learning efficiency.

Methods: In our experimental setup, we applied MAML for its rapid adaptation capabilities and PPO for optimizing the agents' policy decisions within a 2D racing game simulator. The objective was …


Story Of Your Lazy Function’S Life: A Bidirectional Demand Semantics For Mechanized Cost Analysis Of Lazy Programs, Laura Israel, Nicholas Coltharp May 2024

Story Of Your Lazy Function’S Life: A Bidirectional Demand Semantics For Mechanized Cost Analysis Of Lazy Programs, Laura Israel, Nicholas Coltharp

Student Research Symposium

Lazy evaluation is a powerful tool that enables better compositionality and potentially better performance in functional programming, but it is challenging to analyze its computation cost. Existing works either require manually annotating sharing, or rely on separation logic to reason about heaps of mutable cells. In this paper, we propose a bidirectional demand semantics that allows for reasoning about the computation cost of lazy programs without relying on special program logics. To show the effectiveness of our approach, we apply the demand semantics to a variety of case studies including insertion sort, selection sort, Okasaki's banker's queue, and the push …