photo
Google Scholar GitHub Twitter LinkedIn Curriculum Vitae Email: mnakamura@umass.edu

–> <!– - On the Classification of Networks Using Graph Scattering [extended abstract]

  • On the Inversion-Free Newton Algorithm for Softmax Regression [thesis]
  • Existence of Induced H-Saturated Graphs
  • Network Reliability Using Graph Coloring [preprint]
  • Counting Triangles Using Combinatorics
  • Metaprogramming for Contract Algorithms [preprint] –>

<!– back

Selected Papers

contract-program
Formal Composition of Robotic Systems as Contract Programs

Mason Nakamura, Justin Svegliato, Samer Nashed, Shlomo Zilberstein, Stuart Russell

IROS 2023

maple
MAPLE: A Framework for Active Preference Learning Guided by Large Language Models

Saaduddin Mahmud, Mason Nakamura, Shlomo Zilberstein

AAAI 2025

News

2024

December

2023

June

May

  • I recently graduated summa cum laude from Marist College, majoring in applied mathematics and data science with a minor in computer science!

May

  • I was awarded the Excellence in Mathematics Award for graduating as the top mathematics student at Marist College.

March

  • I accepted a computer science MS/PhD offer at UMass Amherst in the Resource-Bounded Reasoning Lab directed by Shlomo Zilberstein!

2022

May-November

  • Visiting scholar at the Center for Human-Compatible AI (CHAI) at UC Berkeley on building well-founded AI using metareasoning.

March

  • Our paper on using combinatorics to solve a combinatorial geometry problem has been accepted to MAA Mathematics Magazine!

2021

May-August

  • Visiting scholar at Moravian University as part of an NSF REU on computational methods in discrete mathematics working on spectral and extremal graph theory.

2020

May-August

  • Visiting scholar at Michigan State University as part of an NSF REU on experimental mathematics working on geometric deep learning.