Online learning algorithms for bidding in repeated second-price auctions achieve rate-optimal regret by modeling ad value as a causal treatment effect and exploiting second-price payment information.
Summer school on machine learning , pages=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
New query-time bound of tilde O(d + epsilon Delta squared + 1/epsilon cubed) for Gaussian kernel mean estimation, improving prior bounds for small epsilon and intermediate diameter via a fast spherical embedding theorem.
NonZero introduces an interaction score and bandit-formalized proposal rule for local agent deviations in multi-agent MCTS, delivering a sublinear local-regret guarantee and improved sample efficiency on game benchmarks without full joint-action enumeration.
citing papers explorer
-
The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
Online learning algorithms for bidding in repeated second-price auctions achieve rate-optimal regret by modeling ad value as a causal treatment effect and exploiting second-price payment information.
-
New Bounds for Kernel Sums via Fast Spherical Embeddings
New query-time bound of tilde O(d + epsilon Delta squared + 1/epsilon cubed) for Gaussian kernel mean estimation, improving prior bounds for small epsilon and intermediate diameter via a fast spherical embedding theorem.
-
NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search
NonZero introduces an interaction score and bandit-formalized proposal rule for local agent deviations in multi-agent MCTS, delivering a sublinear local-regret guarantee and improved sample efficiency on game benchmarks without full joint-action enumeration.