Forecasting Without Full Identification: Reliability and Computational Cost in Clot-Growth Simulation
Lennon J. ShikhmanLily DiPauloYing QianHe Li
Oct 2026
Machine Learning
Abstract
We forecast clot growth from sparse early measurements with incomplete biochemical information. Using 1,000 simulated trajectories, we compare inverse search, which weights candidate inputs by their agreement with early observations, with a direct multilayer perceptron (MLP) predicting future clot size. Inverse search is more accurate when tissue factor alone, or tissue factor and fibrinogen, are unknown. When all five inputs are unknown, direct prediction achieves 2.16% pooled relative $L_2$ forecast error, outperforming search with 8,192 candidates using a forward MLP (3.25%) or latent neural ordinary differential equation model (3.36%). A conditional error bound separates candidate disagreement, weight on poor early fits, surrogate error, and candidate coverage. Increasing randomized quasi-Monte Carlo candidate budgets from 512 to 32,768 reduces numerical variation. A covariance score ranks additional assays by expected forecast value while accounting for measurement noise. At 10% range-scaled assay noise, incorporating assay uncertainty reduces forecast error from about 5% to below 3% for both surrogates. An independent reaction cascade verifies candidate integration against tensor quadrature, with mean normalized forecast-integration error below $10^{-5}$ at 32,768 candidates. These results demonstrate accurate clot-growth forecasting without full biochemical identification and support selecting prediction strategies and additional measurements according to accuracy, reliability, and computational cost.
This paper investigates developing real-world perception for active agents, proposes Gibson Environment for this purpose, and showcases a set of perceptual tasks learned therein.
F. Xia, Amir Zamir, Zhi-Yang He et al.· 2018 IEEE/CVF Conference on...· 1,069 citations· ⚡112
The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.
Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al.· Information and Software Tec...· 394 citations· ⚡54
The possibility of inferring high-dimensional data inference in a model that consists of a prior and an auxiliary differentiable constraint given some additional information is considered, thereby allowing a range of potential applications in adapting models to new domains and tasks.
Alexandros Graikos, Esmeralda S. Whitammer, N. Jojic et al.· Neural Information Processin...· 316 citations· ⚡15
It is proved that any global minimizer of the trajectory balance objective can define a policy that samples exactly from the target distribution, and empirically demonstrate the benefits of the trajectories balance objective for GFlowNet convergence, diversity of generated samples, and robustness to long action sequenc...
Esmeralda S. Whitammer, Moksh Jain, Emmanuel Bengio et al.· Neural Information Processin...· 302 citations· ⚡60
An algorithm is proposed which leverages disentangled semantic factors to generate adversarial perturbation by altering controlled semantic attributes to fool the learner towards various "adversarial" targets.
Haonan Qiu, Chaowei Xiao, Lei Yang et al.· arXiv.org· 208 citations· ⚡17
This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.