Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Shivaram Kalyanakrishnan"'
Publikováno v:
2021 Seventh Indian Control Conference (ICC).
Autor:
Shivaram Kalyanakrishnan
Publikováno v:
IJCAI
My research is driven by my curiosity about the nature of intelligence. Of the several aspects that characterise the behaviour of intelligent agents, I primarily study sequential decision making, learning, and exploration. My interests also extend to
Autor:
Kumar Ashutosh, Bhishma Dedhia, Shivaram Kalyanakrishnan, Parthasarathi Khirwadkar, Sarthak Consul, Sahil Shah
Publikováno v:
CDC
Policy Iteration (PI) is a classical family of algorithms to compute an optimal policy for any given Markov Decision Problem (MDP). The basic idea in PI is to begin with some initial policy and to repeatedly update the policy to one from an improving
Publikováno v:
AAAI
Regret minimisation in stochastic multi-armed bandits is a well-studied problem, for which several optimal algorithms have been proposed. Such algorithms depend on (sufficient statistics of) the empirical reward distributions of the arms to decide wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41da90b38d1b3140b934018aa36b765e
Autor:
Yejin Choi, William Yeoh, Reshef Meir, Shivaram Kalyanakrishnan, Haris Aziz, Suchi Saria, Daniel Hsu, Gerardo I. Simari, Lirong Xia, Elias Bareinboim
Publikováno v:
IEEE Intelligent Systems. 31:56-66
IEEE Intelligent Systems once again selected 10 young AI scientists as " AI's 10 to Watch." This acknowledgment and celebration not only recognizes these young scientists and makes a positive impact in their academic career but also promotes the comm
Publikováno v:
AIES
In the future of India lies the future of a sixth of the world's population. As the Artificial Intelligence (AI) revolution sweeps through societies and enters daily life, its role in shaping India's development and growth is bound to be substantial.
Autor:
Anchit Gupta, Shivaram Kalyanakrishnan
Publikováno v:
IJCAI
The Markov Decision Problem (MDP) plays a central role in AI as an abstraction of sequential decision making. We contribute to the theoretical analysis of MDP PLANNING, which is the problem of computing an optimal policy for a given MDP. Specifically
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 31
We propose a PAC formulation for identifying an arm in an n-armed bandit whose mean is within a fixed tolerance of the m-th highest mean. This setup generalises a previous formulation with m = 1, and differs from yet another one which requires m such
Autor:
KangKang Yin, Shivaram Kalyanakrishnan, Umashankar Nagarajan, Seung-kook Yun, Ambarish Goswami, Sung-Hee Lee
Publikováno v:
Autonomous Robots. 36:199-223
Humanoid robots are expected to share human environments in the future and it is important to ensure the safety of their operation. A serious threat to safety is the fall of such robots, which can seriously damage the robot itself as well as objects
Publikováno v:
IndraStra Global.
Policy Iteration (PI) (Howard 1960) is a classical method for computing an optimal policy for a finite Markov Decision Problem (MDP). The method is conceptually simple: starting from some initial policy, “policy improvement” is repeatedly perform