2 citations · 3 across the 4 of their papers we have counts for
4 papers
A Review on Optimality Investigation Strategies for the Balanced Assignment Problem
Anurag Dutta, K. Lakshmanan, A. Ramamoorthy +3
Mathematical Selection is a method in which we select a particular choice from a set of such. It have always been an interesting field of study for mathematicians. Accordingly, Com…
On convergence to the global optima
K. Lakshmanan
We show that there is no general algorithm which finds a sequence of points with finite-precision converging computably to the global optima of any continuous function.
Global Optima is not Limit Computable
K. Lakshmanan
We study the limit computability of finding a global optimum of a continuous function. We give a short proof to show that the problem of checking whether a point is a global minimu…
Accelerated Reinforcement Learning
K. Lakshmanan
Policy gradient methods are widely used in reinforcement learning algorithms to search for better policies in the parameterized policy space. They do gradient search in the policy…