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

Matteo Sacco

dblp:38/8005 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
1 paper
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
actor-critic methods
0.712023
Wasserstein Actor-Critic: Directed Exploration via Optimism for Continuous-Actions Control · AAAI 2023
Machine learning › Reinforcement learning › exploration
directed exploration
0.712023
Wasserstein Actor-Critic: Directed Exploration via Optimism for Continuous-Actions Control · AAAI 2023
Machine learning › Reinforcement learning
exploration
0.712023
Wasserstein Actor-Critic: Directed Exploration via Optimism for Continuous-Actions Control · AAAI 2023
Machine learning › Reinforcement learning › exploration
uncertainty-guided exploration
0.712023
Wasserstein Actor-Critic: Directed Exploration via Optimism for Continuous-Actions Control · AAAI 2023

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

wasserstein barycenter · 0.7distributional reinforcement learning · 0.7approximate q-posterior · 0.7
YearPublicationVenuePosition
2024 Slideflow: deep learning for digital histopathology with real-time whole-slide visualization
abstract
Deep learning methods have emerged as powerful tools for analyzing histopathological images, but current methods are often specialized for specific domains and software environments, and few open-source options exist for deploying models in an interactive interface. Experimenting with different deep learning approaches typically requires switching software libraries and reprocessing data, reducing the feasibility and practicality of experimenting with new architectures. We developed a flexible deep learning library for histopathology called Slideflow, a package which supports a broad array of deep learning methods for digital pathology and includes a fast whole-slide interface for deploying trained models. Slideflow includes unique tools for whole-slide image data processing, efficient stain normalization and augmentation, weakly-supervised whole-slide classification, uncertainty quantification, feature generation, feature space analysis, and explainability. Whole-slide image processing is highly optimized, enabling whole-slide tile extraction at 40x magnification in 2.5 s per slide. The framework-agnostic data processing pipeline enables rapid experimentation with new methods built with either Tensorflow or PyTorch, and the graphical user interface supports real-time visualization of slides, predictions, heatmaps, and feature space characteristics on a variety of hardware devices, including ARM-based devices such as the Raspberry Pi.
James M. Dolezal, Sara Kochanny, Emma C. Dyer, Siddhi Ramesh, Andrew Srisuwananukorn, Matteo Sacco, Frederick M. Howard, Anran Li 0007, Prajval Mohan, Alexander T. Pearson
BMC Bioinform.6
2023 Wasserstein Actor-Critic: Directed Exploration via Optimism for Continuous-Actions Control
abstract
Uncertainty quantification has been extensively used as a means to achieve efficient directed exploration in Reinforcement Learning (RL). However, state-of-the-art methods for continuous actions still suffer from high sample complexity requirements. Indeed, they either completely lack strategies for propagating the epistemic uncertainty throughout the updates, or they mix it with aleatoric uncertainty while learning the full return distribution (e.g., distributional RL). In this paper, we propose Wasserstein Actor-Critic (WAC), an actor-critic architecture inspired by the recent Wasserstein Q-Learning (WQL), that employs approximate Q-posteriors to represent the epistemic uncertainty and Wasserstein barycenters for uncertainty propagation across the state-action space. WAC enforces exploration in a principled way by guiding the policy learning process with the optimization of an upper bound of the Q-value estimates. Furthermore, we study some peculiar issues that arise when using function approximation, coupled with the uncertainty estimation, and propose a regularized loss for the uncertainty estimation. Finally, we evaluate our algorithm on standard MujoCo tasks as well as suite of continuous-actions domains, where exploration is crucial, in comparison with state-of-the-art baselines. Additional details and results can be found in the supplementary material with our Arxiv preprint.
Amarildo Likmeta, Matteo Sacco, Alberto Maria Metelli, Marcello Restelli
AAAI2