Login / Signup
Generalization bounds for graph convolutional neural networks via Rademacher complexity.
Shaogao Lv
Published in:
CoRR (2021)
Keyphrases
</>
data dependent
generalization bounds
rademacher complexity
risk bounds
empirical risk minimization
generalization ability
uniform convergence
learning theory
model selection
linear classifiers
ranking algorithm
learning problems
energy functional
vc dimension
ranking functions
similarity search
training data