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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Robert-Jan Bruintjes

dblp:166/3241 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-9798-0214ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1

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
Deep learning architectures and training · 79% Image recognition and object detection · 21%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
convolutional neural network
1.222023
Color Equivariant Convolutional Networks · NeurIPS 2023
FlexConv: Continuous Kernel Convolutions With Differentiable Kernel Sizes · ICLR 2022
Machine learning › Deep learning architectures and training › equivariant neural network
equivariant convolution
0.712023
Color Equivariant Convolutional Networks · NeurIPS 2023
Computer vision › Image recognition and object detection
object recognition
0.712023
Color Equivariant Convolutional Networks · NeurIPS 2023
Machine learning › Deep learning architectures and training › convolutional neural network › convolution design
continuous convolution
0.612022
FlexConv: Continuous Kernel Convolutions With Differentiable Kernel Sizes · ICLR 2022
Information retrieval
evaluation
0.212015
Probabilistic Multileave for Online Retrieval Evaluation · SIGIR 2015
Information retrieval › retrieval evaluation
interleaving
0.212015
Probabilistic Multileave for Online Retrieval Evaluation · SIGIR 2015
Information retrieval › evaluation
online evaluation
0.212015
Probabilistic Multileave for Online Retrieval Evaluation · SIGIR 2015

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

parameter sharing · 0.7group equivariance · 0.7probabilistic interleaving · 0.2
YearPublicationVenuePosition
2023 Color Equivariant Convolutional Networks
abstract
Color is a crucial visual cue readily exploited by Convolutional Neural Networks (CNNs) for object recognition. However, CNNs struggle if there is data imbalance between color variations introduced by accidental recording conditions. Color invariance addresses this issue but does so at the cost of removing all color information, which sacrifices discriminative power. In this paper, we propose Color Equivariant Convolutions (CEConvs), a novel deep learning building block that enables shape feature sharing across the color spectrum while retaining important color information. We extend the notion of equivariance from geometric to photometric transformations by incorporating parameter sharing over hue-shifts in a neural network. We demonstrate the benefits of CEConvs in terms of downstream performance to various tasks and improved robustness to color changes, including train-test distribution shifts. Our approach can be seamlessly integrated into existing architectures, such as ResNets, and offers a promising solution for addressing color-based domain shifts in CNNs.
Attila Lengyel 0001, Ombretta Strafforello, Robert-Jan Bruintjes, Alexander Gielisse, Jan C. van Gemert
NeurIPS3
2022 FlexConv: Continuous Kernel Convolutions With Differentiable Kernel Sizes
David W. Romero, Robert-Jan Bruintjes, Jakub M. Tomczak, Erik J. Bekkers, Mark Hoogendoorn, Jan C. van Gemert
ICLR2
2015 Probabilistic Multileave for Online Retrieval Evaluation
abstract
Online evaluation methods for information retrieval use implicit signals such as clicks from users to infer preferences between rankers. A highly sensitive way of inferring these preferences is through interleaved comparisons. Recently, interleaved comparisons methods that allow for simultaneous evaluation of more than two rankers have been introduced. These so-called multileaving methods are even more sensitive than their interleaving counterparts. Probabilistic interleaving--whose main selling point is the potential for reuse of historical data--has no multileaving counterpart yet. We propose probabilistic multileave and empirically show that it is highly sensitive and unbiased. An important implication of this result is that historical interactions with multileaved comparisons can be reused, allowing for ranker comparisons that need much less user interaction data. Furthermore, we show that our method, as opposed to earlier sensitive multileaving methods, scales well when the number of rankers increases.
Anne Schuth, Robert-Jan Bruintjes, Fritjof Buüttner, Joost van Doorn, Carla Groenland, Harrie Oosterhuis, Cong-Nguyen Tran, Bastiaan S. Veeling, Jos van der Velde, Roger Wechsler, David Woudenberg, Maarten de Rijke
SIGIR2