Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster

From MaRDI portal
Publication:6083540
Jump to:navigation, search

DOI10.1145/3519935.3519975arXiv2111.03084OpenAlexW3214183449MaRDI QIDQ6083540

Allan Sly, Shuangping Li, Emmanuel Abbe

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.03084


zbMATH Keywords

neural networkssolution spaceefficient algorithmbinary perceptronperceptron model


Mathematics Subject Classification ID

Theory of computing (68Qxx)





This page was built for publication: Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6083540&oldid=35529128"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 10 July 2024, at 07:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki