Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study the asymptotic behavior of a stochastic approximation scheme on two timescales with set-valued drift functions and in the presence of non-additive iterate-dependent Markov noise. It is shown that the recursion on each timescale tracks the flow of a differential inclusion obtained by averaging the set-valued drift function in the recursion with respect to a set of measures which take into account both the averaging with respect to the stationary distributions of the Markov noise terms and the interdependence beten the two recursions on different timescales. The framework studied in this paper builds on the works of \it{A. Ramaswamy et al. }\rm by allowing for the presence of non-additive iterate-dependent Markov noise. As an application,  consider the problem of computing the optimum in a constrained convex optimization problem where the objective function and the constraints are averaged with respect to the stationary distribution of an underlying Markov chain. Further the proposed scheme neither requires the differentiability of the objective function nor the knowledge of the averaging measure.
['Vinayaka Yaji', 'Shalabh Bhatnagar']
I am writing a research paper on a idea Stochastic Recursive Inclusions in two timescales with non-additive iterate dependent Markov noise
[{"from": "human", "value": "I am writing a research paper on a idea Stochastic Recursive Inclusions in two timescales with non-additive iterate dependent Markov noise"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study the asymptotic behavior of a stochastic approximation scheme on two timescales with set-valued drift functions and in the presence of non-additive iterate-dependent Markov noise. It is shown that the recursion on each timescale tracks the flow of a differential inclusion obtained by averaging the set-valued drift function in the recursion with respect to a set of measures which take into account both the averaging with respect to the stationary distributions of the Markov noise terms and the interdependence beten the two recursions on different timescales. The framework studied in this paper builds on the works of \\it{A. Ramaswamy et al. }\\rm by allowing for the presence of non-additive iterate-dependent Markov noise. As an application,  consider the problem of computing the optimum in a constrained convex optimization problem where the objective function and the constraints are averaged with respect to the stationary distribution of an underlying Markov chain. Further the proposed scheme neither requires the differentiability of the objective function nor the knowledge of the averaging measure."}]