A Path Signature Framework for Detecting Creative Fatigue in Digital Advertising
Pith reviewed 2026-05-18 17:25 UTC · model grok-4.3
The pith
Path signatures detect creative fatigue in digital advertising by capturing geometric changes in performance trajectories.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper claims that advertising performance trajectories can be embedded as paths and represented by truncated (log-)signatures, allowing detection of creative fatigue as geometric change in trend, volatility, and non-linear dynamics beyond simple mean or variance shifts, with an explicit quantification of performance loss relative to a benchmark and evaluation on synthetic panel data using an operational ground truth based on sustained deterioration from a recent-best baseline.
What carries the argument
The truncated log-signature of the embedded performance path, which serves as a geometric feature representation that encodes iterated integrals to capture the shape and dynamics of the trajectory for change detection.
If this is right
- Changes in non-linear dynamics of CTR can be detected in addition to mean shifts.
- Lead-time and alert-burden metrics can be reported for practical monitoring.
- Performance loss can be quantified relative to a benchmark period.
- The method scales linearly with time-series length for fixed signature depth.
- Sensitivity analysis over tuning parameters shows robustness.
Where Pith is reading between the lines
- Applying this geometric method to other marketing metrics like conversion rates could improve overall campaign monitoring.
- Integration with automated creative testing platforms might enable dynamic rotation based on signature-detected fatigue.
- Future work could compare signature features against standard time-series anomaly detection algorithms on real datasets.
- Extending the paths to include multiple dimensions like impressions and costs simultaneously could capture more complex fatigue patterns.
Load-bearing premise
The synthetic panel dataset accurately mimics realistic impression volumes and noisy day-to-day CTR dynamics, and the operational ground truth for fatigue onset based on a noise-robust CTR estimate and sustained deterioration relative to a recent-best baseline is a valid proxy for actual fatigue.
What would settle it
Running the detector on a real-world proprietary dataset with marketing team-confirmed fatigue events and measuring whether it provides statistically significant earlier alerts or lower false positive rates compared to mean-shift detectors.
Figures
read the original abstract
This paper introduces a signature-based framework for detecting advertising creative fatigue using path signatures, a geometric representation from rough path theory. Creative fatigue -- the degradation of creative effectiveness under repeated exposure -- is operationally important in digital marketing because delayed detection can translate directly into avoidable opportunity cost. We reframe fatigue monitoring as a geometric change detection problem: advertising performance trajectories are embedded as paths and represented by truncated (log-)signatures, enabling detection of changes in trend, volatility, and non-linear dynamics beyond simple mean or variance shifts. We further connect statistical detection to managerial decision-making via an explicit quantification of performance loss relative to a benchmark period. Because proprietary production data cannot be released, we evaluate the proposed framework on a synthetic panel dataset designed to mimic realistic impression volumes and noisy day-to-day CTR dynamics. We define observed CTR as the realised binomial rate $CTR_t := C_t/I_t$ using daily clicks $C_t$ and impressions $I_t$. The accompanying CSV also contains a pre-computed CTR field (e.g., due to rounding or upstream derivation), but all modelling and evaluation in this paper use $C_t/I_t$. Crucially, the dataset does not include injected changepoints; we therefore define an operational ground truth for ``fatigue onset'' based on a noise-robust CTR estimate and a sustained deterioration relative to a recent-best baseline. We report lead-time (early warning) and alert-burden metrics under this operational definition, and provide a sensitivity analysis over the detector's primary tuning parameters. The methodology scales linearly in time-series length for fixed signature depth and is suitable for monitoring large creative portfolios.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a path signature framework from rough path theory to detect creative fatigue in digital advertising. Performance trajectories are embedded as paths and represented by truncated (log-)signatures to identify changes in trend, volatility, and non-linear dynamics. Evaluation uses a synthetic panel dataset mimicking noisy CTR dynamics (with observed CTR defined as C_t/I_t), an operational ground truth based on noise-robust CTR estimates and sustained deterioration relative to a recent-best baseline, and reports lead-time and alert-burden metrics plus sensitivity analysis over tuning parameters. The approach is claimed to scale linearly in time-series length.
Significance. If the geometric features can be shown to add value beyond mean-shift detectors, the framework could offer a scalable tool for monitoring large creative portfolios and quantifying performance loss, with potential to reduce opportunity costs in digital marketing. Credit is due for the explicit sensitivity analysis over detector tuning parameters, the linear scalability claim, and the use of synthetic data with an operational ground truth definition to enable evaluation where proprietary data cannot be shared.
major comments (2)
- [Abstract] Abstract: the central claim that truncated (log-)signatures enable detection of changes in trend, volatility, and non-linear dynamics 'beyond simple mean or variance shifts' is not supported by the evaluation. The operational ground truth for fatigue onset relies on a noise-robust CTR estimate and sustained deterioration relative to a recent-best baseline, which primarily encodes mean/trend shifts in the C_t/I_t series; this setup means the reported lead-time and alert-burden metrics do not test the claimed incremental value for volatility or higher-order path effects.
- [Data and ground truth definition] Section describing the synthetic dataset and ground truth definition: the dataset contains no injected changepoints for volatility or non-linear dynamics, and the paper lacks specific details on the noise-robust CTR computation method. This leaves gaps in demonstrating robustness to realistic day-to-day noise and undermines support for the geometric change detection advantage over standard detectors such as CUSUM or EWMA.
minor comments (2)
- [Methods] Clarify in the methods section how the signature truncation depth interacts with the detector tuning parameters, and whether any cross-validation was used to select them.
- [Data description] The distinction between the pre-computed CTR field in the accompanying CSV and the modelled C_t/I_t should be stated more explicitly to avoid reader confusion.
Simulated Author's Rebuttal
We thank the referee for the constructive feedback and for acknowledging the potential of the framework, the sensitivity analysis, and the use of synthetic data with an operational ground truth. We address each major comment below and describe the specific revisions we will make to the manuscript.
read point-by-point responses
-
Referee: [Abstract] Abstract: the central claim that truncated (log-)signatures enable detection of changes in trend, volatility, and non-linear dynamics 'beyond simple mean or variance shifts' is not supported by the evaluation. The operational ground truth for fatigue onset relies on a noise-robust CTR estimate and sustained deterioration relative to a recent-best baseline, which primarily encodes mean/trend shifts in the C_t/I_t series; this setup means the reported lead-time and alert-burden metrics do not test the claimed incremental value for volatility or higher-order path effects.
Authors: We agree that the current operational ground truth is defined via sustained deterioration in a noise-robust CTR estimate relative to a recent-best baseline and therefore primarily reflects mean and trend shifts. Consequently, the reported metrics do not directly quantify any incremental benefit of the signature features for volatility or higher-order effects. The theoretical motivation for using truncated log-signatures remains their ability to encode iterated integrals that capture such dynamics, but we accept that this is not empirically demonstrated in the present evaluation. In the revised manuscript we will add a new subsection containing synthetic experiments in which controlled volatility shifts and non-linear path perturbations are injected into the performance trajectories. On these augmented datasets we will report lead-time and alert-burden for the signature detector alongside CUSUM and EWMA baselines, thereby providing direct evidence for the claimed geometric advantage. revision: yes
-
Referee: [Data and ground truth definition] Section describing the synthetic dataset and ground truth definition: the dataset contains no injected changepoints for volatility or non-linear dynamics, and the paper lacks specific details on the noise-robust CTR computation method. This leaves gaps in demonstrating robustness to realistic day-to-day noise and undermines support for the geometric change detection advantage over standard detectors such as CUSUM or EWMA.
Authors: We will expand the synthetic-data section to include an explicit algorithmic description of the noise-robust CTR estimator (a rolling-window median filter with outlier rejection, followed by a local linear trend fit). We will also augment the data-generation procedure with additional panels that contain injected volatility changes and non-linear drift perturbations while preserving the same marginal impression and click statistics. These new panels will be used to recompute all detection metrics and to compare the signature-based detector against CUSUM and EWMA. The existing sensitivity analysis over tuning parameters will be extended to the new scenarios, directly addressing robustness to day-to-day noise and the relative performance versus standard detectors. revision: yes
Circularity Check
No circularity: derivation applies independent geometric features to an explicitly chosen operational proxy
full rationale
The paper derives its detector from truncated (log-)signatures of performance paths, a construction taken from rough path theory and applied to the observed CTR series C_t/I_t. The operational ground truth is separately defined in the abstract as a noise-robust CTR estimate plus sustained deterioration relative to a recent-best baseline; this proxy is used only for reporting lead-time and alert-burden metrics and is not obtained from the signature transform itself. No equation or step equates the signature features to the ground-truth definition by construction, no self-citation chain is load-bearing, and the methodology is presented with explicit scaling and sensitivity analysis over its own tuning parameters. The evaluation therefore tests the chosen detector against a stated benchmark rather than reducing the claimed geometric advantages to the benchmark by definition.
Axiom & Free-Parameter Ledger
free parameters (2)
- signature depth
- detector tuning parameters
axioms (2)
- domain assumption Performance trajectories can be meaningfully embedded as paths whose geometric features capture fatigue-related changes in trend, volatility, and non-linear dynamics.
- domain assumption Rough path theory and truncated signatures provide a suitable representation for detecting changes beyond mean or variance shifts in CTR time series.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We treat the performance trajectory of a creative asset over time as a path in two-dimensional space and compute its path signature... truncated signature up to depth d... Euclidean distance D=∥S(XW1)−S(XW2)∥2
-
IndisputableMonolith/Foundation/ArithmeticFromLogic.leanLogicNat unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
window size between 7 and 14 days... sensitivity threshold multiplier k
-
IndisputableMonolith/Foundation/AlphaCoordinateFixation.leanalpha_pin_under_high_calibration unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
synthetic panel dataset... operational ground truth... sustained deterioration relative to a recent-best baseline
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
Pechmann, C. and Stewart, D. W., 1988. Advertising repetition: A critical review of wearin and wearout. Current Issues and Research in Advertising, 11(1-2), pp. 285--329
work page 1988
-
[2]
Naik, P. A., Mantrala, M. K., and Sawyer, A. G., 2008. Planning media schedules in the presence of dynamic advertising quality. Marketing Science, 17(3), pp. 214--235
work page 2008
-
[3]
M., Bruce, N., Majumdar, S., and Murthi, B
Bass, F. M., Bruce, N., Majumdar, S., and Murthi, B. P. S., 2007. Wearout effects of different advertising themes: A dynamic Bayesian model of the advertising-sales relationship. Marketing Science, 26(2), pp. 179--195
work page 2007
- [4]
-
[5]
Vakratsas, D. and Ambler, T., 1999. How advertising works: What do we really know? Journal of Marketing, 63(1), pp. 26--43
work page 1999
-
[6]
Campbell, M. C. and Keller, K. L., 2003. Brand familiarity and advertising repetition effects. Journal of Consumer Research, 30(2), pp. 292--304
work page 2003
-
[7]
Kannan, P. K. and Li, H. A., 2017. Digital marketing: A framework, review and research agenda. International Journal of Research in Marketing, 34(1), pp. 22--45
work page 2017
-
[8]
Wedel, M. and Kannan, P. K., 2016. Marketing analytics for data-rich environments. Journal of Marketing, 80(6), pp. 97--121
work page 2016
-
[9]
Lambrecht, A. and Tucker, C., 2013. When does retargeting work? Information specificity in online advertising. Journal of Marketing Research, 50(5), pp. 561--576
work page 2013
-
[10]
Goldfarb, A. and Tucker, C., 2011. Online display advertising: Targeting and obtrusiveness. Marketing Science, 30(3), pp. 389--404
work page 2011
-
[11]
Li, H. A. and Kannan, P. K., 2021. Attribution strategies and return on keyword investment in paid search advertising. Marketing Science, 40(5), pp. 831--848
work page 2021
-
[12]
Bruce, N. I., Foutz, N. Z., and Kolsarici, C., 2012. Dynamic effectiveness of advertising and word of mouth in sequential distribution of new products. Journal of Marketing Research, 49(4), pp. 469--486
work page 2012
-
[13]
Braun, M. and Moe, W. W., 2013. Online display advertising: Modeling the effects of multiple creatives and individual impression histories. Marketing Science, 32(5), pp. 753--767
work page 2013
-
[14]
S., Narayanan, S., and Kalyanam, K., 2019
Sahni, N. S., Narayanan, S., and Kalyanam, K., 2019. The effect of temporal spacing on advertising effectiveness: Evidence from a field experiment. Stanford Graduate School of Business Working Paper
work page 2019
-
[15]
Dekimpe, M. G. and Hanssens, D. M., 1999. Time-series models in marketing: Past, present and future. International Journal of Research in Marketing, 17(2-3), pp. 183--193
work page 1999
-
[16]
Pauwels, K., Hanssens, D. M., and Siddarth, S., 2004. Modeling marketing dynamics by time series econometrics. Marketing Letters, 15(4), pp. 167--183
work page 2004
-
[17]
Horv\'ath, C., Leeflang, P. S. H., and Wittink, D. R., 2014. Changes and persistence in the advertising-sales relationship. International Journal of Research in Marketing, 31(3), pp. 293--305
work page 2014
-
[18]
Aminikhanghahi, S. and Cook, D. J., 2017. A survey of methods for time series change point detection. Knowledge and Information Systems, 51(2), pp. 339--367
work page 2017
-
[19]
Selective review of offline change point detection methods
Truong, C., Oudre, L., and Vayatis, N., 2020. Selective review of offline change point detection methods. Signal Processing, 167, p. 107299
work page 2020
-
[20]
Adams, R. P. and MacKay, D. J. C., 2007. Bayesian online changepoint detection. arXiv preprint arXiv:0710.3742
work page internal anchor Pith review Pith/arXiv arXiv 2007
- [21]
-
[22]
Ma, L. and Sun, B., 2022. Machine learning and AI in marketing--Connecting computing power to human insights. International Journal of Research in Marketing, 39(3), pp. 619--623
work page 2022
-
[23]
Dzyabura, D., Kihal, S. E., and Ibragimov, M., 2018. Leveraging the power of images in managing product return. Harvard Business School Working Paper
work page 2018
-
[24]
Timoshenko, A. and Hauser, J. R., 2019. Identifying customer needs from user-generated content. Marketing Science, 38(1), pp. 1--20
work page 2019
-
[25]
Chevyrev, I. and Kormilitzin, A., 2016. A primer on the signature method in machine learning. arXiv preprint arXiv:1603.03788
-
[26]
Kidger, P., Bonnier, P., Perez Arribas, I., Salvi, C., and Lyons, T., 2019. Deep signature transforms. Advances in Neural Information Processing Systems, 32
work page 2019
-
[27]
Embedding and learning with signatures
Fermanian, A., 2021. Embedding and learning with signatures. Computational Statistics & Data Analysis, 157, p. 107148
work page 2021
-
[28]
Neural rough differential equations for long time series
Morrill, J., Salvi, C., Kidger, P., Foster, J., and Lyons, T., 2021. Neural rough differential equations for long time series. International Conference on Machine Learning, pp. 7829--7838
work page 2021
-
[29]
Choi, H., Mela, C. F., Balseiro, S. R., and Leary, A., 2020. Online advertising and consumer privacy. Marketing Science, 39(4), pp. 666--692
work page 2020
-
[30]
L., Liberali, G., MacDonald, E., Bordley, R., and Hauser, J
Urban, G. L., Liberali, G., MacDonald, E., Bordley, R., and Hauser, J. R., 2014. Turning the "right" knobs: Advertising response models revisited. Journal of Advertising Research, 54(3), pp. 334--344
work page 2014
-
[31]
Real-time bidding for online advertising: Measurement and analysis
Zhang, W., Yuan, S., and Wang, J., 2014. Real-time bidding for online advertising: Measurement and analysis. Proceedings of the 7th International Workshop on Data Mining for Online Advertising
work page 2014
-
[32]
Ataman, M. B., Van Heerde, H. J., and Mela, C. F., 2010. The long-term effect of marketing strategy on brand sales. Journal of Marketing Research, 47(5), pp. 866--882
work page 2010
-
[33]
Mind-set metrics in market response models: An integrative approach
Srinivasan, S., Vanhuele, M., and Pauwels, K., 2010. Mind-set metrics in market response models: An integrative approach. Journal of Marketing Research, 47(4), pp. 672--684
work page 2010
-
[34]
Digital advertising effectiveness: The evidence-based view
IAB, 2023. Digital advertising effectiveness: The evidence-based view. Interactive Advertising Bureau
work page 2023
-
[35]
Effectiveness of online advertising: A meta-analysis
Pergelova, A., Prior, D., and Rialp, J., 2019. Effectiveness of online advertising: A meta-analysis. International Journal of Advertising, 38(5), pp. 710--745
work page 2019
-
[36]
Assmus, G., Farley, J. U., and Lehmann, D. R., 1984. How advertising affects sales: Meta-analysis of econometric results. Journal of Marketing Research, 21(1), pp. 65--74
work page 1984
-
[37]
M., Abraham, M., Kalmenson, S., Livelsberger, J., Lubetkin, B., Richardson, B., and Stevens, M
Lodish, L. M., Abraham, M., Kalmenson, S., Livelsberger, J., Lubetkin, B., Richardson, B., and Stevens, M. E., 1995. How TV advertising works: A meta-analysis of 389 real world split cable TV advertising experiments. Journal of Marketing Research, 32(2), pp. 125--139
work page 1995
-
[38]
Sethuraman, R., Tellis, G. J., and Briesch, R. A., 2011. How well does advertising work? Generalizations from meta-analysis of brand advertising elasticities. Journal of Marketing Research, 48(3), pp. 457--471
work page 2011
-
[39]
Jordan, M. I. and Mitchell, T. M., 2015. Machine learning: Trends, perspectives, and prospects. Science, 349(6245), pp. 255--260
work page 2015
-
[40]
LeCun, Y., Bengio, Y., and Hinton, G., 2015. Deep learning. Nature, 521(7553), pp. 436--444
work page 2015
-
[41]
Balakrishnan, R. and Kambhampati, S., 2008. Optimal Ad Ranking for Profit Maximization. Proceedings of the 11th International Workshop on Web and Databases (WebDB '08), pp. 1--6
work page 2008
-
[42]
Differential equations driven by rough signals
Lyons, T., 1998. Differential equations driven by rough signals. Revista Matem \'a tica Iberoamericana , 14(2), pp. 215--310
work page 1998
-
[43]
Friz, P. K. and Hairer, M., 2014. A Course on Rough Paths: With an Introduction to Regularity Structures. Springer
work page 2014
-
[44]
Cespedes, F. and Plomion, B., 2024. Navigating the Future of Online Advertising with WEB3. Harvard Business School Working Paper No. 24-089
work page 2024
-
[45]
Corvi, E. and Bonera, M., 2010. The effectiveness of advertising: a literature review. Proceedings of the 10th Global Conference on Business & Economics, Rome, Italy, October 15-16
work page 2010
-
[46]
DASS: Digital Advertising System Simulation
Sapp, S., Vaver, J., Shi, M., and Bhatia, N., 2008. DASS: Digital Advertising System Simulation. Google Inc., Mountain View, CA
work page 2008
-
[47]
Vaver, J. and Koehler, J., 2011. Measuring ad effectiveness using geo experiments. Google Inc
work page 2011
-
[48]
Cass, T. and Salvi, C., 2024. Lecture Notes on Rough Paths and Applications to Machine Learning. arXiv preprint arXiv:2404.06583
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.