Mathematical Finance · arXiv:2611.16992 v1 · submitted 12 Nov 2026 · 21 references
Media Trading with Censored Auction Prices: A Stochastic Control and Reinforcement Learning Approach
The paper says
“In real-time bidding, marketing agencies must balance campaign performance, transaction margins and the use of a finite advertising budget.”
more of the abstract
A key difficulty is that market-clearing prices are typically observed only when bids are successful, so the information available for subsequent decisions depends on the bidding policy. We formulate this problem using a continuous-time stochastic control model with a latent price process. To construct a price signal, we consider parallel exploratory subcampaigns in which bids are randomized subject to an upper bound. Under a stylized cross-sectional sampling model, the resulting price estimator is consistent and satisfies a mean-square error bound of order N−1, where N is the number of exploratory observations. We then describe a model-based approach combining forward-equation calibration with Hamilton-Jacobi-Bellman policy iteration and a physics-informed neural network, alongside an entropy-regularized actor-critic approach based on observable information in a model-free setting. Synthetic experiments illustrate the estimator and the computational procedures. The framework clarifies the decision and information trade-offs faced by the agency, while distinguishing full-information benchmarks and estimated-price policies from the genuinely partially observed control problem.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. A clean formulation of a practical problem, with honest limitations; the central estimator bound has a known gap with the experiments, but the paper is transparent about it and the framework is useful. This line is wrong
4 major objections · 12 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 21 references say.
The paper says, at §4.2, Lemma 4.1 and Remark 4.1
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.78):
“Remark 4.1.The mean-square error bound in Lemma 4.1 assumes that the latent price lies almost surely in a fixed compact interval.”
Pith says: Objection 1 of 4 · major
The mean-square error bound of Lemma 4.1 assumes that the latent price St lies almost surely in a known compact interval K. The authors acknowledge in Remark 4.1 that this assumption is violated by the Ornstein–Uhlenbeck model used in the experiments (Section 7.1).
more of objection 1
The estimator (4.4) projects onto K, introducing a truncation error that is not bounded by the lemma. Since the experiments are the primary demonstration of the estimator's performance, the practical validity of the O(N^{-1}) bound is unclear. The paper should either provide a bound that holds under the experimental model (e.g., using a truncation argument with a tail bound) or explain why the violation is negligible in the experiments.
The paper says, at §4.2, Proposition 4.2 and surrounding discussion
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.93):
“Therefore convergence of the price estimator alone does not establish near-optimality of an optimizer of the proxy problem.”
Pith says: Objection 2 of 4 · major
Proposition 4.2 bounds the payoff difference for a fixed policy under an anti-concentration condition, but the authors explicitly state (sentences [b145]–[b147]) that this does not establish near-optimality of an optimizer of the proxy problem. The numerical comparison (Figure 10) shows a substantial gap between observed-price and estimated-price policies.
more of objection 2
The paper does not decompose this gap into estimation error vs. the fundamental cost of using a plug-in policy in a controlled filtering problem. Without such a decomposition, the practical relevance of the estimator for control remains unclear. The paper should either provide a bound on the suboptimality of the plug-in policy under appropriate assumptions or clearly state that the estimator is only useful for monitoring, not for control.
The paper says, at §5.2, HJB equation
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.76):
“In particular, the estimated-price feedback is aplug-in strategy, not the solution of the underlying partially observed control problem.”
Pith says: Objection 3 of 4 · major
The HJB equation (5.2) is derived under full information. The paper then uses it as a plug-in approximation by replacing St with the estimated price. The authors note (sentence [b39]) that this is not the solution of the partially observed control problem.
more of objection 3
However, the paper does not discuss the separated problem (the controlled filtering equation) or provide any justification for the plug-in approach beyond computational convenience. This is a significant gap: the paper claims to address a partially observed control problem, but the main computational method does not actually solve it. The paper should either develop a rigorous approximation theory for the plug-in policy or reframe the contribution as purely heuristic.
The paper says, at §7.5, Figure 10 and comparison
The review did not quote this passage.
Pith says: Objection 4 of 4 · major
The comparison in Figure 10 includes a PID budget-pacing rule that is not a solution to the optimization problem (3.4). The paper states (sentence [b264]) that the PID rule ignores the market price, campaign performance, and the agency margin. Including it as a benchmark is reasonable, but the paper does not provide a clear interpretation of the comparison.
more of objection 4
The gap between observed-price and estimated-price policies is attributed to both exploration cost and threshold effect, but no quantitative decomposition is given. The paper should either provide a more detailed analysis of the gap or temper the claims about the estimator's usefulness for control.
12 minor objections
The paper says, at §1, Introduction
Pith says: minor objection 1 of 12
The related work section mentions [9] but does not clearly distinguish the contributions of the present paper from that work beyond stating that the decision problem differs. A more explicit comparison of the modeling assumptions and results would be helpful.
The paper says, at §2.2, Linear–quadratic benchmark
Pith says: minor objection 2 of 12
The Hamiltonian (2.1) includes a term κ(1+β)^2 a^2, but the derivation of the optimal bid awin uses a0(p) = (β - (1+β)p_y) / (2κ(1+β)^2). This is correct, but the notation could be clarified: the denominator is 2κ(1+β)^2, not 2κ(1+β)^2? It is correct as written, but the parentheses are dense.
show 10 more
The paper says, at §4.1, Equation (4.1)
Pith says: minor objection 3 of 12
The capped exponential distribution (4.1) is defined with a normalization factor 1 - e^{-λ Amax}. This is correct for a truncated exponential, but the denominator should be 1 - e^{-λ Amax} (not 1 - e^{-λ Amax}? Actually it is written as 1 - e^{-λ Amax}, which is correct. The expression is fine.
This objection may describe the copy Pith gave the reviewer, not the paper.
The paper says, at §4.2, Lemma 4.1
Pith says: minor objection 4 of 12
The proof states that projection onto an interval does not increase distance to a point in that interval. This is true if the point is in the interval, but if St is outside K (which is assumed not to happen), the projection would introduce error. The assumption that St ∈ K almost surely is critical.
The paper says, at §4.3, Forward-equation calibration
Pith says: minor objection 5 of 12
The calibration loss L(η) includes a data term L_data(η) that is not defined. The paper should specify what this term measures (e.g., likelihood, mean-square error between observed and predicted moments).
The paper says, at §5.3, Algorithm 1
Pith says: minor objection 6 of 12
The policy iteration algorithm is described at a high level. The paper does not specify how the policy is represented or how the pointwise maximization is performed (e.g., grid search, optimization). More implementation details would improve reproducibility.
The paper says, at §6.3, Actor–critic approximation
Pith says: minor objection 7 of 12
The critic loss L_critic(θ) is defined as the sum of squared conditional expectations E[δ_k | O_k]. In practice, this is often approximated by the mean squared temporal-difference error. The paper should clarify how the conditional expectation is estimated (e.g., using a function approximator).
The paper says, at §7.1, Table 1
Pith says: minor objection 8 of 12
The parameter d = 0.1 is the share of budget allocated to price estimation. The paper should explain how this share is implemented: is it a separate budget for exploratory subcampaigns, or is it deducted from the main budget? The text says 'using an exploratory allocation corresponding to 10% of the initial budget' (Section 7.2), but the budget dynamics in Section 3 do not account for this deduction. The paper should clarify the budget accounting for exploration.
The paper says, at §7.5, Figure 10
Pith says: minor objection 9 of 12
The figure caption and text describe the comparison but do not report error bars or confidence intervals. Given the stochastic nature of the problem, reporting standard errors or quantiles would strengthen the comparison.
The paper says, at §8, Discussion
Pith says: minor objection 10 of 12
The limitations section is brief. The paper should explicitly state that the plug-in policy is not guaranteed to be near-optimal and that the estimator's MSE bound does not apply to the experimental model. These are already mentioned in the text, but a consolidated limitations paragraph would be helpful.
The paper says, at Appendix A
Pith says: minor objection 11 of 12
The derivation of Z^π as a diffusion process assumes that π_t(a) is C^1 in a and has finite variation in time. This is a strong assumption for a learned policy. The paper should note that this is a theoretical expression and may not hold for neural-network policies.
The paper says, at General
Pith says: minor objection 12 of 12
The paper uses the term 'media trading' but the model is more general. The title and abstract should reflect that the focus is on real-time bidding with censored prices.
What would settle it
Re-run the synthetic experiment of Section 7 with a price process that is bounded almost surely (e.g., a reflected OU or a process with compact state space) so that the compact-support assumption of Lemma 4.1 holds. Compare the performance gap between the observed-price and estimated-price policies. If the gap narrows substantially relative to Figure 10, then the truncation error from the unbounded OU is a major driver of the performance loss, and the estimator's theoretical guarantee is not the limiting factor. If the gap persists, then the plug-in approximation itself (not the estimator) is the dominant source of suboptimality.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up, with conditions
- Skeptic agrees
- Editor wrote the verdict above
- Referee major revision: 4 major objections, 12 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
This paper formulates media trading as a continuous-time stochastic control problem where the agency only sees clearing prices when it wins an auction. That is a real operational constraint, and the paper does a good job of making the trade-offs explicit: campaign performance, margin, budget depletion, and the fact that bids determine what you learn. The main technical contribution is a price estimator from randomized exploratory subcampaigns, with a mean-square error bound of order N−1. The paper then shows two computational routes—HJB/PINN and actor-critic—and compares them on synthetic data, including a PID budget-pacing heuristic as a practical baseline.
What the paper does well: it is transparent about its limitations. The authors state repeatedly that the plug-in policy is not the solution of the partially observed control problem, that the estimator bound assumes a compact interval violated by their own OU model, and that the numerical comparisons are illustrative. That honesty is rare and should be credited. The framework is clearly laid out and could serve as a reference for anyone working on bidding under censored prices.
The soft spots are real but acknowledged. The compact-interval assumption for the MSE bound (Lemma 4.1) is violated by the OU model in the experiments (Remark 4.1). The authors flag this, but it means the central theoretical guarantee does not apply to the setting they simulate. The gap between the plug-in policy and the true optimal control is not quantified beyond Proposition 4.2, which the authors themselves say does not establish near-optimality. The numerical experiments lack error bars and sensitivity analysis, so the comparisons are suggestive rather than conclusive.
Who this is for: researchers working on stochastic control with censored observations, or on the intersection of control and RL for advertising. The paper is a modeling and computational framework, not a breakthrough in theory or a validated empirical method. It deserves a serious referee because the problem is well-motivated, the formulation is clean, and the limitations are honestly stated. A referee can push for tighter numerical evidence and a discussion of how to handle the compact-support gap, but the core of the paper is sound.
I would accept this for peer review. It is not a desk reject.
The strongest objection
The central claim of a consistent price estimator with MSE O(N^{-1}) (Lemma 4.1) relies on the assumption that the latent price St lies almost surely in a known compact interval K (Remark 4.1). The authors acknowledge this assumption is violated by the Ornstein–Uhlenbeck model used in their own experiments (Section 7.1, sentence [b242]). The estimator (4.4) projects onto K, introducing a truncation error that is not bounded by the lemma. More critically, the plug-in policy that replaces St with the estimated price ŜN_t in the HJB feedback does not come with any performance guarantee relative to the true partially observed optimum. Proposition 4.2 bounds the payoff difference for a fixed policy under an anti-concentration condition, but the authors explicitly state (sentence [b145]–[b147]) that this does not establish near-optimality of an optimizer of the proxy problem. The numerical comparison (Figure 10) shows a substantial gap between observed-price and estimated-price policies, but the paper does not decompose this gap into estimation error vs. the fundamental cost of using a plug-in policy in a controlled filtering problem. Without such a decomposition, the practical relevance of the estimator for control remains unclear.
The reader's weakest_assumption correctly identifies the compact-interval assumption as the most fragile point. The paper's own Remark 4.1 and the unbounded OU model in the experiments confirm this tension. My stress-test adds that even if the estimator were perfect, the plug-in policy's performance relative to the true partially observed optimum is unquantified. The concrete test I propose would separate the effect of the estimator's truncation error from the inherent suboptimality of the plug-in approach. The verdict remains CONDITIONAL because the authors could address the compact-support issue by modifying the estimator or by providing a bound for unbounded processes, and they could add a decomposition of the performance gap. The reader and I agree on the main concern; I do not see a reason to change the verdict category.
The referee's report
If the results hold, the paper provides a clear formulation of the information-constrained bidding problem and a tractable price estimator with finite-sample guarantees. The distinction between full-information benchmarks, estimated-price plug-in policies, and the genuinely partially observed problem is useful. However, the central claim of a consistent estimator with MSE O(N^{-1}) relies on an assumption (compact support) that is violated in the experiments, and the gap between plug-in policy and optimal control is not quantified. The paper is honest about limitations but does not resolve them.
Pith's reading of the paper (a machine's summary, not the authors')
This paper addresses the problem faced by a marketing agency bidding in real-time auctions: the market-clearing price is only observed when the agency wins an auction, so the information available for future decisions depends on past bids. The authors formulate this as a continuous-time stochastic control model with a latent price process. To construct a usable price signal, they propose running parallel exploratory subcampaigns with bids drawn from a capped exponential distribution, independent of the price. Under a stylized cross-sectional sampling model, the resulting estimator of the latent price is consistent and has a mean-square error of order 1/N, where N is the number of exploratory observations. The paper then describes two computational approaches for turning this price signal into bidding policies: a model-based method combining forward-equation calibration with a Hamilton-Jacobi-Bellman equation solved via physics-informed neural networks (PINNs), and an entropy-regularized actor-critic reinforcement learning method. Synthetic experiments illustrate the methods and compare them to a budget-pacing heuristic. A key finding is that the plug-in policy that substitutes the estimated price into the full-information optimal policy suffers a noticeable performance gap due to both the cost of exploration and a threshold effect: a bid near the estimated price wins with high probability in the proxy model but only about half the time in reality. The paper clarifies that the estimated-price feedback is a plug-in strategy, not a solution to the genuinely partially observed control problem.
What carries the argument. The central object is the inverse estimator \(\hat{S}^N_t = (h_t|_K)^{-1}(\operatorname{proj}_{[h_t(s_+), h_t(s_-)]} z^N_t)\), where \(z^N_t\) is the empirical winning fraction from N exploratory subcampaigns and \(h_t(s) = \$int_0^{{A_{\max}}$} q_\$\lambda$(a) \Phi((a-s)/v_t) da\) is the conditional winning probability given the latent price s. The key identity is that \(h_t\) is continuous and strictly decreasing (since its derivative is negative), so it can be inverted on a compact interval K containing the latent price. This inversion, combined with the binomial variance bound \(\operatorname{Var}(z^N_t | S_t) \le 1/(4N)\) and the Lipschitz property of the inverse on K, yields the mean-square error bound of order \(1/N\). The machinery does the work of turning censored auction outcomes into a usable price signal with a known error rate.
Core claim. The paper's central claim is that a consistent estimator of the latent market-clearing price can be constructed from censored auction outcomes by running independent exploratory subcampaigns with bids drawn from a capped exponential distribution. The estimator inverts the empirical winning fraction using a known, strictly decreasing function that relates the winning probability to the latent price. The key theoretical result is a finite-sample mean-square error bound of order 1/N, where N is the number of exploratory observations. The paper then shows how this price signal can be used in two computational frameworks for bidding: a model-based HJB/PINN approach and a model-free actor-critic approach. The paper's main contribution is the formulation of the media trading problem with control-dependent information and the proposal of a practical, theoretically grounded method for estimating the hidden price, along with a clear delineation of the limitations of the plug-in approach.
The premise it rests on. The mean-square error bound of the price estimator requires that the latent price lies almost surely in a known compact interval K and that the derivative of the winning probability function is bounded away from zero on that interval; the paper's own experiments use an Ornstein-Uhlenbeck price process that does not satisfy the compactness assumption.
If the paper is right (Pith's inferences, not the authors')
If the price estimator works as claimed, agencies can obtain a real-time price signal from a small fraction of their budget allocated to randomized exploration, without needing to change the main campaign's optimization.
The mean-square error bound of O(1/N) provides a theoretical guarantee that the price estimate improves with more exploration, allowing agencies to trade off exploration cost against estimation accuracy.
The paper's clear demonstration that the plug-in policy (using the estimated price in a full-information optimal policy) performs worse than the full-information benchmark highlights the need for more sophisticated methods that account for the uncertainty in the price estimate, such as robust or Bayesian approaches.
The two computational frameworks (HJB/PINN and actor-critic) provide a starting point for implementing bidding strategies that use the estimated price, with the actor-critic method being model-free and thus potentially more robust to model misspecification.
The comparison with the budget-pacing heuristic shows that a simple rule that ignores price and performance can achieve high performance but low criterion value, underscoring the importance of the full objective function that includes margin and budget penalties.
The paper's framework could be extended to jointly optimize the exploration budget and the main campaign policy, rather than treating exploration as a fixed-cost add-on. This would address a key limitation acknowledged by the authors.
The assumption that the latent price lies almost surely in a known compact interval K is violated by the Ornstein-Uhlenbeck model used in the experiments, as the authors note. A practical implementation would need to handle unbounded price processes, perhaps by using adaptive or robust estimation techniques.
The threshold effect identified in the paper (a bid near the estimated price wins with probability ~1/2 in reality) suggests that a policy that occasionally 'overbids' relative to the estimate might improve performance by increasing the win rate, at the cost of higher expenditure. This could be explored as a simple heuristic.
The actor-critic approach is described as model-free, but it still requires a sufficiently rich observation state. The paper does not establish convergence of the discrete-time actor-critic to a continuous-time optimal policy, so practitioners should be cautious about its theoretical guarantees.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
In real-time bidding, marketing agencies must balance campaign performance, transaction margins and the use of a finite advertising budget. A key difficulty is that market-clearing prices are typically observed only when bids are successful, so the information available for subsequent decisions depends on the bidding policy. We formulate this problem using a continuous-time stochastic control model with a latent price process. To construct a price signal, we consider parallel exploratory subcampaigns in which bids are randomized subject to an upper bound. Under a stylized cross-sectional sampling model, the resulting price estimator is consistent and satisfies a mean-square error bound of order N−1, where N is the number of exploratory observations. We then describe a model-based approach combining forward-equation calibration with Hamilton-Jacobi-Bellman policy iteration and a physics-informed neural network, alongside an entropy-regularized actor-critic approach based on observable information in a model-free setting. Synthetic experiments illustrate the estimator and the computational procedures. The framework clarifies the decision and information trade-offs faced by the agency, while distinguishing full-information benchmarks and estimated-price policies from the genuinely partially observed control problem.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-13
The authors' main claim, as the classifier picked it out 0.97
“The framework clarifies the decision and information trade-offs faced by the agency, while distinguishing full-information benchmarks and estimated-price policies from the genuinely partially observed control problem.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.49 · human participants 0.03 · controlled comparison 0.44 · randomized assignment 0.44 · states quantitative result 0.96 · compares with prior results 0.53 · mentions code or data availability 0.02
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| In real-time bidding, marketing agencies must balance campaign performance, transaction margins and the use of a finite advertising budget. | background 1.00 | 0.04 | 0.02 | asserted 1.00 |
| A key difficulty is that market-clearing prices are typically observed only when bids are successful, so the information available for subsequent decisions depends on the bidding policy. | background 0.84 | 0.07 | 0.03 | asserted 0.91 |
| We formulate this problem using a continuous-time stochastic control model with a latent price process. | method 0.87 | 0.91 | 0.04 | asserted 1.00 |
| To construct a price signal, we consider parallel exploratory subcampaigns in which bids are randomized subject to an upper bound. | method 0.99 | 0.78 | 0.03 | asserted 0.87 |
| Under a stylized cross-sectional sampling model, the resulting price estimator is consistent and satisfies a mean-square error bound of order $N^{-1}$, where $N$ is the number of exploratory observations. | result 0.98 | 0.89 | 0.09 | asserted 1.00 |
| We then describe a model-based approach combining forward-equation calibration with Hamilton-Jacobi-Bellman policy iteration and a physics-informed neural network, alongside an entropy-regularized actor-critic approach based on observable information in a model-free setting. | method 0.98 | 0.88 | 0.08 | asserted 0.95 |
| Synthetic experiments illustrate the estimator and the computational procedures. | result 0.46 | 0.91 | 0.04 | asserted 1.00 |
| The framework clarifies the decision and information trade-offs faced by the agency, while distinguishing full-information benchmarks and estimated-price policies from the genuinely partially observed control problem. | interpretation 0.97 | 0.73 | 0.45 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 0.93 · evidence from simulation or computation 0.85
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 6,244 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (10)
Figures are the authors', reproduced from the paper.
References (21)
- [1] Michael G Crandall, Hitoshi Ishii, and Pierre-Louis Lions. User’s guide to viscosity solutions of second order partial differential equations.Bulletin of the American mathematical society, 27(1):1–67, 1992 on Pith
- [2] Joaquin Fernandez-Tapia, Olivier Guéant, and Jean-Michel Lasry. Optimal real-time bidding strategies.Applied Mathematics Research Express, 2017(1):142–183, 2017 on Pith
- [3] Arthur Flajolet and Patrick Jaillet. Real-time bidding with side information.http://web.mit. edu/jaillet/www/general/bidding-nips-17.pdf, 2017 on Pith
- [4] Wendell H. Fleming and H. Mete Soner.Controlled Markov Processes and Viscosity Solutions, volume 25 ofStochastic Modelling and Applied Probability. Springer, second edition, 2006 on Pith
- [5] Yanwei Jia and Xun Yu Zhou. Policy evaluation and temporal-difference learning in continuous time and space: A martingale approach.Journal of Machine Learning Research, 23(154):1–55, 2022 on Pith
- [6] Yanwei Jia and Xunyu Zhou. q-Learning in Continuous Time.Journal of Machine Learning Research, 24(161):1–61, 2023 on Pith
- [7] Randall Lewis and Justin Rao. The unfavorable economics of measuring the returns to advertising. Quarterly Journal of Economics, 130(4):1941–1973, 2015 on Pith
- [8] John D. C. Little. Aggregate advertising models: the state of the art.Operations Research, 27(4):629–667, 1979 on Pith
- [9] Kaito Majima, Kosuke Kawakami, Kota Ishizuka, and Kazuhide Nakata. Keyword-level bayesian online bid optimization for sponsored search advertising.Operations Research Forum, 5(45), 2024 on Pith
- [10] Médéric Motte and Huyên Pham. Optimal bidding strategies for digital advertising, 2021 on Pith
- [11] Thomas Mulc, Mike Anderson, Paul Cubre, Huikun Zhang, Ivy Liu, and Saket Kumar. Nnn: Next-generation neural networks for marketing measurement, 2025 on Pith
- [12] Huyên Pham.Continuous-time stochastic control and optimization with financial applications, volume 61 ofStochastic Modelling and Applied Probability. Springer-Verlag Berlin Heidelberg, 2009. 26 on Pith
- [13] Maziar Raissi, Paris Perdikaris, and George Karniadakis. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations.Journal of Computational Physics, 378:686–707, 2019 on Pith
- [14] Michele Ricciardi and Mauro Rosestolato. Mean field games incorporating carryover effects: Optimizing advertising models.Decisions in Economics and Finance, 49:475–495, 2026 on Pith
- [15] Haoran Wang, Thaleia Zariphopoulou, and Xun Yu Zhou. Reinforcement learning in continuous time and space: A stochastic control approach.Journal of Machine Learning Research, 21(198):1–34, 2020 on Pith
- [16] Wush Chi-Hsuan Wu, Mi-Yen Yeh, and Ming-Syan Chen. Predicting winning price in real time bidding with censored data. http://www0.cs.ucl.ac.uk/staff/w.zhang/rtb-papers/ win-price-pred.pdf, 2015 on Pith
- [17] Weinan Zhang, Shuai Yuan, and Jun Wang. Optimal real-time bidding for display advertising. In KDD ’14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1077–1086, 2014 on Pith
- [18] Yingxiang Zhang, Mike Wurm, Alexander Wakim, Eddie Li, and Ying Liu. Bayesian hierarchical media mix model incorporating reach and frequency data.research.google, 2023 on Pith
- [19] Jun Zhao et al. Deep reinforcement learning for sponsored search real-time bidding. https: //arxiv.org/abs/1803.00259v1, 2018. Accessed: 1 Mar. 2018 on PithPith's reviewarXiv
- [20] Hubert A. Zielske. The remembering and forgetting of advertising.Journal of marketing, 1959 on Pith
show 1 more
- [21] Hubert A. Zielske and Walter A. Henry. Remembering and forgetting television ads.Journal of Advertising Research, 1980. 27 on Pith
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment