Jonah Gabry, Vince Dorie, and I are giving a 3-day short course in two weeks. Before class everyone should install R, RStudio and RStan on their computers. (If you already have these, please update to the latest version of R and the latest version of Stan, which is 2.10.) If problems occur please join the […]
After seeing this post by Matthew Wilson on a class of regression models called “factorization machines,” Aki writes: In a typical machine learning way, this is called “machine”, but it would be also a useful mode structure in Stan to make linear models with interactions, but with a reduced number of parameters. With a fixed […]
This is a public service announcement in the interest of more robust numerical calculations. Like matrix inverse, exponentiation is bad news. It’s prone to overflow or underflow. Just try this in R: > exp(-800) > exp(800) That’s not rounding error you see. The first one evaluates to zero (underflows) and the second to infinity (overflows). […]
Even better than binging on Netflix, catch up on Michael Betancourt’s updated video lectures, just days after their live theatrical debut in Tokyo. Scalable Bayesian Inference with Hamiltonian Monte Carlo (YouTube, 1 hour) Some Bayesian Modeling Techniques in Stan (YouTube, 1 hour 40 minutes) His previous videos have received very good reviews and they’re only […]
Chris Fonnesbeck contributed our first PyStan case study (I wrote the abstract), in the form of a very nice Jupyter notebook. Daniel Lee and I had the pleasure of seeing him present it live as part of a course we were doing at Vanderbilt last week. A Primer on Bayesian Multilevel Modeling using PyStan This […]
Carl Bialik and Andrew Flowers at fivethirtyeight.com (Nate Silver’s site) ran a story following up on our birthdays example—that time series decomposition of births by day, which is on the cover of the third edition of Bayesian Data Analysis using data from 1968-1988, and which then Aki redid using a new dataset from 2000-2014. Friday […]
Luke Miratrix writes: In the applied stats class I’m teaching on hierarchical models I’m giving the students (a mix of graduate students, many from the education school, and undergrads) a taste of Stan. I have to give them some “standard” way to turn Stan output into a point estimate (though of course I’ll also explain […]
Yee Whye Teh sends along this paper with Leonard Hasenclever, Thibaut Lienart, Sebastian Vollmer, Stefan Webb, Balaji Lakshminarayanan, and Charles Blundell. I haven’t read it in detail but they not similarities to our “expectation propagation as a way of life” paper. But their work is much more advanced than ours.
It’s so much fun to work in open source. Luke Wiklendt sent along this improved code for a change-point model calculation in Stan. With N data points in the time series, the version in the manual is O(N2), whereas the improved version is O(N). In practice, Luke says [the new code] results in a dramatic […]
Georgy Cheremovskiy writes: I’m one of the organizers of an unusual reinforcement learning competition named Black Box Challenge. The conception is simple — one need to program an agent that can play a game with unknown rules. At each time step agent is given an environment state vector and has a few possible actions. The […]
Allen and Michael pointed us on the Stan list to these amusing documents by Oliver Keyes: Rbitrary Standards: “This is an alternate FAQ for R. Specifically, it’s an FAQ that tries to answer all the questions about R’s weird standards, formatting and persnicketiness that you’re afraid to ask.” Parallelism, R, and OpenMP Enjoy.
Dave Clark writes: I was hoping for your opinion on a topic related to hierarchical models. I am an actuary and have generally worked with the concept of hierarchical models in the context of credibility theory. The text by Bühlmann and Gisler (A Course in Credibility Theory; Springer) sets up the mixed models under the […]
There’s a new section of the Stan web site, with case studies meant to illustrate statistical methodologies, classes of models, application areas, statistical computation, and Stan programming. Stan Case Studies The first ten or so are up, including a grab bag of education models from Daniel Furr at U.C. Berkeley: Hierarchical Two-Parameter Logistic Item Response […]
A colleague writes: I’m working with a doctoral student on a latent affinity network problem and we keep hitting challenges in sampling, in our case using Metropolis-Hastings, for the network links. As you can imagine, lots of local modes, things get stuck, etc . . . Any suggestions on how to sample network links? My […]
We recently had an email discussion among the Stan team regarding the use of predictive accuracy in evaluating computing algorithms. I thought this could be of general interest so I’m sharing it here. It started when Bob said he’d been at a meting on probabilistic programming where there was confusion on evaluation. In particular, some […]
Peter Liberman writes: I’m working on a paper that, in the absence of a single survey that measured the required combination of variables, analyzes data collected by separate, uncoordinated Knowledge Networks surveys in 2003. My co-author (a social psychologist who commissioned one of the surveys) and I obtained from KN unique id numbers for all […]