23 Apr 2019
Planet Lisp
Paul Khuong: Fractional Set Covering With Experts
Last winter break, I played with one of the annual capacitated vehicle routing problem (CVRP) "Santa Claus" contests. Real world family stuff took precedence, so, after the obvious LKH with Concorde polishing for individual tours, I only had enough time for one diversification moonshot. I decided to treat the high level problem of assembling prefabricated routes as a set covering problem: I would solve the linear programming (LP) relaxation for the mincost set cover, and use randomised rounding to feed new starting points to LKH. Add a lot of luck, and that might just strike the right balance between solution quality and diversity.
Unsurprisingly, luck failed to show up, but I had ulterior motives: I'm much more interested in exploring first order methods for relaxations of combinatorial problems than in solving CVRPs. The routes I had accumulated after a couple days turned into a set covering LP with 1.1M decision variables, 10K constraints, and 20M nonzeros. That's maybe denser than most combinatorial LPs (the aspect ratio is definitely atypical), but 0.2% nonzeros is in the right ballpark.
As soon as I had that fractional set cover instance, I tried to solve it with a simplex solver. Like any good Googler, I used Glop... and stared at a blank terminal for more than one hour.
Having observed that lack of progress, I implemented the toy I really wanted to try out: first order online "learning with experts" (specifically, AdaHedge) applied to LP optimisation. I let this notparticularlyoptimised serial CL code run on my 1.6 GHz laptop for 21 hours, at which point the first order method had found a 4.5% infeasible solution (i.e., all the constraints were satisfied with \(\ldots \geq 0.955\) instead of \(\ldots \geq 1\)). I left Glop running long after the contest was over, and finally stopped it with no solution after more than 40 days on my 2.9 GHz E5.
Given the shape of the constraint matrix, I would have loved to try an interior point method, but all my licenses had expired, and I didn't want to risk OOMing my workstation. Erling Andersen was later kind enough to test Mosek's interior point solver on it. The runtime was much more reasonable: 10 minutes on 1 core, and 4 on 12 cores, with the sublinear speedup mostly caused by the serial crossover to a simplex basis.
At 21 hours for a naïve implementation, the "learning with experts" first order method isn't practical yet, but also not obviously uninteresting, so I'll write it up here.
Using online learning algorithms for the "experts problem" (e.g., Freund and Schapire's Hedge algorithm) to solve linear programming feasibility is now a classic result; Jeremy Kun has a good explanation on his blog. What's new here is:
 Directly solving the optimisation problem.
 Confirming that the parameterfree nature of AdaHedge helps.
The first item is particularly important to me because it's a simple modification to the LP feasibility metaalgorithm, and might make the difference between a tool that's only suitable for theoretical analysis and a practical approach.
I'll start by reviewing the experts problem, and how LP feasibility is usually reduced to the former problem. After that, I'll cast the reduction as a surrogate relaxation method, rather than a Lagrangian relaxation; optimisation should flow naturally from that point of view. Finally, I'll guess why I had more success with AdaHedge this time than with Multiplicative Weight Update eight years ago^{1}.
The experts problem and LP feasibility
I first heard about the experts problem while researching dynamic sorted set data structures: Igal Galperin's PhD dissertation describes scapegoat trees, but is really about online learning with experts. Arora, Hazan, and Kale's 2012 survey of multiplicative weight update methods. is probably a better introduction to the topic ;)
The experts problem comes in many variations. The simplest form sounds like the following. Assume you're playing a binary prediction game over a predetermined number of turns, and have access to a fixed finite set of experts at each turn. At the beginning of every turn, each expert offers their binary prediction (e.g., yes it will rain today, or it will not rain today). You then have to make a prediction yourself, with no additional input. The actual result (e.g., it didn't rain today) is revealed at the end of the turn. In general, you can't expect to be right more often than the best expert at the end of the game. Is there a strategy that bounds the "regret," how many more wrong prediction you'll make compared to the expert(s) with the highest number of correct predictions, and in what circumstances?
Amazingly enough, even with an omniscient adversary that has access to your strategy and determines both the experts' predictions and the actual result at the end of each turn, a stream of random bits (hidden from the adversary) suffice to bound our expected regret in \(\mathcal{O}(\sqrt{T}\,\lg n)\), where \(T\) is the number of turns and \(n\) the number of experts.
I long had trouble with that claim: it just seems too good of a magic trick to be true. The key realisation for me was that we're only comparing against invidivual experts. If each expert is a move in a matrix game, that's the same as claiming you'll never do much worse than any pure strategy. One example of a pure strategy is always playing rock in RockPaperScissors; pure strategies are really bad! The trick is actually in making that regret bound useful.
We need a more continuous version of the experts problem for LP feasibility. We're still playing a turnbased game, but, this time, instead of outputting a prediction, we get to "play" a mixture of the experts (with nonnegative weights that sum to 1). At the beginning of each turn, we describe what weight we'd like to give to each experts (e.g., 60% rock, 40% paper, 0% scissors). The cost (equivalently, payoff) for each expert is then revealed (e.g., \(\mathrm{rock} = 0.5\), \(\mathrm{paper} = 0.5\), \(\mathrm{scissors} = 0\)), and we incur the weighted average from our play (e.g., \(60\% \cdot 0.5 + 40\% \cdot 0.5 = 0.1\)) before playing the next round.^{2} The goal is to minimise our worstcase regret, the additive difference between the total cost incurred by our mixtures of experts and that of the a posteriori best single expert. In this case as well, online learning algorithms guarantee regret in \(\mathcal{O}(\sqrt{T} \, \lg n)\)
This line of research is interesting because simple algorithms achieve that bound, with explicit constant factors on the order of 1,^{3} and those bounds are known to be nonasymptotically tight for a large class of algorithms. Like dense linear algebra or fast Fourier transforms, where algorithms are often compared by counting individual floating point operations, online learning has matured into such tight bounds that worstcase regret is routinely presented without Landau notation. Advances improve constant factors in the worst case, or adapt to easier inputs in order to achieve "better than worst case" performance.
The reduction below lets us take any learning algorithm with an additive regret bound, and convert it to an algorithm with a corresponding worstcase iteration complexity bound for \(\varepsilon\)approximate LP feasibility. An algorithm that promises low worstcase regret in \(\mathcal{O}(\sqrt{T})\) gives us an algorithm that needs at most \(\mathcal{O}(1/\varepsilon\sp{2})\) iterations to return a solution that almost satisfies every constraint in the linear program, where each constraint is violated by \(\varepsilon\) or less (e.g., \(x \leq 1\) is actually \(x \leq 1 + \varepsilon\)).
We first split the linear program in two components, a simple domain (e.g., the nonnegative orthant or the \([0, 1]\sp{d}\) box) and the actual linear constraints. We then map each of the latter constraints to an expert, and use an arbitrary algorithm that solves our continuous version of the experts problem as a black box. At each turn, the black box will output a set of nonnegative weights for the constraints (experts). We will average the constraints using these weights, and attempt to find a solution in the intersection of our simple domain and the weighted average of the linear constraints.
Let's use Stigler's Diet Problem with three foods and two constraints as a small example, and further simplify it by disregarding the minimum value for calories, and the maximum value for vitamin A. Our simple domain here is at least the nonnegative orthant: we can't ingest negative food. We'll make things more interesting by also making sure we don't eat more than 10 servings of any food per day.
The first constraint says we mustn't get too many calories
\[72 x\sb{\mathrm{corn}} + 121 x\sb{\mathrm{milk}} + 65 x\sb{\mathrm{bread}} \leq 2250,\]
and the second constraint (tweaked to improve this example) ensures we ge enough vitamin A
\[107 x\sb{\mathrm{corn}} + 400 x\sb{\mathrm{milk}} \geq 5000,\]
or, equivalently,
\[107 x\sb{\mathrm{corn}}  400 x\sb{\mathrm{milk}} \leq 5000,\]
Given weights \([¾, ¼]\), the weighted average of the two constraints is
\[27.25 x\sb{\mathrm{corn}}  9.25 x\sb{\mathrm{milk}} + 48.75 x\sb{\mathrm{bread}} \leq 437.5,\]
where the coefficients for each variable and for the righthand side were averaged independently.
The subproblem asks us to find a feasible point in the intersection of these two constraints: \[27.25 x\sb{\mathrm{corn}}  9.25 x\sb{\mathrm{milk}} + 48.75 x\sb{\mathrm{bread}} \leq 437.5,\] \[0 \leq x\sb{\mathrm{corn}},\, x\sb{\mathrm{milk}},\, x\sb{\mathrm{bread}} \leq 10.\]
Classically, we claim that this is just Lagrangian relaxation, and find a solution to
\[\min 27.25 x\sb{\mathrm{corn}}  9.25 x\sb{\mathrm{milk}} + 48.75 x\sb{\mathrm{bread}}\] subject to \[0 \leq x\sb{\mathrm{corn}},\, x\sb{\mathrm{milk}},\, x\sb{\mathrm{bread}} \leq 10.\]
In the next section, I'll explain why I think this analogy is wrong and worse than useless. For now, we can easily find the maximum one variable at a time, and find the solution \(x\sb{\mathrm{corn}} = 0\), \(x\sb{\mathrm{milk}} = 10\), \(x\sb{\mathrm{bread}} = 0\), with objective value \(92.5\) (which is \(530\) less than \(437.5\)).
In general, three things can happen at this point. We could discover that the subproblem is infeasible. In that case, the original nonrelaxed linear program itself is infeasible: any solution to the original LP satisfies all of its constraints, and thus would also satisfy any weighted average of the same constraints. We could also be extremely lucky and find that our optimal solution to the relaxation is (\(\varepsilon\))feasible for the original linear program; we can stop with a solution. More commonly, we have a solution that's feasible for the relaxation, but not for the original linear program.
Since that solution satisfies the weighted average constraint, the black box's payoff for this turn (and for every other turn) is nonpositive. In the current case, the first constraint (on calories) is satisfied by \(1040\), while the second (on vitamin A) is violated by \(1000\). On weighted average, the constraints are satisfied by \(\frac{1}{4}(3 \cdot 1040  1000) = 530.\) Equivalently, they're violated by \(530\) on average.
We'll add that solution to an accumulator vector that will come in handy later.
The next step is the key to the reduction: we'll derive payoffs (negative costs) for the black box from the solution to the last relaxation. Each constraint (expert) has a payoff equal to its level of violation in the relaxation's solution. If a constraint is strictly satisfied, the payoff is negative; for example, the constraint on calories is satisfied by \(1040\), so its payoff this turn is \(1040\). The constraint on vitamin A is violated by \(1000\), so its payoff this turn is \(1000\). Next turn, we expect the black box to decrease the weight of the constraint on calories, and to increase the weight of the one on vitamin A.
After \(T\) turns, the total payoff for each constraint is equal to the sum of violations by all solutions in the accumulator. Once we divide both sides by \(T\), we find that the divided payoff for each constraint is equal to its violation by the average of the solutions in the accumulator. For example, if we have two solutions, one that violates the calories constraint by \(500\) and another that satisfies it by \(1000\) (violates it by \(1000\)), the total payoff for the calories constraint is \(500\), and the average of the two solutions does strictly satisfy the linear constraint by \(\frac{500}{2} = 250\)!
We also know that we only generated feasible solutions to the relaxed subproblem (otherwise, we'd have stopped and marked the original LP as infeasible), so the black box's total payoff is \(0\) or negative.
Finally, we assumed that the black box algorithm guarantees an additive regret in \(\mathcal{O}(\sqrt{T}\, \lg n)\), so the black box's payoff of (at most) \(0\) means that any constraint's payoff is at most \(\mathcal{O}(\sqrt{T}\, \lg n)\). After dividing by \(T\), we obtain a bound on the violation by the arithmetic mean of all solutions in the accumulator: for all constraint, that violation is in \(\mathcal{O}\left(\frac{\lg n}{\sqrt{T}}\right)\). In other words, the number of iteration \(T\) must scale with \(\mathcal{O}\left(\frac{\lg n}{\varepsilon\sp{2}}\right)\), which isn't bad when \(n\) is in the millions but \(\varepsilon \approx 0.01\).
Theoreticians find this reduction interesting because there are concrete implementations of the black box, e.g., the multiplicative weight update (MWU) method with nonasymptotic bounds. For many problems, this makes it possible to derive the exact number of iterations necessary to find an \(\varepsilon\)feasible fractional solution, given \(\varepsilon\) and the instance's size (but not the instance itself).
That's why algorithms like MWU are theoretically useful tools for fractional approximations, when we already have subgradient methods that only need \(\mathcal{O}\left(\frac{1}{\varepsilon}\right)\) iterations: stateoftheart algorithms for learning with experts explicit nonasymptotic regret bounds that yield, for many problems, iteration bounds that only depend on the instance's size, but not its data. While the iteration count when solving LP feasibility with MWU scales with \(\frac{1}{\varepsilon\sp{2}}\), it is merely proportional to \(\lg n\), the log of the the number of linear constraints. That's attractive, compared to subgradient methods for which the iteration count scales with \(\frac{1}{\varepsilon}\), but also scales linearly with respect to instancedependent values like the distance between the initial dual solution and the optimum, or the Lipschitz constant of the Lagrangian dual function; these values are hard to bound, and are often proportional to the square root of the number of constraints. Given the choice between \(\mathcal{O}\left(\frac{\lg n}{\varepsilon\sp{2}}\right)\) iterations with explicit constants, and a looser \(\mathcal{O}\left(\frac{\sqrt{n}}{\varepsilon}\right)\), it's obvious why MWU and online learning are powerful additions to the theory toolbox.
Theoreticians are otherwise not concerned with efficiency, so the usual answer to someone asking about optimisation is to tell them they can always reduce linear optimisation to feasibility with a binary search on the objective value. I once made the mistake of implementing that binary search last strategy. Unsurprisingly, it wasn't useful. I also tried another theoretical reduction, where I looked for a pair of primal and dual feasible solutions that happened to have the same objective value. That also failed, in a more interesting manner: since the two solution had to have almost the same value, the universe spited me by sending back solutions that were primal and dual infeasible in the worst possible way. In the end, the second reduction generated fractional solutions that were neither feasible nor superoptimal, which really isn't helpful.
Direct linear optimisation with experts
The reduction above works for any "simple" domain, as long as it's convex and we can solve the subproblems, i.e., find a point in the intersection of the simple domain and a single linear constraint or determine that the intersection is empty.
The set of (super)optimal points in some initial simple domain is still convex, so we could restrict our search to the search of the domain that is superoptimal for the linear program we wish to optimise, and directly reduce optimisation to the feasibility problem solved in the last section, without binary search.
That sounds silly at first: how can we find solutions that are superoptimal when we don't even know the optimal value?
Remember that the subproblems are always relaxations of the original linear program. We can port the objective function from the original LP over to the subproblems, and optimise the relaxations. Any solution that's optimal for a realxation must have an optimal or superoptimal value for the original LP.
Rather than treating the black box online solver as a generator of Lagrangian dual vectors, we're using its weights as solutions to the surrogate relaxation dual. The latter interpretation isn't just more powerful by handling objective functions. It also makes more sense: the weights generated by algorithms for the experts problem are probabilities, i.e., they're nonnegative and sum to \(1\). That's also what's expected for surrogate dual vectors, but definitely not the case for Lagrangian dual vectors, even when restricted to \(\leq\) constraints.
We can do even better!
Unlike Lagrangian dual solvers, which only converge when fed (approximate) subgradients and thus make us (nearly) optimal solutions to the relaxed subproblems, our reduction to the experts problem only needs feasible solutions to the subproblems. That's all we need to guarantee an \(\varepsilon\)feasible solution to the initial problem in a bounded number of iterations. We also know exactly how that \(\varepsilon\)feasible solution is generated: it's the arithmetic mean of the solutions for relaxed subproblems.
This lets us decouple finding lower bounds from generating feasible solutions that will, on average, \(\varepsilon\)satisfy the original LP. In practice, the search for an \(\varepsilon\)feasible solution that is also superoptimal will tend to improve the lower bound. However, nothing forces us to evaluate lower bounds synchronously, or to only use the experts problem solver to improve our bounds.
We can find a new bound from any vector of nonnegative constraint weights: they always yield a valid surrogate relaxation. We can solve that relaxation, and update our best bound when it's improved. The Diet subproblem earlier had
\[27.25 x\sb{\mathrm{corn}}  9.25 x\sb{\mathrm{milk}} + 48.75 x\sb{\mathrm{bread}} \leq 437.5,\] \[0 \leq x\sb{\mathrm{corn}},\, x\sb{\mathrm{milk}},\, x\sb{\mathrm{bread}} \leq 10.\]
Adding the original objective function back yields the linear program
\[\min 0.18 x\sb{\mathrm{corn}} + 0.23 x\sb{\mathrm{milk}} + 0.05 x\sb{\mathrm{bread}}\] subject to \[27.25 x\sb{\mathrm{corn}}  9.25 x\sb{\mathrm{milk}} + 48.75 x\sb{\mathrm{bread}} \leq 437.5,\] \[0 \leq x\sb{\mathrm{corn}},\, x\sb{\mathrm{milk}},\, x\sb{\mathrm{bread}} \leq 10,\]
which has a trivial optimal solution at \([0, 0, 0]\).
When we generate a feasible solution for the same subproblem, we can use any valid bound on the objective value to find the most feasible solution that is also assuredly (super)optimal. For example, if some oracle has given us a lower bound of \(2\) for the original Diet problem, we can solve for
\[\min 27.25 x\sb{\mathrm{corn}}  9.25 x\sb{\mathrm{milk}} + 48.75 x\sb{\mathrm{bread}}\] subject to \[0.18 x\sb{\mathrm{corn}} + 0.23 x\sb{\mathrm{milk}} + 0.05 x\sb{\mathrm{bread}}\leq 2\] \[0 \leq x\sb{\mathrm{corn}},\, x\sb{\mathrm{milk}},\, x\sb{\mathrm{bread}} \leq 10.\]
We can relax the objective value constraint further, since we know that the final \(\varepsilon\)feasible solution is a simple arithmetic mean. Given the same best bound of \(2\), and, e.g., a current average of \(3\) solutions with a value of \(1.9\), a new solution with an objective value of \(2.3\) (more than our best bound, so not necessarily optimal!) would yield a new average solution with a value of \(2\), which is still (super)optimal. This means we can solve the more relaxed subproblem
\[\min 27.25 x\sb{\mathrm{corn}}  9.25 x\sb{\mathrm{milk}} + 48.75 x\sb{\mathrm{bread}}\] subject to \[0.18 x\sb{\mathrm{corn}} + 0.23 x\sb{\mathrm{milk}} + 0.05 x\sb{\mathrm{bread}}\leq 2.3\] \[0 \leq x\sb{\mathrm{corn}},\, x\sb{\mathrm{milk}},\, x\sb{\mathrm{bread}} \leq 10.\]
Given a bound on the objective value, we swapped the constraint and the objective; the goal is to maximise feasibility, while generating a solution that's "good enough" to guarantee that the average solution is still (super)optimal.
For boxconstrained linear programs where the box is the convex domain, subproblems are bounded linear knapsacks, so we can simply stop the greedy algorithm as soon as the objective value constraint is satisfied, or when the knapsack constraint becomes active (we found a better bound).
This last tweak doesn't just accelerate convergence to \(\varepsilon\)feasible solutions. More importantly for me, it pretty much guarantees that out \(\varepsilon\)feasible solution matches the best known lower bound, even if that bound was provided by an outside oracle. Bundle methods and the Volume algorithm can also mix solutions to relaxed subproblems in order to generate \(\varepsilon\)feasible solutions, but the result lacks the last guarantee: their fractional solutions are even more superoptimal than the best bound, and that can make bounding and variable fixing difficult.
The secret sauce: AdaHedge
Before last Christmas's CVRP set covering LP, I had always used the multiplicative weight update (MWU) algorithm as my black box online learning algorithm: it wasn't great, but I couldn't find anything better. The two main downsides for me were that I had to know a "width" parameter ahead of time, as well as the number of iterations I wanted to run.
The width is essentially the range of the payoffs; in our case, the potential level of violation or satisfaction of each constraints by any solution to the relaxed subproblems. The dependence isn't surprising: folklore in Lagrangian relaxation also says that's a big factor there. The problem is that the most extreme violations and satisfactions are initialisation parameters for the MWU algorithm, and the iteration count for a given \(\varepsilon\) is quadratic in the width (\(\mathrm{max_violation} \cdot \mathrm{max_satisfaction}\)).
What's even worse is that the MWU is explicitly tuned for a specific iteration count. If I estimate that, give my worstcase width estimate, one million iterations will be necessary to achieve \(\varepsilon\)feasibility, MWU tuned for 1M iterations will need 1M iterations, even if the actual width is narrower.
de Rooij and others published AdaHedge in 2013, an algorithm that addresses both these issues by smoothly estimating its parameter over time, without using the doubling trick.^{4} AdaHedge's loss (convergence rate to an \(\varepsilon\)solution) still depends on the relaxation's width. However, it depends on the maximum width actually observed during the solution process, and not on any explicit worstcase bound. It's also not explicily tuned for a specific iteration count, and simply keeps improving at a rate that roughly matches MWU. If the instance happens to be easy, we will find an \(\varepsilon\)feasible solution more quickly. In the worst case, the iteration count is never much worse than that of an optimally tuned MWU.
These 400 lines of Common Lisp implement AdaHedge and use it to optimise the set covering LP. AdaHedge acts as the online blackk box solver for the surrogate dual problem, the relaxed set covering LP is a linear knapsack, and each subproblem attempts to improve the lower bound before maximising feasibility.
When I ran the code, I had no idea how long it would take to find a feasible enough solution: covering constraints can never be violated by more than \(1\), but some points could be covered by hundreds of tours, so the worst case satisfaction width is high. I had to rely on the way AdaHedge adapts to the actual hardness of the problem. In the end, \(34492\) iterations sufficed to find a solution that was \(4.5\%\) infeasible^{5}. This corresponds to a worst case with a width of less than \(2\), which is probably not what happened. It seems more likely that the surrogate dual isn't actually an omniscient adversary, and AdaHedge was able to exploit some of that "easiness."
The iterations themselves are also reasonable: one sparse matrix / dense vector multiplication to convert surrogate dual weights to an average constraint, one solve of the relaxed LP, and another sparse matrix / dense vector multiplication to compute violations for each constraint. The relaxed LP is a fractional \([0, 1]\) knapsack, so the bottleneck is sorting double floats. Each iteration took 1.8 seconds on my old laptop; I'm guessing that could easily be 1020 times faster with vectorisation and parallelisation.
In another post, I'll show how using the same surrogate dual optimisation algorithm to mimick Lagrangian decomposition instead of Lagrangian relaxation guarantees an iteration count in \(\mathcal{O}\left(\frac{\lg \#\mathrm{nonzero}}{\varepsilon\sp{2}}\right)\) independently of luck or the specific linear constraints.

Yes, I have been banging my head against that wall for a while.↩

This is equivalent to minimising expected loss with random bits, but cleans up the reduction.↩

When was the last time you had to worry whether that log was natural or base2?↩

The doubling trick essentially says to start with an estimate for some parameters (e.g., width), then adjust it to at least double the expected iteration count when the parameter's actual value exceeds the estimate. The sum telescopes and we only pay a constant multiplicative overhead for the dynamic update.↩

I think I computed the \(\log\) of the number of decision variables instead of the number of constraints, so maybe this could have gone a bit better.↩
23 Apr 2019 10:50pm GMT
09 Apr 2019
Planet Lisp
Lispers.de: Berlin Lispers Meetup, Monday, 15th April 2019
We meet again on Monday 8pm, 15th April. Our host this time is James Anderson (www.dydra.com).
Berlin Lispers is about all flavors of Lisp including Emacs Lisp, Common Lisp, Clojure, Scheme.
We will have two talks this time.
Hans Hübner will tell us about "Reanimating VAX LISP  A CLtL1 implementation for VAX/VMS".
And Ingo Mohr will continue his talk "About the Unknown East of the Ancient LISP World. History and Thoughts. Part II: Eastern Common LISP and a LISP Machine."
We meet in the TautHaus at Engeldamm 70 in BerlinMitte, the bell is "James Anderson". It is located in 10min walking distance from U Moritzplatz or U Kottbusser Tor or Ostbahnhof. In case of questions call Christian +49 1578 70 51 61 4.
09 Apr 2019 12:30pm GMT
08 Apr 2019
Planet Lisp
Didier Verna: Quickref 2.0 "Be Quick or Be Dead" is released
Surfing on the energizing wave of ELS 2019, the 12 European Lisp Symposium, I'm happy to announce the release of Quickref 2.0, codename "Be Quick or Be Dead".
The major improvement in this release, justifying an increment of the major version number (and the very appropriate codename), is the introduction of parallel algorithms for building the documentation. I presented this work last week in Genova so I won't go into the gory details here, but for the brave and impatient, let me just say that using the parallel implementation is just a matter of calling the BUILD
function with :parallel t :decltthreads x :makeinfothreads y
(adjust x and y as you see fit, depending on your architecture).
The second featured improvement is the introduction of an author index, in addition to the original one. The author index is still a bit shaky, mostly due to technical problems (calling asdf:findsystem
almost two thousand times simply doesn't work) and also to the very creative use that some library authors have of the ASDF author
and maintainer
slots in the system descriptions. It does, however, a quite decent job for the majority of the authors and their libraries'reference manuals.
Finally, the repository now has a fully functional continuous integration infrastructure, which means that there shouldn't be anymore lags between new Quicklisp (or Quickref) releases and new versions of the documentation website.
Thanks to Antoine Hacquard, Antoine Martin, and Erik Huelsmann for their contribution to this release! A lot of new features are already in the pipe. Currently documenting 1720 libraries, and counting...
08 Apr 2019 12:00am GMT
28 Mar 2019
Planet Lisp
Lispers.de: LispMeetup in Hamburg on Monday, 1st April 2019
We meet at Ristorante Opera, Dammtorstraße 7, Hamburg, starting around 19:00 CET on 1st April 2019.
This is an informal gathering of Lispers. Svante will talk a bit about the implementation of lispers.de. You are invited to bring your own topics.
28 Mar 2019 7:17pm GMT
20 Mar 2019
Planet Lisp
Lispers.de: Berlin Lispers Meetup, Monday, 25th March 2019
We meet again on Monday 8pm, 25th March. Our host this time is James Anderson (www.dydra.com).
Berlin Lispers is about all flavors of Lisp including Common Lisp, Scheme, Dylan, Clojure.
We will have a talk this time. Ingo Mohr will tell us "About the Unknown East of the Ancient LISP World. History and Thoughts. Part I: LISP on Punchcards".
We meet in the TautHaus at Engeldamm 70 in BerlinMitte, the bell is "James Anderson". It is located in 10min walking distance from U Moritzplatz or U Kottbusser Tor or Ostbahnhof. In case of questions call Christian +49 1578 70 51 61 4.
20 Mar 2019 10:30am GMT
07 Mar 2019
Planet Lisp
Quicklisp news: March 2019 Quicklisp dist update now available
New projects:
 bobbin  Simple (word) wrapping utilities for strings.  MIT
 clmango  A minimalist CouchDB 2.x database client.  BSD3
 clnetpbm  Common Lisp support for reading/writing the netpbm image formats (PPM, PGM, and PBM).  MIT/X11
 clskkserv  skkserv with Common Lisp  GPLv3
 cltorrents  This is a little tool for the lisp REPL or the command line (also with a readline interactive prompt) to search for torrents and get magnet links  MIT
 commonlispjupyter  A Common Lisp kernel for Jupyter along with a library for building Jupyter kernels.  MIT
 conf  Simple configuration file manipulator for projects.  GNU General Public License v3.0
 eventbus  An event bus in Common Lisp.  GPLv3
 openlocationcode  Open Location Code library.  Modified BSD License
 piggybackparameters  This is a configuration system that supports local file and database based parameter storage.  MIT
 quilc  A CLI frontend for the Quil compiler  Apache License 2.0 (See LICENSE.txt)
 qvm  An implementation of the Quantum Abstract Machine.  Apache License 2.0 (See LICENSE.txt)
 restrictedfunctions  Reasoning about functions with restricted argument types.  MIT
 simplet  Simple test runner in Common Lisp.  GPLv3
 skeletoncreator  Create projects from a skeleton directory.  GPLv3
 solidengine  The Common Lisp stackbased application controller  MIT
 spell  Spellchecking package for Common Lisp  BSD
 trivialcontinuation  Provides an implementation of function call continuation and combination.  MIT
 trivialhashtableserialize  A simple method to serialize and deserialize hashtables.  MIT
 trivialjsoncodec  A JSON parser able to identify class hierarchies.  MIT
 trivialmonitoredthread  Trivial Monitored Thread offers a very simple (aka trivial) way of spawning threads and being informed when one any of them crash and die.  MIT
 trivialobjectlock  A simple method to lock object (and slot) access.  MIT
 trivialpooleddatabase  A DB multithreaded connection pool.  MIT
 trivialtimer  Easy scheduling of tasks (functions).  MIT
 trivialvariablebindings  Offers a way to handle associations between a placeholder (aka. variable) and a value.  MIT
 ucons  Unique conses and functions for working on them.  MIT
 wordnet  Common Lisp interface to WordNet  CCBY 4.0
Updated projects: agnosticlizard, april, bigstring, binfix, cepl, chancery, chirp, cl+ssl, clabstractclasses, clall, clasync, clcollider, clconllu, clcron, cldigraph, clegl, clgapbuffer, clgenerator, clgenericarithmetic, clgrace, clhamcrest, cllas, clledger, cllocatives, clmarkless, clmessagepack, clntriples, clpatterns, clprevalence, clproj, clproject, clqrencode, clrandomforest, clstopwatch, clstringcomplete, clstringmatch, cltcod, clwayland, clad, clem, clod, closermop, clxxembed, coleslaw, commonlispactors, croatoan, dartsclhashtree, datalens, defrec, doplus, doublylinkedlist, dynamiccollect, eclector, escalator, externalprogram, fiasco, flacparser, gamemath, gameboxdgen, gameboxmath, gendl, genericcl, genie, goldenutils, helambdap, interface, ironclad, jpnumeral, jsonresponses, lmath, letrec, lispchat, listopia, literatelisp, maiden, mapset, mcclim, mito, nodgui, overlord, parachute, parameterizedfunction, pathnameutils, periods, petalisp, pjlink, plump, policycond, portablethreads, postmodern, protest, qtlibs, qtools, qtoolsui, recur, regulartypeexpression, rove, serapeum, shadow, simplifiedtypes, sly, spinneret, staple, stumpwm, sucle, synonyms, tagger, template, trivia, trivialbattery, trivialbenchmark, trivialsignal, trivialutilities, ubiquitous, umbra, usocket, varjo, vernacular, withcsyntax.
Removed projects: mgl, mglmat.
To get this update, use: (ql:updatedist "quicklisp")
Enjoy!
07 Mar 2019 2:52pm GMT
27 Feb 2019
Planet Lisp
Lispers.de: LispMeetup in Hamburg on Monday, 4th March 2019
We meet at Ristorante Opera, Dammtorstraße 7, Hamburg, starting around 19:00 CET on 4th March 2019.
This is an informal gathering of Lispers. Come as you are, bring lispy topics.
27 Feb 2019 11:26am GMT
26 Feb 2019
Planet Lisp
Paul Khuong: The Unscalable, Deadlockprone, Thread Pool
Epistemic Status: I've seen thread pools fail this way multiple times, am confident the poolperstate approach is an improvement, and have confirmed with others they've also successfully used it in anger. While I've thought about this issue several times over ~4 years and poolperstate seems like a good fix, I'm not convinced it's undominated and hope to hear about better approaches.
Thread pools tend to only offer a sparse interface: pass a closure or a function and its arguments to the pool, and that function will be called, eventually.^{1} Functions can do anything, so this interface should offer all the expressive power one could need. Experience tells me otherwise.
The standard pool interface is so impoverished that it is nearly impossible to use correctly in complex programs, and leads us down design deadends. I would actually argue it's better to work with raw threads than to even have generic amorphous thread pools: the former force us to stop and think about resource requirements (and lets the OS's real scheduler help us along), instead of making us pretend we only care about CPU usage. I claim thread pools aren't scalable because, with the exception of CPU time, they actively hinder the development of programs that achieve high resource utilisation.
This post comes in two parts. First, the story of a simple program that's parallelised with a thread pool, then hits a wall as a wider set of resources becomes scarce. Second, a solution I like for that kind of program: an explicit state machine, where each state gets a dedicated queue that is aware of the state's resource requirements.
Stages of parallelisation
We start with a simple program that processes independent work units, a serial loop that pulls in work (e.g., files in a directory), or wait for requests on a socket, one work unit at a time.
At some point, there's enough work to think about parallelisation, and we choose threads.^{2} To keep things simple, we simply spawn a thread per work unit. Load increases further, and we observe that we spend more time switching between threads or contending on shared data than doing actual work. We could use a semaphore to limit the number of work units we process concurrently, but we might as well just push work units to a thread pool and recycle threads instead of wasting resources on a threadperrequest model. We can even start thinking about queueing disciplines, admission control, backpressure, etc. Experienced developers will often jump directly to this stage after the serial loop.
The 80s saw a lot of research on generalising this "flat" parallelism model to nested parallelism, where work units can spawn additional requests and wait for the results (e.g., to recursively explore subbranches of a search tree). Nested parallelism seems like a good fit for contemporary network services: we often respond to a request by sending simpler requests downstream, before merging and munging the responses and sending the result back to the original requestor. That may be why futures and promises are so popular these days.
I believe that, for most programs, the futures model is an excellent answer to the wrong question. The moment we perform I/O (be it network, disk, or even with hardware accelerators) in order to generate a result, running at scale will have to mean controlling more resources than just CPU, and both the futures and the generic thread pool models fall short.
The issue is that futures only work well when a waiter can help along the value it needs, with task stealing, while thread pools implement a trivial scheduler (dedicate a thread to a function until that function returns) that must be oblivious to resource requirements, since it handles opaque functions.
Once we have futures that might be blocked on I/O, we can't guarantee a waiter will achieve anything by lending CPU time to its children. We could help sibling tasks, but that way stack overflows lie.
The deficiency of flat generic thread pools is more subtle. Obviously, one doesn't want to take a tight thread pool, with one thread per core, and waste it on synchronous I/O. We'll simply kick off I/O asynchronously, and reenqueue the continuation on the pool upon completion!
Instead of doing
A, I/O, B
in one function, we'll split the work in two functions and a callback
A, initiate asynchronous I/O
On I/O completion: enqueue B in thread pool
B
The problem here is that it's easy to create too many asynchronous requests, and run out of memory, DOS the target, or delay the rest of the computation for too long. As soon as the I/O requests has been initiated in A
, the function returns to the thread pool, which will just execute more instances of A
and initiate even more I/O.
At first, when the program doesn't heavily utilise any resource in particular, there's an easy solution: limit the total number of inflight work units with a semaphore. Note that I wrote work unit, not function calls. We want to track logical requests that we started processing, but for which there is still work to do (e.g., the response hasn't been sent back yet).
I've seen two ways to cap inflight work units. One's buggy, the other doesn't generalise.
The buggy implementation acquires a semaphore in the first stage of request handling (A
) and releases it in the last stage (B
). The bug is that, by the time we're executing A
, we're already using up a slot in the thread pool, so we might be preventing B
s from executing. We have a lock ordering problem: A
acquires a thread pool slot before acquiring the inflight semaphore, but B
needs to acquire a slot before releasing the same semaphore. If you've seen code that deadlocks when the thread pool is too small, this was probably part of the problem.
The correct implementation acquires the semaphore before enqueueing a new work unit, before shipping a call to A
to the thread pool (and releases it at the end of processing, in B
). This only works because we can assume that the first thing A
does is to acquire the semaphore. As our code becomes more efficient, we'll want to more finely track the utilisation of multiple resources, and preacquisition won't suffice. For example, we might want to limit network requests going to individual hosts, independently from disk reads or writes, or from database transactions.
Resourceaware thread pools
The core issue with thread pools is that the only thing they can do is run opaque functions in a dedicated thread, so the only way to reserve resources is to already be running in a dedicated thread. However, the one resource that every function needs is a thread on which to run, thus any correct lock order must acquire the thread last.
We care about reserving resources because, as our code becomes more efficient and scales up, it will start saturating resources that used to be virtually infinite. Unfortunately, classical thread pools can only control CPU usage, and actively hinder correct resource throttling. If we can't guarantee we won't overwhelm the supply of a given resource (e.g., read IOPS), we must accept wasteful overprovisioning.
Once the problem has been identified, the solution becomes obvious: make sure the work we push to thread pools describes the resources to acquire before running the code in a dedicated thread.
My favourite approach assigns one global thread pool (queue) to each function or processing step. The arguments to the functions will change, but the code is always the same, so the resource requirements are also well understood. This does mean that we incur complexity to decide how many threads or cores each pool is allowed to use. However, I find that the resulting programs are better understandable at a high level: it's much easier to write code that traverses and describes the work waiting at different stages when each stage has a dedicated thread pool queue. They're also easier to model as queueing systems, which helps answer "what if?" questions without actually implementing the hypothesis.
In increasing order of annoyingness, I'd divide resources to acquire in four classes.
 Resources that may be seamlessly^{3} shared or timesliced, like CPU.
 Resources that are acquired for the duration of a single function call or processing step, like DB connections.
 Resources that are acquired in one function call, then released in another thread pool invocation, like DB transactions, or asynchronous I/O semaphores.
 Resources that may only be released after temporarily using more of it, or by cancelling work: memory.
We don't really have to think about the first class of resources, at least when it comes to correctness. However, repeatedly running the same code on a given core tends to improve performance, compared to running all sorts of code on all cores.
The second class of resources may be acquired once our code is running in a thread pool, so one could pretend it doesn't exist. However, it is more efficient to batch acquisition, and execute a bunch of calls that all need a given resource (e.g., a DB connection from a connection pool) before releasing it, instead of repetitively acquiring and releasing the same resource in backtoback function calls, or blocking multiple workers on the same bottleneck.^{4} More importantly, the property of always being acquired and released in the same function invocation, is a global one: as soon as even one piece of code acquires a given resource and releases in another thread pool call (e.g., acquires a DB connection, initiates an asynchronous network call, writes the result of the call to the DB, and releases the connection), we must always treat that resource as being in the third, more annoying, class. Having explicit stages with fixed resource requirements helps us confirm resources are classified correctly.
The third class of resources must be acquired in a way that preserves forward progress in the rest of the system. In particular, we must never have all workers waiting for resources of this third class. In most cases, it suffices to make sure there at least as many workers as there are queues or stages, and to only let each stage run the initial resource acquisition code in one worker at a time. However, it can pay off to be smart when different queued items require different resources, instead of always trying to satisfy resource requirements in FIFO order.
The fourth class of resources is essentially heap memory. Memory is special because the only way to release it is often to complete the computation. However, moving the computation forward will use even more heap. In general, my only solution is to impose a hard cap on the total number of inflight work units, and to make sure it's easy to tweak that limit at runtime, in disaster scenarios. If we still run close to the memory capacity with that limit, the code can either crash (and perhaps restart with a lower inflight cap), or try to cancel work that's already in progress. Neither option is very appealing.
There are some easier cases. For example, I find that temporary bumps in heap usage can be caused by parsing large responses from idempotent (GET
) requests. It would be nice if networking subsystems tracked memory usage to dynamically throttle requests, or even cancel and retry idempotent ones.
Once we've done the work of explicitly writing out the processing steps in our program as well as their individual resource requirements, it makes sense to let that topology drive the structure of the code.
Over time, we'll gain more confidence in that topology and bake it in our program to improve performance. For example, rather than limiting the number of inflight requests with a semaphore, we can have a fixedsize allocation pool of request objects. We can also selectively use bounded ring buffers once we know we wish to impose a limit on queue size. Similarly, when a sequence (or subgraph) of processing steps is fully synchronous or retires in order, we can control both the queue size and the number of inflight work units with a disruptor, which should also improve locality and throughput under load. These transformations are easy to apply once we know what the movement of data and resource looks like. However, they also ossify the structure of the program, so I only think about such improvements if they provide a system property I know I need (e.g., a limit on the number of inflight requests), or once the code is functional and we have loadtesting data.
Complex programs are often best understood as state machines. These state machines can be implicit, or explicit. I prefer the latter. I claim that it's also preferable to have one thread pool^{5} per explicit state than to dump all sorts of state transition logic in a shared pool. If writing functions that process flat tables is dataoriented programming, I suppose I'm arguing for dataoriented state machines.

Convenience wrappers, like parallel map, or "run after this time," still rely on the flexibility of opaque functions.↩

Maybe we decided to use threads because there's a lot of shared, readmostly, data on the heap. It doesn't really matter, process pools have similar problems.↩

Up to a point, of course. No model is perfect, etc. etc.↩

Explicit resource requirements combined with one queue per stage lets us steal ideas from SEDA.↩

One thread pool per state in the sense that no state can fully starve out another of CPU time. The concrete implementation may definitely let a shared set of workers pull from all the queues.↩
26 Feb 2019 2:27am GMT
24 Feb 2019
Planet Lisp
Christophe Rhodes: sbcl 1 5 0
Today, I released sbcl1.5.0  with no particular reason for the minor version bump except that when the patch version (we don't in fact do semantic versioning) gets large it's hard to remember what I need to type in the release script. In the 17 versions (and 17 months) since sbcl1.4.0, there have been over 2900 commits  almost all by other people  fixing userreported, developeridentified, and randomtesterlesserspotted bugs; providing enhancements; improving support for various platforms; and making things faster, smaller, or sometimes both.
It's sometimes hard for developers to know what their users think of all of this furious activity. It's definitely hard for me, in the case of SBCL: I throw releases over the wall, and sometimes people tell me I messed up (but usually there is a resounding silence). So I am running a user survey, where I invite you to tell me things about your use of SBCL. All questions are optional: if something is personally or commercially sensitive, please feel free not to tell me about it! But it's nine years since the last survey (that I know of), and much has changed since then  I'd be glad to hear any information SBCL users would be willing to provide. I hope to collate the information in late March, and report on any insight I can glean from the answers.
24 Feb 2019 9:40pm GMT
11 Feb 2019
Planet Lisp
Chaitanya Gupta: LOADTIMEVALUE and prepared queries in Postmodern
The Common Lisp library Postmodern defines a macro called PREPARE
that creates prepared statements for a PostgreSQL connection. It takes a SQL query with placeholders ($1
, $2
, etc.) as input and returns a function which takes one argument for every placeholder and executes the query.
The first time I used it, I did something like this:
(defun runquery (id)
(funcall (prepare "SELECT * FROM foo WHERE id = $1") id))
Soon after, I realized that running this function every time would generate a new prepared statement instead of reusing the old one. Let's look at the macro expansion:
(macroexpand1 '(prepare "SELECT * FROM foo WHERE id = $1"))
==>
(LET ((POSTMODERN::STATEMENTID (POSTMODERN::NEXTSTATEMENTID))
(QUERY "SELECT * FROM foo WHERE id = $1"))
(LAMBDA (&REST POSTMODERN::PARAMS)
(POSTMODERN::ENSUREPREPARED *DATABASE* POSTMODERN::STATEMENTID QUERY)
(POSTMODERN::ALLROWS
(CLPOSTGRES:EXECPREPARED *DATABASE* POSTMODERN::STATEMENTID
POSTMODERN::PARAMS
'CLPOSTGRES:LISTROWREADER))))
T
ENSUREPREPARED
checks if a statement with the given statementid exists for the current connection. If yes, it will be reused, else a new one is created with the given query.
The problem is that the macro generates a new statement id every time it is run. This was a bit surprising, but the fix was simple: capture the function returned by PREPARE
once, and use that instead.
(defparameter *prepared* (prepare "SELECT * FROM foo WHERE id = $1"))
(defun runquery (id)
(funcall *prepared* id))
You can also use Postmodern's DEFPREPARED
instead, which similarly defines a new function at the toplevel.
This works well, but now are using toplevel forms instead of the nicely encapsulated single form we used earlier.
To fix this, we can use LOADTIMEVALUE
.
(defun runquery (id)
(funcall (loadtimevalue (prepare "SELECT * FROM foo WHERE id = $1")) id))
LOADTIMEVALUE
is a special operator that
 Evaluates the form in the null lexical environment
 Delays evaluation of the form until load time
 If compiled, it ensures that the form is evaluated only once
By wrapping PREPARE
inside LOADTIMEVALUE
, we get back our encapsulation while ensuring that a new prepared statement is generated only once (per connection), until the next time RUNQUERY
is recompiled.
Convenience
To avoid the need to wrap PREPARE
every time, we can create a converience macro and use that instead:
(defmacro preparedquery (query &optional (format :rows))
`(loadtimevalue (prepare ,query ,format)))
(defun runquery (id)
(funcall (preparedquery "SELECT * FROM foo WHERE id = $1") id))
Caveats
This only works for compiled code. As mentioned earlier, the form wrapped inside LOADTIMEVALUE
is evaluated once only if you compile it. If uncompiled, it is evaluated every time so this solution will not work there.
Another thing to remember about LOADTIMEVALUE
is that the form is evaluated in the null lexical environment. So the form cannot use any lexically scoped variables like in the example below:
(defun runquery (table id)
(funcall (loadtimevalue
(prepare (format nil "SELECT * FROM ~A WHERE id = $1" table)))
id))
Evaluating this will signal that the variable TABLE
is unbound.
11 Feb 2019 12:00am GMT