activity
20192023
most citedWhen are Deep Networks really better than Decision Forests at small sample sizes, and how?

13 citations · 30 across the 11 of their papers we have counts for

collaborators

12 papers

stat.ML2023

Semisupervised regression in latent structure networks on unknown manifolds

Aranyak Acharyya, Joshua Agterberg, Michael W. Trosset +2

Random graphs are increasingly becoming objects of interest for modeling networks in a wide range of applications. Latent position random graph models posit that each node is assoc…

stat.AP2023

Discovering a change point and piecewise linear structure in a time series of organoid networks via the iso-mirror

Tianyi Chen, Youngser Park, Ali Saad-Eldin +10

Recent advancements have been made in the development of cell-based in-vitro neuronal networks, or organoids. In order to better understand the network structure of these organoids…

cs.LG2021★ 13 cited

When are Deep Networks really better than Decision Forests at small sample sizes, and how?

Haoyin Xu, Kaleab A. Kinfu, Will LeVine +9

Deep networks and decision forests (such as random forests and gradient boosted trees) are the leading machine learning methods for structured and tabular data, respectively. Many…

cs.LG2021

Leveraging semantically similar queries for ranking via combining representations

Hayden S. Helm, Marah Abdin, Benjamin D. Pedigo +8

In modern ranking problems, different and disparate representations of the items to be ranked are often available. It is sensible, then, to try to combine these representations to…

stat.ML2021★ 2 cited

Dynamic Silos: Increased Modularity in Intra-organizational Communication Networks during the Covid-19 Pandemic

Tiona Zuzul, Emily Cox Pahnke, Jonathan Larson +9

Workplace communications around the world were drastically altered by Covid-19, related work-from-home orders, and the rise of remote work. To understand these shifts, we analyzed…

cs.LG2021★ 1 cited

Learning without gradient descent encoded by the dynamics of a neurobiological model

Vivek Kurien George, Vikash Morar, Weiwei Yang +6

The success of state-of-the-art machine learning is essentially all based on different variations of gradient descent algorithms that minimize some version of a cost or loss functi…

stat.ML2021★ 1 cited

Inducing a hierarchy for multi-class classification problems

Hayden S. Helm, Weiwei Yang, Sujeeth Bharadwaj +5

In applications where categorical labels follow a natural hierarchy, classification methods that exploit the label structure often outperform those that do not. Un-fortunately, the…

stat.ME2020★ 4 cited

Multiple Network Embedding for Anomaly Detection in Time Series of Graphs

Guodong Chen, Jesús Arroyo, Avanti Athreya +7

This paper considers the graph signal processing problem of anomaly detection in time series of graphs. We examine two related, complementary inference tasks: the detection of anom…

cs.HC2020★ 5 cited

Design of a Privacy-Preserving Data Platform for Collaboration Against Human Trafficking

Darren Edge, Weiwei Yang, Kate Lytvynets +4

Case records on victims of human trafficking are highly sensitive, yet the ability to share such data is critical to evidence-based practice and policy development across governmen…

cs.HC2020

Workgroup Mapping: Visual Analysis of Collaboration Culture

Darren Edge, Jonathan Larson, Nikolay Trandev +5

The digital transformation of work presents new opportunities to understand how informal workgroups organize around the dynamic needs of organizations, potentially in contrast to t…

cs.AI2020★ 4 cited

Simple Lifelong Learning Machines

Jayanta Dey, Joshua T. Vogelstein, Hayden S. Helm +13

In lifelong learning, data are used to improve performance not only on the present task, but also on past and future (unencountered) tasks. While typical transfer learning algorith…

stat.ML2019

Vertex Nomination, Consistent Estimation, and Adversarial Modification

Joshua Agterberg, Youngser Park, Jonathan Larson +3

Given a pair of graphs and and a vertex set of interest in , the vertex nomination (VN) problem seeks to find the corresponding vertices of interest in (if t…