arXiv — cs.AI preprintsInternational8 October 2026
One-Shot Localisation of the Global Minimum of a Noisy One-Dimensional Function: An Iterative Neural Minimizer Compared with Set Transformers and Classical Estimators
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2604.03614v4 Announce Type: replace-cross Abstract: We study a passive form of global optimisation: from twenty noisy samples of an unknown one-dimensional function, predict where its global minimum lies, with no further queries. We introduce the Neural Function Minimizer (NFM), an iterative model that walks a position across the domain and, at every step, reads the samples near that position and attends to all twenty of them, and we compare it with two Set Transformers of the same size trained on the same data, one that answers with a single point and one that answers with a mixture of
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- COMPASS: Finding Where Reasoning Lives in Language Models8 October 2026
- Decoupled Multi-Agent Orchestration8 October 2026
- OTel: Open Telco AI Datasets, Benchmarks, and Models8 October 2026
- Comparative review of hybrid forecasting models for short-term prediction of building thermal load8 October 2026
- Dynamical low-rank equilibrium computation for stochastic games between advanced persistent threats and moving target defense8 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.