3 papers
cs.GT2025
Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits
Shang Lu, Shuji Kijima
Dueling bandit is a variant of the Multi-armed bandit to learn the binary relation by comparisons. Most work on the dueling bandit has targeted transitive relations, that is, total…
cs.CC2024
A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence
Naoaki Okada, Shuji Kijima
This work is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it possible to get the -th bit of a bit sequence generated by a…
cs.CC2023
The Space Complexity of Generating Tent Codes
Naoaki Okada, Shuji Kijima
This paper is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it possible to get the -th bit of a bit sequence generated by…