- Rating
- 4(+1)
- Confidence
- 2(+1)
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
This paper presents differentiable Gaussian dynamics (DGD), which makes three contributions related to understanding population-level behavioral dynamics from aggregate observations.
- They use a mixture of Gaussians in a latent space (containing hidden preferences) to model heterogeneity along distinct cohorts.
- This latent distribution is then used to model observable behaviour using an autoregressive logistic model followed by differentiable numerical integration.
- Transition parameters are used to predict response shifts over the following time stamp. These parameters are jointly optimized using a composite loss involving NLL terms, forecasting losses, and regularization. This method is tested on two datasets and outperforms neural-network-based baselines.
Critical strengths
- This paper shows that a simple structured probabilistic model outperforms more complex GRU-based models. The experimental advantage is impressive, and the role played by each parameter in the model makes this approach much more interpretable.
- Experiments seem to justify the complexity of the theoretical results. The ablations provide strong evidence that the proposed modelling components are useful. The error bounds also seem non-vacuous (but we need more experiments to convincingly show this).
- The methods developed in this paper have applications to other areas in ML/statistics of interest to the reader. Gaussian representation, differentiable aggregration, and feedback recurrence seem like commonly used methods in related communities.
- I went through the proofs and they seem correct to me.
Critical weaknesses
- The presentation needs improvement. Section 3 introduces a substantial number of variables and parameters across its subsections, often without sufficient explanation of their roles or relationships within the overall framework. This makes the methodology difficult to follow. It would be helpful to have, for example, a table of each variable.
- At the moment, the method assumes that individuals have already been assigned to cohorts based on historical information. This limits its applicability to settings where meaningful cohort assignments are not readily available. It would be interesting to know how DGD can be extended to perform these cohort assignments as well.
- Some of the experimental choices are not sufficiently discussed. For example, why did the authors conclude that two Gaussian components are sufficient? Also, why is a 1D latent space sufficient?
- For binary behaviours, there are possible patterns. This can make the computation and optimization of conditional behaviour expensive.
Questions for authors
Can the authors provide empirical computations of the error bounds derived in Appendix C? At the moment, its practical relevance remains unclear. It would be helpful to also compare the theoretical bounds with the empirical errors in the experimentals. This would clarify how vacuous the bounds really are. Also, I'm curious how the bounds scale with the number of quadrature nodes.
2 comments
Thank you for your reply. Your response addresses several of my concerns, so I am happy to increase my score to a 4.
Response to Reviewer QGQu
Thank you for checking the proofs.
W1. Readability of Section 3. The revised Section 3 will open with a table that gives each symbol's meaning, parameter group and first equation. We will also add the regularization formula, the behavior ordering, with its sensitivity to reordering in the appendix, the initialization, and the Cholesky lower bound.
W2. Cohorts are defined in advance. Cohorts are the model's units, and Appendix D.1 gives the partition rules, which are fixed before training. DGD can be extended by treating cohort membership as a latent variable that depends on individual features and training the soft assignment with the same aggregate likelihood; the revised Limitations will discuss this.
W3. Why K=2 and d=1. Over K∈{1,2,3,4} and Q∈{5,7,11}, moving from K=1 to K=2 gives most of the gain (Standard 1.2565 → 1.1232), and larger K adds nothing consistent. For d, we fitted d=2 (10 seeds) and d=3. On bucket 1 in Standard, with 9 training days, d=2 lowers joint NLL by 0.015 [0.003, 0.032] relative to d=1 and is 0.018 [0.009, 0.029] below a discrete model with the same number of distribution parameters; on five further buckets d=2 is lower than d=1 on four and lower than the discrete model on all five. On bucket 1, between d=1 and d=2 validation selects d=2 in Standard and d=1 in Random, and d=3 does not lower test NLL below d=2; the revised paper will report these choices. Our reply to LfFR (W4) has the details.
W4. Cost of enumerating 2H patterns. For d=1, the forward pass costs O(K,Q,2HH) per cell-day, and the largest intermediate tensor has shape [cells, K, nodes, 2H, H]. Single-thread forward-plus-backward time:
Time grows linearly with the number of nodes, and more slowly than the tensor as H increases. DGD has 452 parameters on KuaiRand and 148 on Retail. A full single-thread fit takes 24–68 seconds. The enumeration limits how large H can be; the revised paper will state this and report parameter count, fit time and memory separately.
Question. How large are the error bounds in practice, and how do they scale with the number of nodes? On the trained models, the local probability bound is about the same size as the actual quadrature error for Q≥7, and the gradient bound is within a factor of 1–3 wherever the error is above floating-point precision. In Standard the probability error falls from 6×10⁻⁴ at Q=7 to 7×10⁻⁷ at Q=25; this check uses a high-order reference integral. The recursive bound in Appendix C.3 is about six orders of magnitude wider than the actual error, because the per-step Lipschitz factor exceeds 1 and compounds over the horizon. The revised Appendix C will present it as an inequality next to a bound-versus-error table.