GUGLIELMO BERETTA

Mr. GUGLIELMO BERETTA

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 December 2024 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
GBGUGLIELMO BERETTA
GUGLIELMO BERETTA
ATAlessandro Torcinovich
Alessandro Torcinovich
MPMarcello Pelillo
Marcello Pelillo

26 February 2025
Verified
Book Chapter
Closed access
PDF file
GBGUGLIELMO BERETTA
GUGLIELMO BERETTA
GCGiacomo Chiarot
Giacomo Chiarot
ACAntonio Emanuele Cinà
Antonio Emanuele Cinà
MPMarcello Pelillo
Marcello Pelillo

5 February 2026 in arXiv
Verified
Preprint
Open access
PDF file
GBGUGLIELMO BERETTA
GUGLIELMO BERETTA
TCTommaso Cesari
Tommaso Cesari
RCRoberto Colomboni
Roberto Colomboni
The Pinsker inequality lower bounds the Kullback--Leibler divergence $D_{\textrm{KL}}$ in terms of total variation and provides a canonical way to convert $D_{\textrm{KL}}$ control into $\lVert \cdot \rVert_1$-control. Motivated by applications to probabilistic prediction with Tsallis losses and online learning, we establish a generalized Pinsker inequality for the Bregman divergences $D_α$ generated by the negative $α$-Tsallis entropies -- also known as $β$-divergences. Specifically, for any $p$, $q$ in the relative interior of the probability simplex $Δ^K$, we prove the sharp bound \[ D_α(p\Vert q) \ge \frac{C_{α,K}}{2}\cdot \|p-q\|_1^2, \] and we determine the optimal constant $C_{α,K}$ explicitly for every choice of $(α,K)$.

26 February 2025
Verified
Book Chapter
Closed access
PDF file
GBGUGLIELMO BERETTA
GUGLIELMO BERETTA
ATAlessandro Torcinovich
Alessandro Torcinovich
MPMarcello Pelillo
Marcello Pelillo

29 March 2025 in Entropy
Verified
Journal Article
Open access
PDF file
GBGUGLIELMO BERETTA
GUGLIELMO BERETTA
MPMarcello Pelillo
Marcello Pelillo
One of the fundamental problems of information theory, since its foundation by C. Shannon, has been the computation of the capacity of a discrete memoryless channel, a quantity expressing the maximum rate at which information can travel through the channel. In this paper, we investigate the properties of a novel approach to computing the capacity, based on a continuous-time dynamical system. Interestingly, the proposed dynamical system can be regarded as a continuous-time version of the classical Blahut–Arimoto algorithm, and we can prove that the former shares with the latter an exponential rate of convergence if certain conditions are met. Moreover, a circuit design is presented to implement the dynamics, hence enabling analog computation to estimate the capacity.

8 June 2025
Verified
Book Chapter
Closed access
PDF file
ABAhmed Begga
Ahmed Begga
GBGUGLIELMO BERETTA
GUGLIELMO BERETTA
SVSebastiano Vascon
Sebastiano Vascon
FEFrancisco Escolano
Francisco Escolano
Miguel Angel LozanoMiguel Angel Lozano
Miguel Angel Lozano
MPMarcello Pelillo
Marcello Pelillo