arXiv subjects

Frank Miller

Publications and source records attributed to Frank Miller.

12 recordsLinked to original sources

arXiv2026

Algorithms for optimizing model-based incomplete block designs

Because of time limitations or participation burden, the treatments in an experimental design can be too large for a single subject. Instead of addressing this using combinatorial incomplete block designs, we propose a model-based approach that optimizes model parameters. This offers distinct advantages: it incorporates subject-specific covariates to tailor treatment allocation to individual characteristics, allows for varying block sizes, and eliminates the equal-treatment replication requirement. Despite these benefits, model-based approaches are limited by a lack of software and prohibitively large search spaces, making exact optimization computationally intractable. Therefore, we present local search heuristic algorithms and compare them to existing methods. We evaluate first- and best-improvement algorithms, simulated annealing (SA), threshold accepting (TA), and two novel algorithms utilizing directional derivatives (dd) to guide exchanges. Serving as discrete versions of continuous gradient-based methods, these dd algorithms take smaller steps and avoid flat regions by prioritizing large-difference dd exchanges. Our broadly applicable approach uses item calibration in achievement tests as a comparative example to evaluate objective values and computational times. Results demonstrate that for larger problems, the dd algorithms achieve near-optimal solutions significantly faster than SA and TA. Due to computational efficiency, our algorithms offer a highly appealing approach for practical applications.

stat.OT↗

arXiv2026

Align then Refine: Text-Guided 3D Prostate Lesion Segmentation

Automated 3D segmentation of prostate lesions from biparametric MRI (bp-MRI) is essential for reliable algorithmic analysis, but achieving high precision remains challenging. Volumetric methods must combine multiple modalities while ensuring anatomical consistency, but current models struggle to integrate cross-modal information reliably. While vision-language models (VLMs) are replacing the currently used architectural designs, they still lack the fine-grained, lesion-level semantics required for effective localized guidance. To address these limitations, we propose a new multi-encoder U-Net architecture incorporating three key innovations: (1) an alignment loss that enhances foreground text-image similarity to inject lesion semantics; (2) a heatmap loss that calibrates the similarity map and suppresses spurious background activations; and (3) a final-stage, confidence-gated multi-head cross-attention refiner that performs localized boundary edits in high-confidence regions. A phase-scheduled training regime stabilizes the optimization of these components. Our method consistently outperforms prior approaches, establishing a new state-of-the-art on the PI-CAI dataset through enhanced multi-modal fusion and localized text guidance. Our code is available at https://github.com/NUBagciLab/Prostate-Lesion-Segmentation.

cs.CV↗

arXiv2026

Optimized questionnaire item selection for tracking the progression of motor symptoms in Parkinson's disease

Long questionnaires increase the response burden for patients and healthcare workers. In the treatment of Parkinson's disease, the MDS-UPDRS questionnaire to track disease progression may be underutilized due to time requirements. While reduced item sets have been studied using Fisher information from Item Response Theory (IRT) models, optimal selection methods remain unclear. We compared three methods for selecting an optimal subset of items, with the aim of minimizing the uncertainty in the estimates of the disease severity: Ranking by the Fisher information, coordinate descent local search to directly minimize estimate uncertainty, and adaptive selection. Whereas item ranking based on the expected Fisher information outperformed random choice of items, we saw further gains with the coordinate descent algorithm that directly minimizes the uncertainty of the disease severity estimate. An adaptive algorithm gave an additional slight gain compared to the coordinate descent method. However, the performance of the adaptive method is a best-case limit as we assume that we find the optimal set for the true latent trait scores. For a 5-item subset, the ranked Fisher information method reduced the expected standard deviation by 14 percent compared to random item selection. The corresponding reductions for coordinate descent and adaptive selection were 26 percent and 34 percent respectively. More sophisticated selection methods substantially improved estimate accuracy for small item sets, with diminishing returns for larger subsets. Because item parameters are retained from the full test, reduced item sets measure the same latent construct as the original test. The choice of method entails a trade-off between methodological complexity and precision.

stat.ME↗

arXiv2025

Pancreas Part Segmentation under Federated Learning Paradigm

