Papers

Accurate prediction with interval-censored data is particularly challenging when censoring intervals are wide and follow-up is limited, as is common in studies of chronic diseases. Although auxiliary information from source studies may improve prediction in a target study, existing transfer learning methods typically impose restrictive assumptions on model or parameter similarity, or require access to individual-level source data. We propose a novel transfer learning method for interval-censored data that allows arbitrary source models and avoids sharing source data. Our approach transfers survival probability information from source studies through a carefully designed penalty and enables efficient computation via a simple EM algorithm. When multiple source studies are available and their informativeness is unknown, we further develop a data-adaptive aggregation procedure that is robust to negative transfer. Theoretical analysis shows that the proposed estimator attains a faster convergence rate than the target-only estimator whenever at least one source study is sufficiently informative. Extensive simulation studies and an application to data from the Alzheimer's Disease Neuroimaging Initiative demonstrate the effectiveness of our approach.

Many scientific and engineering applications generate responses that are not scalars or vectors, but statistical objects whose form evolves over an ordered index such as time, depth. Probability distributions are a prominent example, capturing variability and uncertainty that cannot be summarized by low-dimensional statistics. When such responses are observed sequentially, the resulting dynamic distributional trajectories pose significant challenges for regression, particularly in relating scalar predictors to both within-index variability and cross-index evolution. We propose Dynamic Fréchet Regression (DFR), a framework for modeling index-dependent trajectories of distribution-valued responses. DFR extends Global Fréchet Regression by introducing an index-aware weighting mechanism. At each index, predictions are defined as weighted Fréchet means in a metric space of distributions (e.g., Wasserstein space), preserving the intrinsic geometry of the response. The weights depend jointly on predictor similarity and index proximity, enabling index-specific prediction while borrowing strength across neighboring indices. To improve interpretability in high-dimensional settings, DFR incorporates a geometry-aware feature selection approach based on sparse metric learning, which identifies predictors driving distributional dynamics without relying on Euclidean coefficients. Simulation studies show improved predictive accuracy and feature recovery over existing methods. An application to additive manufacturing data demonstrates its ability to produce interpretable, index-specific distributional predictions.

The problem of multi-snapshot spike deconvolution is studied, where the goal is to recover the locations of sparse impulses from their noisy convolution with a known point spread function (PSF) across multiple snapshots. A variable-projection formulation is adopted, in which the amplitudes are eliminated in closed form, thereby reducing the task to a nonconvex least-squares problem over the spike locations alone. This formulation is referred to as the variable-projection formulation of spike deconvolution (VarProSD). An explicit characterization of the basin of convexity of the VarProSD objective is provided in terms of key PSF properties, including its power spectral density and smoothness, revealing how sampling bandwidth and spike separation affect the local geometry. Within this basin, consistency of the estimator in the number of snapshots is established under stochastic noise, and a complementary, sharper error bound is derived under adversarial noise through the local Lipschitz property of the inverse map. Local convergence guarantees for gradient descent are further established when initialization is performed within the basin. A central role throughout the analysis is played by Beurling–Selberg extremal approximations, which enable sharp, PSF-agnostic bounds on the conditioning of the structured matrices arising in the optimization landscape. Numerical experiments are presented to corroborate the theoretical findings and demonstrate the effectiveness of modified ESPRIT initialization followed by gradient-based refinement.

As almost all models are wrong, a mean model's usefulness is often accepted as sufficient justification for its use. In practice, however, standard statistical theory breaks when the mean model fit is imperfect, limiting this usefulness. This tension between fit and usefulness arises from a dichotomization of model fit: the model is either right or it is wrong. Motivated by the linear regression framework, we propose an alternative viewpoint that leverages the mean model's usefulness without assuming it is right or wrong. We define a new model usefulness index and use it to share information across individual observations through the mean model. The result is an estimator of each outcome's mean that shrinks individualized means towards the shared mean model, with the degree of shrinkage governed by this usefulness index. We draw connections between our estimator and the James-Stein estimator and establish when and how our estimators of the individualized means yield more efficient inference than model-based and non-model-based alternatives. We also propose a data-dependent estimate of the usefulness index that balances statistical intuition with efficiency considerations. We illustrate our method's practical value in an analysis of personal tracker data.

