Maurizio Parton
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Maurizio Parton has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Carlo Metta
ISTI-CNR
8 shared publications - Francesco Morandin
Department of Mathematical, Physiscal and Computer Sciences, University of Parma, Parco Area delle Scienze 53/A, Parma, 43124, PR, Italy
8 shared publications - Paolo Piccinni
Dipartimento di Matematica, Sapienza Università di Roma, Roma, Italy
7 shared publications - Gianluca Amato
University of Chieti-Pescara, Pescara, Italy
6 shared publications - Marco Fantozzi
University of Parma
5 shared publications - Victor Vuletescu
Faculty of Mathematics and Informatics, University of Bucharest, Bucharest, Romania
5 shared publications
Latest Publications
- Open Access
- 24 June 2026
- Published by Elsevier in SSRN Electronic Journal
Sequent Calculus Proof Search with Reinforcement Learning
DeepSAT is a research project investigating deep reinforcement learning for automated theorem proving in propositional logic. In contrast to traditional SAT solvers, which check satisfiability, our aim is to construct formal proofs of validity within the sequent calculus, working in intuitionistic propositional logic. We first train a Tree-LSTM classifier to predict whether a formula is an intuitionistic tautology, and then use it to warm-start a dual-head policy–value network that guides a Monte Carlo Tree Search prover. Closing the reinforcement learning loop, the network is refined by expert iteration on the proof traces generated by the search it guides: the proofs MCTS finds become the training signal for the next round. On a held-out test set, expert iteration improves low-budget proving substantially over the warm-started prover, and a diagnostic analysis attributes the residual ceiling primarily to proof depth rather than to guidance failure. DeepSAT aims at a logic-agnostic, explainable, and energy-efficient alternative to neural approaches based on large language models, which require substantially greater computational resources.
- 24 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSequent Calculus Proof Search with Reinforcement Learning
DeepSAT is a research project investigating deep reinforcement learning for automated theorem proving in propositional logic. In contrast to traditional SAT solvers, which check satisfiability, our aim is to construct formal proofs of validity within the sequent calculus, working in intuitionistic propositional logic. We first train a Tree-LSTM classifier to predict whether a formula is an intuitionistic tautology, and then use it to warm-start a dual-head policy–value network that guides a Monte Carlo Tree Search prover. Closing the reinforcement learning loop, the network is refined by expert iteration on the proof traces generated by the search it guides: the proofs MCTS finds become the training signal for the next round. On a held-out test set, expert iteration improves low-budget proving substantially over the warm-started prover, and a diagnostic analysis attributes the residual ceiling primarily to proof depth rather than to guidance failure. DeepSAT aims at a logic-agnostic, explainable, and energy-efficient alternative to neural approaches based on large language models, which require substantially greater computational resources.
- 1 October 2025
- Published by Springer Nature
- p. 133-141
Improving Performance in Neural Networks by Dendrite-Activated Connection
- 1 October 2025
- Published by Springer Nature
- p. 133-141
Improving Performance in Neural Networks by Dendrite-Activated Connection
- 16 June 2025
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 19 (2) , 437-468
Increasing biases can be more efficient than increasing weights
- 16 June 2025
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 19 (2) , 437-468
Increasing biases can be more efficient than increasing weights
- Open Access
- 15 April 2025
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 191, 110147
Deep reinforcement learning for Type 1 Diabetes: Dual PPO controller for personalized insulin management
- 15 April 2025
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 191, 110147
Open AccessDeep reinforcement learning for Type 1 Diabetes: Dual PPO controller for personalized insulin management
- 28 January 2025
- Published by Springer Nature
- p. 325-338
A Systematization of the Wagner Framework: Graph Theory Conjectures and Reinforcement Learning
- 28 January 2025
- Published by Springer Nature
- p. 325-338
A Systematization of the Wagner Framework: Graph Theory Conjectures and Reinforcement Learning
- 28 January 2025
- Published by Springer Nature
- p. 275-291
SwitchPath: Enhancing Exploration in Neural Networks Learning Dynamics
- 28 January 2025
- Published by Springer Nature
- p. 275-291
SwitchPath: Enhancing Exploration in Neural Networks Learning Dynamics
- 1 January 2025
- Published by Springer Nature
- p. 357-373
Stock Price Time Series Forecasting Using Dynamic Graph Neural Networks and Attention Mechanism in Recurrent Neural Networks
- 1 January 2025
- Published by Springer Nature
- p. 357-373
Stock Price Time Series Forecasting Using Dynamic Graph Neural Networks and Attention Mechanism in Recurrent Neural Networks
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 46 (12) , 11422-11431
Curious Explorer: A Provable Exploration Strategy in Policy Learning
A coverage assumption is critical with policy gradient methods, because while the objective function is insensitive to updates in unlikely states, the agent may need improvements in those states to reach a nearly optimal payoff. However, this assumption can be unfeasible in certain environments, for instance in online learning, or when restarts are possible only from a fixed initial state. In these cases, classical policy gradient algorithms like REINFORCE can have poor convergence properties and sample efficiency. Curious Explorer is an iterative state space pure exploration strategy improving coverage of any restart distribution$\rho$ . Using$\rho$ and intrinsic rewards, Curious Explorer produces a sequence of policies, each one more exploratory than the previous one, and outputs a restart distribution with coverage based on the state visitation distribution of the exploratory policies. This paper main results are a theoretical upper bound on how often an optimal policy visits poorly visited states, and a bound on the error of the return obtained by REINFORCE without any coverage assumption. Finally, we conduct ablation studies with REINFORCE and TRPO in two hard-exploration tasks, to support the claim that Curious Explorer can improve the performance of very different policy gradient algorithms.- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 46 (12) , 11422-11431
Curious Explorer: A Provable Exploration Strategy in Policy Learning
A coverage assumption is critical with policy gradient methods, because while the objective function is insensitive to updates in unlikely states, the agent may need improvements in those states to reach a nearly optimal payoff. However, this assumption can be unfeasible in certain environments, for instance in online learning, or when restarts are possible only from a fixed initial state. In these cases, classical policy gradient algorithms like REINFORCE can have poor convergence properties and sample efficiency. Curious Explorer is an iterative state space pure exploration strategy improving coverage of any restart distribution$\rho$ . Using$\rho$ and intrinsic rewards, Curious Explorer produces a sequence of policies, each one more exploratory than the previous one, and outputs a restart distribution with coverage based on the state visitation distribution of the exploratory policies. This paper main results are a theoretical upper bound on how often an optimal policy visits poorly visited states, and a bound on the error of the return obtained by REINFORCE without any coverage assumption. Finally, we conduct ablation studies with REINFORCE and TRPO in two hard-exploration tasks, to support the claim that Curious Explorer can improve the performance of very different policy gradient algorithms.- Open Access
- 7 May 2024
- Published by Springer Nature in Research Square
Signature-Based Portfolio Allocation: A Network Approach
Portfolio allocation represents a significant challenge within financial markets, traditionally relying on correlation or covariance matrices to delineate relationships among stocks. However, these methodologies assume time stationarity and only capture linear relationships among stocks. In this study, we propose to substitute the conventional Pearson's correlation or covariance matrix in portfolio optimization with a similarity matrix derived from the signature. The signature, a concept from path theory, provides a unique representation of time series data, encoding their geometric patterns and inherent properties. Furthermore, we undertake a comparative analysis of network structures derived from the correlation matrix versus those obtained from the signature-based similarity matrix. Through numerical evaluation on the Standard & Poor's 500, we assess that portfolio allocation utilizing the signature-based similarity matrix yielded superior results in terms of cumulative log-returns and Sharpe ratio compared to the baseline network approach based on Pearson's correlation. This assessment was conducted across various portfolio optimization strategies. This research contributes to portfolio allocation and financial network representation by proposing the use of signature-based similarity matrices over traditional correlation or covariance matrices.
- 7 May 2024
- Published by Springer Nature in Research Square
Open AccessSignature-Based Portfolio Allocation: A Network Approach
Portfolio allocation represents a significant challenge within financial markets, traditionally relying on correlation or covariance matrices to delineate relationships among stocks. However, these methodologies assume time stationarity and only capture linear relationships among stocks. In this study, we propose to substitute the conventional Pearson's correlation or covariance matrix in portfolio optimization with a similarity matrix derived from the signature. The signature, a concept from path theory, provides a unique representation of time series data, encoding their geometric patterns and inherent properties. Furthermore, we undertake a comparative analysis of network structures derived from the correlation matrix versus those obtained from the signature-based similarity matrix. Through numerical evaluation on the Standard & Poor's 500, we assess that portfolio allocation utilizing the signature-based similarity matrix yielded superior results in terms of cumulative log-returns and Sharpe ratio compared to the baseline network approach based on Pearson's correlation. This assessment was conducted across various portfolio optimization strategies. This research contributes to portfolio allocation and financial network representation by proposing the use of signature-based similarity matrices over traditional correlation or covariance matrices.