On the public citation graph
Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search
0 signed · 32 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11871842_29openalex-snapshot
Bandit Based Monte-Carlo Planning
inferredcites →https://doi.org/10.1007/978-3-319-14923-3_1openalex-snapshot
Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search
inferredcites →https://doi.org/10.1007/978-3-319-27992-3_6openalex-snapshot
Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search
inferredcites →https://doi.org/10.1007/978-3-642-04414-4_7openalex-snapshot
Pure Exploration in Multi-armed Bandits Problems
inferredcites →https://doi.org/10.1007/978-3-642-34106-9_18openalex-snapshot
Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
inferredcites →https://doi.org/10.1007/s10998-010-3055-6openalex-snapshot
UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem
inferredcites →https://doi.org/10.1016/0196-8858(85)90002-8openalex-snapshot
Asymptotically efficient adaptive allocation rules
inferredcites →https://doi.org/10.1016/j.tcs.2016.06.035openalex-snapshot
LinUCB applied to Monte Carlo tree search
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-snapshot
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1109/cig.2012.6374162openalex-snapshot
Comparison of different selection strategies in Monte-Carlo Tree Search for the game of Tron
inferredcites →https://doi.org/10.1109/cig.2015.7317923openalex-snapshot
Regulation of exploration for simple regret minimization in Monte-Carlo tree search
inferredcites →https://doi.org/10.1109/cig32016.2014openalex-snapshot
2014 IEEE Conference on Computational Intelligence and Games
inferredcites →https://doi.org/10.1109/tciaig.2011.2128770openalex-snapshot
2011 IEEE conference on computational intelligence and games
inferredcites →https://doi.org/10.1109/tciaig.2012.2186810openalex-snapshot
A Survey of Monte Carlo Tree Search Methods
inferredcites →https://doi.org/10.1109/tciaig.2014.2317737openalex-snapshot
Sequential Halving Applied to Trees
inferredcites →https://doi.org/10.1145/1273496openalex-snapshot
Proceedings of the 24th international conference on Machine learning
inferredcites →https://doi.org/10.1145/1526709openalex-snapshot
Proceedings of the 18th international conference on World wide web
inferredcites →https://doi.org/10.1145/1772690.1772758openalex-snapshot
A contextual-bandit approach to personalized news article recommendation
inferredcites →https://doi.org/10.1613/jair.4432openalex-snapshot
Simple Regret Optimization in Online Planning for Markov Decision Processes
inferredcites →https://doi.org/10.48550/arxiv.1102.2490openalex-snapshot
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-21077-9_7openalex-snapshot
Some Variations of Upper Confidence Bound for General Game Playing
inferred← citeshttps://doi.org/10.1016/j.ins.2026.123576openalex-snapshot
Iterative hypothesis generation for scientific discovery with Monte Carlo self-refining trees
inferred← citeshttps://doi.org/10.1021/acs.jpcb.3c08110openalex-snapshot
Accelerated Sequence Design of Star Block Copolymers: An Unbiased Exploration Strategy via Fusion of Molecular Dynamics Simulations and Machine Learning
inferred← citeshttps://doi.org/10.1038/s41467-021-27849-6openalex-snapshot
Learning in continuous action space for developing high dimensional potential energy models
inferred← citeshttps://doi.org/10.1038/s41557-022-01055-3openalex-snapshot
Machine learning overcomes human bias in the discovery of self-assembling peptides
inferred← citeshttps://doi.org/10.1109/tg.2024.3487861openalex-snapshot
A Genetic Algorithm for Solving Sudoku Based on Multiarmed Bandit Selection
inferred← citeshttps://doi.org/10.1145/3610294openalex-snapshot
ICP-RL: Identifying Critical Paths for Fault Diagnosis Using Reinforcement Learning
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12110openalex-snapshot
Efficient-UCBV: An Almost Optimal Algorithm Using Variance Estimates
inferred← citeshttps://doi.org/10.24963/ijcai.2017/350openalex-snapshot
Thresholding Bandits with Augmented UCB
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13159openalex-snapshot
Distribution-dependent and Time-uniform Bounds for Piecewise i.i.d Bandits
inferred← citeshttps://doi.org/10.52783/jes.1195openalex-snapshot
Multi-robot Source Navigation Method Based on Coordination Graph Monte Carlo Tree Search
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.