Papers

Target trial emulation has become a standard framework for causal inference from observational data. Within this paradigm, the clone-censor-weight (CCW) methodology provides a practical way to deal with complex treatment and adherence definitions when treatment regimes are not distinguishable at baseline. Despite its increasing use, the statistical interpretation of CCW remains limited. In this work, we formalize the CCW methodology from a statistical viewpoint based on admissible sets and stochastic interventions. We characterize the causal estimands targeted by CCW, establish consistency of CCW estimators under standard identification assumptions, and provide theoretical guarantees for bootstrap-based inference methods.

Randomized controlled trials (RCTs) identify treatment effects without confounding but are often small, whereas observational studies (OBS) are large but may be confounded. Many estimators combining a small RCT with a large OBS have been developed for the average treatment effect (ATE) and the conditional ATE (CATE). However, existing ATE estimators either make assumptions on the OBS or do not borrow enough power from them. The CATE has been studied less than the ATE. Existing CATE methods either assume the OBS are unconfounded, rely on a model of the confounding function, or accept bias in exchange for lower variance. We therefore propose a framework that, without special assumptions on the OBS, fuses the OBS and the RCT by preserving the unbiasedness of RCT-based estimation while borrowing power from the large OBS to boost precision. Applying this principle, we build an ATE estimator, AIPW-Fusion, with closed-form weights and confidence intervals, and two CATE learners, DR-Fusion and R-Fusion. Experiments corroborate our findings.

Multiple imputation (MI) is widely used for handling missing data in medical research, with variance commonly estimated using Rubin's rules (RR). RR is simple to apply, but under uncongeniality between the imputation and analysis procedures, its variance estimate can be either too small or too large, leading to miscalibrated confidence intervals. Robins and Wang (RW) developed an estimating-equation variance estimator that does not require congeniality under the conditions of their parametric imputation framework. Practical use of RW, however, has been limited by the lack of accessible software and by the additional variance calculations required for modern imputation workflows. We develop an R package, rw, construct RW variance components for normal and logistic conditional imputation models fitted through mice, and propose an approximate RW variance procedure for predictive mean matching (PMM). The PMM procedure preserves the original imputations and selected donors. For the variance calculation, we define differentiable donor probabilities and use expected analysis scores to approximate the cross-moment between analysis and imputation scores. Analysis scores are summed by recorded donor to account for donor reuse. We evaluate the proposed methods in benchmark simulations based on the original RW setting and in validation-study simulations motivated by electronic health record data. RR coverage was up to approximately 23 percentage points below the nominal 95% level in some settings and above nominal in others. The proposed RW estimators generally produced coverage closer to the nominal level in larger samples under both parametric and PMM imputation, while retaining the same completed-data point estimates as RR.

Randomized-withdrawal trials re-randomize induction responders to continued treatment or withdrawal. Baseline characteristics are often reported for the induction population but unavailable for responders, limiting population-adjusted indirect comparisons of maintenance outcomes. We describe re-randomization-probability weighting, which combines induction-population calibration with inverse weighting by known maintenance assignment probabilities. Coding induction non-response as failure defines durable response: response at both induction and maintenance. The design weights reproduce induction-population covariate totals in randomization expectation, allowing population adjustment using reported induction baselines. Conditional maintenance probabilities can also be estimated, although different induction treatments generate different responder populations. A synthetic three-trial demonstration reduced durable-response bias from 0.106 to 0.001 and from 0.055 to 0.001 in two comparisons. Full-procedure simulations showed interval coverage of 91.5% - 94.3%; stress scenarios illustrated bias from omitted covariates and incorrect assignment weights. The method connects established design weighting and aggregate dilution approaches to population-adjusted comparison across randomized-withdrawal and treat-through designs. It requires compatible durable-response endpoints and credible transport and modeling assumptions. Withdrawal after different induction regimens is not automatically a common comparator. Where no valid anchor exists, unanchored comparison is appropriate only if its demanding adjustment assumptions are defensible.

