Problem

The project has a concrete, externally-verifiable optimization problem that has resisted five fundamentally different strategies over a decade: quasi-random grid search with a closed-form likelihood approximation, MCMC with absorbing boundaries, neural-network surrogates, temporal-difference learning on the pricing recursion, and value-function iteration on a discretized state space. This note presents the problem in a form that the optimization research community can engage with without needing to understand the economics: a 54-dimensional constrained stochastic maximum likelihood instance arising from a Markov-switching rational-expectations model of commercial real estate prices.

Key idea

The CRE estimation task is recast as a benchmark instance for derivative-free, constrained, stochastic optimization research. The note gives an operational “interface” that a black-box solver sees (box-bounded , seven implicit feasibility constraints each with a continuous margin function, a noisy objective with three fidelity levels, CRN support), together with the empirical record of twelve systematic experiments and a characterization of what has and has not worked.

Method

  • Decision variable. with simple box bounds ; the reduction from 55 raw parameters to 54 is via the IS-stationarity constraint, which gave a 70,350× gradient- conditioning improvement (see coupled-riccati-recursions-regime-switching-asset).
  • Objective. Noisy oracle returning an estimate of under a Rao-Blackwellized particle filter over a quarterly panel of observations; piecewise-smooth under CRN.
  • Noise taxonomy. Fresh per call → std ≈ 217 nats; CRN with per-eval MC rebuild → std ≈ 2 nats; CRN with cached MC lookup → deterministic but biased (+5269 nats under a fixed lookup).
  • Three fidelity levels. (Hamilton-Kim + BC Riccati, 0.9 ms, rank correlation with the benchmark objective), (Hamilton + MC cap rates , 2.2 s, ), and the full evaluation (per-eval MC rebuild, paths, horizon , 5.2 s on 8 threads).
  • Seven implicit constraints with continuous margins : box constraints (), determinant barrier (, smooth algebraic surface), ordering inequalities (, linear half-spaces), RE fixed-point existence / spectral radius (, combining Cho–Moreno forward-iteration convergence with Kronecker-product spectral radius gaps — see forward-method-rational-expectations, forward-convergence-condition), risk-neutral stability (, at the current best point , within 0.5% of the boundary), coupled Riccati convergence / no-bubble condition (, log-price-growth rate — see no-bubble-condition, spectral-radius-test-markov-pricing-operator), and a long-run variance positive-definiteness condition ().
  • Available surrogates. A GBT feasibility classifier with AUC 0.997 at 0.01 ms per query (ratio 130× faster than the Boolean oracle); three objective-fidelity levels above.

Results

  • Feasible volume fraction: of the prior box.
  • Feasible at Euclidean distance from the current best known point: 62%. At : 1.9%. At : 0% (of 10,000 draws). The feasible set is locally dense near good points but has a very small global measure.
  • 225 multi-start runs yielded 225 distinct terminal basins (no detected convergence to a common point), indicating either severe multi-modality or a flat manifold of near-optima.
  • NLL at the DGP parameter value on the simulated panel: .
  • Best NLL achieved at time of writing: (this note reflects the state before the recent arc; as of 2026-04-12 the incumbent is ep06c_polished at SEM at , closing most of that gap — see exp-07-optarch-10-restart-allocation-incumbent).
  • BOBYQA dominates for noisy MC objectives in 54-D; L-BFGS fails (gradient cost prohibitive under per-eval MC rebuild); NelderMead stagnates; MCMC rejects too often at the feasibility boundary.

Limitations

  • Benchmark reference only. The note is not itself a research claim about the CRE model or its identification; its role is to expose the problem to external reasoners who may have better tools than the ones tried to date.
  • Sample-specific optimum. On the simulated panel, the sample MLE sits 154 nats below the DGP parameter value at — the optimum is panel- specific, not DGP-specific. The benchmark treats the DGP NLL as a reference point, not as a claim about the global minimum.
  • Noise taxonomy is protocol-dependent. Standard deviations reported at the current best; they change across the feasible set, and they are qualitatively different on cached vs per-eval MC rebuild.
  • at 0.96 rank correlation is not trustworthy for final polishing. The Hamilton filter ignores cap rates and therefore produces an 1572-nat systematic gap vs the RBPF objective — useful for screening only.

Open questions

  • Can a derivative-free optimizer exploit the known structure of and (spectral-radius-of-Kronecker-product sublevel sets) rather than treating feasibility as a black box?
  • Is there a structured multi-fidelity scheme that avoids the rank-correlation collapse at the ~5-nat scale where the and full objective stop agreeing?
  • What is the right way to handle the 154-nat displacement between the sample MLE and the DGP? Is it finite-sample overfit (, ), weakly identified nuisance directions absorbing sample noise, or a residual objective-DGP mismatch?
  • Does the label-symmetry / gap-of-gaps idea reliably classify a candidate terminal basin as a false basin vs a real local optimum?

My take

This is the paper form of the project’s central optimization pain point, packaged as an invitation. It consolidates the empirical lessons of the twelve recent experiments — most of them ingested as wiki experiments under this init (see exp-11-curvature-incumbent-scaled-diagnostic, exp-12-online-asymptotic-onset-detection, exp-10-hybrid-tail-cache-theta-only, exp-09-adaptive-tail-splice-mc-pricing, exp-07-optarch-10-restart-allocation-incumbent, basin-finder-complete-program-summary, sim-recovery-experiment-local-global) — into a single self-contained benchmark specification. The companion synthesis document design-brief-global-optimization-pipeline is a longer internal brief for the same audience, with more CRE-model context.

It is also the natural target of the global-optimization-pipeline-msre-cre research idea: once the pipeline is formalized, this note is the artifact against which it is benchmarked.