4 papers
Slimmable Pruned Neural Networks
Hideaki Kuratsu, Atsuyoshi Nakamura
Slimmable Neural Networks (S-Net) is a novel network which enabled to select one of the predefined proportions of channels (sub-network) dynamically depending on the current comput…
Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes
Yuya Sugie, Yuki Yoshida, Normann Mertig +7
Minor embedding heuristics have become an indispensable tool for compiling problems in quadratically unconstrained binary optimization (QUBO) into the hardware graphs of quantum an…
A Bad Arm Existence Checking Problem
Koji Tabata, Atsuyoshi Nakamura, Junya Honda +1
We study a bad arm existing checking problem in which a player's task is to judge whether a positive arm exists or not among given K arms by drawing as small number of arms as poss…
Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification
Aurelien Pelissier, Atsuyoshi Nakamura, Koji Tabata
Monte Carlo tree search (MCTS) has received considerable interest due to its spectacular success in the difficult problem of computer Go and also proved beneficial in a range of ot…