summaries: The paper proposed a data-driven method for optimal action space selection in a reinforcement learning problem. Given a set of training state, action pair, the proposed approach first filters out the set of indispensable action set and then rank the other action set according to their cumulative reward values. To further improve the efficiency, a Monte Carlo sampling method is proposed for cut-off cardinality computation for action space. An action update rule is devised by computing optimal step size. Finally, a case study on a cloud environment is illustrated to select the optimal set of resources (#vCPUs and Memory size) to optimize the CPU utilization rate. The case study demonstrates that the Monte Carlo sampling based algorithm reduces action search space by 81% and then it creates a list of ranked action set. It is shown that a large action space does not necessarily lead to better performance for an RL agent.

summaries: The paper addresses the problem of action set selection, i.e. identifying which actions should be available to a RL agent, during training. The set of available actions can influence the RL agent's performance or even hinder it to reach its goal. A method to evaluate action sets is introduced and a case study is performed on a resource tuning example on cloud infrastructure.

summaries: This paper focuses on Reinforcement Learning (RL). RL methods often entail a potentially large action space exploration to find a good policy. This work proposes a method to reduce such action space exploration. The method separates actions into two categories: dispensable (the action can be ignored) and indispensable (the action must be taken). Dispensable actions are also ranked according to their importance with respect to the final policy. The method is data driven and operates by looking at the global reward returns obtained when a certain action is removed from the action space. The method is evaluated on a case study simulating cloud infrastructure workload optimisation, i.e. the task of reducing high CPU utilisation by allocating more resources.

summaries: This paper empirically considered the impact of training action space for reinforcement learning in a case study. Understanding the impact of training action space is a valid and important problem. An empirical study of this problem appears to be the main contribution of this paper.

abstractText: Training action space selection for reinforcement learning (RL) is conflict-prone due to complex state-action relationships. To address this challenge, this paper proposes a Shapley-inspired methodology for training action space categorization and ranking. To reduce exponential-time shapley computations, the methodology includes a Monte Carlo simulation to avoid unnecessary explorations. The effectiveness of the methodology is illustrated using a cloud infrastructure resource tuning case study. It reduces the search space by 80% and categorizes the training action sets into dispensable and indispensable groups. Additionally, it ranks different training actions to facilitate high-performance yet cost-efficient RL model design. The proposed data-driven methodology is extensible to different domains, use cases, and reinforcement learning algorithms.

title: Conflict acts as an implicit cost in reinforcement learning

venue: Nature communications

authors:
Daniel Fryer
Inga Strümke
Hien Nguyen

title: Shapley values for feature selection: the good, the bad, and the axioms

title: A review on deep reinforcement learning for fluid mechanics

venue: Computers & Fluids

authors:
Andrew Gelman
Jonathan N Katz
Joseph Bafumi

title: Standard voting power indexes do not work: an empirical analysis

venue: British Journal of Political Science

authors:
Meysam Gheisarnejad
Mohammad Hassan Khooban

title: An intelligent non-integer PID controller-based deep reinforcement learning: Implementation and experimental results

venue: IEEE Transactions on Industrial Electronics

authors:
Amirata Ghorbani
James Zou

title: Data shapley: Equitable valuation of data for machine learning

venue: In: International Conference on Machine Learning. PMLR

title: Some theorems on n-person games

venue: Princeton University,

authors:
Naman Goel
Boi Faltings

title: Deep bayesian trust: A dominant and fair incentive mechanism for crowd

venue: Proceedings of the AAAI Conference on Artificial Intelligence

authors:
Jiequn Han
Arnulf Jentzen
E Weinan

title: Overcoming the curse of dimensionality: Solving high-dimensional partial differential equations using deep learning

venue: arXiv preprint arXiv:1707.02568

title: Wide-area measurement system-based low frequency oscillation damping control through reinforcement learning

venue: IEEE Transactions on Smart Grid

authors:
J Fernando Hernandez-Garcia
Richard S Sutton

title: Understanding multi-step deep reinforcement learning: a systematic study of the DQN target

authors:
Mark N Howell
Matt C Best

title: On-line PID tuning for engine idle-speed control using continuous action reinforcement learning automata

venue: Control Engineering Practice

title: Goal-oriented chatbot dialog management bootstrapping with transfer learning

title: Towards efficient data valuation based on the shapley value

venue: The 22nd International Conference on Artificial Intelligence and Statistics. PMLR

authors:
Nan Jiang
Alekh Agarwal

title: Open problem: The dependence of sample complexity lower bounds on planning horizon

venue: In: Conference On Learning Theory. PMLR

title: Contextual decision processes with low Bellman rank are PAC-learnable

authors:
Yujia Jin
Aaron Sidford

title: Towards Tight Bounds on the Sample Complexity of Averagereward MDPs

venue: arXiv preprint arXiv:2106.07046

authors:
Nate Kohl
Peter Stone

title: Policy gradient reinforcement learning for fast quadrupedal locomotion

venue: IEEE International Conference on Robotics and Automation,

authors:
David A Kravitz
John Iwaniszek

title: Number of coalitions and resources as sources of power in coalition bargaining.

venue: Journal of Personality and Social Psychology

title: Giraffe: Using deep reinforcement learning to play chess

venue: arXiv preprint arXiv:1509.01549

title: GPU-accelerated robotic simulation for distributed reinforcement learning

venue: In: Conference on Robot Learning. PMLR

title: Geoman: Multi-level attention networks for geo-sensory time series prediction.

venue: In: IJCAI. Vol. 2018

authors:
Sandeep Manjanna
Herke van Hoof
Gregory Dudek

title: Reinforcement learning with nonuniform state representations for adaptive search

venue: IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR). IEEE