We present the first federated learning (FL) approach for pancreas part(head, body and tail) segmentation in MRI, addressing a critical clinical challenge as a significant innovation. Pancreatic diseases exhibit marked regional heterogeneity cancers predominantly occur in the head region while chronic pancreatitis causes tissue loss in the tail, making accurate segmentation of the organ into head, body, and tail regions essential for precise diagnosis and treatment planning. This segmentation task remains exceptionally challenging in MRI due to variable morphology, poor soft-tissue contrast, and anatomical variations across patients. Our novel contribution tackles two fundamental challenges: first, the technical complexity of pancreas part delineation in MRI, and second the data scarcity problem that has hindered prior approaches. We introduce a privacy-preserving FL framework that enables collaborative model training across seven medical institutions without direct data sharing, leveraging a diverse dataset of 711 T1W and 726 T2W MRI scans. Our key innovations include: (1) a systematic evaluation of three state-of-the-art segmentation architectures (U-Net, Attention U-Net,Swin UNETR) paired with two FL algorithms (FedAvg, FedProx), revealing Attention U-Net with FedAvg as optimal for pancreatic heterogeneity, which was never been done before; (2) a novel anatomically-informed loss function prioritizing region-specific texture contrasts in MRI. Comprehensive evaluation demonstrates that our approach achieves clinically viable performance despite training on distributed, heterogeneous datasets.

cs.CV↗

arXiv2025

VHU-Net: Variational Hadamard U-Net for Body MRI Bias Field Correction

Bias field artifacts in magnetic resonance imaging (MRI) scans introduce spatially smooth intensity inhomogeneities that degrade image quality and hinder downstream analysis. To address this challenge, we propose a novel variational Hadamard U-Net (VHU-Net) for effective body MRI bias field correction. The encoder comprises multiple convolutional Hadamard transform blocks (ConvHTBlocks), each integrating convolutional layers with a Hadamard transform (HT) layer. Specifically, the HT layer performs channel-wise frequency decomposition to isolate low-frequency components, while a subsequent scaling layer and semi-soft thresholding mechanism suppress redundant high-frequency noise. To compensate for the HT layer's inability to model inter-channel dependencies, the decoder incorporates an inverse HT-reconstructed transformer block, enabling global, frequency-aware attention for the recovery of spatially consistent bias fields. The stacked decoder ConvHTBlocks further enhance the capacity to reconstruct the underlying ground-truth bias field. Building on the principles of variational inference, we formulate a new evidence lower bound (ELBO) as the training objective, promoting sparsity in the latent space while ensuring accurate bias field estimation. Comprehensive experiments on body MRI datasets demonstrate the superiority of VHU-Net over existing state-of-the-art methods in terms of intensity uniformity. Moreover, the corrected images yield substantial downstream improvements in segmentation accuracy. Our framework offers computational efficiency, interpretability, and robust performance across multi-center datasets, making it suitable for clinical deployment.

eess.IV↗

arXiv2025

Project portfolio planning in the pharmaceutical industry -- strategic objectives and quantitative optimization

Many pharmaceutical companies face concerns with the maintenance of desired revenue levels. Sales forecasts for the current portfolio of products and projects may indicate a decline in revenue as the marketed products approach patent expiry. To counteract the potential downturn in revenue, and to establish revenue growth, an in-flow of new projects into the development phases is required. In this article, we devise an approach with which the in-flow of new projects could be optimized, while adhering to the objectives and constraints set on revenue targets, budget limitations and strategic considerations on the composition of the company's portfolio.

stat.AP↗

arXiv2024

Estimating abilities with an Elo-informed growth model

An intelligent tutoring system (ITS) aims to provide instructions and exercises tailored to the ability of a student. To do this, the ITS needs to estimate the ability based on student input. Rather than including frequent full-scale tests to update our ability estimate, we want to base estimates on the outcomes of practice exercises that are part of the learning process. A challenge with this approach is that the ability changes as the student learns, which makes traditional item response theory (IRT) models inappropriate. Most IRT models estimate an ability based on a test result, and assume that the ability is constant throughout a test. We review some existing methods for measuring abilities that change throughout the measurement period, and propose a new method which we call the Elo-informed growth model. This method assumes that the abilities for a group of respondents who are all in the same stage of the learning process follow a distribution that can be estimated. The method does not assume a particular shape of the growth curve. It performs better than the standard Elo algorithm when the measured outcomes are far apart in time, or when the ability change is rapid.

stat.ME↗

arXiv2024

IPMN Risk Assessment under Federated Learning Paradigm

