Daniel Andrés Díaz-Pachón

Dr. Daniel Andrés Díaz-Pachón

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
1 March 2021 in Journal of Theoretical Biology
Verified
Journal Article
Closed access
DDDaniel Andrés Díaz-Pachón
Daniel Andrés Díaz-Pachón
JRJ. Sunil Rao
J. Sunil Rao

1 June 2020 in Statistics & Probability Letters
Verified
Journal Article
Closed access
DDDaniel Andrés Díaz-Pachón
Daniel Andrés Díaz-Pachón
JSJuan Pablo Sáenz
Juan Pablo Sáenz
JRJ. Sunil Rao
J. Sunil Rao

21 September 2022 in Entropy
Verified
Journal Article
Open access
PDF file
DDDaniel Andrés Díaz-Pachón
Daniel Andrés Díaz-Pachón
OHOla Hössjer
Ola Hössjer
A general framework is introduced to estimate how much external information has been infused into a search algorithm, the so-called active information. This is rephrased as a test of fine-tuning, where tuning corresponds to the amount of pre-specified knowledge that the algorithm makes use of in order to reach a certain target. A function f quantifies specificity for each possible outcome x of a search, so that the target of the algorithm is a set of highly specified states, whereas fine-tuning occurs if it is much more likely for the algorithm to reach the target as intended than by chance. The distribution of a random outcome X of the algorithm involves a parameter θ that quantifies how much background information has been infused. A simple choice of this parameter is to use θf in order to exponentially tilt the distribution of the outcome of the search algorithm under the null distribution of no tuning, so that an exponential family of distributions is obtained. Such algorithms are obtained by iterating a Metropolis–Hastings type of Markov chain, which makes it possible to compute their active information under the equilibrium and non-equilibrium of the Markov chain, with or without stopping when the targeted set of fine-tuned states has been reached. Other choices of tuning parameters θ are discussed as well. Nonparametric and parametric estimators of active information and tests of fine-tuning are developed when repeated and independent outcomes of the algorithm are available. The theory is illustrated with examples from cosmology, student learning, reinforcement learning, a Moran type model of population genetics, and evolutionary programming.

1 September 2023 in Statistics in Medicine
Verified
Journal Article
Open access
LZLili Zhou
Lili Zhou
DDDaniel Andrés Díaz-Pachón
Daniel Andrés Díaz-Pachón
CZChen Zhao
Chen Zhao
JRJ. Sunil Rao
J. Sunil Rao
OHOla Hössjer
Ola Hössjer
Sampling for prevalence estimation of infection is subject to bias by both oversampling of symptomatic individuals and error‐prone tests. This results in naïve estimators of prevalence (ie, proportion of observed infected individuals in the sample) that can be very far from the true proportion of infected. In this work, we present a method of prevalence estimation that reduces both the effect of bias due to testing errors and oversampling of symptomatic individuals, eliminating it altogether in some scenarios. Moreover, this procedure considers stratified errors in which tests have different error rate profiles for symptomatic and asymptomatic individuals. This results in easily implementable algorithms, for which code is provided, that produce better prevalence estimates than other methods (in terms of reducing and/or removing bias), as demonstrated by formal results, simulations, and on COVID‐19 data from the Israeli Ministry of Health.

1 August 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
TLTianhao Liu
Tianhao Liu
DDDaniel Andrés Díaz-Pachón
Daniel Andrés Díaz-Pachón
JRJ. Sunil Rao
J. Sunil Rao
JDJean-Eudes Dazard
Jean-Eudes Dazard
Principal components analysis has been used to reduce the dimensionality of datasets for a long time. In this paper, we will demonstrate that in mode detection the components of smallest variance, the pettiest components, are more important. We prove that for a multivariate normal or Laplace distribution, we obtain boxes of optimal volume by implementing “pettiest component analysis,” in the sense that their volume is minimal over all possible boxes with the same number of dimensions and fixed probability. This reduction in volume produces an information gain that is measured using active information. We illustrate our results with a simulation and a search for modal patterns of digitized images of hand-written numbers using the famous MNIST database; in both cases pettiest components work better than their competitors. In fact, we show that modes obtained with pettiest components generate better written digits for MNIST than principal components.

14 October 2022 in Entropy
Verified
Journal Article
Open access
PDF file
OHOla Hössjer
Ola Hössjer
DDDaniel Andrés Díaz-Pachón
Daniel Andrés Díaz-Pachón
JRJ. Sunil Rao
J. Sunil Rao
Philosophers frequently define knowledge as justified, true belief. We built a mathematical framework that makes it possible to define learning (increasing number of true beliefs) and knowledge of an agent in precise ways, by phrasing belief in terms of epistemic probabilities, defined from Bayes’ rule. The degree of true belief is quantified by means of active information I+: a comparison between the degree of belief of the agent and a completely ignorant person. Learning has occurred when either the agent’s strength of belief in a true proposition has increased in comparison with the ignorant person (I+>0), or the strength of belief in a false proposition has decreased (I+<0). Knowledge additionally requires that learning occurs for the right reason, and in this context we introduce a framework of parallel worlds that correspond to parameters of a statistical model. This makes it possible to interpret learning as a hypothesis test for such a model, whereas knowledge acquisition additionally requires estimation of a true world parameter. Our framework of learning and knowledge acquisition is a hybrid between frequentism and Bayesianism. It can be generalized to a sequential setting, where information and data are updated over time. The theory is illustrated using examples of coin tossing, historical and future events, replication of studies, and causal inference. It can also be used to pinpoint shortcomings of machine learning, where typically learning rather than knowledge acquisition is in focus.