macrocephalopod

impact), current position x0, and some constraints, and you run a quadratic optimization to find a vector of positions "x" which maximises alpha * x - x' * covariance * x - spread * abs(x - x0) - slippage If you do this naively you will get bad results!

A better approach, the one I use, is to start with a heuristic solution that you know works (i.e. you would make money with it). Then write down an optimization problem that gives you the same result. You're now in a good place because you have a set of parameters for the

optimizer that definitely give a good result, and you can start making changes to the optimizer to try and improve it. One thing optimizers are good at is finding new solutions that are close to existing solutions, but satisfy extra constraints. That means you can change

a parameter, and be sure that the constraints will still be satisfied. That's not generally true if you start modifying a heuristic algorithm - changing one component normally requires changes elsewhere as well.

That's all very vague so let me give an example. You have a vector of signal values "s". Set target positions to be proportional to (s - mean(s)) / sum(abs(s - mean(s))) This has zero net exposure and constant gross book size.

You then apply some buffering to it, as described in this earlier thread, to determined what trades you should do. This is the heuristic solution. Note that after the buffering it no long has zero net exposure.https://twitter.com/macrocephalopod/status/1373216917058682881?s=20 …

The quadratic optimization problem that gives this result has a linear term proportional to "s - mean(s)", a diagonal covariance matrix, a risk aversion which is proportional to sum(abs(s - mean(s))) and a simple linear cost term proportional to abs(x - x0)

The simplest enhancement is to add a zero net exposure constraint, or a quadratic penalty on the total net exposure. That gets you all the benefit of trade buffering but also maintains close to zero net exposure - an instant win.