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

Joseph Early

dblp:239/4193 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Trustworthy machine learning · 65% Reinforcement learning · 23% Learning paradigms · 12%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.322024
Inherently Interpretable Time Series Classification via Multiple Instance Learning · ICLR 2024
Model Agnostic Interpretability for Multiple Instance Learning · ICLR 2022
Machine learning › Trustworthy machine learning › interpretability
multiple instance learning explanation
1.322024
Inherently Interpretable Time Series Classification via Multiple Instance Learning · ICLR 2024
Model Agnostic Interpretability for Multiple Instance Learning · ICLR 2022
Machine learning › Trustworthy machine learning › interpretability › post-hoc explanation
model-agnostic explanation
0.612022
Model Agnostic Interpretability for Multiple Instance Learning · ICLR 2022
Machine learning › Learning paradigms
multiple instance learning
0.612022
Non-Markovian Reward Modelling from Trajectory Labels via Interpretable Multiple Instance Learning · NeurIPS 2022
Machine learning › Reinforcement learning › reward design
non-markovian reward
0.612022
Non-Markovian Reward Modelling from Trajectory Labels via Interpretable Multiple Instance Learning · NeurIPS 2022
Machine learning › Reinforcement learning › reward learning
reward modeling
0.612022
Non-Markovian Reward Modelling from Trajectory Labels via Interpretable Multiple Instance Learning · NeurIPS 2022

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

multiple instance learning · 1.9deep learning · 0.8trajectory label · 0.6
YearPublicationVenuePosition
2024 Inherently Interpretable Time Series Classification via Multiple Instance Learning
abstract
Conventional Time Series Classification (TSC) methods are often black boxes that obscure inherent interpretation of their decision-making processes. In this work, we leverage Multiple Instance Learning (MIL) to overcome this issue, and propose a new framework called MILLET: Multiple Instance Learning for Locally Explainable Time series classification. We apply MILLET to existing deep learning TSC models and show how they become inherently interpretable without compromising (and in some cases, even improving) predictive performance. We evaluate MILLET on 85 UCR TSC datasets and also present a novel synthetic dataset that is specially designed to facilitate interpretability evaluation. On these datasets, we show MILLET produces sparse explanations quickly that are of higher quality than other well-known interpretability methods. To the best of our knowledge, our work with MILLET is the first to develop general MIL methods for TSC and apply them to an extensive variety of domains.
Joseph Early, Gavin K. C. Cheung, Kurt Cutajar, Hanting Xie, Jas Kandola, Niall Twomey
ICLR1
2022 Revisiting Deep Fisher Vectors: Using Fisher Information to Improve Object Classification
Sarah Ahmed, Tayyaba Azim, Joseph Early, Sarvapali D. Ramchurn
BMVC3
2022 Model Agnostic Interpretability for Multiple Instance Learning
Joseph Early, Christine Evers, Sarvapali D. Ramchurn
ICLR1
2022 Non-Markovian Reward Modelling from Trajectory Labels via Interpretable Multiple Instance Learning
abstract
We generalise the problem of reward modelling (RM) for reinforcement learning (RL) to handle non-Markovian rewards. Existing work assumes that human evaluators observe each step in a trajectory independently when providing feedback on agent behaviour. In this work, we remove this assumption, extending RM to capture temporal dependencies in human assessment of trajectories. We show how RM can be approached as a multiple instance learning (MIL) problem, where trajectories are treated as bags with return labels, and steps within the trajectories are instances with unseen reward labels. We go on to develop new MIL models that are able to capture the time dependencies in labelled trajectories. We demonstrate on a range of RL tasks that our novel MIL models can reconstruct reward functions to a high level of accuracy, and can be used to train high-performing agent policies.
Joseph Early, Tom Bewley, Christine Evers, Sarvapali D. Ramchurn
NeurIPS1