综合
Computational complexity of learning
The study of which concept classes can be learned by efficient algorithms rather than merely with enough data, including cryptographic lower bounds, NP-hardness of proper learning, and computational-statistical gaps.
综合
Dana Angluin
Dana Angluin (Dana Charmian Angluin) is an American computer scientist, Professor Emeritus at Yale, known for the L algorithm for learning regular languages and for population protocols.
综合
Learning with errors problem
The learning with errors (LWE) problem asks one to recover a secret vector from noisy linear equations modulo an integer, and serves as the central hardness assumption for lattice-based cryptography.