6 citations · 8 across the 2 of their papers we have counts for
3 papers
cs.AI2021★ 2 cited
Simplified Belief-Dependent Reward MCTS Planning with Guaranteed Tree Consistency
Ori Sztyglic, Andrey Zhitnikov, Vadim Indelman
Partially Observable Markov Decision Processes (POMDPs) are notoriously hard to solve. Most advanced state-of-the-art online solvers leverage ideas of Monte Carlo Tree Search (MCTS…
cs.AI2021
Probabilistic Loss and its Online Characterization for Simplified Decision Making Under Uncertainty
Andrey Zhitnikov, Vadim Indelman
It is a long-standing objective to ease the computation burden incurred by the decision making process. Identification of this mechanism's sensitivity to simplification has tremend…
cs.LG2020★ 6 cited
Topology of deep neural networks
Gregory Naitzat, Andrey Zhitnikov, Lek-Heng Lim
We study how the topology of a data set , representing two classes and in a binary classification problem, changes as it passes thr…