Convoys¶
Convoys is a simple library that fits a few statistical model useful for modeling timelagged conversion rates. You can check out the Github repo for source code and more things!
Background¶
Predicting conversions is a really important problem for ecommerce, online advertising, and many other applications. In many cases when conversions are relatively quick, you can measure the response (e.g. whether the user bought the product) and use models like logistic regression to predict conversion.
If conversions have substantial time lag (which is often the case) it gets a bit trickier. You know who converted, but if someone did not convert, they might still convert in the future. In other words, conversions are observed, but nonconversions are not observed.
The “hacky” way to address this is to define conversion as conversion at time X. This turns the problem into a simple binary classification problem, but the drawback is you are losing data by binarizing it. First of all, you can not learn from users that are younger than X. You also can not learn from users that convert after X. For an excellent introduction to this problem (and distributions like the Weibull distribution), here’s a blog post about implementing a recurrent neural network to predict churn.
Survival analysis saves the day¶
Luckily, there is a somewhat similar field called survival analysis. It introduces the concept of censored data, which is data that we have not observed yet. Lifelines is a great Python package with excellent documentation that implements many classic models for survival analysis.
Unfortunately, fitting a distribution such as Weibull is not enough in the case of conversion rates, since not everyone converts in the end. Typically conversion rates stabilize at some fraction eventually. For that reason, we have to make the model a bit more complex and introduce the possibility that some items may never convert.
Predicting lagged conversions¶
It turns out we can model conversions by essentially thinking of conversions as a logistic regression model multiplied by a distribution over time which is usually a Weibull distribution or something similar. Convoys implements a few of these models with some utility functions for data conversion and plotting.
Examples¶
The main use case for something like Convoys is definitely for online advertising, ecommerce, or similar applications. However, there are several places these models can be useful, which we will illustrate with some very different types of datasets.
Example 1: NYC Department of Buildings violations¶
We are going to look at complaints received by the Department of Buildings in NYC. The dataset is available here.
First, lets load it. There is a pandas DataFrame in the examples/ directory that contains a subsampl of the full dataset (10,000 rows out of the 1.3M rows).
df = pandas.read_pickle('examples/dob_violations.pickle')
We are going to look at time delay from issue to disposition (when the case was finally resolved, or closed).
The next step is to convert it to numpy arrays so that we can work with it.
Convoys comes with a utility function convoys.utils.get_arrays()
that handles the conversion for you.
Several of the arguments are references to columns in the dataframe, in this case type, issue_date, and disposition_date.
unit, groups, (G, B, T) = convoys.utils.get_arrays(
df, groups='type', created='issue_date', converted='disposition_date',
unit='years', group_min_size=100)
This will create three numpy arrays that we can use to plot.
Let’s start with a nonparametric KaplanMeier
estimator and plot it using the convoys.plotting.plot_cohorts()
function.
convoys.plotting.plot_cohorts(G, B, T, model='kaplanmeier', ci=0.95, groups=groups)
pyplot.legend()
pyplot.show()
This should show something similar to this:
The fact that some complaints take 30 years to resolve is pretty baffling. I have no idea why it’s so bad!
Anyway, let’s fit a Weibull
distribution.
This is a parametric model, meaning it will fit a mathematical model with a few unknowns by finding the values of those unknowns that optimizes the fit.
convoys.plotting.plot_cohorts(G, B, T, model='weibull', ci=0.95, groups=groups)
pyplot.legend()
pyplot.show()
This should show something similar to this:
As you can see, the Weibull distribution fits the nonparametric plot fairly well!
One of the benefits of parametric models is that you can extrapolate them to see the final conversion rate. Let’s try to fit the Weibull model to see how different cohorts of reported violations are cleared. Let’s also plot the KaplanMeier and the Weibull model on top of each other so that we can compare visually how well the model fits.
df['bucket'] = df['issue_date'].apply(lambda d: '%d%d' % (5*(d.year//5), 5*(d.year//5)+4))
unit, groups, (G, B, T) = convoys.utils.get_arrays(
df, groups='bucket', created='issue_date', converted='disposition_date',
unit='years', group_min_size=500)
convoys.plotting.plot_cohorts(G, B, T, model='kaplanmeier', groups=groups, t_max=30)
convoys.plotting.plot_cohorts(G, B, T, model='weibull', groups=groups, t_max=30, plot_kwargs={'linestyle': ''}, ci=0.95)
pyplot.legend()
pyplot.show()
This will show something like this:
The dashed lines are the KaplanMeier curves, whereas the solid ones with the shaded area are the Weibull model (with corresponding uncertainty intervals). They match really well!
It looks like disposition has gotten consistently faster over the years, which is good to see. The weird vertical jumps in KaplanMeier is just an artifact of how the model is fit, where the last observation ends up being drawn in a funny way.
Example 2: Age of marriage¶
This example looks at time until marriage. Since not everyone marries, it’s a great example where survival analysis would not be correct (although most people marry, so the difference isn’t that huge).
There’s a dataset in the repo that contains year born, year married, and a number of attributes for a random sample of a few hundred thousand Americans. The data is included as a Pandas dataframe.
Let’s fit a generalized Gamma distribution
!
Why that distribution?
Unlike the previous example, we expect some kind of time lag before the first conversion even start to happen.
A Gamma distribution is a sum of k exponentials, which can be interpreted as various life phases a person goes through (newborn, toddler, etc).
A generalized Gamma distribution adds another paramter p which makes each exponential into a Weibull. This just gives one more degree of freedom to fit the model.
df = pandas.read_pickle('examples/marriage.pickle')
_, groups, (G, B, T) = convoys.utils.get_arrays(
df, groups='sex', created='born', converted='married')
pyplot.figure(figsize=(12, 9))
convoys.plotting.plot_cohorts(G, B, T, model='generalizedgamma', groups=groups)
pyplot.legend()
convoys.plotting.plot_cohorts(G, B, T, model='kaplanmeier', groups=groups, plot_kwargs={'linestyle': ''})
pyplot.savefig('marriagecombined.png')
This will generate something like this:
As you can see, marriage data does not quite follow a generalized Gamma distribution. This is not quite shocking, since many complex real world phenomenon are not always possible to model mathematically. One reason the model isn’t perfect is there’s an inherent bias in the dataset we use, where it only includes people who are still alive. Some resources suggest fitting a “CoaleMcNeil” model to this instead, which seems like an interesting future addition to Convoys.
Motivation¶
A perfectly valid question is: Convoys really only implements one model: a generalized Gamma distribution multiplied by basically logistic regression. That seems like a very specialized distribution. In order to justify this choice, let’s first look at a handful of conversion charts from real data at Better:
The legend, labels of the axes, and title are all removed so that no business secrets are revealed. The solid lines with shaded area are all the generalized Gamma fits, whereas the dashed lines are the KaplanMeier fits. Note that the fit is very good! In fact, we have observed that almost any conversion metric can be modeled reasonably well with the generalized Gamma model (multiplied by logistic regression).
Empirically, this model seems to hold up pretty well.
Some more mathematical justification¶
A simple toy problem also demonstrates why we would expect to get a timedependent distribution (like the Exponential distribution) multiplied by a logistic function. Consider the continuoustime Markov chain with three states: undecided, converted, or died.
Everyone starts out “undecided” but either converts or dies with rates \(\lambda_{\text{convert}}\) and \(\lambda_{\text{die}}\). However, we only observe the conversions, not the deaths. At any point in time, we have \(P_{\text{undecided}}(t) + P_{\text{converted}}(t) + P_{\text{dead}}(t) = 1\).
The rate of going to undecided to any of the other two states is a constant, meaning at any time interval some fixed proportion of the “undecided” state goes away. Writing out the equations we get an ordinary differential equation:
You can verify that the solution to these equations is the following:
As you can see, the solution is the product of two things
 The \(1  \exp((\lambda_{\text{convert}} + \lambda_{\text{die}})t)\) part describes the cumulative density function of an exponential distribution.
 A constant factor \(\lambda_{\text{convert}}/(\lambda_{\text{convert}} + \lambda_{\text{die}})\) describes the final conversion \(P_{\text{converted}}(t \rightarrow \infty)\).
Turning it into a regression problem¶
Note that \(\lambda_{\text{convert}}\) and \(\lambda_{\text{die}}\) are positive numbers. For each observation \(z\), let’s set \(\lambda_{\text{convert}} = \exp(a^Tz)\) and \(\lambda_{\text{die}} = \exp(b^Tz)\) where \(a, b\) are two unknown vectors.
With this transformation, the probability of conversion becomes
This is the sigmoid function. If you set \(\beta = a  b\) then it turns into ordinary logistic regression where \(\beta\) is the unknown feature weights that we are trying to learn. This shows that the regression method in convoys turns into logistic regression in the limit where \(t \rightarrow \infty\).
Weibull, gamma, and generalized gamma distributions¶
Moving on from exponential distributions, there are some good reasons we would want a bit more flexibility with the conversion rates. The Weibull distribution adds one single parameter and is widely used in timetoevent analysis. Empirically, the Weibull model seems to fit a large range of applications, where the common pattern is that conversions start immediately at \(t=0\).
Another class of processes model the behavior where there might be some internal states between “undecided” and “converted” that causes conversions not to start immediately. The sum of multiple exponential distributions is a gamma distribution. It also requires one more parameter than the exponential distribution.
Finally, the generalized gamma distribution unifies the Weibull and the gamma distribution, and requires two more parameters than the exponential distribution. The relationship between all four distributions can be summarized in this chart:
Model¶
Convoys tries to optimize the maximum a posteriori likelihood of observing all the data given the model, optionally also using Markov chain Monte Carlo to sample from the posterior in order to generate uncertainty estimate.
Let’s say \(f(t, x)\) is a probability density function over time of when a conversion happen, where \(t > 0\) and \(x\) is some feature vector. Note that \(f(t, x)\) denote the probability density of conversion conditional on the conversion happening. This means that \(\int_0^\infty f(t, x) dt = 1\).
We use \(F(t, x)\) to denote the cumulative density function of \(f(t, x)\). The definitions of \(f, F\) depends on which model we use, so we can plug in a Weibull distribution or a Gamma distribution or something else.
We now introduce \(g(t, x) = c(x)f(t, x)\) and \(G(t, x) = c(x)F(t, x)\) where \(c(x)\) denotes the probability of conversion at all. This means that \(\lim_{t \rightarrow \infty} G(t, x) = c(x)\).
For each data point, we have three different cases:
 We observed conversion. In that case, the probability density is \(g(t, x)\)
 We didn’t observe conversion yet and the current time is \(t\). There are two subcases
 No conversion will ever happen. The probability density is \(1  c(x)\).
 Conversion will happen at some point in the future. The probability is \(c(x)(1  F(x, t))\).
Multiplying all these probabilities and taking the logarithm gives the total loglikelihood of the data given the model. See documentation for GeneralizedGamma
for some more information about the exact math. There is also some regularization that wasn’t covered here.
Full API documentation¶

class
convoys.regression.
Exponential
(ci=False)[source]¶ Specialization of
GeneralizedGamma
where \(k=1, p=1\).The cumulative density function is:
\(F(t) = 1  \exp(t\lambda)\)
The probability density function is:
\(f(t) = \lambda\exp(t\lambda)\)
The exponential distribution is the most simple distribution. From a conversion perspective, you can interpret it as having two competing final states where the probability of transitioning from the initial state to converted or dead is constant.
See documentation for
GeneralizedGamma
.

class
convoys.regression.
Weibull
(ci=False)[source]¶ Specialization of
GeneralizedGamma
where \(k=1\).The cumulative density function is:
\(F(t) = 1  \exp((t\lambda)^p)\)
The probability density function is:
\(f(t) = p\lambda(t\lambda)^{p1}\exp((t\lambda)^p)\)
See documentation for
GeneralizedGamma
.

class
convoys.regression.
Gamma
(ci=False)[source]¶ Specialization of
GeneralizedGamma
where \(p=1\).The cumulative density function is:
\(F(t) = P(k, t\lambda)\)
where \(P(a, x) = \gamma(a, x) / \Gamma(a)\) is the lower regularized incomplete gamma function. See
convoys.gamma.gammainc()
.The probability density function is:
\(f(t) = \lambda^k t^{k1} \exp(x\lambda) / \Gamma(k)\)
See documentation for
GeneralizedGamma
.

class
convoys.regression.
GeneralizedGamma
(ci=False)[source]¶ Generalization of Gamma, Weibull, and Exponential
This mostly follows the Wikipedia article, although our notation is slightly different. Also see this paper for an overview.
Shape of the probability function
The cumulative density function is:
\(F(t) = P(k, (t\lambda)^p)\)
where \(P(a, x) = \gamma(a, x) / \Gamma(a)\) is the lower regularized incomplete gamma function. See
convoys.gamma.gammainc()
. \(\gamma(a, x)\) is the incomplete gamma function and \(\Gamma(a)\) is the standard gamma function.The probability density function is:
\(f(t) = p\lambda^{kp} t^{kp1} \exp((t\lambda)^p) / \Gamma(k)\)
Modeling conversion rate
Since our goal is to model the conversion rate, we assume the conversion rate converges to a final value
\(c = \sigma(\mathbf{\beta^Tx} + b)\)
where \(\sigma(z) = 1/(1+e^{z})\) is the sigmoid function, \(\mathbf{\beta}\) is an unknown vector we are solving for (with corresponding intercept \(b\)), and \(\mathbf{x}\) are the feature vector (inputs).
We also assume that the rate parameter \(\lambda\) is determined by
\(\lambda = exp(\mathbf{\alpha^Tx} + a)\)
where \(\mathrm{\alpha}\) is another unknown vector we are trying to solve for (with corresponding intercept \(a\)).
We also assume that the \(\mathbf{\alpha}, \mathbf{\beta}\) vectors have a normal distribution
\(\alpha_i \sim \mathcal{N}(0, \sigma_{\alpha})\), \(\beta_i \sim \mathcal{N}(0, \sigma_{\beta})\)
where hyperparameters \(\sigma_{\alpha}^2, \sigma_{\beta}^2\) are drawn from an inverse gamma distribution
\(\sigma_{\alpha}^2 \sim \text{invgamma}(1, 1)\), \(\sigma_{\beta}^2 \sim \text{invgamma}(1, 1)\)
List of parameters
The full model fits vectors \(\mathbf{\alpha, \beta}\) and scalars \(a, b, k, p, \sigma_{\alpha}, \sigma_{\beta}\).
Likelihood and censorship
For entries that convert, the contribution to the likelihood is simply the probability density given by the probability distribution function \(f(t)\) times the final conversion rate \(c\).
For entries that did not convert, there is two options. Either the entry will never convert, which has probability \(1c\). Or, it will convert at some later point that we have not observed yet, with probability given by the cumulative density function \(F(t)\).
Solving the optimization problem
To find the MAP (max a posteriori), scipy.optimize.minimize with the SLSQP method.
If ci == True, then emcee is used to sample from the full posterior in order to generate uncertainty estimates for all parameters.

class
convoys.multi.
KaplanMeier
(*args, **kwargs)[source]¶ Multigroup version of
convoys.single.KaplanMeier
.
fit
(G, B, T)¶ Fits the model
Parameters:  G – numpy vector of shape \(n\)
 B – numpy vector of shape \(n\)
 T – numpy vector of shape \(n\)


class
convoys.multi.
Exponential
(*args, **kwargs)[source]¶ Multigroup version of
convoys.regression.Exponential
.
fit
(G, B, T)¶ Fits the model
Parameters:  G – numpy vector of shape \(n\)
 B – numpy vector of shape \(n\)
 T – numpy vector of shape \(n\)


class
convoys.multi.
Weibull
(*args, **kwargs)[source]¶ Multigroup version of
convoys.regression.Weibull
.
fit
(G, B, T)¶ Fits the model
Parameters:  G – numpy vector of shape \(n\)
 B – numpy vector of shape \(n\)
 T – numpy vector of shape \(n\)


class
convoys.multi.
Gamma
(*args, **kwargs)[source]¶ Multigroup version of
convoys.regression.Gamma
.
fit
(G, B, T)¶ Fits the model
Parameters:  G – numpy vector of shape \(n\)
 B – numpy vector of shape \(n\)
 T – numpy vector of shape \(n\)


class
convoys.multi.
GeneralizedGamma
(*args, **kwargs)[source]¶ Multigroup version of
convoys.regression.GeneralizedGamma
.
fit
(G, B, T)¶ Fits the model
Parameters:  G – numpy vector of shape \(n\)
 B – numpy vector of shape \(n\)
 T – numpy vector of shape \(n\)


convoys.utils.
get_arrays
(data, features=None, groups=None, created=None, converted=None, now=None, unit=None, group_min_size=0, max_groups=1)[source]¶ Converts a dataframe to a list of numpy arrays.
Each input refers to a column in the dataframe.
TODO: more doc

convoys.gamma.
gammainc
(*args, **kwargs)¶ Lower regularized incomplete gamma function.
We rely on scipy.special.gammainc for this. However, there is a number of issues using this function together with autograd:
 It doesn’t let you take the gradient with respect to k
 The gradient with respect to x is really slow
As a really stupid workaround, because we don’t need the numbers to be 100% exact, we just approximate the gradient.
Side note 1: if you truly want to compute the correct derivative, see the Wikipedia articule about the Incomplete gamma function where the T(3, s, x) function can be implemented as
def T3(s, x): return mpmath.meijerg(a_s=([], [0, 0]), b_s=([s1, 1, 1], []), z=x)
I wasted a few hours on this but sadly it turns out to be extremely slow.
Side note 2: TensorFlow actually has a similar bug
Future work¶
 Add support for a competing hazard model. This would make it possible to analyze a dataset where there’s multiple final outcomes.
 Add support for leftcensoring. This would make it possible to analyze some great datasets such as Washington Posts unsolved homicide dataset where we don’t know when a murder was dispositioned.
 Add support for multistage processes where there’s a number of “milestones” that depend on each other.
 Add support for some kind of recurrent neural network or similar where the features can vary over time.
License¶
Convoys uses the MIT license.