Ameya Jadhav

builder (and investor, sometimes)

I'm Ameya (uh-may). I have a Bachelor's and Master's in Computer Science from Stanford, focused on AI and systems.

I'm a Neo Scholar. I previously worked at Neo in an investments + product/eng role, and before that I was an intern Member of Technical Staff at OpenAI.

I invest in founders and companies as an angel investor, and previously through institutions like Neo, Stanford Ventures, and General Catalyst.

At Stanford, I ran TreeHacks, the world's largest collegiate hackathon, was a Partner at Stanford Ventures, and did research at the Stanford AI Lab on LLMs, formal math, and general reasoning.

I love hackathons — I've won grand prizes at TreeHacks, Hack the North, Neo Hackathon, HackGT, Pear VC x OpenAI, South Park Commons x Meta AI, and more.

avatar

projects

view all projects

research

HRL for Web Agents

Stanford CS Department

WebHierarch introduces a novel framework that combines large language model reasoning with hierarchical reinforcement learning to advance autonomous web automation. By integrating semantic understanding with experiential skill learning, the system achieves near state-of-the-art performance on complex MiniWoB++ benchmarks, with a 90% average success rate—outperforming both pure RL and LLM approaches. This work establishes a scalable and interpretable foundation for adaptable web agents capable of handling diverse and dynamic online environments.

3D Mesh Reconstruction with Vision Transformers

Stanford CS Department

This work presents a novel framework for reconstructing dynamic 3D meshes from monocular videos using Vision Transformers. The approach integrates D-NeRF scene representations, ViT-based spatial encoding, and Mesh R-CNN decoders, achieving measurable improvements in geometric accuracy and visual fidelity over prior methods. It establishes a proof of concept for applying transformer-based architectures to advance the state of the art in 3D reconstruction

ITP-Enhanced LLM Reasoning

Stanford STAIR Lab (SAIL)

This work introduces a methodology for augmenting mathematical reasoning in LLMs through the incorporation of axiomatic structures from Interactive Theorem Provers. Empirical evaluations reveal statistically significant, albeit modest, enhancement in proof-theoretic capabilities, suggesting this formalism-driven approach offers a promising vector for advancing machine cognition in mathematical domains.

view all research