Electronic health record (EHR) phenotyping algorithms support clinical prediction, observational research, and quality improvement, but manual chart review for gold-standard validation is costly. For algorithms targeting rare outcomes, algorithm-negative patients often greatly outnumber algorithm-positive patients. We propose a design-based validation framework that fully verifies algorithm-positive patients and reviews a simple random sample (SRS) of algorithm-negative patients. Horvitz-Thompson estimators of false-negative (FN) and true-negative totals yield estimates of sensitivity, specificity, negative predictive value, positive predictive value, and accuracy. We derive finite-population-corrected variance estimators and confidence intervals (CIs), with sample-size planning for a prespecified CI half-width. An optional Phase 2 extension uses pilot data to assess whether risk-guided Neyman allocation may improve precision. In simulations, the design-based approach substantially reduced bias relative to naive verified-sample analyses and achieved near-nominal CI coverage. Adaptive allocation reduced root mean squared error and CI width when FNs were concentrated across risk strata, but offered little benefit when the risk signal was weak. We illustrate the framework using a breast cancer recurrence algorithm in 3,336 patients, with endpoint-specific algorithm-negative review budgets of 125, 150, and 175 charts. The framework combines SRS-based validation and precision planning with optional pilot-guided adaptive allocation.

Accurate covariance estimation is crucial for spatial data analysis. While parametric methods can suffer from model misspecification leading to wrong conclusions, nonparametric approaches are often neglected in practice as they rely on the estimation of a large number of covariance parameters and often face finite-sample bias issues. In this paper, we study the bias properties of sample covariance estimators for stationary lattice processes on $\mathbb{Z}^2$, when the true mean parameter is unknown and has to be estimated. We derive exact formulas for the finite-sample biases of sample covariance estimators and show that their expectations are linear combinations of population covariances determined by spatial lag and sample size. Based on this characterization, we propose jointly bias-corrected covariance estimators that are nearly unbiased. Additionally, we derive formulas for the mean-squared error and prove asymptotic normality results that show asymptotic equivalence for the estimators with and without bias correction. Simulations demonstrate substantial reductions of bias and often also in terms of MSE, particularly under strong spatial dependence. A kriging application to topography data further illustrates the practical benefits of the proposed approach.

A compromised LLM inference server can leak model weights by encoding payload bits in otherwise plausible token choices. A replay of the same prompt in a trusted server can expose such deviations, but benign numerical nondeterminism also causes token mismatches. Patient attackers can therefore hide within normal variation unless evidence is combined across responses. We introduce a prompt-level e-process that calibrates whole-response mismatch events on trusted benign traffic and accumulates evidence sequentially while, under a calibration-transfer assumption, controlling the probability of any false alarm over an unbounded monitoring horizon. We evaluate it on four models against a seed-blind attack and a stronger seed-aware attack that hides payload bits only in near-ties to remain stealthy, analyzing the channel capacity vs detectability trade-off. Compared with a hard per-token alarm, the e-process combines weak evidence across responses while providing explicit anytime false-alarm control.

Conventional statistical modeling typically assumes a one-to-one mapping between input and output variables, where one-to-one is used in the predictive sense that a specified input results in a unique output. Many scientific and engineering systems, however, exhibit non-one-to-one(noto) input-output relations. In a noto relation, the same input may correspond to multiple admissible outputs, so the conventional statistical models may not be appropriate. This paper develops manifold regression, a parametric modeling framework for such noto input-output relations, which represents the underlying input-output relation through a latent manifold. The manifold is specified upto an unknown finite dimensional parameter and we estimate the unknown parameters from ordinary input-output observations by regularized profile optimization with a robust solver. Once the manifold has been learned, prediction is obtained by slicing the estimated manifold along a specified coordinate value. Because a slice may contain multiple latent roots, the resulting manifold prediction is naturally set-valued. This formulation extends predictive learning beyond conventional one-to-one statistical models while containing classical regression and inverse prediction as special cases. Theoretical results are established to justify the manifold regression model and its sliced prediction sets; and case studies are used to demonstrate stable performance across representative noto cases.