General-purpose tabular foundation models can be adapted across prediction tasks, but right censoring leaves many event times unknown and prevents their direct use as regression labels. SurvFM converts censored follow-up into observation-level targets for restricted mean survival time (RMST), the expected event-free time accumulated up to a chosen horizon. These targets allow multiple tabular foundation models to predict RMST without architectural modification. In simulations with known RMST, SurvFM achieved leading RMST accuracy and competitive discrimination across heterogeneous settings. Its targets were more accurate than simpler outcome constructions, with larger gains as censoring increased. Across 55 public datasets, SurvFM models remained in the leading performance band under full and restricted training. Models fitted in either of two public myelodysplastic syndrome cohorts retained competitive performance in the other without refitting. SurvFM separates censoring handling from prediction architecture, allowing advances in general-purpose tabular prediction to enter survival analysis without model-specific redesign.

Extreme value theory and compositional data analysis both study settings where relative information plays a central role. In multivariate extreme value theory, threshold exceedance limits satisfy homogeneity properties that separate the radial size of an extreme event from its relative profile. In compositional data analysis, positive vectors are analysed up to multiplicative scale, and inference is based on ratios or log-ratios between components. Consequently, both fields have developed several covariance and dependence representations of the underlying relative structure. In the Hüsler-Reiss model for extremes, these include variogram, covariance, and precision parametrizations. In compositional data analysis, analogous representations arise from pairwise log-ratios, centred log-ratios, and additive log-ratios. We establish an explicit link between the two fields that relates these different representations by a small set of simple transformations, including oblique projections, Hüsler-Reiss inverses, and the variogram map. From a methodological perspective, leveraging this algebraic connection enables the transfer of statistical approaches from one field to the other. For instance, we introduce intrinsic logistic-normal graphical models for compositional data, which are based on Hüsler-Reiss graphical models for extremes. Conversely, we explore how dimensionality reduction methods from compositional data analysis can be applied to the analysis of multivariate extremes.

High-dimensional interpolation is common in modern machine learning, but its tail risk is less understood than its expected prediction risk. Existing theory shows that interpolating models can perform well in expectation, yet such guarantees do not determine the probability of rare, severe errors. In operations research and stochastic decision-making applications, rare estimation errors can have disproportionate downstream effects, so tail behavior matters alongside average performance. We study the fragility of high-dimensional linear interpolators using large-deviation methods. We focus on ridgeless regression and compare it with ridge-regularized estimators. We first show that the risk of ridgeless regression can exhibit heavy-tailed behavior: although its expected risk may remain well controlled, its upper tail can decay much more slowly than that of regularized alternatives. We then quantify this phenomenon at the level of large-deviation rates. In the regime we study, ridge regularization suppresses fixed right-tail deviations at the $n^2$ scale, whereas ridgeless regression has only $n\log n$-scale decay, where $n$ is the sample size. This gap shows that interpolation can be statistically fragile even when it is accurate on average. Thus regularization affects the frequency of rare, high-impact risk events in addition to the usual bias-variance tradeoff.

For analytic convenience, existing statistical frameworks either assume random or fixed regressors. However, it is a little awkward that they do not cover the practical case of estimating the average treatment effect in experiments with randomized treatments and non-randomized, fixed pretreatment covariates. We unify the literature by providing the theory for regressions with mixed regressors that contain both random and fixed components. Importantly, our theory allows for misspecification of the regression functions. We first establish general results for estimating equations with both random and fixed components and then use it to analyze misspecified linear regression, with applications to completely randomized experiments. We focus on the causal interpretation of the regression coefficients and standard errors even when the models are wrong. We start with the theory for independent data and then extend the discussion to clustered data.

Understanding how genetic and epigenetic factors jointly influence binary health outcomes remains a major challenge in biomedical research. We propose a global test for the overall effect of interactions between DNA methylation and a set of single nucleotide polymorphisms (SNPs) on a binary phenotype. We propose a logistic functional regression model in which methylation measurements at CpG sites are transformed into smooth functional predictors interacting with discrete SNP genotypes through a localized kernel. This framework enables stable inference on region-level interactions while accounting for the spatial structure of methylation around SNPs. Extensive simulations show that the proposed test provides well-calibrated type I error and improved power over classical SNP-CpG pairwise analyses. The practical relevance of the method is illustrated using publicly available methylation and genotyping data from an obesity case-control study.