Accurate classification of Intraductal Papillary Mucinous Neoplasms (IPMN) is essential for identifying high-risk cases that require timely intervention. In this study, we develop a federated learning framework for multi-center IPMN classification utilizing a comprehensive pancreas MRI dataset. This dataset includes 652 T1-weighted and 655 T2-weighted MRI images, accompanied by corresponding IPMN risk scores from 7 leading medical institutions, making it the largest and most diverse dataset for IPMN classification to date. We assess the performance of DenseNet-121 in both centralized and federated settings for training on distributed data. Our results demonstrate that the federated learning approach achieves high classification accuracy comparable to centralized learning while ensuring data privacy across institutions. This work marks a significant advancement in collaborative IPMN classification, facilitating secure and high-accuracy model training across multiple centers.

eess.IV↗

arXiv2024

Optimal item calibration in the context of the Swedish Scholastic Aptitude Test

Large scale achievement tests require the existence of item banks with items for use in future tests. Before an item is included into the bank, its characteristics need to be estimated. The process of estimating the item characteristics is called item calibration. For the quality of the future achievement tests, it is important to perform this calibration well and it is desirable to estimate the item characteristics as efficiently as possible. Methods of optimal design have been developed to allocate calibration items to examinees with the most suited ability. Theoretical evidence shows advantages with using ability-dependent allocation of calibration items. However, it is not clear whether these theoretical results hold also in a real testing situation. In this paper, we investigate the performance of an optimal ability-dependent allocation in the context of the Swedish Scholastic Aptitude Test (SweSAT) and quantify the gain from using the optimal allocation. On average over all items, we see an improved precision of calibration. While this average improvement is moderate, we are able to identify for what kind of items the method works well. This enables targeting specific item types for optimal calibration. We also discuss possibilities for improvements of the method.

stat.ME↗

arXiv2023

Radiomics Boosts Deep Learning Model for IPMN Classification

Intraductal Papillary Mucinous Neoplasm (IPMN) cysts are pre-malignant pancreas lesions, and they can progress into pancreatic cancer. Therefore, detecting and stratifying their risk level is of ultimate importance for effective treatment planning and disease control. However, this is a highly challenging task because of the diverse and irregular shape, texture, and size of the IPMN cysts as well as the pancreas. In this study, we propose a novel computer-aided diagnosis pipeline for IPMN risk classification from multi-contrast MRI scans. Our proposed analysis framework includes an efficient volumetric self-adapting segmentation strategy for pancreas delineation, followed by a newly designed deep learning-based classification scheme with a radiomics-based predictive approach. We test our proposed decision-fusion model in multi-center data sets of 246 multi-contrast MRI scans and obtain superior performance to the state of the art (SOTA) in this field. Our ablation studies demonstrate the significance of both radiomics and deep learning modules for achieving the new SOTA performance compared to international guidelines and published studies (81.9\% vs 61.3\% in accuracy). Our findings have important implications for clinical decision-making. In a series of rigorous experiments on multi-center data sets (246 MRI scans from five centers), we achieved unprecedented performance (81.9\% accuracy).

eess.IV↗

arXiv2018

Conditional Estimation in Two-stage Adaptive Designs

We consider conditional estimation in two-stage sample size adjustable designs and the following bias. More specifically, we consider a design which permits raising the sample size when interim results look rather promising, and, which keeps the originally planned sample size when results look very promising. The estimation procedures reported comprise the unconditional maximum likelihood, the conditionally unbiased Rao-Blackwell estimator, the conditional median unbiased estimator, and the conditional maximum likelihood with and without bias correction. We compare these estimators based on analytical results and by a simulation study. We show in a real clinical trial setting how they can be applied.

stat.ME↗

arXiv2006

Optimal designs which are efficient for lack of fit tests

Linear regression models are among the models most used in practice, although the practitioners are often not sure whether their assumed linear regression model is at least approximately true. In such situations, only designs for which the linear model can be checked are accepted in practice. For important linear regression models such as polynomial regression, optimal designs do not have this property. To get practically attractive designs, we suggest the following strategy. One part of the design points is used to allow one to carry out a lack of fit test with good power for practically interesting alternatives. The rest of the design points are determined in such a way that the whole design is optimal for inference on the unknown parameter in case the lack of fit test does not reject the linear regression model. To solve this problem, we introduce efficient lack of fit designs. Then we explicitly determine the $\mathbf{e}_k$-optimal design in the class of efficient lack of fit designs for polynomial regression of degree $k-1$.

math.ST↗