A watermark detector can flag a text even when only a small fraction of its tokens are watermarked. We study sequential auditing to identify local passages whose watermark proportions exceed a prespecified threshold. Each alarm fixes a candidate passage's endpoint, while its start is chosen from earlier tokens. Reusing the same evidence to locate and test a passage can invalidate inference. We propose FissionGuard, which uses data fission to construct an alarm value and a validation value from each token-level $p$-value. The alarm values guide alarms and localization. The validation values yield passage-level $p$-values through partial conjunction, excluding as many of the strongest signals as the proportion null allows. These $p$-values are used to test the corresponding hypotheses at levels assigned by an online multiple-testing procedure. Under the stated watermark generation model, allowing dependence among token-level $p$-values at watermarked positions, we prove finite-sample false discovery rate (FDR) control among reported passages at every fixed finite horizon. We also derive a finite-sample lower bound on power for testing nonnull candidates. Experiments on synthetic streams and Mistral and Qwen generations across four marking layouts show gains in watermarked-token coverage over sample splitting, with empirical FDR below the target.

Outside the linear-Gaussian regime, conditional sampling from Gaussian processes (GPs) is challenging. Recent methods such as FlowGP (Moss et al., (2026)) can condition on arbitrary non-linear and non-Gaussian statements, but at considerable cost: an expensive iterative and high-dimensional diffusion that requires hand-specified kernel hyperparameters. In this paper, we alleviate two significant drawbacks of FlowGP by (1) introducing kernel approximations that enable scaling to high-resolution domains and (2) proposing a way to obtain the marginal likelihood by measuring the work needed to steer the diffusion towards conditioning statements. We enable, for the first time, hyperparameter optimisation within FlowGP and demonstrate our approach on probabilistic downscaling from areal summary statistics, PDE solution inference on irregular domains, and recovery of sea level anomaly fields from non-Gaussian satellite observations.

Many applications of language models hinge not on individual samples but on the expectation of a test functional under the model. Estimating such expectations reliably can be computationally expensive. In this paper, we show how to make estimation more efficient by exploiting the next-token conditional probabilities which are available as a by-product of sampling. We do so through potentials: real-valued functions on prefixes that decompose the test functional additively. We construct an estimator whose variance depends on the chosen potential, and derive conditions under which a potential reduces this variance. We then develop practical potentials for several estimands and applications, and demonstrate substantial variance reductions across several estimands at comparable computational cost.

Generative conformal prediction builds uncertainty sets from samples of a conditional generator, which are efficient only when the samples represent the response distribution well. This can require many samples, each of which can be costly, as in large diffusion models and scientific simulators, so the sampling budget must be used efficiently. Existing methods draw the same number of samples at every input, wasting samples where the response distribution is simple and undersampling where it is complex, which inflates sets and leaves those inputs under-covered. We propose CASA (Conformal Adaptive Sample Allocation), which characterizes the marginal value of an additional sample and allocates samples across inputs to minimize the expected set size subject to marginal coverage and an average sampling budget. Theoretical analysis shows that adaptive allocation yields smaller sets than a fixed count at the same budget: a missed mode forces a radius that spans the gap between modes, and even oracle radius cannot compensate for it. On synthetic and real tasks, CASA produces substantially smaller sets at the same budget, often improves conditional coverage, and complements existing radius-adaptive methods.

Estimating covariate-dependent intensity functions from spatial point pattern is challenging when the integrated intensity function cannot be evaluated analytically. This challenge becomes even worse in Bayesian inference due to repeated integration of the intensity function over the high-dimensional covariate space. This paper develops a Bayesian soft-tree Poisson process model that combines adaptive covariate partitioning with smooth intensity function. The key idea is to use soft gating functions to smooth transitions between partition boundaries in a tree generating process while preserving analytic evaluation of integrated intensity. A Bayesian CART prior is adopted to learn the partition structure from data. Given the partition tree, conjugate priors are assigned on leaf parameters to enable analytic marginal likelihood computation. This paper also develops a reversible-jump Markov chain Monte Carlo (RJ-MCMC) algorithm for posterior inference. Posterior consistency is established for the proposed model with respect to the Hellinger distance. Extensive simulation studies and an application to wildfire data confirm the advantages of the proposed method over existing methods.

