188 citations · 193 across the 6 of their papers we have counts for
7 papers
GANsemble for Small and Imbalanced Data Sets: A Baseline for Synthetic Microplastics Data
Daniel Platnick, Sourena Khanzadeh, Alireza Sadeghian +1
Microplastic particle ingestion or inhalation by humans is a problem of growing concern. Unfortunately, current research methods that use machine learning to understand their poten…
Opti Code Pro: A Heuristic Search-based Approach to Code Refactoring
Sourena Khanzadeh, Samad Alias Nyein Chan, Richard Valenzano +1
This paper presents an approach that evaluates best-first search methods to code refactoring. The motivation for code refactoring could be to improve the design, structure, or impl…
Learning Reward Machines: A Study in Partially Observable Reinforcement Learning
Rodrigo Toro Icarte, Ethan Waldie, Toryn Q. Klassen +3
Reinforcement learning (RL) is a central problem in artificial intelligence. This problem consists of defining artificial agents that can learn optimal behaviour by interacting wit…
The act of remembering: a study in partially observable reinforcement learning
Rodrigo Toro Icarte, Richard Valenzano, Toryn Q. Klassen +3
Reinforcement Learning (RL) agents typically learn memoryless policies---policies that only consider the last observation when selecting actions. Learning memoryless policies is ef…
Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning
Rodrigo Toro Icarte, Toryn Q. Klassen, Richard Valenzano +1
Reinforcement learning (RL) methods usually treat reward functions as black boxes. As such, these methods must extensively interact with the environment in order to discover reward…
A Formal Characterization of the Local Search Topology of the Gap Heuristic
Richard Anthony Valenzano, Danniel Sihui Yang
The pancake puzzle is a classic optimization problem that has become a standard benchmark for heuristic search algorithms. In this paper, we provide full proofs regarding the local…
On polygon numbers of circle graphs and distance hereditary graphs
Lorna Stewart, Richard Anthony Valenzano
Circle graphs are intersection graphs of chords in a circle and -polygon graphs are intersection graphs of chords in a convex -sided polygon where each chord has its endpoint…