Pedro Pessoa

Dr. Pedro Pessoa

University at Albany (SUNY)
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 August 2021 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
PPPedro Pessoa
Pedro Pessoa
CCCarlo Cafaro
Carlo Cafaro

4 January 2018 in Entropy
Verified
Journal Article
Open access
PDF file
PPPedro Pessoa
Pedro Pessoa
Ariel CatichaAriel Caticha
Ariel Caticha
The Renormalization Group (RG) is a set of methods that have been instrumental in tackling problems involving an infinite number of degrees of freedom, such as, for example, in quantum field theory and critical phenomena. What all these methods have in common—which is what explains their success—is that they allow a systematic search for those degrees of freedom that happen to be relevant to the phenomena in question. In the standard approaches the RG transformations are implemented by either coarse graining or through a change of variables. When these transformations are infinitesimal, the formalism can be described as a continuous dynamical flow in a fictitious time parameter. It is generally the case that these exact RG equations are functional diffusion equations. In this paper we show that the exact RG equations can be derived using entropic methods. The RG flow is then described as a form of entropic dynamics of field configurations. Although equivalent to other versions of the RG, in this approach the RG transformations receive a purely inferential interpretation that establishes a clear link to information theory.

21 April 2021 in Entropy
Verified
Journal Article
Open access
PDF file
PPPedro Pessoa
Pedro Pessoa
FCFelipe Xavier Costa
Felipe Xavier Costa
Ariel CatichaAriel Caticha
Ariel Caticha
Entropic dynamics is a framework in which the laws of dynamics are derived as an application of entropic methods of inference. Its successes include the derivation of quantum mechanics and quantum field theory from probabilistic principles. Here, we develop the entropic dynamics of a system, the state of which is described by a probability distribution. Thus, the dynamics unfolds on a statistical manifold that is automatically endowed by a metric structure provided by information geometry. The curvature of the manifold has a significant influence. We focus our dynamics on the statistical manifold of Gibbs distributions (also known as canonical distributions or the exponential family). The model includes an “entropic” notion of time that is tailored to the system under study; the system is its own clock. As one might expect that entropic time is intrinsically directional; there is a natural arrow of time that is led by entropic considerations. As illustrative examples, we discuss dynamics on a space of Gaussians and the discrete three-state system.

4 March 2024 in The Journal of Chemical Physics
Verified
Journal Article
Closed access
PDF file
PPPedro Pessoa
Pedro Pessoa
MSMax Schweiger
Max Schweiger
SPSteve Presse
Steve Presse
Exact methods for the exponentiation of matrices of dimension N can be computationally expensive in terms of execution time (N3) and memory requirements (N2), not to mention numerical precision issues. A matrix often exponentiated in the natural sciences is the rate matrix. Here, we explore five methods to exponentiate rate matrices, some of which apply more broadly to other matrix types. Three of the methods leverage a mathematical analogy between computing matrix elements of a matrix exponential process and computing transition probabilities of a dynamical process (technically a Markov jump process, MJP, typically simulated using Gillespie). In doing so, we identify a novel MJP-based method relying on restricting the number of “trajectory” jumps that incurs improved computational scaling. We then discuss this method’s downstream implications on mixing properties of Monte Carlo posterior samplers. We also benchmark two other methods of matrix exponentiation valid for any matrix (beyond rate matrices and, more generally, positive definite matrices) related to solving differential equations: Runge–Kutta integrators and Krylov subspace methods. Under conditions where both the largest matrix element and the number of non-vanishing elements scale linearly with N—reasonable conditions for rate matrices often exponentiated—computational time scaling with the most competitive methods (Krylov and one of the MJP-based methods) reduces to N2 with total memory requirements of N.

22 July 2025 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
PPPedro Pessoa
Pedro Pessoa
PCPaul Campitelli
Paul Campitelli
DSDouglas P Shepherd
Douglas P Shepherd
SOS. Ozkan
S. Ozkan
SPSteve Presse
Steve Presse
State space models, such as Mamba, have recently garnered attention in time series forecasting (TSF) due to their ability to capture sequence patterns. However, in electricity consumption benchmarks, Mamba forecasts exhibit a mean error of approximately 8%. Similarly, in traffic occupancy benchmarks, the mean error reaches 18%. This discrepancy leaves us to wonder whether the prediction is simply inaccurate or falls within error given spread in historical data. To address this limitation, we propose a method to quantify the predictive uncertainty of Mamba forecasts. To achieve this, we propose a dual-network framework based on the Mamba architecture for probabilistic forecasting, where one network generates point forecasts while the other estimates predictive uncertainty by modeling variance. We abbreviate our tool, Mamba with probabilistic TSF, as Mamba-ProbTSF and the code for its implementation is available on GitHub https://github.com/PessoaP/Mamba-ProbTSF. Evaluating this approach on synthetic and real-world benchmark datasets, we find Kullback–Leibler divergence between the learned distributions and the data–which, in the limit of infinite data, should converge to zero if the model correctly captures the underlying probability distribution–reduced to the order of 10−3 for synthetic data and 10−1 for real-world benchmark. We find that in both the electricity consumption and traffic occupancy benchmark, the true trajectory stays within the predicted uncertainty interval at the two-sigma level about 95% of the time. We further compare Mamba-ProbTSF against leading probabilistic forecast methods, DeepAR and ARIMA, and show that our method consistently achieves lower forecast errors while offering more reliable uncertainty quantification. We end with a consideration of potential limitations, adjustments to improve performance, and considerations for applying this framework to processes for purely or largely stochastic dynamics where the stochastic changes accumulate as observed, for example, in pure Brownian motion or molecular dynamics trajectories.

1 October 2020 in Entropy
Verified
Journal Article
Open access
PDF file
PPPedro Pessoa
Pedro Pessoa
BCBruno Arderucio Costa
Bruno Arderucio Costa
In a recent paper (Entropy 2020, 22(1), 17), Tsallis states that entropy—as in Shannon or Kullback–Leiber’s definitions—is inadequate to interpret black hole entropy and suggests that a new non-additive functional should take the role of entropy. Here we counterargue by explaining the important distinction between the properties of extensivity and additivity; the latter is fundamental for entropy, while the former is a property of particular thermodynamical systems that is not expected for black holes. We also point out other debatable statements in his analysis of black hole entropy.