Autonomous scientific discovery with LLMs requires generating and testing hypotheses adaptively as evidence accumulates while maintaining statistical validity. Existing anytime-valid methods can handle data-dependent hypotheses, but open-ended discovery poses a deeper challenge: the best discovered hypothesis may still be the best of a bad lot, with better explanations yet undiscovered, while even background knowledge such as physical laws may require revision in light of new findings. In response, we formalize the problem as Abductive Autonomous Scientific Discovery (AASD) using possibility theory. We introduce abductive utility, a computable measure of discovery progress, and possibility frontier search, the first algorithm for AASD, which maintains anytime validity and achieves $\varepsilon$-optimal abductive utility asymptotically under suitable conditions. Experiments on synthetic and real-world scientific-discovery tasks show strong performance.

Large language models (LLMs) are commonly post-trained against LLM judges and other cheap surrogates because the true reward, such as human preference, is too expensive to query at scale. This practice often leads to reward hacking, where reinforcement learning against a miscalibrated surrogate leads to undesirable side effects. In this work, we study a setting in which a small number $n$ of model outputs are annotated with ground-truth labels (e.g., from expert review) and used to recalibrate the LLM judge before optimizing against it. Prior approaches to judge recalibration are costly or heuristic, and it is known that on-policy sampling fails when the surrogate is miscalibrated on a rare set of outputs. In this work, we propose envelope sampling, a theoretically-grounded method for judge recalibration that seeks to minimize an upper bound on the regret of the post-trained model under the assumption that the human reward and re-calibrated reward lie in an $L^2$ ball around the judge. We give practical algorithms to sample from the envelope by rejection or by fine-tuning against a modified reward, and experiments on clinical note generation and on a controlled sycophancy task show that recalibrating on envelope samples mitigates reward hacking where recalibrating on base-model samples does not.

The recent e-closure method can recover every procedure that controls FDR (and other expectation losses). But the recovered e-collection is “self-referential” and gives no insight on how to improve the procedure (if improvable), and some recent improvements have been somewhat opaque. We introduce an elementary new technique called anchoring that exploits looseness in existing FDR proofs to enlarge a baseline multiple-testing procedure's self-referential local e-value. The resulting e-closure thus transparently retains every baseline discovery (and usually adding more) and controlling the false discovery rate under the same conditions as the baseline. To show that this principle is broadly applicable, we use it to improve a large suite of multiple testing procedures: (i) Anchored-BH dominates the Benjamini-Hochberg (BH) procedure under PRDS while being incomparable to Goeman's recent closed-BH, (ii) Anchored-BY dominates the Benjamini-Yekutieli (BY) procedure under arbitrary dependence while being incomparable to closed-BY, (iii) For two-sided Gaussian p-values (under appropriate covariance conditions), Anchored-2BH dominates running BH twice at half the level on two one-sided p-values, (iv) Anchored-dBH dominates dependence-adjusted BH, (v) Anchored e-BH dominates e-BH and is incomparable to closed e-BH, (vi) Anchored SeqStep+ improves the original (including selective and adpative variants) while preserving ordered rejection structures. All of these are accomplished in sorting or quadratic time. The appendix shows how to dominate Shifted-BH (for two-sided arbitrarily correlated Gaussians) and NDBH (for negatively dependent p-values), IndBH (for graph-dependent p-values), some online FDR procedures and the support line procedure for boundary FDR control.

Small area estimation (SAE) often requires both borrowing information across areas and benchmarking estimates to reliable aggregates. We develop a Bayesian framework that addresses these two objectives jointly through a new family of Benchmarking priors. The priors are induced by a benchmark-constrained regularization problem. The resulting family includes a Benchmarking Prior that incorporates the benchmarking restrictions without additional regularization across areas, and Single and Multi-View Laplacian Benchmarking Priors that introduce regularization through graph Laplacians constructed from area similarities based on external covariate information. For posterior computation under these degenerate priors, we develop tailored MCMC algorithms based on a reduced parameterization of the constraint space. We assess the proposed models using a data-based simulation and apply the framework to estimate Average Household Size (AHS) at the municipality level in Colombia in 2025. In this application, graph-based regularization improves model performance, with the Multi-View models generally producing more precise municipality-level estimates.

