Pith. sign in

REVIEW 1 cited by

Stochastic Linear Optimization with Adversarial Corruption

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1909.02109 v1 pith:U36V4QUL submitted 2019-09-04 cs.LG stat.ML

Yingkai Li , Edmund Y. Lou , Liren Shan This is my paper · ORCID
classification cs.LGstat.ML
keywords corruptionalgorithmstochasticadversarialamountlinearoptimizationadaptive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We extend the model of stochastic bandits with adversarial corruption (Lykouriset al., 2018) to the stochastic linear optimization problem (Dani et al., 2008). Our algorithm is agnostic to the amount of corruption chosen by the adaptive adversary. The regret of the algorithm only increases linearly in the amount of corruption. Our algorithm involves using L\"owner-John's ellipsoid for exploration and dividing time horizon into epochs with exponentially increasing size to limit the influence of corruption.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cascading Bandits Robust to Adversarial Corruptions

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Cascading bandits can be made robust to adversarial click corruption using multi-instance position-based elimination, with regret logarithmic in time and linear in the corruption budget.

Pith tools