We show how an adversarial model trainer can plant backdoors in a large class of deep, feedforward neural networks. These backdoors are statistically undetectable in the white-box setting, meaning that the backdoored and honestly trained models are close in total variation distance, even given the full descriptions of the models (e.g., all of the weights). The backdoor provides access to invariance-based adversarial examples for every input, mapping distant inputs to unusually close outputs. However, without the backdoor, it is provably impossible (under standard cryptographic assumptions) to generate any such adversarial examples in polynomial time. Our theoretical and preliminary empirical findings demonstrate a fundamental power asymmetry between model trainers and model users.

Authorship verification (AV) is the task of determining whether two texts were written by the same author. In a forensic context, the strength of AV evidence can be quantified using likelihood ratios. Most AV methods are score-based and deriving well-calibrated likelihood ratios from these scores requires a separate calibration model. This, in turn, requires additional amounts of case-relevant data, which is often time-consuming to obtain and prepare. This study proposes two novel normalisation techniques, the Square Root Correction and the Hapax Correction, for deriving likelihood ratios from the AV method LambdaG without the need of a calibration model (Nini et al. 2026). These corrections are designed to mitigate the overestimation of evidential strength that may result from long or highly repetitive texts. Performance is evaluated against logistic regression calibration across fifteen corpora and a range of text lengths (100-9,500 tokens), using the log-likelihood ratio cost (Cllr). The proposed methods achieve performance comparable to logistic regression calibration, with the Hapax Correction outperforming it in approximately 45% of tests (weighted by corpora). Furthermore, performance was more frequently close (within 5%) when the Hapax Correction was outperformed by logistic regression calibration, compared with the reverse comparison. Eliminating the need to train a calibration model reduces data-requirements, time and complexity, thereby increasing the accessibility and transparency of forensic text comparison. This combination of empirical performance and practical advantages supports the adoption of the proposed methods in forensic settings.

We study log-convexity and log-concavity of densities obtained from sums and differences of two independent noncentral gamma random variables. We give a complete classification of one-sided log-convexity for noncentral gamma differences, a complete log-convexity classification for sums of two independent central gamma random variables, and sharp log-concavity criteria for central differences and for common-scale sums. As special cases, we deduce a log-convexity classification for the density of the product of two correlated normal random variables with arbitrary means and variances, and log-convexity and log-concavity classifications for the densities of the variance-gamma and McKay Type I distributions.

Terminal embeddings have emerged as a powerful tool for dimension reduction. Given a set of points $P\subset \mathbb{R}^d$, a terminal embedding is a mapping $f:\mathbb{R}^d\rightarrow \mathbb{R}^t$ that preserves the pairwise distance between any pair of points $p\in P$ and $q\in \mathbb{R}^d$ up to small distortion under this mapping. Terminal embeddings have been particularly fruitful for constructing $k$-means and $k$-median coresets, where the objective is to find a typically weighted subset $\Omega$ of $P$ such that for any candidate solution, the cost of the clustering objective on $\Omega$ approximates the cost of the clustering objective on $P$ up to small distortion. Unfortunately, these techniques have not been extended to more complicated structures such as clustering time-series data under common straight-line interpolation between measurements. The main issue is that terminal embeddings, arguably the central technique in this line of research, cannot be linear and are thus not immediately suitable to preserve linear structures. In this work, we develop a generalization of terminal embeddings to affine line-segments that overcomes this issue. We showcase their applicability by using our lines-preserving terminal embeddings to obtain the first dimension-free coresets for clustering time-series under the Fréchet distance. The underlying dimension reduction uses Johnson-Lindenstrauss (JL) embeddings, and our experiments indicate that terminal embeddings perform similarly to JL and favorably against PCA for synthetic and real-world time-series, while only terminal embeddings extend pairwise distance preservation to the full ambient space.

