On the public citation graph

Unimodal Bandits with Continuous Arms

https://doi.org/10.1145/3379480
0 signed · 28 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.1002/0471722138openalex-snapshot
Introduction to Stochastic Search and Optimization
inferredcites →https://doi.org/10.1007/978-3-540-72927-3_33openalex-snapshot
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
inferredcites →https://doi.org/10.1016/0022-0531(74)90066-0openalex-snapshot
A two-armed bandit theory of market pricing
inferredcites →https://doi.org/10.1016/0196-8858(85)90002-8openalex-snapshot
Asymptotically efficient adaptive allocation rules
inferredcites →https://doi.org/10.1016/j.jcss.2007.04.016openalex-snapshot
Online linear optimization and adaptive routing
inferredcites →https://doi.org/10.1016/j.tcs.2004.05.012openalex-snapshot
Online learning in online auctions
inferredcites →https://doi.org/10.1090/s0002-9939-1953-0055639-3openalex-snapshot
Sequential minimax search for a maximum
inferredcites →https://doi.org/10.1093/biomet/25.3-4.285openalex-snapshot
ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES
inferredcites →https://doi.org/10.1109/jsac.2014.2361084openalex-snapshot
Dynamic Rate and Channel Selection in Cognitive Radio Systems
inferredcites →https://doi.org/10.1109/tac.2009.2019797openalex-snapshot
Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
inferredcites →https://doi.org/10.1109/tmc.2018.2854758openalex-snapshot
Optimal Rate Sampling in 802.11 Systems: Theory, Design, and Implementation
inferredcites →https://doi.org/10.1137/110850827openalex-snapshot
Stochastic Convex Optimization with Bandit Feedback
inferredcites →https://doi.org/10.1137/s0363012992237273openalex-snapshot
The Continuum-Armed Bandit Problem
inferredcites →https://doi.org/10.1145/2796314.2745852openalex-snapshot
Learning to Rank
inferredcites →https://doi.org/10.1145/3055399.3055403openalex-snapshot
Kernel-based Methods for Bandit Convex Optimization
inferredcites →https://doi.org/10.1145/3154490openalex-snapshot
Online Learning of Optimally Diverse Rankings
inferredcites →https://doi.org/10.48550/arxiv.1507.08752openalex-snapshot
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
inferredcites →https://doi.org/10.48550/arxiv.1711.00400openalex-snapshot
Minimal Exploration in Structured Stochastic Bandits
inferredcites →https://doi.org/10.5555/1005332.1005355openalex-snapshot
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
inferredcites →https://doi.org/10.5555/1248547.1248586openalex-snapshot
Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4729530openalex-extracted
Finding the Best Arm Privately in Unimodal Bandits
inferred← citeshttps://doi.org/10.1109/tit.2024.3441669openalex-snapshot
Transfer Learning in Bandits With Latent Continuity
inferred← citeshttps://doi.org/10.1109/tnsm.2024.3458390openalex-snapshot
Efficient Queue Control Policies for Latency-Critical Traffic in Mobile Networks
inferred← citeshttps://doi.org/10.1145/3410220.3453919openalex-snapshot
Federated Bandit: A Gossiping Approach
inferred← citeshttps://doi.org/10.1145/3447380openalex-snapshot
Federated Bandit
inferred← citeshttps://doi.org/10.1145/3459637.3482335openalex-snapshot
Dynamic Early Exit Scheduling for Deep Neural Network Inference through Contextual Bandits
inferred← citeshttps://doi.org/10.1287/msom.2023.0246openalex-snapshot
Adaptive Seamless Dose-Finding Trials
inferred← citeshttps://doi.org/10.2139/ssrn.5272309openalex-snapshot
Optimal Robust Pricing with Minimal Information
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.