no code implementations • 1 Apr 2021 • Tiona Zuzul, Emily Cox Pahnke, Jonathan Larson, Patrick Bourke, Nicholas Caurvina, Neha Parikh Shah, Fereshteh Amini, Jeffrey Weston, Youngser Park, Joshua Vogelstein, Christopher White, Carey E. Priebe
Workplace communications around the world were drastically altered by Covid-19, related work-from-home orders, and the rise of remote work.
no code implementations • 10 Nov 2020 • Meghana Madhyastha, Kunal Lillaney, James Browne, Joshua Vogelstein, Randal Burns
We present methods to serialize and deserialize tree ensembles that optimize inference latency when models are not already loaded into memory.
no code implementations • 25 Sep 2019 • Ronan Perry, Tyler M. Tomita, Jesse Patsolic, Benjamin Falk, Joshua Vogelstein
In particular, DFs dominate other methods in tabular data, that is, when the feature space is unstructured, so that the signal is invariant to permuting feature indices.
no code implementations • 7 Jun 2019 • Hayden Helm, Joshua Vogelstein, Carey Priebe
This paper proposes a discrimination technique for vertices in a weighted network.
2 code implementations • 9 Feb 2016 • Da Zheng, Disa Mhembere, Vince Lyzinski, Joshua Vogelstein, Carey E. Priebe, Randal Burns
In contrast, we scale sparse matrix multiplication beyond memory capacity by implementing sparse matrix dense matrix multiplication (SpMM) in a semi-external memory (SEM) fashion; i. e., we keep the sparse matrix on commodity SSDs and dense matrices in memory.
Distributed, Parallel, and Cluster Computing
no code implementations • NeurIPS 2013 • Francesca Petralia, Joshua Vogelstein, David B. Dunson
Nonparametric estimation of the conditional distribution of a response given high-dimensional features is a challenging problem.
no code implementations • NeurIPS 2013 • Marcelo Fiori, Pablo Sprechmann, Joshua Vogelstein, Pablo Musé, Guillermo Sapiro
We also present results on multimodal graphs and applications to collaborative inference of brain connectivity from alignment-free functional magnetic resonance imaging (fMRI) data.
no code implementations • 23 Nov 2013 • Li Chen, Cencheng Shen, Joshua Vogelstein, Carey Priebe
For random graphs distributed according to stochastic blockmodels, a special case of latent position graphs, adjacency spectral embedding followed by appropriate vertex classification is asymptotically Bayes optimal; but this approach requires knowledge of and critically depends on the model dimension.