6 citations · 6 across the 8 of their papers we have counts for
4 papers · 1 filter
Sensitivity Lower Bounds for Approximaiton Algorithms
Noah Fleming, Yuichi Yoshida
Sensitivity measures how much the output of an algorithm changes, in terms of Hamming distance, when part of the input is modified. While approximation algorithms with low sensitiv…
Stochastic Distance in Property Testing
Uri Meir, Gregory Schwartzman, Yuichi Yoshida
We introduce a novel concept termed "stochastic distance" for property testing. Diverging from the traditional definition of distance, where a distance implies that there exist…
Pointwise Lipschitz Continuous Graph Algorithms
Quanquan C. Liu, Grigoris Velegkas, Yuichi Yoshida +1
In many real-world applications, it is undesirable to drastically change the problem solution after a small perturbation in the input, as unstable outputs can lead to costly transa…
Replicability is Asymptotically Free in Multi-armed Bandits
Junpei Komiyama, Shinji Ito, Yuichi Yoshida +1
We consider a replicable stochastic multi-armed bandit algorithm that ensures, with high probability, that the algorithm's sequence of actions is not affected by the randomness inh…