On the public citation graph

Finding the Best Arm Privately in Unimodal Bandits

https://doi.org/10.2139/ssrn.4729530
0 signed · 21 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-981-19-7083-2openalex-extracted
Federated Learning
inferredcites →https://doi.org/10.1090/s0002-9939-1953-0055639-3openalex-extracted
Sequential minimax search for a maximum
inferredcites →https://doi.org/10.1111/rssb.12454openalex-extracted
Gaussian Differential Privacy
inferredcites →https://doi.org/10.1137/110850827openalex-extracted
Stochastic Convex Optimization with Bandit Feedback
inferredcites →https://doi.org/10.1137/120861898openalex-extracted
Bisection Search with Noisy Responses
inferredcites →https://doi.org/10.1145/3379480openalex-extracted
Unimodal Bandits with Continuous Arms
inferredcites →https://doi.org/10.1287/mnsc.2021.4129openalex-extracted
Privacy-Preserving Dynamic Personalized Pricing with Demand Learning
inferredcites →https://doi.org/10.1287/opre.1080.0640openalex-extracted
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
inferredcites →https://doi.org/10.1287/opre.2020.2021openalex-extracted
Private Sequential Learning
inferredcites →https://doi.org/10.1287/opre.2022.2347openalex-extracted
Differential Privacy in Personalized Pricing with Nonparametric Demand Models
inferredcites →https://doi.org/10.1561/2200000024openalex-extracted
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
inferredcites →https://doi.org/10.1609/aaai.v30i1.10212openalex-extracted
Algorithms for Differentially Private Multi-Armed Bandits
inferredcites →https://doi.org/10.1609/aaai.v35i11.17156openalex-extracted
Federated Multi-Armed Bandits
inferredcites →https://doi.org/10.48550/arxiv.1405.5096openalex-extracted
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms
inferredcites →https://doi.org/10.48550/arxiv.1602.05629openalex-extracted
Communication-Efficient Learning of Deep Networks from Decentralized Data
inferredcites →https://doi.org/10.48550/arxiv.1810.00068openalex-extracted
Differentially Private Contextual Linear Bandits
inferredcites →https://doi.org/10.48550/arxiv.1909.09836openalex-extracted
Optimal query complexity for private sequential learning against eavesdropping
inferredcites →https://doi.org/10.48550/arxiv.1911.06903openalex-extracted
Query Complexity of Bayesian Private Learning
inferredcites →https://doi.org/10.48550/arxiv.2102.11976openalex-extracted
Learner-Private Convex Optimization
inferredcites →https://doi.org/10.48550/arxiv.2104.01926openalex-extracted
Optimal Query Complexity of Secure Stochastic Convex Optimization
inferredcites →https://doi.org/10.48550/arxiv.2106.02900openalex-extracted
Differentially Private Multi-Armed Bandits in the Shuffle Model
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.