Search Results for author: Michelangelo Diligenti

Found 13 papers, 2 papers with code

Multitask Kernel-based Learning with Logic Constraints

no code implementations16 Feb 2024 Michelangelo Diligenti, Marco Gori, Marco Maggini, Leonardo Rigutini

This paper presents a general framework to integrate prior knowledge in the form of logic constraints among a set of task functions into kernel machines.

Multi-Task Learning

Multitask Kernel-based Learning with First-Order Logic Constraints

no code implementations6 Nov 2023 Michelangelo Diligenti, Marco Gori, Marco Maggini, Leonardo Rigutini

In this paper we propose a general framework to integrate supervised and unsupervised examples with background knowledge expressed by a collection of first-order logic clauses into kernel machines.

Multi-Task Learning

Relational Concept Based Models

no code implementations23 Aug 2023 Pietro Barbiero, Francesco Giannini, Gabriele Ciravegna, Michelangelo Diligenti, Giuseppe Marra

The design of interpretable deep learning models working in relational domains poses an open challenge: interpretable deep learning methods, such as Concept-Based Models (CBMs), are not designed to solve relational problems, while relational models are not as interpretable as CBMs.

Image Classification Knowledge Graphs +1

Relational Reasoning Networks

no code implementations1 Jun 2021 Giuseppe Marra, Michelangelo Diligenti, Francesco Giannini

However, they have been struggling at both dealing with the intrinsic uncertainty of the observations and scaling to real-world applications.

Relational Reasoning

Contrastive Losses and Solution Caching for Predict-and-Optimize

2 code implementations10 Nov 2020 Maxime Mulamba, Jayanta Mandi, Michelangelo Diligenti, Michele Lombardi, Victor Bucarey, Tias Guns

Many decision-making processes involve solving a combinatorial optimization problem with uncertain input that can be estimated from historic data.

Combinatorial Optimization Decision Making

Relational Neural Machines

no code implementations6 Feb 2020 Giuseppe Marra, Michelangelo Diligenti, Francesco Giannini, Marco Gori, Marco Maggini

Deep learning has been shown to achieve impressive results in several tasks where a large amount of training data is available.

T-Norms Driven Loss Functions for Machine Learning

no code implementations26 Jul 2019 Giuseppe Marra, Francesco Giannini, Michelangelo Diligenti, Marco Maggini, Marco Gori

Neural-symbolic approaches have recently gained popularity to inject prior knowledge into a learner without requiring it to induce this knowledge from data.

BIG-bench Machine Learning General Knowledge

On the relation between Loss Functions and T-Norms

no code implementations18 Jul 2019 Francesco Giannini, Giuseppe Marra, Michelangelo Diligenti, Marco Maggini, Marco Gori

Deep learning has been shown to achieve impressive results in several domains like computer vision and natural language processing.

Relation

LYRICS: a General Interface Layer to Integrate Logic Inference and Deep Learning

no code implementations18 Mar 2019 Giuseppe Marra, Francesco Giannini, Michelangelo Diligenti, Marco Gori

In spite of the amazing results obtained by deep learning in many applications, a real intelligent behavior of an agent acting in a complex environment is likely to require some kind of higher-level symbolic inference.

Integrating Learning and Reasoning with Deep Logic Models

no code implementations14 Jan 2019 Giuseppe Marra, Francesco Giannini, Michelangelo Diligenti, Marco Gori

Deep learning is very effective at jointly learning feature representations and classification models, especially when dealing with high dimensional input patterns.

Constraint-Based Visual Generation

no code implementations16 Jul 2018 Giuseppe Marra, Francesco Giannini, Michelangelo Diligenti, Marco Gori

We use deep architectures to model the involved variables, and propose a computational scheme where the learning process carries out a satisfaction of the constraints.

Cannot find the paper you are looking for? You can Submit a new open access paper.