arXiv preprints from January 1, 2026 through September 23, 2026 — 19:08:40 EST
Functional clustering is an important tool for identifying latent heterogeneity in functional data and has been widely applied across various scientific fields. However, many existing methods are not fully adaptive, as they may require the number of clusters to be prespecified and may lack automatic control over the smoothness of the...
A continuous clinical measurement recorded in fixed physical units may have different prognostic meaning across patients when its effect depends on a patient-level modifier. For example, the same tumor diameter may imply markedly different prognosis in an infant and an adult, because patient size can modify its prognostic effect. We...
In resin transfer moulding, complete saturation of the fibre preform is necessary before the resin front reaches the outlet vent(s), to prevent dry-spot formation. In practice, the flow front rarely advances uniformly due to race-tracking effects. We propose a combined estimation and control strategy to address this issue. We use...
Deployed decisions are often optimized once and retained because updates impose operational, regulatory, or switching costs. As operating conditions change, when should such decisions be re-optimized? We study this question for stochastic optimization when the objective's functional form is known but the decision maker's trade-offs...
Whether the risk of death keeps climbing at extreme ages or levels off has divided researchers for a century. We show this conflict reflects a moving target. Using cohort data from twelve low-mortality populations, we find that mortality deceleration and plateau onset shift steadily later across cohorts born from the mid-19th to the...
Physics-informed neural networks (PINNs) often face ill-conditioned objectives that limit high-accuracy training. Dense quasi-Newton methods improve local conditioning but require expensive optimizer state, while Kronecker-factored methods such as SOAP scale to larger networks but rely on periodic basis updates. We introduce \method,...
Industrial recommenders give new content initial views through budgeted exploration, then use early performance to decide further delivery. On many short-video platforms, exploration is the primary way new videos reach viewers. Viewer-side tests measure consumption; the published budget objectives we review omit creator response. We...
A new approach to robust estimation in generalized linear models is introduced. The idea of the method is to first transform the responses applying the composition of the normal quantile function and the probability integral transformation. Then, using that the transformed responses should follow a standard normal distribution, find...
Kernel density estimation (KDE) is one of the most fundamental statistical estimators of density functions. Its direct implementation on a dataset of $N$ points incurs an $\mathcal{O}(N^{2})$ computational cost, which is prohibitive for large-scale datasets. Kernel approximation techniques can be applied to bring the computational...
Varmapack is a software package for efficient, exact simulation of VARMA time series without a burn-in period. For stationary models, Varmapack can generate initial states and innovations from their joint stationary distribution. Alternatively, the user can supply initial states, in which case innovations are generated from their...
The Bayes factor (BF) is a central tool in Bayesian hypothesis testing and model selection, yet its practical use is often challenged. Classical BFs depend heavily on prior specification, cannot be applied with improper priors, and are typically interpreted through arbitrary evidence scales. Moreover, they fail to capture uncertainty...
We study the empirical Sinkhorn estimator of the entropic optimal transport potentials under the uniform loss. Since the potentials are only unique up to additive constants, we measure the error using the quotient supremum norm, defined as $d_\infty([u],[v]) = \inf_{a\in\mathbb{R}}\|u-v-a\|_\infty$. For a fixed regularization...
While modern generative models excel at modeling complex data, precise inference-time control in conditional generation remains a critical challenge. Classifier-free guidance (CFG) is a primary mechanism for such control, yet it is typically treated as a static tuning parameter. In flow-based models, however, the guidance scale...
We consider the problem of feature selection in linear models with finite-sample control of the false discovery rate (FDR). While existing knockoff-based methods control the directional FDR, which penalises incorrect sign estimates, they do not target discoveries in a pre-specified direction, and their knockoff constructions are...
We determine the sharp restricted isometry threshold for recovery at global minima of the rank-restricted matrix LASSO. For target rank $r_{\star}$, if the rank-$k$ RIP constant satisfies $δ<δ_{\mathrm{sharp}}(k/r_{\star})$, where $δ_{\mathrm{sharp}}(t)=t/(4-t)$ for $0<t<4/3$ and $δ_{\mathrm{sharp}}(t)=\sqrt{(t-1)/t}$ for $t\ge4/3$,...
Causal representation learning (CRL) aims to recover latent causal variables and their structural relations from high-dimensional observations. Existing CRL methods typically assume that all environments are defined over the same latent variables, or at least share a common latent representation space. We study a fragmented...
We study a class of product-reference diffusion algorithms for sampling from a discrete distribution. We show that their sampling performance can be characterized using a path-based measure of data geometry that we call the interaction growth complexity (IGC). We show that a bivariate IGC kernel gives an exact representation of both...
Cluster randomized trials (CRTs) can exhibit informative cluster sizes (ICS) where cluster size is associated with outcomes and/or treatment effects. Under ICS, the individual and cluster-average treatment effects (iATE, cATE) can diverge, and the conventional linear mixed-effects model (LMM) and generalized estimating equation (GEE)...
Modeling multivariate extremes using a geometric perspective leverages the shape of the multivariate point cloud to make inference on joint tail probabilities. While the original statistical framework for geometric extremes was fully parametric, relying on a gauge function that uniquely defines the shape for a given density, newer...
Prognostic factor evaluation and prediction model development are central to precision oncology, enabling patient risk stratification and individualized treatment selection. Unified predictions that synthesize information from existing models are valuable for comprehensive and consistent risk assessment. Many studies also seek to...
Curve fitting for physical, biological, and engineering data typically forces a choice between interpretable but rigid parametric forms and flexible but physically opaque smoothers. This paper introduces the Growth-Decay Curve (GDC), a physics-informed basis derived as the product of a lognormal growth cumulative distribution function...
We study nonzero-frequency phase-locked motions in asymmetrically coupled Kuramoto networks. Such motions are relative equilibria with fixed phase differences and a nonzero common angular velocity, and we call them dancing equilibria. Their existence requires all coupling sums to have the same nonzero value. We show that neither...
Safety-critical optimization applications, such as real-time power system operation, maintain feasibility at every intermediate step, not merely at convergence. Existing approaches either violate constraints mid-solve (interior-point methods) or enforce feasibility through per-instant quadratic programming subproblems with cubic...
The average performance of FirstFit online coloring on trees in the random order model is completely determined in recent works of Frei et al. and Bosek et al., showing $Θ(\log n /\log\log n)$ number of colors, improving the $Θ(\log n)$ colors in the adversarial model. We provide a few further results on slightly more general graph...
In this paper, we use completed root views to study measure sofic entropy of Poisson actions of locally compact sofic groups. We prove that, for every noncompact locally compact second countable sofic group and every locally compact sofic approximation, each positive-intensity Poisson action has completely positive measure sofic...