Talks and presentations

Scalable and Sample-Efficient Active Learning in Graph-Based Semi-Supervised Classification

October 05, 2021

Talk, UMN Institute of Mathematics and its Applications (IMA) Data Science Seminar,

Presented work at University of Minnesota’s (UMN) IMA Data Science Seminar, per the invitation of Dr. Jeffrey Calder. Presented my recent work on active learning with application to Hyperspectral Imagery (HSI) and Synthetic Aperture Radar (SAR) data, including specific focus and discussion about exploration and exploitation in active learning.

Active Learning Methods on Graphs for Image, Video and Multispectral Datasets

September 28, 2021

Talk, 7th Annual Intelligence Community Academic Research Symposium 2021,

Presented work at the 7th Annual Intelligence Community Academic Research Symposium (ICARS) on September 29, 2021, in place of my advisor Dr. Bertozzi. Presented our recent work on active learning with application to Hyperspectral Imagery (HSI) and Synthetic Aperture Radar (SAR) data.

Active Learning in Graph Based Semi-Supervised Learning

March 26, 2021

Talk, BYU Mathematics of Machine Learningm 2021,

Guest Lecturer for Dr. Jared Whitehead’s Mathematics of Machine Learning graduate level course at BYU. Presented my work on model change active learning for graph-based semi-supervised learning (SSL) as well as gave some advice on applying for Ph.D. programs in Applied Mathematics.

Multiclass Active Learning for Graph-Based Semi-Supervised Learning

March 24, 2021

Poster, Naval Applications of Machine Learning (NAML) Conference 2021,

Presented poster at Naval Applications of Machine Learning (NAML) Conference on March 24, 2021. Presented my work on scalable and sample-efficient model change active learning for a family of graph-based semi-supervised learning models, with specific application to Hyperspectral Imagery (HSI).

Active Learning in Graph Based Semi-Supervised Learning

March 01, 2021

Talk, SIAM CSE 2021,

SIAM CSE 2021, Minisymposium on Theory and Applications of Graph-Based Learning. Presented my work on model change active learning for graph-based semi-supervised learning (SSL), where we use the approximate change in the underlying SSL model as a measure of usefulness in the active learning process. This approximate change is efficiently done for a family of graph-based SSL models, using only a subset of the graph Laplacian’s eigenvalues and eigenvectors.

A Probabilistic Perspective on Link Prediction via Effective Resistances

March 17, 2017

Poster, BYU Spring Research Conference, 2017,

Won prize for best presentation of my session of the BYU Spring Research Conference. Presented research on using effective resistance for use in link prediction by viewing link prediction as a probabilistic problem wherein we view the current graph’s edge set as a realization of draws from an underlying probability distribution determined by a ground truth graph’s effective resistances.

Spectral Clustering in Directed Networks

March 19, 2016

Poster, BYU Spring Research Conference, 2016,

Won prize for best presentation of my session of the BYU Spring Research Conference. Presented research on estimating the latent number of clusters in directed networks for use in spectral clustering. The sequence of smallest eigenvalues of the associated graph Laplacian matrix that are real turned out to be a good estimator for the latent clustering structure.