38 citations · 84 across the 5 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2017
Near-optimal sample complexity for convex tensor completion
Navid Ghadermarzy, Yaniv Plan, Özgür Yılmaz
We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-, order-, tensor where $r=O…
cs.LG2017★ 17 cited
Free energy-based reinforcement learning using a quantum processor
Anna Levit, Daniel Crawford, Navid Ghadermarzy +3
Recent theoretical and experimental results suggest the possibility of using current and near-future quantum hardware in challenging sampling tasks. In this paper, we introduce fre…