A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus.

Parker Newton Silas Richelson

Published in: IACR Cryptol. ePrint Arch. (2022)

Keyphrases

lower bound
learning process
knowledge acquisition
learning tasks
learning problems
reinforcement learning
linear programming
learning algorithm
np hard
supervised learning
learning systems
computational complexity
online learning
inductive inference