Within-class variance in language-model representations is commonly read as incomplete neural collapse. We argue it is allocated information storage, and that the allocation obeys a law. A one-line centering identity voids a family of simplex equiangular-tight-frame claims, including our own earlier ones; in dimensionless variance shares across 14 models, macro-category structure carries only 4-12% of representational variance and within-token context carries 79-91%, stable across a 100x parameter range. On the theory side, token-level weight decay penalizes a category in proportion to its type count, not its occurrence mass, reducing next-token prediction to an imbalanced K-class problem whose optimum orders category norms by type count. A converse floor, proved for binary categories, forces within-category dispersion to be at least proportional to the conditional mutual information I(token; context | category). The law holds: identity dispersion, not total variance, tracks this information across every tested model and partition, under a model-free estimate and even across models, where one model's information predicts another's dispersion; and over pretraining the category share overshoots, decays, and partially recovers, because the information it must carry never left.

We prove a divisibility theorem for the signed $J$-characteristics of two-level designs: if the number of factors $n$ is odd and every $J$-characteristic of a proper odd-cardinality subset of factors vanishes, then the top $J$-characteristic is divisible by $2^{n-1}$. As an arithmetic consequence, any two-level design whose $J$-characteristics vanish in orders one, two, three, five, and seven but which has a nonzero odd-order $J$-characteristic must have at least $256$ runs. This settles, uniformly in the number of factors, a conjecture of Eendebak, Schoen, Vazquez, and Goos (2023) on the nonexistence of certain strength-three even–odd designs with $56$ or $64$ runs. The divisibility bound is sharp at every odd order and is attained by the even-weight half-fraction.

This paper proposes the certainty-equivalent first-order learning (CEFOL) algorithm, a deep learning algorithm for solving discrete-time dynamic programming problems with recursive utility. Dynamic programming with recursive utility is challenging because nonlinear certainty equivalent appears in the Bellman equation and the first-order optimality conditions but is difficult to evaluate. By introducing a separate neural network to represent the certainty equivalent, CEFOL enables the exploitation of the Bellman and model-specific first-order optimality conditions. In addition to certainty equivalent, CEFOL also uses neural networks to learn the value functions, policy functions, and Lagrange multipliers by using model-specific first-order conditions to construct residuals for minimization. By using first-order and KKT residuals to learn the policy, CEFOL directly accommodates general equality and inequality constraints on the controls, including occasionally binding constraints, without requiring penalty functions or problem-specific reformulations. We apply the algorithm to risk-sensitive and Epstein–Zin consumption-saving problems, a small-noise robust-control problem, and a DSGE model with recursive preferences and stochastic volatility. Across these applications, out-of-sample Bellman diagnostics and model-specific optimality residuals, including Euler or first-order residuals where applicable, are generally of order 1.0e-4 to 1.0e-3 over the relevant state regions, with larger values mainly near binding constraints, and the learned value and policy functions closely match VFI benchmarks when available. The CEFOL algorithm also works for dynamic programming problems with expected utility, as expected utility is a special case of recursive utility.

In this paper, we resolve an open question of Klopp & Zadik (2026) by providing a high-probability polynomial-time, node-private algorithm which nearly matches the performance of their exponential-time node-private algorithm for exact recovery in stochastic block models. Our result involves an explicitly constructed Lipschitz surrogate for the penalized likelihood function, as well as a carefully devised accept-reject algorithm that samples community labels from the corresponding exponential mechanism in polynomial-time. We rigorously analyze the privacy, runtime, and utility of our proposed algorithm, showing that even when the number of communities K grows logarithmically with the number of nodes n, we can achieve the minimax rates for exact recovery with the privacy parameter epsilon growing as log(n), thus matching known lower bounds on the cost of privacy for this setting.

Medical time-to-event data are frequently subject to competing risks, where the occurrence of one terminal event precludes the others and standard survival methods that treat competing events as censoring yield biased absolute-risk estimates. Valid analysis instead targets the cause-specific cumulative incidence function (CIF). This methodology has been available to applied researchers almost exclusively through R packages, forcing Python-based machine-learning workflows into a Python-to-R round trip. We present comprisk, a scikit-learn-compatible Python toolkit that puts the canonical competing-risks methods behind one API: a scalable competing-risks random survival forest, Fine-Gray subdistribution-hazard regression and a penalized variant, cause-specific Cox regression, the Aalen-Johansen CIF estimator, and Gray's K-sample test, together with competing-risks-aware model evaluation. Every estimator is validated numerically against its R reference implementation. The forest uses a histogram-based, numba-compiled split kernel that fits 10-22x faster than randomForestSRC at comparable discrimination on real clinical cohorts and scales to n = 10^6 on a consumer CPU. comprisk is distributed on PyPI and lets applied researchers run correct, scalable competing-risks analysis without leaving the Python scientific stack.

