SearcharxivSearch

arXiv subjects

Daniel W. Franks

Publications and source records attributed to Daniel W. Franks.

3 recordsLinked to original sources

Rethinking the Scientific Method: An Introduction to Bayesian Epistemology

Scientists routinely disagree not about data but about how to interpret evidence, because they implicitly operate from different epistemological frameworks without recognising it. The two dominant traditions, confirmationism and falsificationism, each capture genuine insights about scientific reasoning but face well-documented limitations. Confirmationism provides a natural account of how evidence supports hypotheses but cannot escape the problem of induction. Falsificationism provides logical rigour through deductive refutation but is undermined by the Duhem-Quine problem and offers no account of how scientists rationally accept theories and act on them. Here we argue that Bayesian epistemology provides a practical resolution to this impasse. By treating evidence probabilistically and operating over a finite, revisable set of hypotheses, the framework recovers the valid contributions of both traditions while addressing their core weaknesses. We show that confirmation and falsification emerge as special cases of Bayesian updating, that the subjectivity objection to priors is weaker than commonly supposed, and that the framework has direct practical consequences for study design, evidence synthesis, and publishing norms. Specifically, it replaces the falsifiability criterion with the more useful question of whether a hypothesis makes predictions that discriminate between competitors, and reframes the reproducibility crisis as an epistemological rather than a purely statistical problem. Adopting Bayesian epistemology, even informally as a mental model, can reduce friction between researchers, improve research efficiency, and help restore the cumulative character of scientific progress.

stat.ME

PhytNet -- Tailored Convolutional Neural Networks for Custom Botanical Data

Automated disease, weed and crop classification with computer vision will be invaluable in the future of agriculture. However, existing model architectures like ResNet, EfficientNet and ConvNeXt often underperform on smaller, specialised datasets typical of such projects. We address this gap with informed data collection and the development of a new CNN architecture, PhytNet. Utilising a novel dataset of infrared cocoa tree images, we demonstrate PhytNet's development and compare its performance with existing architectures. Data collection was informed by analysis of spectroscopy data, which provided useful insights into the spectral characteristics of cocoa trees. Such information could inform future data collection and model development. Cocoa was chosen as a focal species due to the diverse pathology of its diseases, which pose significant challenges for detection. ResNet18 showed some signs of overfitting, while EfficientNet variants showed distinct signs of overfitting. By contrast, PhytNet displayed excellent attention to relevant features, no overfitting, and an exceptionally low computation cost (1.19 GFLOPS). As such PhytNet is a promising candidate for rapid disease or plant classification, or precise localisation of disease symptoms for autonomous systems.

cs.CV

Quality Evolvability ES: Evolving Individuals With a Distribution of Well Performing and Diverse Offspring

One of the most important lessons from the success of deep learning is that learned representations tend to perform much better at any task compared to representations we design by hand. Yet evolution of evolvability algorithms, which aim to automatically learn good genetic representations, have received relatively little attention, perhaps because of the large amount of computational power they require. The recent method Evolvability ES allows direct selection for evolvability with little computation. However, it can only be used to solve problems where evolvability and task performance are aligned. We propose Quality Evolvability ES, a method that simultaneously optimizes for task performance and evolvability and without this restriction. Our proposed approach Quality Evolvability has similar motivation to Quality Diversity algorithms, but with some important differences. While Quality Diversity aims to find an archive of diverse and well-performing, but potentially genetically distant individuals, Quality Evolvability aims to find a single individual with a diverse and well-performing distribution of offspring. By doing so Quality Evolvability is forced to discover more evolvable representations. We demonstrate on robotic locomotion control tasks that Quality Evolvability ES, similarly to Quality Diversity methods, can learn faster than objective-based methods and can handle deceptive problems.

cs.NE