2 citations · 5 across the 5 of their papers we have counts for
5 papers
Computing Optimal Strategies for a Search Game in Discrete Locations
Jake Clarkson, Kyle Y Lin
Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among discrete locations, and the searcher successively visits individual locations u…
Distribution Free Prediction Sets for Node Classification
Jase Clarkson
Graph Neural Networks (GNNs) are able to achieve high classification accuracy on many important real world datasets, but provide no rigorous notion of predictive uncertainty. Quant…
Time Series Prediction under Distribution Shift using Differentiable Forgetting
Stefanos Bennett, Jase Clarkson
Time series prediction is often complicated by distribution shift which demands adaptive models to accommodate time-varying distributions. We frame time series prediction under dis…
DAMNETS: A Deep Autoregressive Model for Generating Markovian Network Time Series
Jase Clarkson, Mihai Cucuringu, Andrew Elliott +1
Generative models for network time series (also known as dynamic graphs) have tremendous potential in fields such as epidemiology, biology and economics, where complex graph-based…
A Classical Search Game in Discrete Locations
Jake Clarkson, Kyle Y. Lin, Kevin D. Glazebrook
Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among discrete locations, and the searcher successively visits individual locations u…