In this paper, we study several incomplete entropy measures, namely the Incomplete Weighted Cumulative Residual Entropy, the Incomplete Cumulative Residual Tsallis Entropy and its weighted version, and introduce the associated partial orderings. Their connections with certain well-known stochastic orderings are also investigated. Based on these characterizations, a class of nonparametric tests for stochastic equality against ordered alternatives is developed. The asymptotic properties of the proposed tests are derived, while their finite-sample performances are assessed through extensive Monte Carlo simulations under various alternative models and sample sizes. These tests are further compared with the test based on incomplete cumulative residual entropy proposed by Zardasht (2015).

Similarity search is a primary application of embedding models trained by contrastive learning. For one of the most popular contrastive learning loss functions, InfoNCE, we show that the population risk with $k$ negative samples is $O(1/k)$ close to an expected cross-entropy which quantifies deviation between i) a softmax similarity search over unseen data using the learned embedding function, and ii) an idealised softmax search over the same data but using similarity implicitly represented in the positive sample generator. This complements existing interpretations of InfoNCE in the $k\to\infty$ limit which are phrased in terms of mutual information, and alignment versus uniformity in embeddings. To quantify generalisation performance, we introduce a new continuity bound for the InfoNCE loss, obtained via Gâteaux differentiation. The bound preserves the structure of averaging over negative samples present in the loss function and features an “inverse temperature” parameter which can be tuned to account for the algorithmic temperature. For embedding functions which are Lipschitz in a parameter, this yields a simple demonstration that the averaging effect of $k$ negative samples in the InfoNCE loss carries over to stabilisation of the generalisation error as $k$ grows.

Health economic evaluations are fundamentally concerned with answering causal questions by targeting estimands that contrast the costs and health consequences that would be observed under at least two different interventions. This requires the joint distribution of potential outcomes under each level of intervention, which, with appropriate causal assumptions, can in principle be identified from the joint distribution of observed health outcomes. Such data, however, are rarely available from a single source. This limitation has motivated the use of decision-analytical models to approximate the joint distribution of outcomes under each intervention directly, informed by causal parameters drawn and synthesized from multiple sources, so that the potential outcomes of interest can be approximated as an expectation over the model-implied outcome trajectories. The validity of this approach, however, depends on the credibility of the underlying assumptions. In this work, we formalize this procedure explicitly as a task of causal inference, thereby defining and decomposing decision-analytical model bias into components arising from model structure (model bias) and input parameters (target bias). Because decision-analytical models often rely on unconventional target parameters lacking straightforward observable analogues, and because bias in these parameters can propagate through the model, target bias may arise even in simple settings, a point of central focus in this work. More broadly, this work provides a unifying foundation for medical decision-analytical modelling and causal inference, making explicit the potential for decision-analytical model bias and the role of causal assumptions contributing to it. Ultimately, the resulting clinical decision is only as credible as the assumptions underlying it.

Flexible machine-learning methods can be sensitive to hidden confounding: they may learn associations induced by unobserved confounders rather than stable signals. Spectral deconfounding mitigates this problem by shrinking high-variance directions of the covariate matrix that, under dense confounding, carry latent confounder information. Existing work has largely focused on linear models. We develop a nonlinear spectral deconfounding framework for gradient boosting. Our approach replaces the ordinary squared-error loss by a spectral loss, which alters the boosting dynamics by slowing down learning in confounding-aligned directions. We show that deconfounding is not achieved by the spectral loss alone, but by the interaction between spectral shrinkage and regularization, especially in terms of early stopping. Moreover, we provide a mixed-model interpretation that connects LAVA-type shrinkage to random-effects adjustment and yields an empirical-Bayes procedure for tuning the spectral loss. We also extend the method to general likelihoods and nonlinear confounding using Laplace approximations and kernel random effects. Across synthetic and real-world experiments, spectrally deconfounded boosting improves estimation of the target function under hidden confounding and is substantially more scalable than existing nonlinear spectral deconfounding baselines.

