Papers for

product data teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Simplex lattice method improves merging of language model experts

SLIM: Simplex-Lattice Interpolation Merging

Abstract: Optimizing merging coefficients for large language models can require many costly benchmark evaluations. We propose \textbf{Simplex-Lattice Interpolation Merging (SLIM)}, which constructs a quadratic surrogate of aggregate performance on the coefficient simplex using a classical mixture design. Evaluations of individual experts and equal-weight pairs determine the surrogate with the minimum number of measurements needed to identify a general quadratic on this domain. SLIM then optimizes the surrogate without further target-metric evaluations. Experiments on two model architectures demonstrate accurate prediction of unseen multi-expert mixtures and competitive merge performance under limited evaluation budgets. Matched-budget comparisons show that structured evaluation points improve prediction fidelity over random designs, including those using regularized fitting.

Thu 1 OctMachine Learning
The gist
Combining different experts in large language models to work well together takes many costly tests. The authors propose a method called SLIM that builds a simple quadratic model to predict how well different mixes will perform, using as few tests as possible. This model lets them find the best combination without testing every possibility. Experiments show it predicts results accurately and works better than random testing approaches when test budgets are limited.
Open → 2610.01037v1

Llm simulations reduce costs and sample sizes in hypothesis testing

Augmented Hypothesis Testing with Persona-Based LLM Simulations

Abstract: A/B testing requires large sample sizes, long timelines, and significant costs. When auxiliary predictions of experimental outcomes are available from machine learning models, uncertain prediction quality precludes replacing human experiments entirely, yet these predictions may still contain useful signal. We propose a principled framework for learning-augmented hypothesis testing that leverages predictions of unknown quality to reduce sample sizes while maintaining statistical validity. Predictions naturally vary in granularity, from coarse aggregate signals to fine-grained individual-level estimates, and our framework addresses both ends of this spectrum: (1) for population-level directional predictions, where only a binary signal on the treatment effect sign is available, we use an asymmetric test and prove consistency and robustness bounds within the learning-augmented algorithms paradigm; (2) for individual-level predictions, we introduce Generalized PPI++ (GPPI), extending Prediction-Powered Inference to handle nonlinear prediction errors through higher-dimensional transformations. Both methods benefit from accurate predictions while remaining robust to inaccurate or adversarial ones. We validate our framework using persona-based LLM simulations, where AI agents equipped with user personas predict individual behavior, as a natural prediction source spanning both granularity levels. Experiments on four real-world datasets demonstrate that our methods, combined with persona-based predictions, substantially reduce experimental costs while preserving rigorous statistical validity.

Mon 21 SeptMachine LearningArtificial Intelligence
The gist
Testing whether changes really work, like in A/B tests, usually takes a lot of time and many test subjects. The authors propose a new way to use predictions from AI models, even when those predictions aren’t perfectly accurate, to cut down on how many tests you need while still being confident in the results. They created special math tools that work with both broad predictions about groups and detailed predictions about individuals. They checked their methods using AI agents that simulate different user types and found significant savings in time and cost without losing reliability.
Open → 2609.24629v1