I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
When is memorization of irrelevant training data necessary ..:
, In:
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
,
Brown, Gavin
;
Bun, Mark
;
Feldman, Vitaly
.. - p. 123-132 , 2021
Link:
https://dl.acm.org/doi/10.1145/3406325.3451131
RT T1 <cTitle>Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing</cTitle>: T1 <Title>When is memorization of irrelevant training data necessary for high-accuracy learning?</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3451131&Exemplar=1&LAN=DE A1 Brown, Gavin A1 Bun, Mark A1 Feldman, Vitaly A1 Smith, Adam A1 Talwar, Kunal PB ACM YR 2021 K1 Information Complexity K1 Memorization K1 Overparameterization K1 Theory of computation K1 Theory and algorithms for application domains K1 Machine learning theory K1 Models of learning K1 Sample complexity and generalization bounds K1 Computational complexity and cryptography K1 Communication complexity SP 123 OP 132 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3406325.3451131 DO https://dl.acm.org/doi/10.1145/3406325.3451131 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
