Projects

Differential Privacy for Spatial and Temporal Data

This project centers around participating in the NIST 2020 Differential Privacy Challenge with my colleagues in the DREAM Lab at UMass Amherst. This competition aims at developing new DP algorithms that incorporate and account for spatial and temporal information.

Results: Sprint 1 - Sprint 2 - Sprint 3

Topology and Explainable Machine Learning

This project studies connections between the topological properties of machine learning classification models and the explainability of those models’ predictions. We introduce a rigorous, topological grounding for the theory of probabilisitic anchors and provide an intuitive but formal definition of an explainable classifer. From this perspective, we derive connections between the degree of explainability, topological complexity of the classifier, and the learning theoretic notion of solvability.

Working Paper: Identifying the Most Explainable Classifier

Earnings Mobility and SNAP Participation in Georgia

This project investigates earnings mobility among SNAP participants using linked administrative data from the State of Georgia. The goal of this work is to better understand the earnings mobility of low-income populations and how participation in government benefits programs affects one’s earnings, especially during economic downturns such as the Great Recession.

This project is in collaboration with my colleagues at the Fiscal Research Center at Georgia State University.

Results from this project were presented at the National Tax Association’s Annual Conference, the Next Generation of Public Finance conference, the International Conference on Administrative Data Research and discussed on WABE, Atlanta’s NPR affiliate.

To enable practitioners to easily work with mobility indices, we’ve developed an R package called mobilityIndexR that can be found on CRAN.

Infinite Cycles and the Regress Problem

This project aims to bring the recent work of Diestel and collaborators on the topological approach to infinite cycles in graphs to bear on the program of Atkinson and Peijnenburg in analyzing the justification structure of infinite chains and infinite cycles of reasoning from a probabilistic and epistemological perspective.

A draft of initial results is here.

New results from this approach were presented at the 2019 Society for Exact Philosophy conference. See the deck for this conference here.


Updated: 7/21