Continuous structural connectivity describes the connection between any two points of the cortical surface by an intensity function. Based on the endpoints of tractography streamlines, existing methods estimate this function mostly by kernel smoothing, which only gives a point estimate. We propose a Bayesian framework that estimates continuous connectivity with uncertainty quantification. The endpoints of tractography streamlines, mapped to two spheres, are modeled by a log-Gaussian Cox process on the product of the spheres with a Matérn Gaussian process prior. With the finite element representation of the prior, the Laplace approximation of the posterior enables the computation on a fine mesh with over 400,000 latent variables per hemisphere pair. Numerical experiments show the accuracy of the point estimate of this approach and the coverage of its credible intervals. In the Adolescent Brain Cognitive Development Study, the proposed method predicts held-out streamlines better than kernel smoothing.

Testing equality of two high-dimensional covariance matrices is challenging when many entries differ only slightly. Dependence among sample covariance entries can also affect the finite-sample size and power of tests that aggregate their differences. We propose a studentized $\ell_2$-type statistic that averages squared, marginally standardized differences between corresponding entries of the two sample covariance matrices. Before constructing the statistic, we apply the same nonsingular linear transformation to both samples. In the transformed coordinates, the covariance-equality hypothesis is unchanged, whereas the standardized differences and correlations among their estimators generally change. The transformation can therefore incorporate structural or scientific information without reducing dimension. We approximate the null distribution using a Gaussian multiplier bootstrap that uses coordinatewise studentization and avoids forming or inverting the full covariance matrix of the vectorized sample covariance entries. For deterministic transformations, we derive nonasymptotic Gaussian and bootstrap approximation bounds and establish asymptotic size validity and power consistency. We also show that replacing a population transformation by a same-sample estimator leaves the statistic and bootstrap critical value asymptotically unchanged in relative terms under an operator-norm convergence condition. Simulations show that suitable transformations improve size accuracy and power under weak dependence. An analysis of breast cancer gene-expression data illustrates the method.

Functional generalized linear models provide a flexible framework for relating a scalar response to functional and scalar predictors, but their conventional formulation requires specification of the response distribution and is typically developed for a single population. We propose a semiparametric functional generalized linear model for multi-population data that leaves the baseline response distributions unspecified and links them across populations through a density ratio model. The proposed framework accommodates both functional and scalar predictors while borrowing information across related populations. We develop a maximum empirical likelihood estimation procedure and use penalized B-spline approximations to estimate the functional coefficients. A cross-validation procedure based on a kernel-smoothed empirical likelihood density estimator is introduced to select the smoothing parameters. Simulation studies show that borrowing information through the density ratio structure can improve estimation efficiency relative to fitting each population separately, and that the proposed semiparametric method remains competitive when a parametric Gaussian model is correctly specified while providing substantial robustness when it is misspecified. We illustrate the method using county-level soybean yield data from Kansas, with daily temperature curves and irrigation levels as predictors.

E-values provide a flexible framework for statistical inference, but the universal threshold $1/\alpha$ can be conservative when the null distribution has additional structure. We study how structural restrictions limit the worst-case concentration underlying Markov's inequality, using a nondecreasing density model to constrain tail allocation and an $L$-Lipschitz density model to control local concentration. The nondecreasing model gives the minimax rejection threshold, and the Lipschitz condition yields a sharper closed-form threshold with an $O(L^{-1/2})$ relative improvement over $1/\alpha$. We further show that this threshold is asymptotically sharp as $\alpha\to0$, in the sense that no uniformly valid threshold can improve on it by a fixed positive $L$-dependent amount. We then incorporate the Lipschitz calibration into multiple testing procedures with FDR control and use the same structural information to construct calibrated conditional e-values for anytime-valid sequential inference. Numerical experiments illustrate the resulting gains in discoveries and the trade-offs of the sequential procedures.

The likelihood input to a Bayesian analysis almost never exactly represents how the data were generated, calling into question the validity of posterior inferences. We review a variational interpretation of the Bayesian posterior as an alternative justification for its use under model misspecification, and consider the resulting implications on uncertainty quantification and parameter estimation. We then introduce a range of techniques that seek to obtain generalised Bayesian inferences that account for model misspecification

