Review of COLT and ICML

I spent last week in the lovely city of Edinburgh attending COLT and ICML. I’m still digesting a lot of what I saw, but I thought it might be interesting to give a quick list of my highlights.

Modern Banditry

Bandit and reinforcement learning algorithms are of major interest, given my work on Myna, and both conferences featured interesting papers on these problems. Of particular note, Hierarchical Exploration for Accelerating Contextual Bandits is an algorithm I could see us putting into practice very soon. This solves the problem of training a (linear) classifier under bandit feedback by initially restricting the parameters to a lower-dimensional subspace, and then relaxing this restriction as more data arrives. This reduces the amount of time spent exploring, and hence the regret, so long as a good subspace can be identified.

The Best of Both Worlds: Stochastic and Adversarial Bandits is a very interesting paper, showing it is possible to switch between a stochastic and adversarial bandit and still bound the regret if either case is true. I think this work is very early, and hopefully we’ll see further developments in the future. In particular bandit algorithms for the non-stationary but not adversarial case are of interest but largely unexplored in the literature.

The Policy Regret and Local Regret papers also presented some interesting ideas rethinking how we define regret. Finally there are number of reinforcement learning papers, which I haven’t yet had time to read.

Topic Models

Topic models continue to be a hot topic as they have direct application in many content recommendation systems. Latent Dirichlet allocation is one basic topic model, and there has been much work scaling it to large document collections. Previous work includes online LDA and Yahoo’s Hadoop-based LDA. At ICML we were treated to Sparse stochastic inference for latent Dirichlet allocation. This uses a hybrid variational/sampling scheme to do online inference (that is, it processes a stream of data). The experiments are performed on a 33 billion word corpus, which demonstrates the algorithms scalability. Of course this is not the last word on scaling LDA. In the future we can expect spectral methods to provide an alternative learning paradigm. In this particular case the algorithm is based on the singular value decomposition, which is surprisingly easy to scale.

Speeding up LDA is not the only game in the topic model town. The other main direction is developing more expressive or domain specific models. ICML had plenty of these, including models for melodic sequences, labelled data, changing topics and more.

While gathering the links for this post I came across this paper, which looks very very interesting if topic modelling is your bag.

Other Things

There was plenty of work on optimisation and Bayesian inference. I use these techniques, but they’re not something I have a particular interest in so I don’t have much to say here.

Both ICML and COLT had many papers on recommendation systems (also known as collaborative filtering, or matrix prediction/completion). I haven’t got around to reading most of these, but I’ll definitely be going through them at some point.

Finally, three papers that don’t fit any of the above themes but I found interesting:

  1. Exact Soft Confidence-Weighted Learning is the latest in the series of online linear classifiers that began with the passive-aggressive perceptron. I really like these algorithms; they are simple to implement, give great performance, and being online you don’t need to keep your training data around. I’m looking forward to testing this one.

  2. Sequence prediction is a problem that has many applications, from compression to recommender systems. Learning the Experts for Online Sequence Prediction shows how to learn a suffix-tree variant and demonstrates good performance predicting browsing behaviour.

  3. Most developers know about k-d trees for storing spatial data. K-d trees aren’t efficient in high dimensions as they branch too often. Approximate Principal Direction Trees describes an algorithm that represents high dimensional data compactly and doesn’t take much time to compute. The key insight, for me, is to use only a few iterations of the power method to compute a vector that is with high probability in a direction of high variance.

If you read this you might also be interested in Alexandre Passos’ reading list.

Like what you're reading?

Join our newsletter


We encourage discussion of our blog posts on our Gitter channel. Please review our Community Guidelines before posting there. We encourage discussion in good faith, but do not allow combative, exclusionary, or harassing behaviour. If you have any questions, contact us!