output
20092026
most citedParallelizing MCMC with Random Partition Trees

50 citations

Showing 2015Show all

7 papers · 1 filter

stat.AP2015

Stability and Localization of inter-individual differences in functional connectivity

Raag D. Airan, Joshua T. Vogelstein, Jay J. Pillai +3

Much recent attention has been paid to quantifying anatomic and functional neuroimaging on the individual subject level. For optimal individual subject characterization, specific a…

stat.ML2015★ 50 cited

Parallelizing MCMC with Random Partition Trees

Xiangyu Wang, Fangjian Guo, Katherine A. Heller +1

The modern scale of data has brought new challenges to Bayesian inference. In particular, conventional MCMC algorithms are computationally very expensive for large data sets. A pro…

math.NA2015★ 11 cited

Fast exact summation using small and large superaccumulators

Radford M. Neal

I present two new methods for exactly summing a set of floating-point numbers, and then correctly rounding to the nearest floating-point number. Higher accuracy than simple summati…

stat.CO2015

Representing numeric data in 32 bits while preserving 64-bit precision

Radford M. Neal

Data files often consist of numbers having only a few significant decimal digits, whose information content would allow storage in only 32 bits. However, we may require that arithm…

stat.ME2015

Model Choice and Diagnostics for Linear Mixed-Effects Models Using Statistics on Street Corners

Adam Loy, Heike Hofmann, Dianne Cook

The complexity of linear mixed-effects (LME) models means that traditional diagnostics are rendered less effective. This is due to a breakdown of asymptotic results, boundary issue…

math.ST2015

Detection of Planted Solutions for Flat Satisfiability Problems

Quentin Berthet, Jordan S. Ellenberg

We study the detection problem of finding planted solutions in random instances of flat satisfiability problems, a generalization of boolean satisfiability formulas. We describe th…