Relational states refer to concepts such as friendship or collaboration, in which a relationship persists over a certain amount of time. Study of relational states often involves figuring out what factors contribute to the creation or dissolution of these relationships. However, most methods available now restrict their attention to binary states, i.e., ties that are either present or absent, even though many real-world systems evolve through multiple relational states (e.g., acquaintance, friendship, close friendship). We propose a continuous-time framework for modelling and inferring relational state networks in which each edge evolves by transitioning between two or more states. In our model, transition intensities are driven by state-dependent covariates that might be decomposed into anchoring (current-state) and pulling (target-state) mechanisms, with both linear and smooth non-linear effects. We address two common sampling regimes. With full event histories, a Cox-type partial likelihood with nested case-control sampling enables efficient estimation of both parametric and smooth effects. Instead, for panel data we derive a general ODE formulation for the likelihood, which leads to a particularly efficient inference procedure for binary state model. Simulation studies confirm accurate recovery of model parameters, and an empirical application to adolescent friendship data reproduces the substantive conclusions of established modelling techniques while offering substantial computational gains. The framework preserves the interpretability of classical network effects, generalizes them to multi-state ties, and scales to larger, more complex designs under both full-history and panel sampling designs.

We study scalar-on-function linear regression when each covariate curve is observed only through finitely many noisy point evaluations. Our goal is to characterize the minimax estimation and prediction risks as joint functions of the number of trajectories $n$ and the within-trajectory resolution $m$. Working in a fixed trigonometric eigenbasis, with covariance eigenvalues decaying at rate $\alpha$ and slope function of Sobolev smoothness $s$, we derive matching minimax upper and lower bounds under two canonical sampling schemes. Under an independent random design, the minimax prediction rate is $n^{-\frac{2\alpha+2s}{2\alpha+2s+1}} + (nm)^{-\frac{2\alpha+2s}{4\alpha+2s+1}}$. The first term is the fully observed functional linear regression benchmark, while the second term captures the cost of noisy point evaluations after amplification by the inverse covariance operator. Under a common design on an equally spaced grid, the shared sampling geometry introduces additional obstructions, and the minimax prediction rate becomes $n^{-\frac{2\alpha+2s}{2\alpha+2s+1}} + (nm)^{-\frac{2\alpha+2s}{4\alpha+2s+1}} + m^{-(2\alpha+2s)} + m^{-4\alpha}$. Here the third term represents discretization error induced by the fixed grid, whereas the fourth reflects the cost of identifying unknown eigenvalues from observations on a common grid. We further construct data-driven adaptive estimators that screen the covariance scale and threshold blockwise prediction energy, attaining these rates without prior knowledge of the eigenvalue sequence or the smoothness indices. The results reveal a sharp phase transition that depends on the sampling resolution under independent design and a richer phase diagram under common design. Numerical simulations and a real data example illustrate the theoretical findings.

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.

The impact of a given training point on a statistical model can be measured through its leave-one-out influence on the model parameters, which quantifies how its removal from the training set affects the learned weights. For convex M-estimation under Gaussian design, in the high-dimensional limit $n\asymp d$, we show that the empirical distribution of influences across training points concentrates around a deterministic measure which we sharply characterize. This characterization suggests that influential samples tend to lie on average close to the decision boundary, making contact with a standard data selection heuristic in active learning.

This paper establishes a central limit theorem (CLT) for functionals of $M$-bounded persistence diagrams arising from germ-grain random set models. Building on stabilisation methods for marked point processes, we show that, under certain conditions, these topological summaries exhibit asymptotic normality as the observation window increases, particularly for models with exponential decay of correlations. These results are applied in goodness-of-fit tests designed to detect spatial interactions such as clustering or repulsion. Using test statistics derived from rectangular partitions of persistence diagrams and functional summaries (e.g., the APF or the support function of the lift zonoid), the study distinguishes between different models. Finally, the methodology is applied to histological images of breast tissue.

Pairwise and network meta-analyses occupy the highest tier of evidence-based medicine and routinely inform clinical guidelines and healthcare decision-making. Current approaches typically aggregate study-level treatment effects to obtain an overall estimate. We argue that the causal estimand should come first, with the aggregation derived only afterwards: the target population and the relevant sources of between-study heterogeneity should be explicitly defined before deriving the aggregation required for identification. This shift in perspective fundamentally changes both the estimands and the methodology. We develop a unified causal framework for pairwise and network meta-analysis based on aggregate data. By defining treatment effects with respect to a clinically meaningful target population, for example, the average population represented by the contributing trials, and accounting for heterogeneity induced by treatment-effect modifiers and center effects, we show that identification naturally leads to arm-level aggregation. In the network setting, this causal formulation departs fundamentally from the conventional contrast-based paradigm: arm-level aggregation emerges from the causal formulation rather than from a modeling choice, and treatment effects are identified without relying on the treatment network itself. This perspective provides an additional conceptual argument in the long-standing contrast-based versus arm-based debate. Numerical studies show that the proposed estimators target well-defined causal effects, whereas the causal interpretation of conventional approaches remains unclear. Although both approaches often produce similar estimates, we identify settings in which they diverge, with potentially important implications for the interpretation of meta-analytic evidence.

The Susceptible-Exposed-Infectious-Removed (SEIR) model is a fundamental model in epidemiology. Model parameters such as the reciprocal transmission, incubation, and infectious rates are often difficult to measure directly, and they are estimated by solving an optimisation problem aiming to minimise the difference between the observed data and the model solution. However, the parameters of the standard SEIR system are not globally identifiable, causing optimisation algorithms to frequently converge to incorrect local optima and suffer from numerical stiffness. Here we show a comprehensive structural identifiability analysis of the SEIR framework, and present a globally identifiable and computationally stable reparameterisation of the model derived via an observational system approach. We fully characterise the multiple locally identifiable parameters, and by transforming the system into a globally identifiable structure, we eliminate the non-uniqueness issues in the parameter estimation approaches. Our numerical experiments demonstrate that this reformulation significantly improves convergence frequency, avoids runtime errors caused by numerical overflow, and consistently recovers the correct parameters. Furthermore, incorporating first-order sensitivity equations into the optimiser enhances the robustness and execution speed of the estimation process. Numerically well-conditioned methods for parameter identification, together with a comprehensive understanding of the identifiability of the parameters, ensure that the model yields reliable, rigorous insights for infectious disease forecasting and theoretical epidemiology.

We study stochastic fixed-point equations $\mathbf{T}(\mathbf{x}) = \mathbf{x}$ over normed spaces $(\mathcal{E}, \|\cdot\|)$, where the operator $\mathbf{T}$ is nonexpansive or contractive and is accessed only through unbiased stochastic evaluations with bounded second central moment. Given $\epsilon > 0, \delta \in (0, 1)$, the goal is to output $\mathbf{x} \in \mathcal{E}$ such that $\|\mathbf{T}(\mathbf{x}) - \mathbf{x}\| \leq \epsilon$ with probability at least $1-\delta$. We introduce VR-GHAL, a variance-reduced gradual Halpern method for quadratically smoothable Banach spaces. The key algorithmic ingredient is a recursive stochastic estimator based on clipped differences of oracle evaluations: instead of clipping $\tau(\mathbf{x}; \xi)$ itself, we clip stochastic differences at the Lipschitz scale $\gamma\|\mathbf{x} - \mathbf{y}\|$. This makes the estimator pathwise Lipschitz along the algorithmic trajectory while permitting martingale concentration under finite second moments in the native norm. Our main theorem gives an anytime high-probability residual bound: on a single event of probability at least $1 - \delta$, the residual decreases nearly geometrically across epochs, up to lower-order logarithmic factors. Under only bounded variance, displaying only the dependence on the target error $\epsilon$ and Lipschitz constant $\gamma \in (0, 1]$ of $\mathbf{T}$, the resulting oracle complexity is $\min\{\epsilon^{-5}, (1-\gamma)^{-3}\epsilon^{-2}\}$. Under a Lipschitz-in-expectation oracle, the dependence improves to the corresponding $\epsilon^{-3}$ nonexpansive rate (i.e., for $\gamma = 1$), and under samplewise nonexpansiveness to $\epsilon^{-2}$.