Real-world data often exhibit nonlinear, interactive associations between predictors and an outcome. For example, in public health studies, environmental exposures and demographic variables can have nonlinear associations with health outcomes and modify the associations of other predictors. Parametric regression models facilitate interpretable inference and hypothesis testing with Type I error rate control, but may be misspecified when associations are nonlinear. In contrast, flexible nonparametric regression models such as Gaussian processes (GPs) can capture complex nonlinearity, but are often more difficult to interpret and do not readily provide hypothesis tests with Type I error rate control. To bridge this gap, we propose a hypothesis testing framework based on additive GPs restricted to pairwise interactions, allowing tests of variable associations and interaction effects with Type I error rate control. We further establish contraction rates for additive GPs, providing theoretical support for their reduced dependence on predictor dimension when higher-order interactions are absent. Through simulations, we show that restricting the model to pairwise interactions can substantially improve testing power relative to methods based on standard GPs. Applications to environmental health studies identify nonlinear associations between metal exposures and health outcomes as well as effect modification by demographic factors.

One-to-one matching without replacement is a classical approach to constructing comparable treated and control samples in the design of observational studies. It pairs each treated unit with a distinct control while minimizing a covariate distance objective. With continuous covariates, the matched pairs generally remain inexact, which contributes to bias in downstream analysis. Its key theoretical properties, such as the resulting imbalance between matched pairs and when it is negligible to support valid inference, remain unclear. In this paper, we analyze one-to-one matching based on $d$-dimensional, continuous covariates with a quadratic covariate-distance objective. First, we find that when $d\leq 3$, under standard conditions on the propensity score ensuring abundant control samples near each treated sample, the imbalance (difference between within-group averages) is root-$n$ negligible uniformly over the family of smooth functions with a common first- and second-order derivative bound. However, such balance is subject to a dimension restriction, as we construct examples in which the imbalance is root-$n$ non-negligible when $d=4$ and dominates root-$n$ rate when $d>4$. Second, we show that when $d\leq 3$, the matched design allows valid Wald-type and bootstrap inference for the average treatment effect on the treated, distributional treatment effects, and quantile treatment effects. Thus, the same outcome-blind matched design supports various downstream inferences without having to tailor the design to the targets. Finally, paired randomization inference based on the matched design is asymptotically valid in the super-population sense for $d\leq 3$ but can fail when $d=4$. We corroborate the theoretical results with numerical experiments.

Markov chain Monte Carlo (MCMC) methods are the standard tool for computing expectations under complex probability distributions. Control variates reduce the variance of the resulting estimates, but a good control variate requires solving the Poisson equation of the sampler, which rarely admits a closed-form solution. Exact solutions are available when the sampler's kernel has a known spectral decomposition on a simple reference density. In our work, we extend these solutions to general targets through a learned change of variables. A bijection, such as a normalizing flow, is trained so that the target becomes close to the reference in a latent space, and we show that Markov kernels and their Poisson solutions are transformed by any bijection. Running such samplers in the latent space then yields explicit control variates, and the estimator is consistent under mild tail conditions on the map and target. Importance sampling (IS) from the flow is the limiting case of the same construction and the control variates apply to it as well. Experiments on synthetic targets and real posteriors compare the procedure against state-of-the-art samplers and control variates.

Many treatments have effects that plausibly vary by latent classes. For example, the effect of personalized video recommendations may be stronger for users who seek a new discovery than for users seeking to rewatch something familiar. In the context of user journeys on digital platforms, we can conceptualize user moods as dynamic latent states that lead to distinct action distributions. Because mood is unobserved, we infer it from a user's pre-treatment actions using a hidden Markov model (HMM), and then leverage the latent state as an interpretable treatment effect modifier when evaluating experiment results. Under a treatment-effect sufficiency assumption, each observable conditional effect is a known mixture of the latent effects, so state-specific effects are identified when state posteriors are sufficiently heterogeneous. We propose an estimator that is Neyman-orthogonal to errors in the fitted HMM, enabling standard influence-function confidence intervals. In a real-world large-scale A/B test of a new recommendation model at Netflix, our latent-state analysis reveals that heavy-engagement users show significantly positive effects across all treatment variants, with limited evidence of benefit among less-active and rewatch-oriented users.

