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

Christoffer Riis

dblp:263/7663 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0002-4540-6691ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 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
1 paper
Probabilistic and Bayesian machine learning · 50% Optimization for machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
acquisition function
0.612022
Bayesian Active Learning with Fully Bayesian Gaussian Processes · NeurIPS 2022
Machine learning › Probabilistic and Bayesian machine learning › experimental design › bayesian experimental design
bayesian active learning
0.612022
Bayesian Active Learning with Fully Bayesian Gaussian Processes · NeurIPS 2022
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
0.612022
Bayesian Active Learning with Fully Bayesian Gaussian Processes · NeurIPS 2022
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.612022
Bayesian Active Learning with Fully Bayesian Gaussian Processes · NeurIPS 2022

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

query-by-committee · 0.6fully bayesian gaussian processes · 0.6
YearPublicationVenuePosition
2025 Bayesian Active Learning for Censored Regression
Frederik Boe Hüttel, Christoffer Riis, Filipe Rodrigues 0001, Francisco C. Pereira
ECML/PKDD (2)2
2022 Bayesian Active Learning with Fully Bayesian Gaussian Processes
abstract
The bias-variance trade-off is a well-known problem in machine learning that only gets more pronounced the less available data there is. In active learning, where labeled data is scarce or difficult to obtain, neglecting this trade-off can cause inefficient and non-optimal querying, leading to unnecessary data labeling. In this paper, we focus on active learning with Gaussian Processes (GPs). For the GP, the bias-variance trade-off is made by optimization of the two hyperparameters: the length scale and noise-term. Considering that the optimal mode of the joint posterior of the hyperparameters is equivalent to the optimal bias-variance trade-off, we approximate this joint posterior and utilize it to design two new acquisition functions. The first one is a Bayesian variant of Query-by-Committee (B-QBC), and the second is an extension that explicitly minimizes the predictive variance through a Query by Mixture of Gaussian Processes (QB-MGP) formulation. Across six simulators, we empirically show that B-QBC, on average, achieves the best marginal likelihood, whereas QB-MGP achieves the best predictive performance. We show that incorporating the bias-variance trade-off in the acquisition functions mitigates unnecessary and expensive data labeling.
Christoffer Riis, Francisco Antunes, Frederik Boe Hüttel, Carlos Lima Azevedo, Francisco C. Pereira
NeurIPS1
2021 On the Limits to Multi-modal Popularity Prediction on Instagram: A New Robust, Efficient and Explainable Baseline
abstract
Our global population contributes visual content on platforms like Instagram, attempting to express themselves and engage their audiences, at an unprecedented and increasing rate. In this paper, we revisit the popularity prediction on Instagram. We present a robust, efficient, and explainable baseline for population-based popularity prediction, achieving strong ranking performance. We employ the latest methods in computer vision to maximize the information extracted from the visual modality. We use transfer learning to extract visual semantics such as concepts, scenes, and objects, allowing a new level of scrutiny in an extensive, explainable ablation study. We inform feature selection towards a robust and scalable model, but also illustrate feature interactions, offering new directions for further inquiry in computational social science. Our strongest models inform a lower limit to population-based predictability of popularity on Instagram. The models are immediately applicable to social media monitoring and influencer identification.
Christoffer Riis, Damian Konrad Kowalczyk, Lars Kai Hansen
ICAART (2)1