Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of controlling a Markov decision process (MDP) with a large state space, so as to minimize average cost. Since it is intractable to compete with the optimal policy for large scale problems,  pursue the more modest goal of competing with a low-dimensional family of policies.  use the dual linear programming formulation of the MDP average cost problem, in which the variable is a stationary distribution over state-action pairs, and  consider a neighborhood of a low-dimensional subset of the set of stationary distributions (defined in terms of state-action features) as the comparison class.  propose a technique based on stochastic convex optimization and give bounds that show that the performance of our algorithm approaches the best achievable by any policy in the comparison class. Most importantly, this result depends on the size of the comparison class, but not on the size of the state space. Preliminary experiments show the effectiveness of the proposed algorithm in a queuing application.
['Alan Malek', 'Yasin Abbasi-Yadkori', 'Peter L. Bartlett']
I am writing a research paper on a idea Linear Programming for Large-Scale Markov Decision Problems
[{"from": "human", "value": "I am writing a research paper on a idea Linear Programming for Large-Scale Markov Decision Problems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of controlling a Markov decision process (MDP) with a large state space, so as to minimize average cost. Since it is intractable to compete with the optimal policy for large scale problems,  pursue the more modest goal of competing with a low-dimensional family of policies.  use the dual linear programming formulation of the MDP average cost problem, in which the variable is a stationary distribution over state-action pairs, and  consider a neighborhood of a low-dimensional subset of the set of stationary distributions (defined in terms of state-action features) as the comparison class.  propose a technique based on stochastic convex optimization and give bounds that show that the performance of our algorithm approaches the best achievable by any policy in the comparison class. Most importantly, this result depends on the size of the comparison class, but not on the size of the state space. Preliminary experiments show the effectiveness of the proposed algorithm in a queuing application."}]