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

Kyriacos Nikiforou

dblp:189/4403 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-1504-5725ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 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
2 papers
Knowledge representation and reasoning · 54% Representation and self-supervised learning · 29% Trustworthy machine learning · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
invariant representation learning
0.712023
Neural Algorithmic Reasoning with Causal Regularisation · ICML 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge incorporation › knowledge-infused learning › neuro-symbolic learning
neural algorithmic reasoning
0.712023
Neural Algorithmic Reasoning with Causal Regularisation · ICML 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
relational reasoning
0.412020
An Explicitly Relational Neural Network Architecture · ICML 2020
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.212023
Neural Algorithmic Reasoning with Causal Regularisation · ICML 2023
Machine learning › Trustworthy machine learning
robustness
0.212023
Neural Algorithmic Reasoning with Causal Regularisation · ICML 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic-based reasoning
symbolic reasoning
0.112020
An Explicitly Relational Neural Network Architecture · ICML 2020

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

self-supervised learning · 0.7data augmentation · 0.7causal regularization · 0.7end-to-end learning · 0.4curriculum learning · 0.4
YearPublicationVenuePosition
2023 Neural Algorithmic Reasoning with Causal Regularisation
abstract
Recent work on neural algorithmic reasoning has investigated the reasoning capabilities of neural networks, effectively demonstrating they can learn to execute classical algorithms on unseen data coming from the train distribution. However, the performance of existing neural reasoners significantly degrades on out-of-distribution (OOD) test data, where inputs have larger sizes. In this work, we make an important observation: there are many different inputs for which an algorithm will perform certain intermediate computations identically. This insight allows us to develop data augmentation procedures that, given an algorithm’s intermediate trajectory, produce inputs for which the target algorithm would have exactly the same next trajectory step. We ensure invariance in the next-step prediction across such inputs, by employing a self-supervised objective derived by our observation, formalised in a causal graph. We prove that the resulting method, which we call Hint-ReLIC, improves the OOD generalisation capabilities of the reasoner. We evaluate our method on the CLRS algorithmic reasoning benchmark, where we show up to 3x improvements on the OOD test data.
Beatrice Bevilacqua, Kyriacos Nikiforou, Borja Ibarz, Ioana Bica, Michela Paganini, Charles Blundell, Jovana Mitrovic, Petar Velickovic
ICML2
2022 A Predictive Processing Model of Episodic Memory and Time Perception
abstract
Human perception and experience of time are strongly influenced by ongoing stimulation, memory of past experiences, and required task context. When paying attention to time, time experience seems to expand; when distracted, it seems to contract. When considering time based on memory, the experience may be different than what is in the moment, exemplified by sayings like "time flies when you're having fun." Experience of time also depends on the content of perceptual experience-rapidly changing or complex perceptual scenes seem longer in duration than less dynamic ones. The complexity of interactions among attention, memory, and perceptual stimulation is a likely reason that an overarching theory of time perception has been difficult to achieve. Here, we introduce a model of perceptual processing and episodic memory that makes use of hierarchical predictive coding, short-term plasticity, spatiotemporal attention, and episodic memory formation and recall, and apply this model to the problem of human time perception. In an experiment with approximately 13,000 human participants, we investigated the effects of memory, cognitive load, and stimulus content on duration reports of dynamic natural scenes up to about 1 minute long. Using our model to generate duration estimates, we compared human and model performance. Model-based estimates replicated key qualitative biases, including differences by cognitive load (attention), scene type (stimulation), and whether the judgment was made based on current or remembered experience (memory). Our work provides a comprehensive model of human time perception and a foundation for exploring the computational basis of episodic memory within a hierarchical predictive coding framework.
Zafeirios Fountas, Anastasia Sylaidi, Kyriacos Nikiforou, Anil K. Seth, Murray Shanahan, Warrick Roseboom
Neural Comput.3
2020 An Explicitly Relational Neural Network Architecture
abstract
With a view to bridging the gap between deep learning and symbolic AI, we present a novel end-to-end neural network architecture that learns to form propositional representations with an explicitly relational structure from raw pixel data. In order to evaluate and analyse the architecture, we introduce a family of simple visual relational reasoning tasks of varying complexity. We show that the proposed architecture, when pre-trained on a curriculum of such tasks, learns to generate reusable representations that better facilitate subsequent learning on previously unseen tasks when compared to a number of baseline architectures. The workings of a successfully trained model are visualised to shed some light on how the architecture functions.
Murray Shanahan, Kyriacos Nikiforou, Antonia Creswell, Christos Kaplanis, David G. T. Barrett, Marta Garnelo
ICML2
2016 A reservoir computing model of episodic memory
abstract
We present a novel neural episodic memory architecture that utilizes reservoir computing to extract and recall information gleaned over time from a multilayer perceptron that receives sensory input. Reservoir computing models project input data into a high-dimensional dynamical space and also serve as a fading memory that holds on to past inputs thereby enabling the direct association of the current input with the past. The architecture presented utilizes these capabilities via an abstract feedback mechanism and in doing so creates attractor-like states within the reservoir that are associated with each discrete memory and associates these states and therefore memories over time into episodes. In addition, the feedback mechanism provides stabilization to an otherwise chaotic complex dynamical system.
David Bhowmik, Kyriacos Nikiforou, Murray Shanahan, Michail Maniadakis, Panos E. Trahanias
IJCNN2