title: Correspondence learning via linearly-invariant embedding

title: Human-level control through deep reinforcement learning

title: Playing atari with deep reinforcement learning

venue: arXiv preprint arXiv:1312.5602

authors:
Mehryar Mohri
Gary Sivek
Ananda Theertha Suresh

title: Agnostic federated learning

authors:
Christoph Molnar
Giuseppe Casalicchio
Bernd Bischl

title: Interpretable machine learning–a brief history, state-of-the-art and challenges

venue: Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer

title: Simulation-based reinforcement learning for real-world autonomous driving

venue: IEEE International Conference on Robotics and Automation (ICRA). IEEE

title: Time series analysis: Regression techniques

title: Improving Reproducibility in Machine Learning Research

venue: Journal of Machine Learning Research

title: Data lifecycle challenges in production machine learning: a survey

venue: ACM SIGMOD Record

authors:
Vikas Raunak
Vivek Gupta
Florian Metze

title: Effective dimensionality reduction for word embeddings

venue: Proceedings of the 4th Workshop on Representation Learning for NLP (RepL4NLP-2019)

authors:
Roberta Rocca
Tal Yarkoni

title: Putting psychology to the test: Rethinking model evaluation through benchmarking and prediction

title: The Shapley value: essays in honor of Lloyd S

authors:
Alaa Sagheer
Mostafa Kotb

title: Time series forecasting of petroleum production using deep LSTM recurrent networks

venue: In: Neurocomputing

title: Shorrocks. Decomposition procedures for distributional analysis: a unified framework based on the Shapley value

venue: Tech. rep. mimeo, University of Essex,

title: Mastering the game of Go with deep neural networks and tree search

authors:
Satinder Singh
Andy Okun
Andrew Jackson

title: Learning to play Go from scratch

venue: Nature

title: Comprehensive Benefit Allocation for Joint Operation of Multiple Reservoirs in the Ningbo Based on Shapely-Value Method and Benefit-Incremental Method

venue: MATEC Web of Conferences

authors:
Mukund Sundararajan
Amir Najmi

title: The many Shapley values for model explanation

title: Dyna, an integrated architecture for learning, planning, and reacting

venue: Sigart Bulletin

authors:
Sebastian Thrun
Anton Schwartz

title: Issues in using function approximation for reinforcement learning

venue: Proceedings of the Fourth Connectionist Models Summer School. Hillsdale,

title: Reinforcement learning in continuous state and action spaces

venue: Reinforcement learning. Springer,

authors:
Hilde JP Weerts
Werner van Ipenburg
Mykola Pechenizkiy

title: A human-grounded evaluation of shap for alert processing

title: The shapley value

authors:
Yu Zhang
Jianguo Yao
Haibing Guan

