Demo Data from EDBT 2026 / reviewers in the wild / expert
Andrei Liviu Nicolicioiu
dblp:222/1728
· DBLP profile ↗
6ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
4 papers |
Graph learning · 28% Representation and self-supervised learning · 24% Trustworthy machine learning · 24% |
Topics — the 13 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph neural network |
0.9 | 2 | 2021 | Discovering Dynamic Salient Regions for Spatio-Temporal Graph Neural Networks · NeurIPS 2021 Recurrent Space-time Graph Neural Networks · NeurIPS 2019 |
Machine learning › Graph learning › graph neural network › dynamic graph neural network
spatio-temporal graph neural network |
0.9 | 2 | 2021 | Discovering Dynamic Salient Regions for Spatio-Temporal Graph Neural Networks · NeurIPS 2021 Recurrent Space-time Graph Neural Networks · NeurIPS 2019 |
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning |
0.7 | 1 | 2023 | DCI-ES: An Extended Disentanglement Framework with Connections to Identifiability · ICLR 2023 |
Machine learning › Representation and self-supervised learning › representation learning › disentangled representation learning
disentanglement evaluation |
0.7 | 1 | 2023 | DCI-ES: An Extended Disentanglement Framework with Connections to Identifiability · ICLR 2023 |
Machine learning › Transfer learning and domain adaptation
domain generalization |
0.7 | 1 | 2023 | Spuriosity Didn't Kill the Classifier: Using Invariant Predictions to Harness Spurious Features · NeurIPS 2023 |
Machine learning › Representation and self-supervised learning › causal representation learning
identifiability |
0.7 | 1 | 2023 | DCI-ES: An Extended Disentanglement Framework with Connections to Identifiability · ICLR 2023 |
Machine learning › Trustworthy machine learning › causal machine learning
invariant prediction |
0.7 | 1 | 2023 | Spuriosity Didn't Kill the Classifier: Using Invariant Predictions to Harness Spurious Features · NeurIPS 2023 |
Machine learning › Trustworthy machine learning
robustness |
0.7 | 1 | 2023 | Spuriosity Didn't Kill the Classifier: Using Invariant Predictions to Harness Spurious Features · NeurIPS 2023 |
Machine learning › Trustworthy machine learning › robustness › spurious correlation
spurious feature |
0.7 | 1 | 2023 | Spuriosity Didn't Kill the Classifier: Using Invariant Predictions to Harness Spurious Features · NeurIPS 2023 |
Machine learning › Graph learning › graph construction
dynamic graph construction |
0.5 | 1 | 2021 | Discovering Dynamic Salient Regions for Spatio-Temporal Graph Neural Networks · NeurIPS 2021 |
Computer vision › Video understanding and tracking
video classification |
0.5 | 1 | 2021 | Discovering Dynamic Salient Regions for Spatio-Temporal Graph Neural Networks · NeurIPS 2021 |
Computer vision › Video understanding and tracking
activity recognition |
0.4 | 1 | 2019 | Recurrent Space-time Graph Neural Networks · NeurIPS 2019 |
Computer vision › Video understanding and tracking
spatio-temporal understanding |
0.4 | 1 | 2019 | Recurrent Space-time Graph Neural Networks · NeurIPS 2019 |
Methods — techniques the papers use, named apart from their topics
pseudo-labeling · 0.7invariant prediction · 0.7DCI framework · 0.7object-centric representation learning · 0.5graph neural network · 0.5recurrent neural network · 0.4message passing · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Robust Novelty Detection Through Style-Conscious Feature RankingabstractNovelty detection seeks to identify samples deviating from a known distribution, yet data shifts in a multitude of ways, and only a few consist of relevant changes. Aligned with out-of-distribution generalization literature, we advocate for a formal distinction between task-relevant semantic or content changes and irrelevant style changes. This distinction forms the basis for robust novelty detection, emphasizing the identification of semantic changes resilient to style distributional shifts. To this end, we introduce Stylist, a method that utilizes pretrained large-scale model representations to selectively discard environment-biased features. By computing per-feature scores based on feature distribution distances between environments, Stylist effectively eliminates features responsible for spurious correlations, enhancing novelty detection performance. Evaluations on adapted domain generalization datasets and a synthetic dataset demonstrate Stylist's efficacy in improving novelty detection across diverse datasets with stylistic and content shifts. We make our code available at https://github.com/bit-ml/Stylist. Stefan Smeu, Elena Burceanu, Emanuela Haller, Andrei Liviu Nicolicioiu |
WACV | 4 |
| 2023 | DCI-ES: An Extended Disentanglement Framework with Connections to Identifiability
Cian Eastwood, Andrei Liviu Nicolicioiu, Julius von Kügelgen, Armin Kekic, Frederik Träuble, Andrea Dittadi, Bernhard Schölkopf |
ICLR | 2 |
| 2023 | Spuriosity Didn't Kill the Classifier: Using Invariant Predictions to Harness Spurious FeaturesabstractTo avoid failures on out-of-distribution data, recent works have sought to extract features that have an invariant or stable relationship with the label across domains, discarding "spurious" or unstable features whose relationship with the label changes across domains. However, unstable features often carry complementary information that could boost performance if used correctly in the test domain. In this work, we show how this can be done without test-domain labels. In particular, we prove that pseudo-labels based on stable features provide sufficient guidance for doing so, provided that stable and unstable features are conditionally independent given the label. Based on this theoretical insight, we propose Stable Feature Boosting (SFB), an algorithm for: (i) learning a predictor that separates stable and conditionally-independent unstable features; and (ii) using the stable-feature predictions to adapt the unstable-feature predictions in the test domain. Theoretically, we prove that SFB can learn an asymptotically-optimal predictor without test-domain labels. Empirically, we demonstrate the effectiveness of SFB on real and synthetic data. Cian Eastwood, Shashank Singh 0011, Andrei Liviu Nicolicioiu, Marin Vlastelica Pogancic, Julius von Kügelgen, Bernhard Schölkopf |
NeurIPS | 3 |
| 2021 | Discovering Dynamic Salient Regions for Spatio-Temporal Graph Neural NetworksabstractGraph Neural Networks are perfectly suited to capture latent interactions between various entities in the spatio-temporal domain (e.g. videos). However, when an explicit structure is not available, it is not obvious what atomic elements should be represented as nodes. Current works generally use pre-trained object detectors or fixed, predefined regions to extract graph nodes. Improving upon this, our proposed model learns nodes that dynamically attach to well-delimited salient regions, which are relevant for a higher-level task, without using any object-level supervision. Constructing these localized, adaptive nodes gives our model inductive bias towards object-centric representations and we show that it discovers regions that are well correlated with objects in the video. In extensive ablation studies and experiments on two challenging datasets, we show superior performance to previous graph neural networks models for video classification. Iulia Duta, Andrei Liviu Nicolicioiu, Marius Leordeanu |
NeurIPS | 2 |
| 2019 | Recurrent Space-time Graph Neural NetworksabstractLearning in the space-time domain remains a very challenging problem in machine learning and computer vision. Current computational models for understanding spatio-temporal visual data are heavily rooted in the classical single-image based paradigm. It is not yet well understood how to integrate information in space and time into a single, general model. We propose a neural graph model, recurrent in space and time, suitable for capturing both the local appearance and the complex higher-level interactions of different entities and objects within the changing world scene. Nodes and edges in our graph have dedicated neural networks for processing information. Nodes operate over features extracted from local parts in space and time and over previous memory states. Edges process messages between connected nodes at different locations and spatial scales or between past and present time. Messages are passed iteratively in order to transmit information globally and establish long range interactions. Our model is general and could learn to recognize a variety of high level spatio-temporal concepts and be applied to different learning tasks. We demonstrate, through extensive experiments and ablation studies, that our model outperforms strong baselines and top published methods on recognizing complex activities in video. Moreover, we obtain state-of-the-art performance on the challenging Something-Something human-object interaction dataset. Andrei Liviu Nicolicioiu, Iulia Duta, Marius Leordeanu |
NeurIPS | 1 |
| 2018 | Mining for meaning: from vision to language through multiple networks consensus
Iulia Duta, Andrei Liviu Nicolicioiu, Simion-Vlad Bogolin, Marius Leordeanu |
BMVC | 2 |