Demo Data from EDBT 2026 / reviewers in the wild / expert
Amin Parvaneh
dblp:241/5249
· DBLP profile ↗
5ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0003-1674-9051ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 2 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
5 papers |
Vision and language · 18% Learning paradigms · 16% Transfer learning and domain adaptation · 16% |
Topics — the 18 heaviest of 19, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms › continual learning
class-incremental learning |
0.7 | 1 | 2023 | RanPAC: Random Projections and Pre-trained Models for Continual Learning · NeurIPS 2023 |
Machine learning › Learning paradigms
continual learning |
0.7 | 1 | 2023 | RanPAC: Random Projections and Pre-trained Models for Continual Learning · NeurIPS 2023 |
Machine learning › Transfer learning and domain adaptation › pre-training and adaptation
pretrained model reuse |
0.7 | 1 | 2023 | RanPAC: Random Projections and Pre-trained Models for Continual Learning · NeurIPS 2023 |
Machine learning › Transfer learning and domain adaptation › model adaptation
training-free adaptation |
0.7 | 1 | 2023 | RanPAC: Random Projections and Pre-trained Models for Continual Learning · NeurIPS 2023 |
Machine learning › Efficient and distributed learning
active learning |
0.6 | 1 | 2022 | Active Learning by Feature Mixing · CVPR 2022 |
Machine learning › Efficient and distributed learning › active learning
batch active learning |
0.6 | 1 | 2022 | Active Learning by Feature Mixing · CVPR 2022 |
Natural language and speech › Question answering and dialogue systems
dialogue generation |
0.6 | 1 | 2022 | Show, Price and Negotiate: A Negotiator With Online Value Look-Ahead · IEEE Trans. Multim. 2022 |
Machine learning › Deep learning architectures and training › data augmentation
feature mixing |
0.6 | 1 | 2022 | Active Learning by Feature Mixing · CVPR 2022 |
Natural language and speech › Question answering and dialogue systems › task-oriented dialogue
negotiation dialogue |
0.6 | 1 | 2022 | Show, Price and Negotiate: A Negotiator With Online Value Look-Ahead · IEEE Trans. Multim. 2022 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal model |
0.4 | 1 | 2020 | Counterfactual Vision and Language Learning · CVPR 2020 |
Machine learning › Trustworthy machine learning › causal machine learning
counterfactual learning |
0.4 | 1 | 2020 | Counterfactual Vision and Language Learning · CVPR 2020 |
Computer vision › Vision and language
multimodal reasoning |
0.4 | 1 | 2020 | Counterfactual Vision and Language Learning · CVPR 2020 |
Computer vision › Vision and language
vision-and-language navigation |
0.4 | 1 | 2020 | Counterfactual Vision-and-Language Navigation: Unravelling the Unseen · NeurIPS 2020 |
Computer vision › Vision and language
visual question answering |
0.4 | 1 | 2020 | Counterfactual Vision and Language Learning · CVPR 2020 |
Computer vision › Image recognition and object detection
image classification |
0.2 | 1 | 2022 | Active Learning by Feature Mixing · CVPR 2022 |
Machine learning › Learning theory
generalization |
0.1 | 1 | 2020 | Counterfactual Vision and Language Learning · CVPR 2020 |
Machine learning › Reinforcement learning
generalization in reinforcement learning |
0.1 | 1 | 2020 | Counterfactual Vision-and-Language Navigation: Unravelling the Unseen · NeurIPS 2020 |
Machine learning › Trustworthy machine learning
robustness |
0.1 | 1 | 2020 | Counterfactual Vision and Language Learning · CVPR 2020 |
Methods — techniques the papers use, named apart from their topics
random projection · 0.7decorrelation · 0.7class-prototype accumulation · 0.7vision transformer · 0.6supervised learning · 0.6reinforcement learning · 0.6feature interpolation · 0.6deep neural network · 0.6closed-form optimization · 0.6counterfactual reasoning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | RanPAC: Random Projections and Pre-trained Models for Continual LearningabstractContinual learning (CL) aims to incrementally learn different tasks (such as classification) in a non-stationary data stream without forgetting old ones. Most CL works focus on tackling catastrophic forgetting under a learning-from-scratch paradigm. However, with the increasing prominence of foundation models, pre-trained models equipped with informative representations have become available for various downstream requirements. Several CL methods based on pre-trained models have been explored, either utilizing pre-extracted features directly (which makes bridging distribution gaps challenging) or incorporating adaptors (which may be subject to forgetting). In this paper, we propose a concise and effective approach for CL with pre-trained models. Given that forgetting occurs during parameter updating, we contemplate an alternative approach that exploits training-free random projectors and class-prototype accumulation, which thus bypasses the issue. Specifically, we inject a frozen Random Projection layer with nonlinear activation between the pre-trained model's feature representations and output head, which captures interactions between features with expanded dimensionality, providing enhanced linear separability for class-prototype-based CL. We also demonstrate the importance of decorrelating the class-prototypes to reduce the distribution disparity when using pre-trained representations. These techniques prove to be effective and circumvent the problem of forgetting for both class- and domain-incremental continual learning. Compared to previous methods applied to pre-trained ViT-B/16 models, we reduce final error rates by between 20% and 62% on seven class-incremental benchmark datasets, despite not using any rehearsal memory. We conclude that the full potential of pre-trained models for simple, effective, and fast continual learning has not hitherto been fully tapped. Code is available at https://github.com/RanPAC/RanPAC. Mark D. McDonnell, Dong Gong, Amin Parvaneh, Ehsan Abbasnejad, Anton van den Hengel |
NeurIPS | 3 |
| 2022 | Active Learning by Feature MixingabstractThe promise of active learning (AL) is to reduce labelling costs by selecting the most valuable examples to annotate from a pool of unlabelled data. Identifying these examples is especially challenging with high-dimensional data (e.g. images, videos) and in low-data regimes. In this paper, we propose a novel method for batch AL called ALFA-Mix. We identify unlabelled instances with sufficiently-distinct features by seeking inconsistencies in predictions resulting from interventions on their representations. We construct interpolations between representations of labelled and unlabelled instances then examine the predicted labels. We show that inconsistencies in these predictions help discovering features that the model is unable to recognise in the unlabelled instances. We derive an efficient implementation based on a closed-form solution to the optimal interpolation causing changes in predictions. Our method outperforms all recent AL approaches in 30 different settings on 12 benchmarks of images, videos, and non-visual data. The improvements are especially significant in low-data regimes and on self-trained vision transformers, where ALFA-Mix outperforms the state-of-the-art in 59% and 43% of the experiments respectively11The code is available at https://github.com/aminparvaneh/alpha_mix_active_learning. Amin Parvaneh, Ehsan Abbasnejad, Damien Teney, Gholamreza Haffari, Anton van den Hengel, Qinfeng Shi |
CVPR | 1 |
| 2022 | Show, Price and Negotiate: A Negotiator With Online Value Look-AheadabstractNegotiation, as an essential and complicated aspect of online shopping, is still challenging for an intelligent agent. To that end, we propose thePrice Negotiator, a modular deep neural network that addresses the unsolved problems in recent studies by (1) considering images of the items as a crucial, though neglected, source of information in a negotiation, (2) heuristically finding the most similar items from an external online source to predict the potential value and an acceptable agreement price, (3) predicting a general price-based “action” at each turn which is fed into the language generator to output the supporting natural language, and (4) adjusting the prices based on the predicted actions. Empirically, we show that our model, that is trained in both supervised and reinforcement learning setting, significantly improves negotiation on the CraigslistBargain dataset, in terms of the agreement price, price consistency, and dialogue quality. Amin Parvaneh, Ehsan Abbasnejad, Qi Wu 0001, Qinfeng Shi, Anton van den Hengel |
IEEE Trans. Multim. | 1 |
| 2020 | Counterfactual Vision and Language LearningabstractThe ongoing success of visual question answering methods has been somwehat surprising given that, at its most general, the problem requires understanding the entire variety of both visual and language stimuli. It is particularly remarkable that this success has been achieved on the basis of comparatively small datasets, given the scale of the problem. One explanation is that this has been accomplished partly by exploiting bias in the datasets rather than developing deeper multi-modal reasoning. This fundamentally limits the generalization of the method, and thus its practical applicability. We propose a method that addresses this problem by introducing counterfactuals in the training. In doing so we leverage structural causal models for counterfactual evaluation to formulate alternatives, for instance, questions that could be asked of the same image set. We show that simulating plausible alternative training data through this process results in better generalization. Ehsan Abbasnejad, Damien Teney, Amin Parvaneh, Qinfeng Shi, Anton van den Hengel |
CVPR | 3 |
| 2020 | Counterfactual Vision-and-Language Navigation: Unravelling the UnseenabstractThe task of vision-and-language navigation (VLN) requires an agent to follow text instructions to find its way through simulated household environments. A prominent challenge is to train an agent capable of generalising to new environments at test time, rather than one that simply memorises trajectories and visual details observed during training. We propose a new learning strategy that learns both from observations and generated counterfactual environments. We describe an effective algorithm to generate counterfactual observations on the fly for VLN, as linear combinations of existing environments. Simultaneously, we encourage the agent's actions to remain stable between original and counterfactual environments through our novel training objective-effectively removing the spurious features that otherwise bias the agent. Our experiments show that this technique provides significant improvements in generalisation on benchmarks for Room-to-Room navigation and Embodied Question Answering. Amin Parvaneh, Ehsan Abbasnejad, Damien Teney, Qinfeng Shi, Anton van den Hengel |
NeurIPS | 1 |