title: Intelligent cloud resource management with deep reinforcement learning

venue: IEEE Cloud Computing

authors:
Dongruo Zhou
Jiafan He
Quanquan Gu

title: Provably efficient reinforcement learning for discounted mdps with feature mapping

title: Deep reinforcement learning for mobile edge caching: Review, new features, and open issues

venue: IEEE Network

title: Dexterous manipulation with deep reinforcement learning: Efficient, general, and low-cost

heading: 1 INTRODUCTION

text:
A reinforcement learning (RL) agent learns how to map states to actions in order to maximize a long-term cumulative award signal in a given environment. Figure 1 shows the various artifacts of an RL algorithm. An RL problem is defined by a quartet of (S,A, Pa, Ra), where S is a set of states or the state space; A is a set of actions or the action space available to influence S; Pa(s, s ′) = Pr(st+1 = s ′|st = s, at = a) is the transition probability which is the probability that action a in state s at time t will lead to state s′ at time t+ 1; and finally, Ra(s, s′) is the immediate reward signal received after transitioning from state s to state s′, due to action a. An RL agent training involves recognizing an optimal policy function, π∗ : a← s, from a corpus of {(si, ai)} to maximize the long-term cumulative reward, ∑ Ra. The reward function, Ra, is defined ab initio for an efficient goal accomplishment. The transition probability or state-action mapping is defined by the environment dynamics. In many real-life use cases, the agent cannot directly sense the effect of its actions on the environment. This is particularly true when the state-action relationship cannot be modeled by either closed-form analytical expressions [26, 29, 58] or explicit rules as in the popular games such as Chess [28], Go [47, 46], and Atari [34]. This challenge is well documented in the literature [51, 57]. To address this challenge for RL model training [52, 33], simulation-based action models [50] play a pivotal role. The optimal choice of simulation parameters such as the training action space is a non-trivial challenge because of the curse of dimensionality [17], non-linearity [11], and non-uniform action set [25].
Training data valuation [22, 10] and associated artisanal software engineering efforts constitute a large part of the machine learning (ML) life cycle (or MLOps). Yet, most research and development efforts [36] focus on algorithms and infrastructure. Production-grade MLOps needs to handle data lifecycle management (DLM) [40] challenges including: fairness and bias in labeled datasets [16], data quality [9], limitations of benchmarks [42], and reproducibility concerns [39]. For RL, the DLM challenges are further compounded due to complexities arising from non-linear state-action interactions, partiallyobservable processes, non-isometric action spaces [32], and strong domain specificity [21] of action models. With the recent emphasis on ML explainability, traditional supervised learning and deep learning research communities are actively working on systematic data-driven frameworks [14, 53] for training data valuation. We need equivalent frameworks for RL to streamline conflict-prone training action selection [8, 37, 18]. Depending on the agent-environment interactions, different training actions have different relative contributions to the RL agent performance. Some training actions are indispensable because of their unique positions in the parametric space. Other dispensable actions have different relative contributions to the reward function. Remarkably, a high-cardinality
training action space in many cases leads to lower cumulative reward than a well-designed training action space. To the best of authors’ knowledge, there is hardly any data-driven tool for the evaluation of training action space for RL. Such a tool leads to superior RL agent performance, lower model training and maintenance cost, and strong multi-disciplinary collaboration [35].
This paper proposes a shapley-inspired [54] algorithm to categorize and rank training action sets. It also assists in recognizing cut-off cardinality for the training action space to reduce unnecessary exploration and ensure polynomial time complexity. While Section 2 describes the algorithms for RL training action space evaluation, Section 3 illustrates the effectiveness of the algorithms in a specific case study. Section 4 discusses the relevant work. Finally, Section 5 presents a summary with possible future directions.

heading: 2 ALGORITHM

text: The proposed framework provides a shapley-inspired methodology [49] to efficiently filter out unnecessary training actions and discover a near-optimal action set. Figure 2 shows the framework consists of two algorithms and how these two algorithms interact with each other to design a nearoptimal RL model by training action space filtering and evaluation. The first algorithm computes cutoff cardinality for the training action space. The cut-off cardinality is defined as the minimium number of action points needed in a training action set to enable high-fidelity predictions within an acceptable computational complexity and an error bound. The second algorithm takes action points only above the cut-off cardinality and categorize action points into two classes: {dispensable, indispensable} and ranking dispensable training action points based on the corresponding cumulative rewards. Indispensable action points are absolute essential action points for the RL training to achieve the desired goal. On the other hand, dispensable action points are non-essential action points that can be discarded. However, the RL agent might perform sub-optimally without a disposable action point. By ranking disposable training action points based on the corresponding cumulative rewards, the relative contributions of different training action points are estimated.

