arXiv Statistics ML By Stefano Cortinovis, Laura Battaglia, Fran\c{c}ois Caron

SLICE: Sequential Likelihood-Free Inference via Conformal E-Values

Read the original on arXiv Statistics ML →

SLICE: Sequential Likelihood-Free Inference via Conformal E-Values introduces a method for constructing exact anytime-valid confidence sequences for parameters of scientific models that can be simulated but have intractable likelihoods. The approach uses fresh simulations at each observation to conformalize a positive predictable score into a conditional e-value, whose product forms a test martingale that is inverted over the parameter space. The method is shown to be valid for any score, with the oracle likelihood-ratio score maximizing expected log growth, and is demonstrated on synthetic benchmarks, an audit of model routing in an LLM API, and microlensing data, where the resulting confidence sequences remain valid under continuous monitoring while neural scores remain competitive with exact likelihood ratios and application-specific scores.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Machine Learning
Oct 28

Pro-Active Inference

The paper introduces Pro-Active Inference (PAI), a method for efficiently estimating a population mean when only a subset of outcomes can be observed. PAI proactively selects which observation to label next from a covariate pool, updating machine‑learning predictions online, and provides finite‑sample unbiasedness, asymptotic validity, and an improved variance estimator. Experiments on eight datasets show that PAI outperforms Sequential Active Inference in most settings, while diagnostics reveal when additional adaptivity is beneficial or detrimental.

By Skyler Wu, Yash Nair, Antoine Maechler, Emmanuel J. Cand\`es
arXiv Machine Learning
Oct 19

Predictable Scaling: Efficient Model Exploration via Scaling-Law Prediction

Predictable Scaling (PS) is a framework that uses small‑scale training proxies to forecast full‑scale model performance, reducing the need for expensive GPU‑hourly runs. By applying composable scaling functions and curve fitting with uncertainty estimates, PS can rank candidate changes accurately across different hypothesis types. Experiments on two ranking models show PS achieves 79–88% compute savings while maintaining correct ranking of actionable hypotheses.

By Aishwarya Wesanekar, Sheng-Tao Yang, Jiawei Zhang, Flavio Sales Truzzi, Chen Chen, Nader Beigiparast, Shengyuan Huang, Roshanak Zilouchian Moghaddam, Vitor Cid, Colin Clement, Vinayak Thapliyal, Sebastian Ament, Jihao Andreas Lin, Vincent Huang, Kai Han, Boyi Jiang, Wenlin Chen, Chaorong Chen, Ashwin Kumar, Maximilian Balandat, David Eriksson, Yifei Zhang, Pan Zhong
arXiv Statistics ML
Sep 21

Neural composite likelihood estimation: simulation based inference for time series

Neural Composite Likelihood Estimation (NCLE) extends simulation‑based inference to high‑dimensional time series by partitioning long sequences into equal‑sized batches. For each batch, a neural network estimates the likelihood via conditional density estimation, and the product of these batch likelihoods forms an approximate composite likelihood. Frequentist inference is then performed by maximizing this composite likelihood to obtain a point estimate and by estimating the Godambe information matrix to derive confidence intervals.

By Grace Yan, Mark Beaumont, Dennis Prangle