![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Leonard Berrada
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]Soham De, Samuel L. Smith, Anushan Fernando, Aleksandar Botev, George-Cristian Muraru, Albert Gu, Ruba Haroun, Leonard Berrada, Yutian Chen, Srivatsan Srinivasan, Guillaume Desjardins, Arnaud Doucet, David Budden, Yee Whye Teh, Razvan Pascanu, Nando de Freitas, Caglar Gulcehre:
Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models. CoRR abs/2402.19427 (2024) - [i12]Aleksandar Botev, Soham De, Samuel L. Smith, Anushan Fernando, George-Cristian Muraru, Ruba Haroun, Leonard Berrada, Razvan Pascanu, Pier Giuseppe Sessa, Robert Dadashi, Léonard Hussenot, Johan Ferret, Sertan Girgin, Olivier Bachem, Alek Andreev, Kathleen Kenealy, Thomas Mesnard, Cassidy Hardin, Surya Bhupatiraju, Shreya Pathak, Laurent Sifre, Morgane Rivière, Mihir Sanjay Kale, Juliette Love, Pouya Tafti, Armand Joulin, Noah Fiedel, Evan Senter, Yutian Chen, Srivatsan Srinivasan, Guillaume Desjardins, David Budden, Arnaud Doucet, Sharad Vikram, Adam Paszke, Trevor Gale, Sebastian Borgeaud, Charlie Chen, Andy Brock, Antonia Paterson, Jenny Brennan, Meg Risdal, Raj Gundluru, Nesh Devanathan, Paul Mooney, Nilay Chauhan, Phil Culliton, Luiz GUStavo Martins, Elisa Bandy, David Huntsperger, Glenn Cameron, Arthur Zucker, Tris Warkentin, Ludovic Peran, Minh Giang, Zoubin Ghahramani, Clément Farabet, Koray Kavukcuoglu, Demis Hassabis, Raia Hadsell, Yee Whye Teh, Nando de Frietas:
RecurrentGemma: Moving Past Transformers for Efficient Open Language Models. CoRR abs/2404.07839 (2024) - 2023
- [i11]Sahra Ghalebikesabi, Leonard Berrada, Sven Gowal, Ira Ktena, Robert Stanforth, Jamie Hayes, Soham De, Samuel L. Smith, Olivia Wiles, Borja Balle:
Differentially Private Diffusion Models Generate Useful Synthetic Images. CoRR abs/2302.13861 (2023) - [i10]Leonard Berrada, Soham De, Judy Hanwen Shen, Jamie Hayes, Robert Stanforth, David Stutz, Pushmeet Kohli, Samuel L. Smith, Borja Balle:
Unlocking Accuracy and Fairness in Differentially Private Image Classification. CoRR abs/2308.10888 (2023) - [i9]Samuel L. Smith, Andrew Brock, Leonard Berrada, Soham De:
ConvNets Match Vision Transformers at Scale. CoRR abs/2310.16764 (2023) - 2022
- [j1]Alasdair Paren, Leonard Berrada, Rudra P. K. Poudel, M. Pawan Kumar:
A Stochastic Bundle Method for Interpolation. J. Mach. Learn. Res. 23: 15:1-15:57 (2022) - [i8]Alasdair Paren, Leonard Berrada, Rudra P. K. Poudel, M. Pawan Kumar:
A Stochastic Bundle Method for Interpolating Networks. CoRR abs/2201.12678 (2022) - [i7]Soham De, Leonard Berrada, Jamie Hayes, Samuel L. Smith, Borja Balle:
Unlocking High-Accuracy Differentially Private Image Classification through Scale. CoRR abs/2204.13650 (2022) - 2021
- [c5]Leonard Berrada, Sumanth Dathathri, Krishnamurthy Dvijotham, Robert Stanforth, Rudy Bunel, Jonathan Uesato, Sven Gowal, M. Pawan Kumar:
Make Sure You're Unsure: A Framework for Verifying Probabilistic Specifications. NeurIPS 2021: 11136-11147 - [i6]Leonard Berrada, Sumanth Dathathri, Krishnamurthy Dvijotham, Robert Stanforth, Rudy Bunel, Jonathan Uesato, Sven Gowal, M. Pawan Kumar:
Verifying Probabilistic Specifications with Functional Lagrangians. CoRR abs/2102.09479 (2021) - [i5]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Comment on Stochastic Polyak Step-Size: Performance of ALI-G. CoRR abs/2105.10011 (2021) - 2020
- [c4]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Training Neural Networks for and by Interpolation. ICML 2020: 799-809
2010 – 2019
- 2019
- [b1]Leonard Berrada:
Leveraging structure for optimization in deep learning. University of Oxford, UK, 2019 - [c3]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Deep Frank-Wolfe For Neural Network Optimization. ICLR (Poster) 2019 - [i4]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Training Neural Networks for and by Interpolation. CoRR abs/1906.05661 (2019) - 2018
- [c2]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Smooth Loss Functions for Deep Top-k Classification. ICLR (Poster) 2018 - [i3]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Smooth Loss Functions for Deep Top-k Classification. CoRR abs/1802.07595 (2018) - [i2]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Deep Frank-Wolfe For Neural Network Optimization. CoRR abs/1811.07591 (2018) - 2017
- [c1]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Trusting SVM for Piecewise Linear CNNs. ICLR (Poster) 2017 - 2016
- [i1]Leonard Berrada, Andrew Zisserman, M. Pawan Kumar:
Trusting SVM for Piecewise Linear CNNs. CoRR abs/1611.02185 (2016)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-11 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint