Login / Signup
Near optimal sample complexity for matrix and tensor normal models via geodesic convexity.
Cole Franks
Rafael Mendes de Oliveira
Akshay Ramachandran
Michael Walter
Published in:
CoRR (2021)
Keyphrases
</>
sample complexity
active learning
model selection
data sets
learning algorithm
special case
upper bound
dimensionality reduction
vc dimension