Spatial modelling and inference arise across many areas of science and engineering, with Kriging and Gaussian process (GP) regression serving as two widely used predictive models. Although grounded in the same random field theory, these approaches are often treated in isolation. As a result, their connection has been obscured by differences in terminology, notation, and practical implementation. This separation largely reflects their independent development within geostatistics and machine learning, respectively. To bridge this methodological divide, this work establishes a unified mathematical framework that connects the two paradigms. The underlying assumptions and formulations of each approach are detailed and compared within this framework. This comparison highlights their differences while clarifying the connections between them. The resulting perspective provides practitioners with a common foundation for translating concepts and methods between geostatistics and machine learning. In particular, it makes methodological developments in either field more accessible to the other, including advances in uncertainty quantification from the GP literature.

Compressing a matrix for reconstruction still defaults to the truncated SVD, approximating the data with a single low-rank structure. It is common to reduce the residual further by adding an overlapping row-sparse component, but methods that solve this joint problem often require iterative solvers and tuning of regularization parameters. We propose the Disjoint Row-Sparse plus Low-Rank (D-SLR) decomposition, a closed-form drop-in for the truncated SVD that improves or exactly matches it. D-SLR restricts rows to either being stored verbatim or approximated by the low-rank fit, never both. Under squared error this restriction costs nothing: the joint optimum is attainable disjointly with fewer parameters at every non-trivial rank and stored row count (shape). With zero stored rows D-SLR reduces to the truncated SVD, so it never does worse at equal cost. The algorithm scores the entire error-versus-parameters tradeoff, and the solution is chosen afterwards by a supplied error target or parameter count, or by a selection rule. The grid and solution together cost three SVDs, with no tuning or regularization. We derive an assumption-free, a-posteriori lower bound on the error at every shape, giving each solution a computable certificate on the potential gain of any other choice of rank and stored rows. Experiments on synthetic and real data (LLM embedding tables, network traffic, hyperspectral images) confirm the gains and quantify the certificate.

Road safety programs count the coded fields of police crash records, while the officer's narrative, which often records factors the fields omit, is rarely read. A safety office thus cannot tell how much its counts miss or where to review. This study develops and evaluates a system that joins both views of the 5,601,890 Texas crashes from 2017 to 2025 into population estimates with stated validity. An in-context tabular foundation model, Kumo Tabular, reads the coded record of every crash, a calibrated System One model, Jev, reads the narratives of two probability samples, and human judgments recalibrate its probabilities. A multiwave predict-then-debias estimator joins the three tiers, and a second human tier drawn with recorded probabilities checks the estimates by design. For hydroplaning, medical episodes, fatigue, animals, and phone use, the narrative documents more injury crashes than the coded field, 15,074 against 7,340 for phone use, and the human check agrees with all fifteen estimates within its margin. A re-read list ranked by Kumo Tabular finds confirmed discordance 7 to 58 times as often as random reading. At the planning cost of human coding, one further round of human judgments would cut the root mean square relative half-width from 22.0 to 16.2 percent, against 21.2 for reading every narrative. Two calibrated readers of different views, joined by a sampling design, give a safety office counts, a discordance map, a validated re-read list, and a reading budget, with Kumo Tabular reading the table at 15 times the speed of TabPFN 3.5.

When resources are limited in a randomized trial, a common strategy is to augment data from the control arm with external controls. We propose a hybrid group sequential Bayesian design that uses this approach to compare time-to-event distributions. The design allows between-treatment effects to differ between patient subgroups, and adaptively combines subgroups that have similar hazard functions. The aim is to reduce the control arm sample size without compromising the validity of comparative inferences due to systematic trial-versus-external data differences. The model borrows external control data dynamically by using a self-adapting mixture prior, which is a weighted average of a non-informative prior and an informative prior constructed from the external controls. The amount of borrowing is proportional to the agreement between the randomized and external controls. At each interim analysis, the design compares the treatments in each subgroup, and if inferiority or superiority is concluded stops accrual for that subgroup. Simulations show that the proposed design outperforms other methods for incorporating external control data in a randomized trial, and improves efficiency.