heading: 2.1 CUT-OFF CARDINALITY COMPUTATION FOR TRAINING ACTION POINTS

text:
RL deals with compilation of a quartet (S,A, Pa, Ra) and computation of an optimal policy, π∗ which maximizes the long-term cumulative reward. The search space for a shapley-inspired technique needs to span across the power set for the training action space which has exponential complexity with training action points. To circumvent this problem, the proposed algorithm, as discussed in Algorithm 1, uses Monte Carlo method to compute the cut-off cardinality. The inputs to this algorithm include an RL algorithm, the power set for the training action space, the corresponding state space,
the transition probability, an acceptable performance margin, and an acceptable number of iterations. The output is the cut-off cardinality. The algorithm uses an iterative procedure to train the RL agent with different numbers of training actions, starting from all available training actions to only one training action. If for a certain cardinality, all the cumulative rewards do not improve by within n iterations, then we set the status to failure, and assign the cut-off cardinality to that cardinality plus one. The cut-off cardinality signifies computational efficiency — a larger cut-off cadinality means lower computational overhead and vice versa.
Algorithm 1 Monte Carlo method for cut-off cardinality computation for the training action space Input: The RL algorithm,R, the power set for the training action space, P(A), the corresponding
state space, P(S|A), transition probability P , an acceptable performance margin, , and an acceptable number of iterations, n.
Output: Cut-off cardinality, |A|cutoff for k ← |A| to 1 do
repeat π∗ ← R(S,A, Pa, Ra) if the cumulative reward improves by with n iterations then
status← success else
status← failure end if
until all necessary training action sets for a given cardinality is exhausted. if all statuses for a given cardinality, k, are failures then |A|cutoff ← k + 1
end if end for

heading: 2.2 CATEGORIZATION AND RANKING OF TRAINING ACTIONS

text:
Algorithm 2 offers a principled procedure for training action selection. As for inputs, it takes the combinations of training state-action pairs above the cut-off cardinality, determined by Algorithm 1, the RL algorithm, the reward function, the threshold condition, and the acceptable number of iterations. As for outputs, it predicts a categorization vector which classifies training action points into two classes: {dispensable, indispensable} and ranks dispensable training actions based on the corresponding cumulative reward. At its core, Algorithm 2 determines whether the policy determined from the given state-action pairs achieves the threshold condition within the acceptable number of iterations. The algorithm uncovers the indispensability of some training action sets for a given RL task. A training action set is deemed to be indispensable: iff upon removal of that training action
point, the RL agent fails to accomplish the goal within a finite number of iterations [24, 56, 23]. All other action points are dispensable. The dispensable action points are rank listed in L based on the corresponding cumulative reward. Essentially, L informs the performance impact of different disposable action points on the RL agent.
Algorithm 2 Data-driven categorization and ranking for training action space evaluation Input: All combinations of training state-action pairs upto cut-off cardinality: {(si, ai)}, the RL
algorithm,R, the reward function, the threshold condition, and the acceptable number of iterations. Output: Categorization vector, V , which classifies training action points into two classes: {dispens-
able, indispensable}. Rank order list of dispensable training actions based on the corresponding cumulative reward. repeat
for < si, ai > do π∗ ← R(S,A, Pa, Ra) if Threshold condition is never satisfied within the acceptable number of iterations then V(A− ai)← indispensable
else V(A− ai)← dispensable
end if end for
until all necessary training action sets are evaluated. Rank List, L ← dispensable actions sorted in order of the corresponding cumulative rewards

heading: 2.3 ACTION SHAPLEY

