In this work, we introduce a new method for imitation learning from video demonstrations. Our method, Relational Mimic (RM), improves on previous visual imitation learning methods by combining generative adversarial networks and relational learning. RM is flexible and can be used in conjunction with other recent advances in generative adversarial imitation learning to better address the need for more robust and sample-efficient approaches. In addition, we introduce a new neural network architecture that improves upon the previous state-of-the-art in reinforcement learning and illustrate how increasing the relational reasoning capabilities of the agent enables the latter to achieve increasingly higher performance in a challenging locomotion task with pixel inputs. Finally, we study the effects and contributions of relational learning in policy evaluation, policy improvement and reward learning through ablation studies.

Rideshare platforms, when assigning requests to drivers, tend to maximize profit for the system and/or minimize waiting time for riders. Such platforms can exacerbate biases that drivers may have over certain types of requests. We consider the case of peak hours when the demand for rides is more than the supply of drivers. Drivers are well aware of their advantage during the peak hours and can choose to be selective about which rides to accept. Moreover, if in such a scenario, the assignment of requests to drivers (by the platform) is made only to maximize profit and/or minimize wait time for riders, requests of a certain type (e.g. from a non-popular pickup location, or to a non-popular drop-off location) might never be assigned to a driver. Such a system can be highly unfair to riders. However, increasing fairness might come at a cost of the overall profit made by the rideshare platform. To balance these conflicting goals, we present a flexible, non-adaptive algorithm, \lpalg, that allows the platform designer to control the profit and fairness of the system via parameters $\alpha$ and $\beta$ respectively. We model the matching problem as an online bipartite matching where the set of drivers is offline and requests arrive online. Upon the arrival of a request, we use \lpalg to assign it to a driver (the driver might then choose to accept or reject it) or reject the request. We formalize the measures of profit and fairness in our setting and show that by using \lpalg, the competitive ratios for profit and fairness measures would be no worse than $\alpha/e$ and $\beta/e$ respectively. Extensive experimental results on both real-world and synthetic datasets confirm the validity of our theoretical lower bounds. Additionally, they show that $\lpalg$ under some choice of $(\alpha, \beta)$ can beat two natural heuristics, Greedy and Uniform, on \emph{both} fairness and profit.

The ubiquity of embodied gameplay, observed in a wide variety of animal species including turtles and ravens, has led researchers to question what advantages play provides to the animals engaged in it. Mounting evidence suggests that play is critical in developing the neural flexibility for creative problem solving, socialization, and can improve the plasticity of the medial prefrontal cortex. Comparatively little is known regarding the impact of gameplay upon embodied artificial agents. While recent work has produced artificial agents proficient in abstract games, the environments these agents act within are far removed the real world and thus these agents provide little insight into the advantages of embodied play. Hiding games have arisen in multiple cultures and species, and provide a rich ground for studying the impact of embodied gameplay on representation learning in the context of perspective taking, secret keeping, and false belief understanding. Here we are the first to show that embodied adversarial reinforcement learning agents playing cache, a variant of hide-and-seek, in a high fidelity, interactive, environment, learn representations of their observations encoding information such as occlusion, object permanence, free space, and containment; on par with representations learnt by the most popular modern paradigm for visual representation learning which requires large datasets independently labeled for each new task. Our representations are enhanced by intent and memory, through interaction and play, moving closer to biologically motivated learning strategies. These results serve as a model for studying how facets of vision and perspective taking develop through play, provide an experimental framework for assessing what is learned by artificial agents, and suggest that representation learning should move from static datasets and towards experiential, interactive, learning.

There are over 15 distinct communities that work in the general area of sequential decisions and information, often referred to as decisions under uncertainty or stochastic optimization. We focus on two of the most important fields: stochastic optimal control, with its roots in deterministic optimal control, and reinforcement learning, with its roots in Markov decision processes. Building on prior work, we describe a unified framework that covers all 15 different communities, and note the strong parallels with the modeling framework of stochastic optimal control. By contrast, we make the case that the modeling framework of reinforcement learning, inherited from discrete Markov decision processes, is quite limited. Our framework (and that of stochastic control) is based on the core problem of optimizing over policies. We describe four classes of policies that we claim are universal, and show that each of these two fields have, in their own way, evolved to include examples of each of these four classes.

