Ben Blaxill blaxill

These links no longer work. Springer have pulled the free plug.

Graduate texts in mathematics

duplicates = multiple editions

A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen

Garbage collection with zero cost at non-GC time

Every once in a while I investigate low-level backend options for PL-s, although so far I haven't actually written any such backend for my projects. Recently I've been looking at precise garbage collection in popular backends, and I've been (like on previous occasions) annoyed by limitations and compromises.

I was compelled to think about a system which accommodates precise relocating GC as much as possible. In one extreme configuration, described in this note, there

	"""Parallel grid search for sklearn's GradientBoosting.

	This script uses IPython.parallel to run cross-validated
	grid search on an IPython cluster. Each cell on the parameter grid
	will be evaluated ``K`` times - results are stored in MongoDB.

	The procedure tunes the number of trees ``n_estimators`` by averaging
	the staged scores of the GBRT model averaged over all K folds.

	You need an IPython ipcluster to connect to - for local use simply