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 D. Viviano

dblp:244/0297 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0001-7016-5212ORCID · reported

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
Trustworthy machine learning · 38% Reinforcement learning · 22% Multi-agent systems · 22%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems
action abstraction
0.912025
Action abstractions for amortized sampling · ICLR 2025
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.912025
Action abstractions for amortized sampling · ICLR 2025
Machine learning › Learning theory
generalization
0.512021
Saliency is a Possible Red Herring When Diagnosing Poor Generalization · ICLR 2021
Machine learning › Trustworthy machine learning
interpretability
0.512021
Saliency is a Possible Red Herring When Diagnosing Poor Generalization · ICLR 2021
Machine learning › Trustworthy machine learning
robustness
0.512021
Saliency is a Possible Red Herring When Diagnosing Poor Generalization · ICLR 2021
Machine learning › Trustworthy machine learning › interpretability › attribution methods
saliency methods
0.512021
Saliency is a Possible Red Herring When Diagnosing Poor Generalization · ICLR 2021
Machine learning › Generative modeling
generative flow networks
0.312025
Action abstractions for amortized sampling · ICLR 2025

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

policy optimization · 0.9amortized sampling · 0.9saliency analysis · 0.5
YearPublicationVenuePosition
2025 Action abstractions for amortized sampling
abstract
As trajectories sampled by policies used by reinforcement learning (RL) and generative flow networks (GFlowNets) grow longer, credit assignment and exploration become more challenging, and the long planning horizon hinders mode discovery and generalization. The challenge is particularly pronounced in entropy-seeking RL methods, such as generative flow networks, where the agent must learn to sample from a structured distribution and discover multiple high-reward states, each of which take many steps to reach. To tackle this challenge, we propose an approach to incorporate the discovery of action abstractions, or high-level actions, into the policy optimization process. Our approach involves iteratively extracting action subsequences commonly used across many high-reward trajectories and `chunking' them into a single action that is added to the action space. In empirical evaluation on synthetic and real-world environments, our approach demonstrates improved sample efficiency performance in discovering diverse high-reward objects, especially on harder exploration problems. We also observe that the abstracted high-order actions are potentially interpretable, capturing the latent structure of the reward landscape of the action space. This work provides a cognitively motivated approach to action abstraction in RL and is the first demonstration of hierarchical planning in amortized sequential sampling.
Oussama Boussif, Léna Néhale Ezzine, Joseph D. Viviano, Michal Koziarski, Moksh Jain, Nikolay Malkin, Emmanuel Bengio, Rim Assouel, Yoshua Bengio
ICLR3
2021 Saliency is a Possible Red Herring When Diagnosing Poor Generalization
Joseph D. Viviano, Becks Simpson, Francis Dutil, Yoshua Bengio, Joseph Paul Cohen
ICLR1
2018 Modeling and prediction of clinical symptom trajectories in Alzheimer's disease using longitudinal data
abstract
Computational models predicting symptomatic progression at the individual level can be highly beneficial for early intervention and treatment planning for Alzheimer's disease (AD). Individual prognosis is complicated by many factors including the definition of the prediction objective itself. In this work, we present a computational framework comprising machine-learning techniques for 1) modeling symptom trajectories and 2) prediction of symptom trajectories using multimodal and longitudinal data. We perform primary analyses on three cohorts from Alzheimer's Disease Neuroimaging Initiative (ADNI), and a replication analysis using subjects from Australian Imaging, Biomarker & Lifestyle Flagship Study of Ageing (AIBL). We model the prototypical symptom trajectory classes using clinical assessment scores from mini-mental state exam (MMSE) and Alzheimer's Disease Assessment Scale (ADAS-13) at nine timepoints spanned over six years based on a hierarchical clustering approach. Subsequently we predict these trajectory classes for a given subject using magnetic resonance (MR) imaging, genetic, and clinical variables from two timepoints (baseline + follow-up). For prediction, we present a longitudinal Siamese neural-network (LSN) with novel architectural modules for combining multimodal data from two timepoints. The trajectory modeling yields two (stable and decline) and three (stable, slow-decline, fast-decline) trajectory classes for MMSE and ADAS-13 assessments, respectively. For the predictive tasks, LSN offers highly accurate performance with 0.900 accuracy and 0.968 AUC for binary MMSE task and 0.760 accuracy for 3-way ADAS-13 task on ADNI datasets, as well as, 0.724 accuracy and 0.883 AUC for binary MMSE task on replication AIBL dataset.
Nikhil Bhagwat, Joseph D. Viviano, Aristotle N. Voineskos, M. Mallar Chakravarty
PLoS Comput. Biol.2