Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Maurits J. R. Bleeker

dblp:292/4316 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
6since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Knowledge representation and reasoning · 23% Efficient and distributed learning · 23% Image recognition and object detection · 23%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › decoding
bidirectional decoding
0.612022
Multi-modal Learning Algorithms and Network Architectures for Information Extraction and Retrieval · ACM Multimedia 2022
Machine learning › Efficient and distributed learning
efficient multimodal learning
0.612022
Multi-modal Learning Algorithms and Network Architectures for Information Extraction and Retrieval · ACM Multimedia 2022
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
multimodal information extraction
0.612022
Multi-modal Learning Algorithms and Network Architectures for Information Extraction and Retrieval · ACM Multimedia 2022
Computer vision › Image recognition and object detection
scene text recognition
0.612022
Multi-modal Learning Algorithms and Network Architectures for Information Extraction and Retrieval · ACM Multimedia 2022
Machine learning › Trustworthy machine learning › AI governance
fairness and accountability
0.212022
Reproducibility as a Mechanism for Teaching Fairness, Accountability, Confidentiality, and Transparency in Artificial Intelligence · AAAI 2022
Information retrieval
machine learning for information retrieval
0.212022
Towards Reproducible Machine Learning Research in Information Retrieval · SIGIR 2022

Methods — techniques the papers use, named apart from their topics

reproducibility · 1.1metric learning · 1.1latent target decoding · 1.1group project · 1.1reproducibility checklist · 0.6multimodal pretraining · 0.6multimodal pre-training · 0.6artifact review and badging · 0.6
YearPublicationVenuePosition
2023 Approximate Nearest Neighbour Phrase Mining for Contextual Speech Recognition
Maurits J. R. Bleeker, Pawel Swietojanski, Xiaodan Zhuang
INTERSPEECH1
2022 Reproducibility as a Mechanism for Teaching Fairness, Accountability, Confidentiality, and Transparency in Artificial Intelligence
abstract
In this work, we explain the setup for a technical, graduate-level course on Fairness, Accountability, Confidentiality, and Transparency in Artificial Intelligence (FACT-AI) at the University of Amsterdam, which teaches FACT-AI concepts through the lens of reproducibility. The focal point of the course is a group project based on reproducing existing FACT-AI algorithms from top AI conferences and writing a corresponding report. In the first iteration of the course, we created an open source repository with the code implementations from the group projects. In the second iteration, we encouraged students to submit their group projects to the Machine Learning Reproducibility Challenge, resulting in 9 reports from our course being accepted for publication in the ReScience journal. We reflect on our experience teaching the course over two years, where one year coincided with a global pandemic, and propose guidelines for teaching FACT-AI through reproducibility in graduate-level AI study programs. We hope this can be a useful resource for instructors who want to set up similar courses in the future.
Ana Lucic, Maurits J. R. Bleeker, Sami Jullien, Samarth Bhargav 0001, Maarten de Rijke
AAAI2
2022 Do Lessons from Metric Learning Generalize to Image-Caption Retrieval?
Maurits J. R. Bleeker, Maarten de Rijke
ECIR (1)1
2022 Extending CLIP for Category-to-Image Retrieval in E-Commerce
Mariya Hendriksen, Maurits J. R. Bleeker, Svitlana Vakulenko, Nanne van Noord, Ernst Kuiper, Maarten de Rijke
ECIR (1)2
2022 Multi-modal Learning Algorithms and Network Architectures for Information Extraction and Retrieval
abstract
Large-scale (pre-)training has recently achieved great success on both uni- and multi-modal downstream evaluation tasks. However, this training paradigm generally comes with a high cost, both in the amount of compute and data needed for training. In my Ph.D. thesis, I study the problem of multi-modal learning for information extraction and retrieval, with the main focus on new learning algorithms and network architectures to make the learning process more efficient. First, I introduce a novel network architecture for bidirectional decoding for the scene text recognition (STR) task. Next, I focus on the image-caption retrieval (ICR) task. I question if the results obtained in the metric learning field generalize to the ICR task. Finally, I focus on the reduction of shortcut learning for the ICR task. I introduce latent target decoding (LTD), a novel constraint-based learning algorithm which reduces shortcut feature learning by decoding the input caption in a semantic latent space.
Maurits J. R. Bleeker
ACM Multimedia1
2022 Towards Reproducible Machine Learning Research in Information Retrieval
abstract
While recent progress in the field of machine learning (ML) and information retrieval (IR) has been significant, the reproducibility of these cutting-edge results is often lacking, with many submissions failing to provide the necessary information in order to ensure subsequent reproducibility. Despite the introduction of self-check mechanisms before submission (such as the Reproducibility Checklist, criteria for evaluating reproducibility during reviewing at several major conferences, artifact review and badging framework, and dedicated reproducibility tracks and challenges at major IR conferences, the motivation for executing reproducible research is lacking in the broader information community. We propose this tutorial as a gentle introduction to help ensure reproducible research in IR, with a specific emphasis on ML aspects of IR research.
Ana Lucic, Maurits J. R. Bleeker, Maarten de Rijke, Koustuv Sinha, Sami Jullien, Robert Stojnic
SIGIR2
2020 Bidirectional Scene Text Recognition with a Single Decoder
abstract
Scene Text Recognition (STR) is the problem of recognizing the correct word or character sequence in a cropped word image. To obtain more robust output sequences, the notion of bidirectional STR has been introduced. So far, bidirectional STRs have been implemented by using two separate decoders; one for left-to-right decoding and one for right-to-left. Having two separate decoders for almost the same task with the same output space is undesirable from a computational and optimization point of view. We introduce the Bidirectional Scene Text Transformer (Bi-STET), a novel bidirectional STR method with a single decoder for bidirectional text decoding. With its single decoder, Bi-STET outperforms methods that apply bidirectional decoding by using two separate decoders while also being more efficient than those methods, Furthermore, we achieve or beat state-of-the-art (SOTA) methods on all STR benchmarks with Bi-STET. Finally, we provide analyzes and insights into the performance of Bi-STET.
Maurits J. R. Bleeker, Maarten de Rijke
ECAI1