17 citations · 17 across the 1 of their papers we have counts for
3 papers
math.ST2018
Learning tensors from partial binary measurements
Navid Ghadermarzy, Yaniv Plan, Ozgur Yilmaz
In this paper we generalize the 1-bit matrix completion problem to higher order tensors. We prove that when a bounded rank-, order- tensor in $\mathbb{R}^{N} \ti…
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…