pith. sign in

Thus the deterministic noise bound is Rγ s = ( 1, s∈ S dir t , 4/γ, s∈ S suf t

For suffix measurements, admissibility givesFS(q)≥ γon every involved grid point, so 0≤Y(q)≤ 1 γ ,|Y suf s | ≤ 2 γ ,|ξ suf s | ≤ 4 γ · 2003

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

stat.ML 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Do Not Trust The Auctioneer: Learning to Bid in Feedback-Manipulated Auctions

stat.ML · 2026-05-21 · unverdicted · novelty 7.0

In first-price auctions with feedback-only shilling, an algorithm combining robust interval elimination and optimistic debiasing with racing achieves near-optimal regret rates of O(T^{2/3}) or O(sqrt(T)) and matches a lower bound in the single-active-region case.

citing papers explorer

Showing 1 of 1 citing paper.

  • Do Not Trust The Auctioneer: Learning to Bid in Feedback-Manipulated Auctions stat.ML · 2026-05-21 · unverdicted · none · ref 15

    In first-price auctions with feedback-only shilling, an algorithm combining robust interval elimination and optimistic debiasing with racing achieves near-optimal regret rates of O(T^{2/3}) or O(sqrt(T)) and matches a lower bound in the single-active-region case.