← Search

Neev Parikh

5 accepted papers

2025

Measuring AI Ability to Complete Long Software Tasks

NeurIPS 2025poster

Despite rapid progress on AI benchmarks, the real-world meaning of benchmark performance remains unclear. To quantify the capabilities of AI systems in terms of human capabilities, we propose a new metric: 50%-task-completion time horizon. This is the time humans typically take to complete tasks tha…

Cited by 0SourceScholar
2025

RE-Bench: Evaluating Frontier AI R&D Capabilities of Language Model Agents against Human Experts

ICML 2025spotlight

Frontier AI safety policies highlight automation of AI research and development (R&D) by AI agents as an important capability to anticipate. However, there exist few evaluations for AI R&D capabilities, and none that are highly realistic and have a direct comparison to human performance. We introduc…

Cited by 16SourcePDFScholar
2024

Robot Task Planning Under Local Observability

ICRA 2024poster

Real-world robot task planning is intractable in part due to partial observability. A common approach to reducing complexity is introducing additional structure into the decision process, such as mixed-observability, factored states, or temporally-extended actions. We propose the locally observable…

Cited by 2SourceScholar
2021

Deep Radial-Basis Value Functions for Continuous Control

AAAI 2021technical

A core operation in reinforcement learning (RL) is finding an action that is optimal with respect to a learned value function. This operation is often challenging when the learned value function takes continuous actions as input. We introduce deep radial-basis value functions (RBVFs): value function…

2021

Learning Markov State Abstractions for Deep Reinforcement Learning

NeurIPS 2021poster

A fundamental assumption of reinforcement learning in Markov decision processes (MDPs) is that the relevant decision process is, in fact, Markov. However, when MDPs have rich observations, agents typically learn by way of an abstract state representation, and such representations are not guaranteed…