1.1k citations · 7.8k across the 180 of their papers we have counts for
5 papers · 1 filter
ITPEval: Benchmarking Formal Translation Across Interactive Theorem Provers
Jiayi Wu, Robert Joseph George, Anima Anandkumar
Formal theorem proving has emerged as a frontier challenge for machine learning, yet the ecosystem is fragmented: proofs remain siloed across incompatible systems, limiting both tr…
Efficient Exploration through Bayesian Deep Q-Networks
Kamyar Azizzadenesheli, Animashree Anandkumar
We study reinforcement learning (RL) in high dimensional episodic Markov decision processes (MDP). We consider value-based RL when the optimal Q-value is a linear function of d-dim…
Experimental results : Reinforcement Learning of POMDPs using Spectral Methods
Kamyar Azizzadenesheli, Alessandro Lazaric, Animashree Anandkumar
We propose a new reinforcement learning algorithm for partially observable Markov decision processes (POMDP) based on spectral decomposition methods. While spectral methods have be…
Open Problem: Approximate Planning of POMDPs in the class of Memoryless Policies
Kamyar Azizzadenesheli, Alessandro Lazaric, Animashree Anandkumar
Planning plays an important role in the broad class of decision theory. Planning has drawn much attention in recent work in the robotics and sequential decision making areas. Recen…
Reinforcement Learning of POMDPs using Spectral Methods
Kamyar Azizzadenesheli, Alessandro Lazaric, Animashree Anandkumar
We propose a new reinforcement learning algorithm for partially observable Markov decision processes (POMDP) based on spectral decomposition methods. While spectral methods have be…