D EEP R ANDOM S PLINES FOR P OINT P ROCESS I NTENSITY E STIMATION
A BSTRACT
Gaussian processes are the leading class of distributions on random functions, but they suffer from well known issues including difﬁculty scaling and inﬂexibility with respect to certain shape constraints (such as nonnegativity).
Here we propose Deep
Random Splines, a ﬂexible class of random functions obtained by transforming
Gaussian noise through a deep neural network whose output are the parameters of a spline.
Unlike Gaussian processes, Deep Random Splines allow us to readily enforce shape constraints while inheriting the richness and tractability of deep generative models.
We also present an observational model for point process data which uses Deep Random Splines to model the intensity function of each point process and apply it to neuroscience data to obtain a low-dimensional representation of spiking activity.
Inference is performed via a variational autoencoder that uses a novel recurrent encoder architecture that can handle multiple point processes as input.
I NTRODUCTION
Gaussian Processes (GPs) are one of the main tools for modeling random functions (Rasmussen, 2004).
They allow control of the smoothness of the function by choosing an appropriate kernel but have the disadvantage that, except in special cases (for example Gilboa et al.
; Flaxman et al.
(2015)), inference in GP models scales poorly in both memory and runtime.
Furthermore,
GPs cannot easily handle shape constraints.
It can often be of interest to model a function under some shape constraint, for example nonnegativity, monotonicity or convexity/concavity
(Møller et al., 1998; Schmidt & Hess, 1988; Ramsay, 1988; Mammen, 1991).
While some shape constraints can be enforced by transforming the GP or by enforcing them at a ﬁnite number of points, doing so cannot always be done and usually makes inference harder, see for example Lin & Dunson (2014).
Splines are another popular tool for modeling unknown functions (Wahba, 1990).
When there are no shape constraints, frequentist inference is straightforward and can be performed using linear regression, by writing the spline as a linear combination of basis functions.
Under shape constraints, the basis function expansion usually no longer applies, since the space of shape constrained splines is not typically a vector space.
However, the problem can usually still be written down as a tractable constrained optimization problem (Schmidt & Hess, 1988).
Furthermore, when using splines to model a random function, a distribution must be placed on the spline’s parameters, so the inference problem becomes Bayesian.
DiMatteo et al.
(2001) proposed a method to perform Bayesian inference in a setting without shape constraints, but the method relies on the basis function expansion and cannot be used in a shape constrained setting.
Furthermore, fairly simple distributions have to be placed on the spline parameters for their approximate posterior sampling algorithm to work adequately, which results in the splines having a restrictive and oversimpliﬁed distribution.
On the other hand, deep probabilistic models take advantage of the major progress in neural networks to ﬁt rich, complex distributions to data in a tractable way (Rezende et al., 2014; Mohamed &
Lakshminarayanan, 2016; Kingma & Welling, 2013; Gao et al., 2016; Johnson et al., 2016).
However, their goal is not usually to model random functions.
In this paper, we introduce Deep Random Splines (DRS), an alternative to GPs for modeling random functions.
DRS are a deep probabilistic model in which standard Gaussian noise is transformed through a neural network to obtain the parameters of a spline, and the random function is then the corresponding spline.
This combines the complexity of deep generative models and the ability to enforce shape constraints of splines.
We use DRS to model the nonnegative intensity functions of Poisson processes (Kingman, 1992).
In order to ensure that the splines are nonnegative, we use a parametrization of nonnegative splines that can be written as an intersection of convex sets, and then use the method of alternating projections (von Neumann, 1950) to obtain a point in that intersection (and differentiate through that during learning).
To perform scalable inference, we use a variational autoencoder (Kingma & Welling, 2013) with a novel encoder architecture that takes multiple, truly continuous point processes as input (not discretized in bins, as is common).
Our contributions are: ( i ) Introducing DRS, ( ii ) using the method of alternating projections to constrain splines, ( iii ) proposing a variational autoencoder model whith a novel encoder architecture for point process data which uses DRS, and ( iv ) showing that our model outperforms commonly used alternatives in both simulated and real data.
The rest of the paper is organized as follows: we ﬁrst explain DRS, how to parametrize them and how constraints can be enforced in section 2.
We then present our model and how to do inference in section 3.
We then compare our model against competing alternatives in simulated data and in two real spiking activity datasets in section 4, and observe that our method outperforms the alternatives.
Finally, we summarize our work in section 5.
D EEP R ANDOM S PLINES
Throughout the paper we will consider functions on the interval [ T 1 , T 2 ) and will select I + 1 ﬁxed knots T 1 = t 0 < · · · < t I
=
T 2 .
We will refer to a function as a spline of degree d and smoothness s < d if the function is a d -degree polynomial in each interval [ t i , t i +1 ) for i = 0 , . .
, I − 1 , is continuous, and s times differentiable.
We will denote the set of splines of degree d and smoothness s by G d,s = { g ψ :
ψ ∈ Ψ d,s } , where Ψ d,s is the set of parameters of each polynomial in each interval.
That is, every ψ ∈ Ψ d,s contains the parameters of each of the I polynomial pieces (it does not contain the locations of the knots as we take them to be ﬁxed since we observed overﬁtting when not doing so).
While the most natural ways to parametrize splines of degree d are a linear combination of basis functions or with the d + 1 polynomial coefﬁcients of each interval, these parametrizations do not lend themselves to easily enforce constraints such as nonnegativity (Schmidt & Hess, 1988).
We will thus use a different parametrization which we will explain in detail in the next section.
We will denote by Ψ ⊆ Ψ d,s the subset of spline parameters that result in the splines having the shape constraint of interest, for example, nonnegativity.
DRS are a distribution over G d,s .
To sample from a DRS, a standard Gaussian random variable
Z ∈ R m is transformed through a neural network parametrized by θ , f θ : R m → Ψ .
The DRS is then given by g f θ ( Z ) and inference on θ can be performed through a variational autoencoder (Kingma &
Welling, 2013).
Note that f maps to Ψ , thus ensuring that the spline has the relevant shape constraint.
2. C ONSTRAINING S PLINES
We now explain how we can enforce piecewise polynomials to form a nonnegative spline.
We add the nonnegativity constraint to the spline as we will use it for our model in section 3, but constraints such as monotonicity and convexity/concavity can be enforced in an analogous way.
In order to achieve this, we use a parametrization of nonnegative splines that might seem overly complicated at ﬁrst.
However, it has the critical advantage that it decomposes into the intersection of convex sets that are easily characterized in terms of the parameters, which is not the case for the naive parametrization which only includes the d + 1 coefﬁcients of every polynomial.
We will see how to take advantage of this fact in the next section.
A beautiful but perhaps lesser known spline result (see Lasserre (2010)) gives that a polynomial p ( t ) of degree d , where d = 2 k + 1 for some k ∈ N , is nonnegative in the interval [ l, u ) if and only if it can be written down as follows:
[Equation]
where [ t ] = (1 , t, t 2 , . .
t k ) (cid:62) and Q 1 and Q 2 are ( k + 1) × ( k + 1) symmetric positive semideﬁnite matrices.
It follows that a piecewise polynomial of degree d with knots t 0 , . . .
, t I deﬁned as p ( i ) ( t ) for t ∈ [ t i − 1 , t i ) for i = 1 , . . .
, I is nonnegative if and only if it can be written as:
[Equation]
for i = 1 , . . .
, I , where each Q ( i ) 1 and Q ( i ) 2 are ( k + 1) × ( k + 1) symmetric positive semideﬁnite matrices.
We can thus parametrize every piecewise nonnegative polynomial on our I intervals with ( Q ( i ) 1 , Q ( i ) 2 ) Ii =1 .
If no constraints are added on these parameters, the resulting piecewise polynomial might not be smooth, so certain constraints have to be added in order to guarantee that we are parametrizing a nonnegative spline and not just a nonnegative piecewise polynomial.
To that end, we deﬁne C 1 as the set of ( Q ( i ) 1 , Q ( i ) 2 ) Ii =1 such that:
[Equation]
That is, C 1 is the set of parameters whose resulting piecewise polynomial as in equation 2 is continuous.
Analogously, let C j for j = 2 , 3 , . .
be the set of ( Q ( i ) 1 , Q ( i ) 2 ) Ii =1 such that:
[Equation]
So that C j is the set of parameters whose corresponding piecewise polynomials have matching left and right ( j − 1) -th derivatives.
Let C 0 be the set of ( Q ( i ) 1 , Q ( i ) 2 ) Ii =1 which are symmetric positive semideﬁnite.
We can then parametrize the set of nonnegative splines on [ T 1 , T 2 ) by Ψ =
∩ s +1 j =0 C j .
Note that the case where d is even can be treated analogously (see supplementary material).
2. T HE M ETHOD OF A LTERNATING P ROJECTIONS
In order to use a DRS, f θ has to map to Ψ , that is, we need to have a way for a neural network to map to the parameter set corresponding to nonnegative splines.
We achieve this by taking f θ ( z )
=
h ( ˜ f θ ( z )) , where ˜ f θ is an arbitrary neural network and h is a surjective function onto Ψ .
The most natural choice for h is the projection onto Ψ .
However, while computing the projection onto Ψ (for Ψ as in section 2.1) can be done by solving a convex optimization problem, it cannot be done analytically.
This is an issue because when we train the model, we will need to differentiate f θ with respect to θ .
Note that Amos & Kolter (2017) propose a method to have an optimization problem as a layer in a neural network.
One might hope to use their method for our problem, but it cannot be applied due to the semideﬁnite constraint on our matrices.
The method of alternating projections (von Neumann, 1950; Bauschke & Borwein, 1996) allows us to approximately compute such a function h analytically.
If C 0 , . . . , C s +1 are closed, convex sets in R D , then the sequence ψ ( k ) =
P k mod ( s +2)
( ψ ( k − 1) ) converges to a point in ∩ s +1 j =0 C j for any starting ψ (0) , where P j is the projection onto C j for j = 0 , . . .
, s + 1 .
The method of alternating projections then consists on iteratively projecting onto each set in a cyclic fashion.
We call computing ψ ( k ) from ψ ( k − 1) the k -th iteration of the method of alternating projections.
This method can be useful to obtain a point in the intersection if each P j can be easily computed.
In our case, projecting onto C 0 can be done by doing eigenvalue decompositions of Q ( i ) 1 and Q ( i )and zeroing out negative elements in the diagonal matrices containing the eigenvalues.
While this might seem computationally expensive, the matrices are small and this can be done efﬁciently.
For example, for cubic splines ( d = 3 ), there are 2 I matrices each one of size 2 × 2 .
Projecting onto
C j for j = 1 , . . .
s + 1 can be done analytically as it can be formulated as a quadratic optimization problem with linear constraints.
Furthermore, because of the local nature of the constraints where every interval is only constrained by its neighboring intervals, this quadratic optimization problem can be reduced to solving a tridiagonal system of linear equations of size I − 1 which can be solved efﬁciently in O ( I ) time with simpliﬁed Gaussian elimination.
While the derivation of this fact is a straightforward application of the KKT conditions, the algebra is cumbersome, so we omit it here to include it in the supplementary material.
By letting h be the ﬁrst M iterations of the method of alternating projections, we can ensure that f θ maps (approximately) to Ψ , while still being able to compute ∇ θ f θ ( z ) .
Note that we could ﬁnd such an h function using Dykstra’s algorithm (not to be confused with Dijkstra’s shortest path algorithm), which is a modiﬁcation of the method of alternating projections that converges to the projection of ψ (0) onto ∩ s +1 j =
C j (Dykstra, 1983; Boyle & Dykstra, 1986; Tibshirani, 2017)), but we found that the method of alternating projections was faster to differentiate when using reverse mode automatic differentiation packages (Abadi et al., 2016).
Another way of ﬁnding such an h would be unrolling any iterative optimization method that solves the projection onto Ψ , such as gradient-based methods or Newton methods.
We found the alternating projections method more convenient as it does not involve additional hyperparameters such as learning rate that drastically affect performance.
Furthermore, the method of alternating projections is known to have a linear convergence rate (as fast as gradient-based methods) that is independent of the starting point (Bauschke & Borwein, 1996).
This last observation is important, as the starting point in our case is determined by the output of ˜ f
θ , so that the convergence rate being independent of the starting point ensures that ˜
f θ cannot learn to ignore h , which is not the case for gradient-based and Newton methods (for a ﬁxed number of iterations and learning rate, there might exist an initial point that is too far away to actually reach the projection).
Finally, note that if we wanted to enforce, for example, that the spline be monotonic, we could parametrize its derivative and force it to be nonnegative or nonpositive.
Convexity or concavity can be enforced analogously.
D EEP R ANDOM S PLINES AS I NTENSITY F UNCTIONS OF P OINT P ROCESSES
Since we will use DRS as intensity functions for Poisson processes, we begin this section with a brief review of these processes.
3. P OISSON P ROCESSES
An inhomogeneous Poisson process in a set S is a random subset of S .
The process can (for our purposes) be parametrized by an intensity function g : S → R + and in our case, S =
[ T 1 , T 2 ) .
We write S ∼ PP S ( g ) to denote that the random set S , whose elements we call events, follows a Poisson process on S with intensity g .
If S = { x k } Kk =1 ∼ PP S ( g ) , then | S ∩
A | , the number of events in any A ⊆ S , follows a Poisson distribution with parameter (cid:82)
A g ( t ) dt and the log likelihood of S is given by:
[Equation]
Splines have the very important property that they can be analytically integrated (as the integral of polynomials can be computed in closed form), which allows to exactly evaluate the log likelihood in equation 5 when g is a spline.
As a consequence, ﬁtting a DRS to observed events is more tractable than ﬁtting models that use GPs to represent g , such as log-Gaussian Cox processes (Møller et al., 1998).
Inference in the latter type of models is very challenging, despite some efforts by Cunningham et al.
; Adams et al.
; Lloyd et al.
Splines also vary smoothly, which incorporates the reasonable assumption that the expected number of events changes smoothly over time.
These properties were our main motivations for choosing splines to model intensity functions.
3. O UR M ODEL
Suppose we observe N simultaneous point processes in [ T 1 , T 2 ) a total of R repetitions (we will call each one of these repetitions/samples a trial).
Let X r,n denote the n -th point process of the r -th trial.
Looking ahead to an application we study in the results, data of this type is a standard setup for microelectrode array data, where N neurons are measured from time T 1 to time T 2 for R repetitions, and each event in the point processes corresponds to a spike (the time at which the neurons “ﬁred”).
Each X r,n is also called a spike train.
The model we propose, which we call DRS-VAE, is as follows:
[Equation]
where each f ( n ) θ : R m → Ψ is obtained as described in section 2.2.
The hidden state Z r for the r -th trial X r :=
( X r, 1 , . . .
, X r,N ) can be thought as a low-dimensional representation of X r .
Note that while the intensity function of every point process and every trial is a DRS, the latent state Z r of each trial is shared among the N point processes.
Once again, one might think that our parametrization of nonnegative splines is unnecessarily complicated and that having f ( n ) θ in equation 6 be a simpler parametrization of an arbitrary spline (e.g. basis coefﬁcients) and using τ ( g ψ r,n ) instead of g ψ r,n , where τ is a nonnegative function, might be a better solution to enforcing nonnegativity constraints.
The function τ would have to be chosen in such a way that the integral of equation 5 can still be computed analytically, making τ ( t )
=
t 2 a natural choice.
While this would avoid having to use the method of alternating projections, we found that squared splines perform very poorly as they oscillate too much.
3. I NFERENCE
Autoencoding variational Bayes (Kingma & Welling, 2013) is a technique to perform inference in the following type of model:
[Equation]
where each Z r ∈ R m is a local hidden variable which we do not observe, θ are the model parameters and X r is the data that we actually observe, whose distribution depends on Z r .
A variational autoencoder estimates θ and approximates the posterior p ( z | x ) by a distribution q φ ( z | x ) parametrized by φ .
Further simplifying assumptions are made and q φ ( z | x ) is taken such that it respects conditional independence:
[Equation]
where each q φ ( z r | x r ) is taken to be normal with mean and variance depending on R m valued nonlinear functions (usually taken to be neural networks) of x r :
[Equation]
where diag (cid:0) σ 2 φ ( x r ) (cid:1) is a diagonal matrix whose diagonal elements are given by σ 2 φ ( x r ) .
Performing (approximate) Bayesian inference becomes ﬁnding values of φ that adequately approximate the true posterior.
To achieve this task, the ELBO L , which is given by the following expression, is jointly maximized over ( θ, φ ) :
[Equation]
Maximizing the ELBO over φ is equivalent to minimizing the KL of the approximate posterior to the true posterior (for a ﬁxed θ ), while maximizing it over θ is equivalent to maximizing a lower bound on the log likelihood.
This lower bound is close to the actual log likelihood when the true posterior is correctly approximated.
Furthermore, the ﬁrst term in the sum in equation 10 can be written down in closed form as it is just the KL divergence between two normal random variables, while the second term in the sum can be written using the reparametrization trick:
[Equation]
11) where (cid:12) refers to coordinate-wise multiplication.
This allows for straightforward differentiation with respect to φ , and thus stochastic gradient methods can be used.
In order to perform inference, we use autoencoding variational Bayes.
Because of the point process nature of the data, µ φ and σ φ require a recurrent architecture, since their input x r = ( x r, 1 , x r, 2 , . . .
, x r,N ) consists of N point processes.
This is challenging because the input is not just a sequence, but N sequences of different lengths (numbers of events).
In order to deal with this, we use N separate LSTMs (Hochreiter & Schmidhuber, 1997), one per point process.
Each LSTM takes as input the events of the corresponding point process.
The ﬁnal states of each LSTM are then concatenated and transformed through a dense layer (followed by an exponential activation in the case of σ φ to ensure positivity) in order to map to the hidden space R m .
We also tried bidirectional
LSTMs (Graves & Schmidhuber, 2005) but found regular LSTMs to be faster while having similar performance.
The architecture is depicted in ﬁgure 1.
Combining equations 10 and 11 for our model of equation 6, we approximate the ELBO at each stochastic gradient step by:
[Equation]
log g ψ r,n,l ( x r,n,k ) − (cid:90) T
Tg ψ r,n,l ( t ) dt where B is a randomly selected subset of trials, (cid:15) 1 , . . .
(cid:15) L are iid N (0 , I m ) , µ φ,j ( x r ) and σ 2 φ,j ( x r ) are, respectively, the j -th coordinates of µ φ ( x r ) and σ 2 φ ( x r ) , K r,n is the number of events in the n -th point process of the r -th trial, ψ r,n,l = f ( n ) θ ( µ φ ( x r ) + σ φ ( x r ) (cid:12) (cid:15) l ) and x r,n,k is the k -th event of the n -th point process of the r -th trial.
Gao et al.
(2016) have a similar model, where a hidden Markov model is transformed through a neural network to obtain event counts on time bins.
The hidden state for a trial in their model is then an entire hidden Markov chain, which will have signiﬁcantly higher dimension than our hidden state.
Also, their model can be recovered from ours if we change the standard Gaussian distribution of Z r in equation 6 to reﬂect their Markovian structure and choose G to be piecewise constant, nonnegative functions.
We also emphasize the fact that our model is very easy to extend: for example, it would be straightforward to extend it to multi-dimensional point processes (not neural data any more) by changing G and its parametrization.
It is also straightforward to use a more complicated point process than the Poisson one by allowing the intensity to depend on previous event history.
Furthermore,
DRS can be used in settings that require random functions, even if no point process is involved.
E XPERIMENTS 4. S IMULATED D ATA
We simulated data with the following procedure: First, we set 2 different types of trials.
For each type of trial, we sampled one true intensity function on [0 , 10) for each of the N = 2 point processes by sampling from a GP and exponentiating the result.
We then sampled 600 times from each type of trial, resulting in 1200 trials.
We randomly selected 1000 trials for training and set aside the rest for testing.
We then ﬁt the model described in section 3.2 and compared it against the PfLDS model of
Gao et al.
and the GPFA model of Yu et al.
Both of these methods discretize time into
B time bins and have a latent variable per time bin and per trial (as opposed to our model which is only per trial).
They do this as a way of enforcing temporal smoothness by placing an appropriate prior over their latent trajectories, which we do not have to do as we implicitly enforce temporal smoothness by using splines to model intensity functions. PfLDS uses Gaussian linear dynamics x [Figure] x
[Figure] x [Figure] LSTM N
LSTM
LSTMdense [Figure] for their latent space and a Poisson distribution on the number of events per time bin, while GPFA places a GP distribution on the latent space and a Gaussian distribution on the square-rooted number of events per time bin. We compare these methods against DRS-VAE since both were designed to analyze the same type of point process data and, inference wise, PfLDS uses a similar autoencoding variational Bayes algorithm whereas GFPA uses GPs to model random functions.
We used a uniform grid with 11 knots (resulting in I = 10 intervals), picked d = 3 , s = 2 , used a mini-batch size of 2 and used L = 2 .
The state of each LSTM has 100 units, and ˜ f is a feed-forward neural network with ReLU activations and with 3 hidden layers, each one with 100 units.
We apply 102 iterations of the method of alternating projections.
Since a twice-differentiable cubic spline on I intervals has I + 3 degrees of freedom, when discretizing time for PfLDS and GPFA we use
B = I +3 = 13 time bins.
This way the distribution recovered by PfLDS also has B = 13 degrees of freedom, while the distribution recovered by GPFA has even more, as each Gaussian has a covariance in addition to the mean.
We set the latent dimension m in our model to 2 and we also set the latent dimension per time bin in PfLDS and GPFA to 2 , meaning that the overall latent dimension for an entire trial was 2 B = 26 .
These two choices make the comparison conservative as they allow more ﬂexibility for the two competing methods than for ours.
For the feed-forward architecture in PfLDS, we also used 3 hidden layers, each with 100 units.
The left panel of ﬁgure 2 shows the posterior means of the hidden variables in our model for each of the 200 test trials.
Each posterior mean is colored according to its type of trial.
We can see that different types of trials form separate clusters, meaning that our model successfully obtains low-dimensional representations of the trials.
Note that the model is trained without having access to the type of each trial; colors are assigned in the ﬁgure post hoc.
The right panel of ﬁgure 2 shows the events (in red) for a particular point process on a particular trial, along with the true intensity (in green) that generated the events and posterior samples from our model (in purple) and from PfLDS (in blue) of the corresponding intensities.
Note that since PfLDS parametrizes the number of counts on each time bin, it does not have a corresponding intensity.
We plot instead a piecewise constant intensity on each time bin in such a way that the resulting Poisson process has the same count distribution as the distribution that is parametrized by PfLDS.
We can see that our method recovers a smoother function that is closer to the truth than PfLDS. [Table]
[Figure] Table 1 shows performance from our model compared against PfLDS and GPFA.
The second column shows the per-trial ELBO on test data, and we can see that our model has a larger ELBO than PfLDS.
While having a better ELBO does not imply that our log likelihood is better, it does suggest that it is.
Since both PfLDS and GPFA put a distribution on event counts on time bins instead of a distribution on event times as our models does, the log likelihoods are not directly comparable.
However, in the case of PfLDS, we can easily convert from the Poisson likelihood on time bins to the piecewise constant intensity Poisson process likelihood, so that the numbers become comparable.
In order to get a quantitative comparison between our model and GPFA, we take advantage of the fact that we know the true intensity that generated the data and compare average L 2 distance, across point processes and trials, between posterior intensity samples and actual intensity function.
Once again, we can see that our method outperforms the alternatives.
Table 1 also includes the standard deviation of these Ldistances.
Since the standard deviations are somewhat large in comparison to the means, for each of the two competing alternatives, we carry out a two sample t-test comparing the L 2 distance means obtained with our method against the alternative.
The p -values indicate that our method recovers intensity functions that are closer to the truth in a statistically signiﬁcant way.
R EAL D ATA 4.2. R EACHING D ATA
We also ﬁt our model to the dataset collected by Churchland et al.
The dataset, after preprocessing (see supplementary material for details), consists of measurements of 20 neurons for 3590 trials on the interval [ − 100 , 300) (in ms ) of a primate.
In each trial, the primate reaches with its arm to a speciﬁc location, which changes from trial to trial (we can think of the 40 locations as types of trials), where time 0 corresponds to the beginning of the movement.
We randomly split the data into a training set with 3000 trials and a test set with the rest of the trials.
We chose d = 3 , s = 2 , L = 2 , applied 102 iterations of the method of alternating projections, set the state of each LSTM to have 25 units and ˜ f is a feed-forward network with ReLU activations and with 3 hidden layers, each one with 10 units (we tried more complicated architectures but saw no improvement).
We used 18 uniformly spaced knots (that is, 17 intervals).
For the comparison against
PfLDS, we split time into 20 bins, resulting in time bins of 20 ms (which is a standard length), once again making sure that the degrees of freedom are comparable.
Since we do not have access to the ground truth, we do not compare against GPFA as the L 2 metric computed in the previous section cannot be used here.
Again, we used a hidden dimension m = 2 for our model, resulting in hidden trajectories of dimension 40 for PfLDS.
We experimented with larger values of m but did not observe signiﬁcant improvements in either model.
Figure 3 shows the spike train (red) for a particular neuron on a particular trial, along with posterior samples from our model (in purple) and from PfLDS (in blue) of the corresponding intensities.
We can see that the posterior samples look like plausible intensities to have generated the corresponding spike trains and that our posterior intensities look smoother than the ones obtained by PfLDS.
[Figure]
[Table]
Table 2 shows the per-trial ELBO on test data for our model and for PfLDS. Again, our model has a larger ELBO than PfLDS, even when PfLDS has access to 20 times more hidden dimensions: our method is more successful at producing low-dimensional representations of trials than PfLDS.
The table also shows the percentage of correctly predicted test trial types when using 15 -nearest neighbors on the posterior means of train data (the entire trajectories are used for PfLDS).
While 23 .
73% might seem small, it should be noted that it is signiﬁcantly better than random guessing (which would have 2 .
5% accuracy)
and that the model was not trained to minimize this objective.
Regardless, we can see that our method also outperforms PfLDS in this metric, even when using a much lower-dimensional representation of each trial.
The last entry in the table shows the percentage of explained variation when doing ANOVA on the test posterior means (denoted SSG/SST), using trial type as groups.
Once again, we can see that our model recovers a more meaningful representation of the trials.
4.2. C YCLING D ATA
We also ﬁt our model to a not yet published dataset collected by our collaborators from the Churchland lab at Columbia University.
After preprocessing (see supplementary material), it consists ofand 188 train and test trials, respectively.
During each trial, 20 neurons of a primate are measured as it pedals for approximately 8 s .
There are 8 types of trials, based on whether the primate is pedaling forwards or backwards and at which speed.
We use the same hyperparameter settings as for the reaching data, except we use 26 uniformly spaced knots ( 25 intervals) and 28 bins for PfLDS, as well as a hidden dimension m = 10 , resulting in hidden trajectories of dimension 280 for PfLDS.
Table 3 quantitatively compares our method against
PfLDS.
The ELBO is actually higher for PfLDS, which appears (in preliminary analysis not shown) to be caused by an artifact of preprocessing the data rather than any essential performance loss.
While the ELBO was better for PfLDS, the quality of our latent representations is signiﬁcantly better, as shown by the accuracy of 15 -nearest neighbors to predict test trial types (random guessing would have 12 .
5% accuracy) and the ANOVA percentage of explained variation of the test posterior means.
This is particularly impressive as our latent representations have 28 times fewer dimensions.
We did experiment with different hyperparameter settings, and found that the ELBO of PfLDS increased
[Table]
slightly when using more time bins (at the cost of even higher-dimensional latent representations), whereas our ELBO remained the same when increasing the number of intervals.
However, even in this setting the accuracy of 15 -nearest neighbors and the percentage of explained variation did not improve for PfLDS.
C ONCLUSIONS
In this paper we introduced Deep Random Splines, an alternative to Gaussian processes to model random functions.
Owing to our key modeling choices and use of results from the spline and optimization literatures, ﬁtting DRS is tractable and allows one to enforce shape constraints on the random functions.
While we only enforced nonnegativity and smoothness in this paper, it is straightforward to enforce constraints such as monotonicity (or convexity/concavity).
We also proposed a variational autoencoder that takes advantage of DRS to accurately model and produce meaningful low-dimensional representations of neural activity.
Future work includes using DRS-VAE for multi-dimensional point processes, for example spatial point processes.
While splines would become harder to use in such a setting, they could be replaced by any family of easily-integrable nonnegative functions, such as, for example, conic combinations of Gaussian kernels.
Another line of future work involves using a more complicated point process than the Poisson, for example a Hawkes process, by allowing the parameters of the spline in a certain interval to depend on the previous spiking history of previous intervals.
Finally, DRS can be applied in more general settings than the one explored in this paper since they can be used in any setting where a random function is involved, having many potential applications beyond what we analyzed here. A CKNOWLEDGMENTS
We thank Sean Perkins and Karen Schroeder for sharing the cycling data.
This work was supported by the following grants: Simmons Foundation 542963, NIH NINDS 5R01NS100066, the McKnight
Endowment Fund, NSF 1707398 and The Gatsby Charitable Foundation (JPC)
Parametrization for nonnegative splines of even degree
As mentioned on section 2.1, there is an alternative characterization of nonnegative polynomials of even degree d = 2 k on an interval [ l, u ) that is analogous to equation 1 of the manuscript, which says that the polynomial p is nonnegative on the interval if and only if it can be written as:
[Equation]
where again, [ t ] = (1 , t, t 2 , . .
t k ) (cid:62) and Q 1 is a ( k + 1) × ( k + 1) symmetric positive semideﬁnite matrix.
In this case Q 2 is now a k × k symmetric positive semideﬁnite matrix and ˜[ t ] = (1 , t, t 2 , . . .
, t k − 1 ) (cid:62) .
Again, it follows that a piecewise polynomial of degree d with knots t 0 , . . .
, t I deﬁned as p ( i ) ( t ) for t ∈ [ t i − 1 , t i ) for i = 1 , . . .
, I is nonnegative if and only if it can be written as:
[Equation]
for i = 1 , . . .
, I , where each Q ( i ) 1 is a ( k + 1) × ( k + 1) symmetric positive semideﬁnite matrix and each Q ( i ) 2 is a k × k symmetric positive semideﬁnite matrix.
Projecting onto the space of smooth splines
As mentioned in section 2.2, mapping to Ψ = ∩ s +1 j =
C j can be achieved through the method of alternating projections.
As mentioned previously, projecting onto C 0 can be easily done through eigen-decomposition.
We now go through the details on how to project onto the other C j sets.
We will only cover C 1 , C 2 and C 3 for odd-degree splines as we used splines of degree 3 and smoothness 2, but projecting onto C j for j ≥ 4 for higher degree splines can be done in an analogous way.
Projections for even degree splines can also be derived in an analogous way.
Continuity projection for splines of odd degree
Suppose we are given ( Q ( i ) 1 , Q ( i ) 2 ) I i =1 , which are ( k +1) × ( k +1) matrices (not necessarily in Ψ ), deﬁning a piecewise polynomial as in equation 2 of the manuscript.
Computing the projection ( X ( i ) ∗ , Y ( i ) ∗ ) Ii =1 of ( Q ( i ) 1 , Q ( i ) 2 ) Ii =1 onto
C 1 can be done by solving the following optimization problem:
[Equation]
where || · || F denotes the Frobenius norm and each constraint is merely forcing the piecewise function to be continuous at knot i for i = 1 , . .
, I − 1 .
Note that this is a quadratic optimization problem with linear constraints, and can be solved analytically.
The corresponding Lagrangian is:
[Equation]
[Table]
Y
[Table] [ t i ] − ( t [Table] 1 − t i )
[ t i ] [Table] X (
[Table]
[ t [Table] ] (cid:17) where λ
= ( λ 1 , . . .
, λ I − 1 )
(cid:62) ∈ R I − 1 .
By solving the KKT conditions, it can be veriﬁed that:
[Equation]
where c i =
t i − t
i − 1 t i +1 − t i for i = 1 , . .
, I − 1 , c I = 0 , λ ∗ 0 = 0 , λ ∗ I =
and A i =
[ t i ][ t i ] (cid:62) for i = 0 , . . .
, I .
Diﬀerentiability projection for splines of odd degree
Analogously, computing the projection ( X ( i ) ∗ , Y ( i ) ∗ )
Ii =1 of ( Q ( i ) 1 , Q ( i ) 2 )
Ii =1 onto C 2 can be done by solving the following optimization problem:
[Equation]
, for
[Equation]
=
[Equation]
−
[Equation]
where [ t (cid:48) ]
= (0 , 1 , 2 t, 3 t 2 , . .
. , kt k − 1 ) (cid:62) and each constraint is now forcing the values of the left and right derivatives of the piecewise function to match at knot i for i = 1 , . .
, I − 1 .
Again, this is a quadratic optimization problem with linear constraints.
By writing the Lagrangian and solving the KKT conditions, we get:
[Equation]
for
[Equation]
where M i =
[ t i ][ t (cid:48)
i ] (cid:62) + [ t (cid:48)
i ][ t i ] (cid:62) for i = 0 , . .
, I and:
[Equation]
−
[Equation]
Q
[Equation]
for i = 1 , . . .
, I − 1 and again, λ ∗ 0 =
and λ ∗ I = 0 .
This is a tridiagonal system of I − 1 linear equations with
I − 1 unknowns and can be solved eﬃciently in O ( I ) time with simpliﬁed Gaussian elimination.
Second diﬀerentiability projection for splines of odd degree
Finally, computing the projection ( X ( i ) ∗ , Y ( i ) ∗ )
Ii =1 of ( Q ( i ) 1 , Q ( i ) 2 )
Ii =1 onto C 2 can be done by solving the following optimization problem:
[Equation]
[ t i ] − 2[ t i ] (cid:62) X
( i )
[ t (cid:48)
i ] + 2[ t (cid:48)
i ] (cid:62) Y ( i )
[ t i ] + 2[ t i ] (cid:62) Y ( i )
[ t (cid:48)
i ]
+ ( t i − t
i − 1 )
[ t (cid:48)(cid:48)
i ] (cid:62) Y ( i )
[ t i ] + 2( t i − t
i − 1 )
[ t (cid:48)
i ] (cid:62) Y ( i )
[ t (cid:48)
i ]
+ ( t i − t
i − 1 )
[ t i ] (cid:62) Y ( i )
[ t (cid:48)(cid:48)
i ]
= − 2[ t (cid:48)
i ] (cid:62) X
( i +1)
[ t i ] − 2[ t i ] (cid:62) X
( i +1)
[ t (cid:48)
i ]
+ ( t i +1 − t i )
[ t (cid:48)(cid:48)
i ] (cid:62) X
( i +1)
[ t i ] + 2( t i +1 − t i )
[ t (cid:48)
i ] (cid:62) X
( i +1)
[ t (cid:48)
i ]
+ ( t i +1 − t i )
[ t i ] (cid:62) X
( i +1)
[ t (cid:48)(cid:48)
i ] + 2[ t (cid:48)
i ] (cid:62) Y ( i +1)
[ t i ] + 2[ t i ] (cid:62) Y ( i +1)
[ t (cid:48)
i ] where [ t (cid:48)(cid:48) ]
= (0 , 0 , 2 , 6 t, . . .
, k ( k − 1)
t k − 2 ) (cid:62) and each constraint is now forcing the values of the left and right second derivatives of the piecewise function to match at knot i for i = 1 , . .
, I − 1 .
Again, this is a quadratic optimization problem with linear constraints.
By writing the Lagrangian and solving the KKT conditions, we get:
[Equation]
where B i − 1 = 2 M
i
[Equation]
1 − (
[Equation]
i
[Equation] [Equation]
[Equation] [Equation]
+
[Equation]
[ t
[Equation]
][ t
[Equation] [Equation]
+[ t
[Equation]
1 ][ t
[Equation] [Equation]
and E i =
2 M i −
[Equation] [Equation]
[Equation] [Equation]
+ 2[ t (cid:48)
i ][ t (cid:48)
i ] (cid:62) + [ t i ][ t (cid:48)(cid:48) i ] (cid:62) ) for i
= 1 , . .
, I and:
[Equation] [Equation]
where again, λ ∗ 0 = 0 and λ ∗ I = 0 .
Again, this is a tridiagonal system of I − 1 linear equations with I − 1 unknowns that can be solved eﬃciently.
Reaching Data Preprocessing
We include only successful trials (i.e. when the primate reaches to the correct location) and use only spikes occurring in a window of − 100 ms and 300 ms from the time that movement starts.
We also reduce the total number of neurons as inference with our method requires one LSTM per neuron and having too many neurons renders training slow.
In order to do so, we use the following GLM:
[Equation]
where y r is the trial type of trial r , C = 40 is the number of trial types, ˜ K r, · ∈ R N is a vector containing the (centered and standardized) number of spikes in trial r for each of the N = 223 neurons, and β ∈ R N × C are the
GLM parameters.
We train the GLM using group lasso (Yuan and Lin, 2006), where the groups are deﬁned by neurons.
That is, the GLM is trained through maximum likelihood with an added penalty:
[Equation]
where β n, · is the n th row of β .
This makes it so that the coeﬃcients in each group hit zero simultaneously.
A neuron n is removed if || ˆ β n, · || = 0 .
We use a regularization parameter λ such that all but 20 neurons are removed.
This provides a principled way of reducing the number of neurons while making sure that the kept neurons are useful.
As PfLDS does not require the use of LSTMs, it can be run on the data without removing neurons.
While doing this did increase performance of PfLDS, it did so very marginally and our model still heavily outperformed
PfLDS.
Cycling Data Preprocessing
Once again, we only keep successful trials (i.e. when the primate pedals in the correct direction and speed) and reduce the total number of neurons N = 256 to 20 by using group lasso.
Since each trial has a diﬀerent length, we extend every trial to have the same length as the longest trial.
We add no spikes to these extended time periods.
We also tried running PfLDS with all the neurons and saw only a very marginal improvement, like we did with reaching data.