default search action
Amal Rannen Triki
Person information
- affiliation: DeepMind, London, UK
- affiliation: KU Leuven, Belgium
- affiliation: Yonsei University, Seoul, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Michalis K. Titsias, Alexandre Galashov, Amal Rannen-Triki, Razvan Pascanu, Yee Whye Teh, Jörg Bornschein:
Kalman Filter for Online Classification of Non-Stationary Data. ICLR 2024 - [i13]Amal Rannen-Triki, Jörg Bornschein, Razvan Pascanu, Marcus Hutter, András György, Alexandre Galashov, Yee Whye Teh, Michalis K. Titsias:
Revisiting Dynamic Evaluation: Online Adaptation for Large Language Models. CoRR abs/2403.01518 (2024) - [i12]Jörg Bornschein, Yazhe Li, Amal Rannen-Triki:
Transformers for Supervised Online Continual Learning. CoRR abs/2403.01554 (2024) - [i11]Jessica Schrouff, Alexis Bellot, Amal Rannen-Triki, Alan Malek, Isabela Albuquerque, Arthur Gretton, Alexander D'Amour, Silvia Chiappa:
Mind the Graph When Balancing Data for Fairness or Robustness. CoRR abs/2406.17433 (2024) - 2023
- [j2]Jörg Bornschein, Alexandre Galashov, Ross Hemsley, Amal Rannen-Triki, Yutian Chen, Arslan Chaudhry, Xu Owen He, Arthur Douillard, Massimo Caccia, Qixuan Feng, Jiajun Shen, Sylvestre-Alvise Rebuffi, Kitty Stacpoole, Diego de Las Casas, Will Hawkins, Angeliki Lazaridou, Yee Whye Teh, Andrei A. Rusu, Razvan Pascanu, Marc'Aurelio Ranzato:
Nevis'22: A Stream of 100 Tasks Sampled from 30 Years of Computer Vision Research. J. Mach. Learn. Res. 24: 308:1-308:77 (2023) - [c6]Zifu Wang, Maxim Berman, Amal Rannen-Triki, Philip H. S. Torr, Devis Tuia, Tinne Tuytelaars, Luc Van Gool, Jiaqian Yu, Matthew B. Blaschko:
Revisiting Evaluation Metrics for Semantic Segmentation: Optimization and Evaluation of Fine-grained Intersection over Union. NeurIPS 2023 - [i10]Massimo Caccia, Alexandre Galashov, Arthur Douillard, Amal Rannen-Triki, Dushyant Rao, Michela Paganini, Laurent Charlin, Marc'Aurelio Ranzato, Razvan Pascanu:
Towards Compute-Optimal Transfer Learning. CoRR abs/2304.13164 (2023) - [i9]Michalis K. Titsias, Alexandre Galashov, Amal Rannen-Triki, Razvan Pascanu, Yee Whye Teh, Jörg Bornschein:
Kalman Filter for Online Classification of Non-Stationary Data. CoRR abs/2306.08448 (2023) - [i8]Adam Fisch, Amal Rannen-Triki, Razvan Pascanu, Jörg Bornschein, Angeliki Lazaridou, Elena Gribovskaya, Marc'Aurelio Ranzato:
Towards Robust and Efficient Continual Language Learning. CoRR abs/2307.05741 (2023) - [i7]Zifu Wang, Maxim Berman, Amal Rannen Triki, Philip H. S. Torr, Devis Tuia, Tinne Tuytelaars, Luc Van Gool, Jiaqian Yu, Matthew B. Blaschko:
Revisiting Evaluation Metrics for Semantic Segmentation: Optimization and Evaluation of Fine-grained Intersection over Union. CoRR abs/2310.19252 (2023) - 2022
- [i6]Jörg Bornschein, Alexandre Galashov, Ross Hemsley, Amal Rannen-Triki, Yutian Chen, Arslan Chaudhry, Xu Owen He, Arthur Douillard, Massimo Caccia, Qixuang Feng, Jiajun Shen, Sylvestre-Alvise Rebuffi, Kitty Stacpoole, Diego de Las Casas, Will Hawkins, Angeliki Lazaridou, Yee Whye Teh, Andrei A. Rusu, Razvan Pascanu, Marc'Aurelio Ranzato:
NEVIS'22: A Stream of 100 Tasks Sampled from 30 Years of Computer Vision Research. CoRR abs/2211.11747 (2022) - 2021
- [c5]Ilja Kuzborskij, Csaba Szepesvári, Omar Rivasplata, Amal Rannen-Triki, Razvan Pascanu:
On the Role of Optimization in Double Descent: A Least Squares Study. NeurIPS 2021: 29567-29577 - [i5]Ilja Kuzborskij, Csaba Szepesvári, Omar Rivasplata, Amal Rannen-Triki, Razvan Pascanu:
On the Role of Optimization in Double Descent: A Least Squares Study. CoRR abs/2107.12685 (2021)
2010 – 2019
- 2019
- [c4]Xingchen Ma, Amal Rannen Triki, Maxim Berman, Christos Sagonas, Jacques Calì, Matthew B. Blaschko
:
A Bayesian Optimization Framework for Neural Network Compression. ICCV 2019: 10273-10282 - [c3]Amal Rannen-Triki, Maxim Berman, Vladimir Kolmogorov, Matthew B. Blaschko
Function Norms for Neural Networks. ICCV Workshops 2019: 748-752 - 2018
- [j1]Amal Rannen Triki, Matthew B. Blaschko
Intraoperative margin assessment of human breast tissue in optical coherence tomography images using deep neural networks. Comput. Medical Imaging Graph. 69: 21-32 (2018) - [c2]Maxim Berman, Amal Rannen Triki, Matthew B. Blaschko
The Lovász-Softmax Loss: A Tractable Surrogate for the Optimization of the Intersection-Over-Union Measure in Neural Networks. CVPR 2018: 4413-4421 - [i4]Maxim Berman, Matthew B. Blaschko, Amal Rannen Triki, Jiaqian Yu:
Yes, IoU loss is submodular - as a function of the mispredictions. CoRR abs/1809.01845 (2018) - 2017
- [c1]Amal Rannen Triki, Rahaf Aljundi, Matthew B. Blaschko
Encoder Based Lifelong Learning. ICCV 2017: 1329-1337 - [i3]Amal Rannen Triki, Rahaf Aljundi, Matthew B. Blaschko, Tinne Tuytelaars:
Encoder Based Lifelong Learning. CoRR abs/1704.01920 (2017) - [i2]Amal Rannen Triki, Maxim Berman, Matthew B. Blaschko:
Stochastic Weighted Function Norm Regularization. CoRR abs/1710.06703 (2017) - 2016
- [i1]Amal Rannen Triki, Matthew B. Blaschko:
Stochastic Function Norm Regularization of Deep Networks. CoRR abs/1605.09085 (2016)
Coauthor Index
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-09-14 01:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: