Retrospective Orthogonal Design: Response-Surface Reconstruction from Observational Data

• URL: http://arxiv.org/abs/2607.26219v1
• Date: Tue, 28 Jul 2026 19:46:40 GMT
• Title: Retrospective Orthogonal Design: Response-Surface Reconstruction from Observational Data
• Abstract summary: We introduce Retrospective Orthogonal Design (ROD), which reconstructs conditional mean surfaces on a probability-balanced lattice.<n>Across 6,480 simulation conditions spanning nine data-generating processes, ROD matched or exceeded regression in five processes and performed strongest on threshold, sign-interaction, and localized surfaces.
• Score: 39.81551870349453
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Regression estimates from observational data can depend on specification under multicollinearity, while sequential sums of squares (SS) depend on term order. We introduce Retrospective Orthogonal Design (ROD), which reconstructs conditional mean surfaces on a probability-balanced lattice. ROD preserves observed cell means, completes unsupported cells, applies weighted tensor-product contrasts, and evaluates the reconstructed surface through piecewise-affine interpolation over Freudenthal polyhedra. Resolution and completion are selected jointly by validation among rank-admissible candidates, followed by refitting and evaluation on an untouched test set. For an admissible lattice, $\mathbf{X}^{\top}\mathbf{W}\mathbf{X}=c\mathbf{I}$, yielding specification-invariant contrast effects and unique, order-independent SS within the retained contrast space. Response-free projection calibration maps the fixed reconstruction onto a declared scientific basis and corrects finite-resolution recovery loss. Across 6,480 simulation conditions spanning nine data-generating processes, ROD matched or exceeded polynomial regression in five processes and performed strongest on threshold, sign-interaction, and localized surfaces. For the quadratic-interaction process, mean out-of-sample $R^2$ differed by only $0.0001$, while calibrated coefficient bias remained small across prespecified targets. A Rao-based information adjustment provides dependence-aware sample-size guidance for ROD planning. In a weighted Mincer application, ROD produced the highest out-of-sample $R^2$ point estimate, with substantial interval overlap with polynomial regression, and provided exhaustive SS allocations invariant to term-entry order.

Related papers

• Phase Transition in Binary Compressed Sensing via Annealing with Adaptive Regularization [0.7734726150561088]
  Regularization choice changes the recovery phase diagrams of binary compressed sensing.<n>We develop a regularization-selection method that combines systematic parameter search with random forest regression.
  arXiv  Detail & Related papers  (2026-09-15T06:35:58Z)
• Response Renormalization for Critical Deep Equilibrium Models [0.0]
  Training through implicit differentiation requires solving an adjoint system built from the residual Jacobian.<n>We introduce Response Renormalization, a backward-pass framework that lifts selected near-pole denominators while leaving unlifted response channels unchanged.<n>We derive dense and matrix-free collective formulations, distinguish exact gradients of a modified frozen-anchor residual from backward-response surrogates, and extend the construction to Structured Implicit Layers and Vector Attractors.
  arXiv  Detail & Related papers  (2026-08-24T18:10:30Z)
• Causal Discovery in Equal Variance Linear Gaussian DAGs via SURE-Tuned Ridge Regression [18.884190660925444]
  SURE-Ridge is a non-iterative, closed-form estimator for equal variance linear Gaussian SEM.<n>It achieves the lowest structural Hamming distance in the small-sample regime and the lowest run time across all sample sizes tested.
  arXiv  Detail & Related papers  (2026-08-17T21:07:06Z)
• Looped SSMs: Depth-Recurrence and Input Reshaping for Time Series Classification [50.994194925685434]
  We show that a looped SSM with $k$ parameters iterated $L$ times consistently closely matches or outperforms a standard SSM.<n>We also show that input reshaping is an equally neglected design axis.
  arXiv  Detail & Related papers  (2026-05-15T15:18:12Z)
• QuadNorm: Resolution-Robust Normalization for Neural Operators [41.429437803093485]
  We introduce a quadrature normalization family that replaces existing uniform averaging in normalization layers with numerical quadrature: QuadNorm and BlendQuadNorm.<n>On endpoint-inclusive uniform grids, the proposed quadrature moments are $O(h2)$-consistent across discretizations.<n>A transfer-error bound then predicts how normalization-induced mismatch scales with both the resolution gap and network depth.
  arXiv  Detail & Related papers  (2026-05-08T07:30:43Z)
• Simulation-Based Inference via Regression Projection and Batched Discrepancies [1.9435397960631862]
  We analyze a lightweight simulation-based inference method that infers simulator parameters using only a regression-based projection of the observed data.<n> Experiments on a tractable nonlinear model and on a cosmological calibration task using the DREAMS simulation suite illustrate the computational advantages of regression-based projections.
  arXiv  Detail & Related papers  (2026-02-03T15:07:40Z)
• Finite-Sample Inference for Sparsely Permuted Linear Regression [6.2000582635449994]
  We develop a general statistical inference framework on the permutation and regression coefficients.<n>For computational purposes, we develop a linear assignment problem computable in time and demonstrate that, with high probability, the solution is equivalent to that of the conventional least squares with large computational cost.
  arXiv  Detail & Related papers  (2026-01-21T11:00:47Z)
• Phase-space entropy at acquisition reflects downstream learnability [54.4100065023873]
  We propose an acquisition-level scalar $S_mathcal B$ based on instrument-resolved phase space.<n>We show theoretically that (S_mathcal B) correctly identifies the phase-space coherence of periodic sampling.<n>$|S_mathcal B|$ consistently ranks sampling geometries and predicts downstream reconstruction/recognition difficulty emphwithout training.
  arXiv  Detail & Related papers  (2025-12-22T10:03:51Z)
• Stochastic Poisson Surface Reconstruction with One Solve using Geometric Gaussian Processes [48.72107407035312]
  We apply geometric Gaussian processes to combine techniques and surface reconstruction into a single stage.<n>The resulting reconstructed surface samples can be queried locally in space, without the use of problem-dependent volumetric meshes or grids.<n>Results show that our approach provides a cleaner, more-principled, and more-flexible surface reconstruction pipeline.
  arXiv  Detail & Related papers  (2025-03-24T20:47:51Z)
• Rao-Blackwell Gradient Estimators for Equivariant Denoising Diffusion [55.95767828747407]
  In domains such as molecular and protein generation, physical systems exhibit inherent symmetries that are critical to model.<n>We present a framework that reduces training variance and provides a provably lower-variance gradient estimator.<n>We also present a practical implementation of this estimator incorporating the loss and sampling procedure through a method we call Orbit Diffusion.
  arXiv  Detail & Related papers  (2025-02-14T03:26:57Z)
• Intrinsic Gaussian Process Regression Modeling for Manifold-valued Response Variable [6.137918306133745]
  We propose a novel intrinsic Gaussian process regression model for manifold-valued data.<n>We establish the properties of the proposed models, including information consistency and posterior consistency.<n> Numerical studies, including simulation and real examples, indicate that the proposed methods work well.
  arXiv  Detail & Related papers  (2024-11-28T08:27:59Z)
• Multivariate root-n-consistent smoothing parameter free matching estimators and estimators of inverse density weighted expectations [51.000851088730684]
  We develop novel modifications of nearest-neighbor and matching estimators which converge at the parametric $sqrt n $-rate.<n>We stress that our estimators do not involve nonparametric function estimators and in particular do not rely on sample-size dependent parameters smoothing.
  arXiv  Detail & Related papers  (2024-07-11T13:28:34Z)
• Polynomial-Time Solutions for ReLU Network Training: A Complexity Classification via Max-Cut and Zonotopes [70.52097560486683]
  We prove that the hardness of approximation of ReLU networks not only mirrors the complexity of the Max-Cut problem but also, in certain special cases, exactly corresponds to it. In particular, when $epsilonleqsqrt84/83-1approx 0.006$, we show that it is NP-hard to find an approximate global dataset of the ReLU network objective with relative error $epsilon$ with respect to the objective value.
  arXiv  Detail & Related papers  (2023-11-18T04:41:07Z)
• Sparse Representations of Positive Functions via First and Second-Order Pseudo-Mirror Descent [15.340540198612823]
  We consider expected risk problems when the range of the estimator is required to be nonnegative. We develop first and second-order variants of approximation mirror descent employing emphpseudo-gradients. Experiments demonstrate favorable performance on ingeneous Process intensity estimation in practice.
  arXiv  Detail & Related papers  (2020-11-13T21:54:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.