Eivind Meyer is currently working on his Master's thesis, completing his five-year integrated Master's degree in Cybernetics and Robotics at the Norwegian University of Science and Technology (NTNU) in Trondheim. Having specialized in Real Time Systems, his research interests focus on adopting state-of-the-art Artificial Intelligence methods for Autonomous Vehicle Control. Haakon Robinson is a PhD candidate at the Norwegian University of Science and Technology (NTNU). He received a Bachelors degree in Physics in 2015 and completed a Masters degree in Cybernetics and Robotics in 2019, both at NTNU. His current work investigates the overlap between modern machine learning techniques and established methods within modelling and control, with a focus on improving the interpretability and be-E Meyer et al.: Preprint submitted to Elsevier Page 15 of 16 Taming an ASV for path following and collision avoidance using DRL havioural guarantees of hybrid models that combine first principle models and data-driven components.

Which authors of this paper are endorsers? Disable MathJax (What is MathJax?)

At the Tackling Climate Change workshop at this year's NeurIPS conference, some of the top minds in machine learning came together to discuss the effects of climate change on life on Earth, how AI can tackle the urgent problem, and why and how the machine learning community should join the fight. The panel included Yoshua Bengio, MILA director and University of Montreal professor; Jeff Dean, Google's AI chief; Andrew Ng, cofounder of Google Brain and founder of Landing.ai; and Cornell University professor and Institute for Computational Sustainability director Carla Gomes. The Tackling Climate Change workshop explored a wide range of topics, from the use of deep reinforcement learning to improve performance for ride-hailing services like Uber and Lyft to the application of deep learning to predict wildfire risk, detect avalanche deposits, improve plane efficiency with better wind forecasts, and conduct a global census of solar farms. The workshop is put together by Climate Change AI, a group that hosts workshops at AI research conferences and a forum for collaboration between machine learning practitioners and people from other fields. One essential step in better addressing the world's pressing challenges, says Bengio, is changing the way AI research is valued.

Supervised learning: You know how to classify the input data and the type of behavior you want to predict, but you need the algorithm to calculate it for you on new data Unsupervised learning: You do not know how to classify the data, and you want the algorithm to find patterns and classify the data for you Reinforcement learning: An algorithm which learns by trial and error by interacting with the environment. You use it when you don't have a lot of training data; you cannot clearly define the ideal end state; or the only way to learn about the environment is to interact with it Reinforcement learning: An algorithm which learns by trial and error by interacting with the environment. You use it when you don't have a lot of training data; you cannot clearly define the ideal end state; or the only way to learn about the environment is to interact with it

While policy-based reinforcement learning (RL) achieves tremendous successes in practice, it is significantly less understood in theory, especially compared with value-based RL. In particular, it remains elusive how to design a provably efficient policy optimization algorithm that incorporates exploration. To bridge such a gap, this paper proposes an Optimistic variant of the Proximal Policy Optimization algorithm (OPPO), which follows an "optimistic version" of the policy gradient direction. This paper proves that, in the problem of episodic Markov decision process with linear function approximation, unknown transition, and adversarial reward with full-information feedback, OPPO achieves O (\sqrt{d 3 H 3 T}) regret. Here d is the feature dimension, H is the episode horizon, and T is the total number of steps.

Portfolio management is the act of making decisions to allocate your funds to a collection of assets for optimal dollar results. When those assets are cryptocurrencies the question is that of allocating funds to digital assets in order to maximise some crypto investment goal, for example, accumulate Bitcoin. In this paper, a reinforcement machine learning approach is built using historical data from the crypto exchange website Polonix with the goal of optimising investor gains over a set period. This model is then benchmarked against standard portfolio strategies used by traders such as buy and hold. The results show that the reinforcement learning approach is extremely effective as an investment optimisation strategy; but the authors warn that historical data is not always a valid way to predict the market.