text:
The proposed framework adopts Action Shapley which introduces a formulation for the problem of equitable training action valuation in reinforcement learning. Reinforcement learning has three key building blocks. The first building block is the training action space, A, the corresponding state space S, and a pre-assigned reward function, Ra. The second building block is a reinforcement learning algorithm, R, which is treated as a black box. It takes (S,A, Pa, Ra) and computes an optimal policy function, π∗. The third building block is the performance measure or the cumulative sum of reward, ∑ Ra. The goal of the framework is to compute the valuation for each training action
point, φi(A,R, ∑ Ra) as a function of three building blocks. A shapley technique is useful for action valuation because it satisfies nullity, symmetry, and linearity [45]. From game theory, φ can be expressed as shown in Equation 1:
φi = C ∑
S⊆A−{i}
∑ Ra(S ∪ {i})− ∑ Ra(S)(
n−1 |S| ) (1)
where, the sum is over all subsets of A not containing i and C is an arbitrary constant. We call φi the Action Shapley value of action ai. Equation 1 suggests Action Shapley computation is with exponential time complexity w.r.t. the training action points. This exponential computational complexity warrants the need for the cut-off cardinality discussed in Algorithm 1.

heading: 3 CASE STUDY

text:
In this section, we design a resource tuning example (in the cloud) to illustrate the effectiveness of the proposed algorithm for the training action space evaluation. We evaluate the performance of an MDP [20]-based RL agent, as shown in Figure 1. The state-action mapping and transition probability are modeled using time-series auto-regression [38] after a PCA-based dimensionality reduction [41] with time complexity O(klogk), where k is the number of principal components. The choice of the algorithms is purely driven by the nature of the training dataset. A more complex non-linear dataset warrants more complex sequential models such as long short-term memory (LSTM) [44] or attention based models [30]. For action updates, WLOG, an RL-based PID controller [1, 13] is used. Similar to time-series modeling, action update can be conducted by other policy learning algorithms such as SARSA [19].
As shown in Table 1, the objective of the RL agent for this case study is to quickly reduce high CPU utilization below a pre-assigned threshold for a given workload. In most infrastructure/cloud resource tuning technologies [55], CPU utilization represents a key metric. Therefore, the state space for this RL case study consists of virtual machine CPU utilization (%) metrics and the action space is defined by the VM resource set points, i.e., (# of vCPUs, Memory Size (GB)). The RL agent uses AWS boto3 SDK [2] to manipulate actions and AWS CloudWatch [3] for state space monitoring. The reward is defined as the number of time steps required by the agent to accomplish the objective multiplied by −1. The negative reward per time step was meant to push the agent to accomplish the task as fast as possible.
The training data for this case study was generated internally [4] with an open source library, stress (https://linux.die.net/man/1/stress). It uses a rectangular workload. The peak of the workload uses the stress command: sudo stress –io 4 –vm 2 –vm-bytes 1024M –timeout 500s. Essentially, the peak is running 4 I/O stressors and 2 VM workers spinning on malloc with 1024 MB per worker for 500 s. The simulated rectangular workload has a time period of 600 s: a high-stress phase of 500 s is followed by an inactive phase of 100 s. The RL training action space is spanned by the power set drawn from the five pairs of EC2 configuration set points as shown in Table 2. Using Algorithm 1, we notice that the power set below the cut-off cardinality of 4 produces trivial and unstable results. Therefore, WLOG, the analysis in this paper has been focused on six training action sets as shown in Table 4. That amounts to 81.25% reduction in the search space. For each EC2 instance in the training action space, the corresponding state metrics, i.e., CPU utilization (%) are shown in Figure 3. The training data was collected for a 24 hour period with 1 minute sampling interval. Using Algorithm ??, the optimal step-size for action update is identified to be 0.1 in both # of vCPUs and Memory Size (GB) dimensions.
With this set up, different RL models are developed with different training action sets and the corresponding rewards and ranks are noted in Table 4. Remarkably, a high cardinality training action set does not guarantee the best reward: the agent with all training actions,<small t3a, medium t3a, large t3a, xlarge t3a, 2xlarge t3a>, does not yield the highest reward. In fact, the action set with <medium t3a, large t3a, xlarge t3a, 2xlarge t3a> yields the highest reward. This pattern could be attributed to the state-action interaction in this particular case study. First, the parametric distances
between different EC2 instance pairs are not uniform. While the Euclidean distance between small t3a and medium t3a is equal to 2, that between xlarge t3a and 2xlarge t3a is 16.5. The non-uniform spacing for training action space is a considerable deterrent [31] for RL adoption. Second, in this case study, the transient CPU utilization (%) patterns have undergone a material change from xlarge t3a (max 100%) to 2xlarge t3a (max 73%). This indicates the strong influence of 2xlarge t3a for the given RL task. Indeed, we noticed 2xlarge t3a to be an indispensable training action. As shown in Table 3, a categorization of training actions can be inferred based on the valuation vector, V , as described in Algorithm 2: two dispensable training actions are uncovered to be small t3a, medium t3a and three indispensable training actions to be large t3a, xlarge t3a, 2xlarge t3a.
Figure 4 shows the RL loop action with three training actions: <small t3a, medium t3a, large t3a, xlarge t3a, 2xlarge t3a>, <medium t3a, large t3a, xlarge t3a, 2xlarge t3a>, and <small t3a, large t3a, xlarge t3a, 2xlarge t3a>.
• For the first training action set of <small t3a, medium t3a, large t3a, xlarge t3a, 2xlarge t3a>, the reward is −21. The left subplot in Figure 4(a) shows how the recommended action is evolving with time from an arbitrary initial point of (6, 14). The recommended points are superimposed on the training action parameter space to illustrate their relative position with respect to the parametric boundary which is defined by the trapezium with vertices: {(2,2), (2,8), (8,32), (8,2)} in the (# of vCPUs, Memory Size (GB)) space. The right subplot in Figure 4(a) shows how the median CPU utilization (%) comes below the 90% threshold in 21 steps leading to −21 in reward. The blue dots represent the median CPU utilizations for different training set points.
• For the second training action set of <medium t3a, large t3a, xlarge t3a, 2xlarge t3a>, the reward is −13 as shown in Figure 4(b).
• For the third training action set of <small t3a, large t3a, xlarge t3a, 2xlarge t3a>, the reward is −16 as shown in Figure 4(c).
As shown in Table 4, the reward scores can indeed be used for ranking different training action sets leading to a data-driven approach for training action selection. As shown in Figure 5, large t3a is an indispensable element in the training action space for the given RL agent. Without this training action, the RL agent fails to accomplish the goal of bringing the CPU utilization below the critical threshold. Similar observations can be made about xlarge t3a and 2xlarge t3a.

heading: 4 RELATED WORK

text: Shapley value was postulated in a classic paper in game theory [15] and influences the field of economics significantly [43]. Various shapley-inspired techniques have been applied to model diverse problems including voting [12], resource allocation [48] and bargaining [27]. Recent years saw increased application of shapley-inspired methodologies in machine learning feature importance evaluation and training data valuation [14, 10]. To the best of our knowledge, Shapley value has not been used to quantify training action valuation in a reinforcement learning context. The application of shapley-inspired technique for reinforcement learning is a challenging problem. First, the relationship between state-action pairs and transition probabilities are expensive to model. Also, often the RL training action points are not uniformly positioned. Finally, we have purposefully focused on a small sample cloud infrastructure use case instead of cliched RL use cases [5]. That is because the problem of optimal action selection has relatively more expensive in the cloud infrastructure space where the state-action relationship is only partially observable.

heading: 5 CONCLUSION

text: This paper proposes a data-driven methodology for training action space evaluation for RL. The methodology offers a principled framework for training action space categorization and ranking within a finite computational time. It unleashes a strategy for superior model performance and lower modeling cost. Additionally, the proposed methodology is completely agnostic of use cases and machine learning algorithms. Therefore, it is a general-purpose methodology extensible to different domains including distributed computing, network traffic control, healthcare, automatic locomotion, building management system, and industrial controls, and different machine learning algorithms such as PCA, Autoencoder, ARIMA, LSTM, Transformer, PID, SARSA, DQN, and many others. For the next phase of the development for this data-agnostic methodology, we are planning to contribute a general RL design library to relevant open source projects [6, 5, 7].

heading: 6 NOTATION

text:
S Space Space
A Action Space
Pa Transition Probability
Ra Reward Signal
P Power Set π Policy
π∗ Optimal Policy
π∗ Optimal Policy
V Categorization Vector L Rank List of Dispensable Actions