Reinforcement Learning
Optimizing Credit Limit Adjustments Under Adversarial Goals Using Reinforcement Learning
Alfonso-Sánchez, Sherly, Solano, Jesús, Correa-Bahnsen, Alejandro, Sendova, Kristina P., Bravo, Cristián
Credit cards are an essential part of modern financial life; according to the Consumer Financial Protection Bureau (2021), 175 million North Americans, more than half of its population, own credit card products. On the other hand, the same cannot be said for developing countries; according to the World Bank, an average of only 55% of Latin Americans had a bank account in January 2020, and only approximately 20% have a credit card (World Economic Forum, 2022). However, companies that use financial technology, known as fintechs, have enabled digital financial services that can help the unbanked population overcome difficulties such as costs, geographical impediments, long waiting times, and lack of financial history in accessing traditional banking products (Khera, Ng, Ogawa, & Sahay, 2022; Rojas-Torres, Kshetri, Hanafi, & Kouki, 2021). The number of fintech companies in Latin America has risen rapidly, and their appearance has altered the behavior of traditional banks, which are now seeking innovation and changes to customercentered approaches (Vives, 2019) and have decided in some cases to create alliances with these new companies (Bejar et al., 2022). Because the financial industry is primarily based on information, financial process reports have been more easily transitioned to the digitization stage; this situation is in contrast with the consumer goods industry, which includes a physical element (Puschmann, 2017). In addition, emerging "super-apps", which are mobile applications that offer different services and products in the same environment (e.g., goods deliveries, social networks, and financial services), collect a large amount of alternative data (Siddiqi, 2017) that are generated by the use of the given application and are supplementary to the traditional financial data. Several researchers have found that the use of alternative information is valuable in the financial sector because it allows for improvement in the performance of some models; for instance, Roa et al. (2021) showed that the inclusion of variables such as the number of payments with errors and orders paid with the superapp's own credit cards can add significant predictive value in the problem of default prediction.
Enhancing Navigation Benchmarking and Perception Data Generation for Row-based Crops in Simulation
Martini, Mauro, Eirale, Andrea, Tuberga, Brenno, Ambrosio, Marco, Ostuni, Andrea, Messina, Francesco, Mazzara, Luigi, Chiaberge, Marcello
Service robotics is recently enhancing precision agriculture enabling many automated processes based on efficient autonomous navigation solutions. However, data generation and infield validation campaigns hinder the progress of large-scale autonomous platforms. Simulated environments and deep visual perception are spreading as successful tools to speed up the development of robust navigation with low-cost RGB-D cameras. In this context, the contribution of this work is twofold: a synthetic dataset to train deep semantic segmentation networks together with a collection of virtual scenarios for a fast evaluation of navigation algorithms. Moreover, an automatic parametric approach is developed to explore different field geometries and features. The simulation framework and the dataset have been evaluated by training a deep segmentation network on different crops and benchmarking the resulting navigation.
Trajectory Generation, Control, and Safety with Denoising Diffusion Probabilistic Models
Botteghi, Nicolò, Califano, Federico, Poel, Mannes, Brune, Christoph
The Control barrier functions (CBFs) (Ames et al., 2017; 2019) technology of control barrier functions (CBFs), represent a formal framework aiming to achieve safety as encoding desired safety constraints, is used in a hard constraint in an optimization problem in which the combination with DDPMs to plan actions by iteratively cost function encodes information on the nominal task to denoising trajectories through a CBFbased be executed. In particular CBF-based safety constraints are guided sampling procedure. At the same represented by forward invariance of so-called safe sets, i.e. time, the generated trajectories are also guided to subsets of the state space which the controlled system should maximize a future cumulative reward representing not leave during the task execution. We stress that within a specific task to be optimally executed. The this context, safety becomes a mathematically rigorous system proposed scheme can be seen as an offline and theoretic property and, even if unable to represent any model-based reinforcement learning algorithm resembling possible safety hazard, it is very useful to design safety constraints, in its functionalities a model-predictive e.g.
Prioritized Trajectory Replay: A Replay Memory for Data-driven Reinforcement Learning
Liu, Jinyi, Ma, Yi, Hao, Jianye, Hu, Yujing, Zheng, Yan, Lv, Tangjie, Fan, Changjie
In recent years, data-driven reinforcement learning (RL), also known as offline RL, have gained significant attention. However, the role of data sampling techniques in offline RL has been overlooked despite its potential to enhance online RL performance. Recent research suggests applying sampling techniques directly to state-transitions does not consistently improve performance in offline RL. Therefore, in this study, we propose a memory technique, (Prioritized) Trajectory Replay (TR/PTR), which extends the sampling perspective to trajectories for more comprehensive information extraction from limited data. TR enhances learning efficiency by backward sampling of trajectories that optimizes the use of subsequent state information. Building on TR, we build the weighted critic target to avoid sampling unseen actions in offline training, and Prioritized Trajectory Replay (PTR) that enables more efficient trajectory sampling, prioritized by various trajectory priority metrics. We demonstrate the benefits of integrating TR and PTR with existing offline RL algorithms on D4RL. In summary, our research emphasizes the significance of trajectory-based data sampling techniques in enhancing the efficiency and performance of offline RL algorithms.
Discovering Object-Centric Generalized Value Functions From Pixels
Nath, Somjit, Subbaraj, Gopeshh Raaj, Khetarpal, Khimya, Kahou, Samira Ebrahimi
Deep Reinforcement Learning has shown significant progress in extracting useful representations from high-dimensional inputs albeit using hand-crafted auxiliary tasks and pseudo rewards. Automatically learning such representations in an object-centric manner geared towards control and fast adaptation remains an open research problem. In this paper, we introduce a method that tries to discover meaningful features from objects, translating them to temporally coherent "question" functions and leveraging the subsequent learned general value functions for control. We compare our approach with state-of-the-art techniques alongside other ablations and show competitive performance in both stationary and non-stationary settings. Finally, we also investigate the discovered general value functions and through qualitative analysis show that the learned representations are not only interpretable but also, centered around objects that are invariant to changes across tasks facilitating fast adaptation.
Learning to Play Text-based Adventure Games with Maximum Entropy Reinforcement Learning
Li, Weichen, Devidze, Rati, Fellenz, Sophie
Text-based games are a popular testbed for language-based reinforcement learning (RL). In previous work, deep Q-learning is commonly used as the learning agent. Q-learning algorithms are challenging to apply to complex real-world domains due to, for example, their instability in training. Therefore, in this paper, we adapt the soft-actor-critic (SAC) algorithm to the text-based environment. To deal with sparse extrinsic rewards from the environment, we combine it with a potential-based reward shaping technique to provide more informative (dense) reward signals to the RL agent. We apply our method to play difficult text-based games. The SAC method achieves higher scores than the Q-learning methods on many games with only half the number of training steps. This shows that it is well-suited for text-based games. Moreover, we show that the reward shaping technique helps the agent to learn the policy faster and achieve higher scores. In particular, we consider a dynamically learned value function as a potential function for shaping the learner's original sparse reward signals.
Communication-Enabled Deep Reinforcement Learning to Optimise Energy-Efficiency in UAV-Assisted Networks
Omoniwa, Babatunji, Galkin, Boris, Dusparic, Ivana
Unmanned aerial vehicles (UAVs) are increasingly deployed to provide wireless connectivity to static and mobile ground users in situations of increased network demand or points of failure in existing terrestrial cellular infrastructure. However, UAVs are energy-constrained and experience the challenge of interference from nearby UAV cells sharing the same frequency spectrum, thereby impacting the system's energy efficiency (EE). Recent approaches focus on optimising the system's EE by optimising the trajectory of UAVs serving only static ground users and neglecting mobile users. Several others neglect the impact of interference from nearby UAV cells, assuming an interference-free network environment. Despite growing research interest in decentralised control over centralised UAVs' control, direct collaboration among UAVs to improve coordination while optimising the systems' EE has not been adequately explored. To address this, we propose a direct collaborative communication-enabled multi-agent decentralised double deep Q-network (CMAD-DDQN) approach. The CMAD-DDQN is a collaborative algorithm that allows UAVs to explicitly share their telemetry via existing 3GPP guidelines by communicating with their nearest neighbours. This allows the agent-controlled UAVs to optimise their 3D flight trajectories by filling up knowledge gaps and converging to optimal policies. Simulation results show that the proposed approach outperforms existing baselines in terms of maximising the systems' EE without degrading coverage performance in the network. The CMAD-DDQN approach outperforms the MAD-DDQN that neglects direct collaboration among UAVs, the multi-agent deep deterministic policy gradient (MADDPG) and random policy approaches that consider a 2D UAV deployment design while neglecting interference from nearby UAV cells by about 15%, 65% and 85%, respectively.
Maximum State Entropy Exploration using Predecessor and Successor Representations
Jain, Arnav Kumar, Lehnert, Lucas, Rish, Irina, Berseth, Glen
Animals have a developed ability to explore that aids them in important tasks such as locating food, exploring for shelter, and finding misplaced items. These exploration skills necessarily track where they have been so that they can plan for finding items with relative efficiency. Contemporary exploration algorithms often learn a less efficient exploration strategy because they either condition only on the current state or simply rely on making random open-loop exploratory moves. In this work, we propose $\eta\psi$-Learning, a method to learn efficient exploratory policies by conditioning on past episodic experience to make the next exploratory move. Specifically, $\eta\psi$-Learning learns an exploration policy that maximizes the entropy of the state visitation distribution of a single trajectory. Furthermore, we demonstrate how variants of the predecessor representation and successor representations can be combined to predict the state visitation entropy. Our experiments demonstrate the efficacy of $\eta\psi$-Learning to strategically explore the environment and maximize the state coverage with limited samples.
Beyond dynamic programming
In contrast with classical dynamic programming-based methods, our method can search over non-stationary policy functions, and can directly compute optimal infinite horizon action sequences from a given state. The central idea in our method is the construction of a mapping between infinite horizon action sequences and real numbers in a bounded interval. This construction enables us to formulate an optimization problem for directly computing optimal infinite horizon action sequences, without requiring a policy function. We demonstrate the effectiveness of our approach by applying it to nonlinear optimal control problems. Overall, our contributions provide a novel theoretical framework for formulating and solving reinforcement learning problems.
Decentralized Multi-Robot Formation Control Using Reinforcement Learning
Obradovic, Juraj, Krizmancic, Marko, Bogdan, Stjepan
This paper presents a decentralized leader-follower multi-robot formation control based on a reinforcement learning (RL) algorithm applied to a swarm of small educational Sphero robots. Since the basic Q-learning method is known to require large memory resources for Q-tables, this work implements the Double Deep Q-Network (DDQN) algorithm, which has achieved excellent results in many robotic problems. To enhance the system behavior, we trained two different DDQN models, one for reaching the formation and the other for maintaining it. The models use a discrete set of robot motions (actions) to adapt the continuous nonlinear system to the discrete nature of RL. The presented approach has been tested in simulation and real experiments which show that the multi-robot system can achieve and maintain a stable formation without the need for complex mathematical models and nonlinear control laws.