REVIEW 3 cited by
Budget Optimization for Sponsored Search: Censored Learning in MDPs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We consider the budget optimization problem faced by an advertiser participating in repeated sponsored search auctions, seeking to maximize the number of clicks attained under that budget. We cast the budget optimization problem as a Markov Decision Process (MDP) with censored observations, and propose a learning algorithm based on the wellknown Kaplan-Meier or product-limit estimator. We validate the performance of this algorithm by comparing it to several others on a large set of search auction data from Microsoft adCenter, demonstrating fast convergence to optimal performance.
Forward citations
Cited by 3 Pith papers
-
Asymptotic optimality theory of confidence intervals of the mean
This paper derives the exact asymptotic minimum width of mean confidence intervals and shows KL-divergence-based intervals attain it.
-
JD-BP: A Joint-Decision Generative Framework for Auto-Bidding and Pricing
JD-BP jointly generates bids and pricing corrections via generative models, memory-less return-to-go, trajectory augmentation, and energy-based DPO to improve auto-bidding performance despite prediction errors and latency.
-
RTBAgent: A LLM-based Agent System for Real-Time Bidding
RTBAgent wraps an LLM around an expert bidding strategy, letting the model adjust a bid multiplier by up to ±50% using memories and daily reflection, and reports marginal click gains on iPinYou.
Discussion (0). Continue with ORCID to comment.