Optimal Null-Constrained Source-Basis Sensing in a Time-Reversed Young Interferometer

• URL: http://arxiv.org/abs/2604.10320v1
• Date: Sat, 11 Apr 2026 18:54:36 GMT
• Title: Optimal Null-Constrained Source-Basis Sensing in a Time-Reversed Young Interferometer
• Abstract summary: We develop a theory of null-constrained parameter estimation in a time-reversed Young (TRY) interferometer.<n>We show how to design source patterns that enforce a true metrological null while preserving finite first-order sensitivity to the parameter.<n>These findings identify source-basis null engineering as a distinct and practically viable modality for derivative-mode sensing.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We develop a general theory of null-constrained parameter estimation in a time-reversed Young (TRY) interferometer, where measurement is performed through programmable source-basis encoding with a fixed detector. We address the fundamental question of how to design source patterns that enforce a true metrological null -- vanishing nominal response at the operating point -- while preserving finite first-order sensitivity to the parameter. Under a general shot-noise-limited channel model, we show that the optimal null-constrained receiver is obtained by projecting the derivative response onto the subspace orthogonal to the nominal background in the inverse-noise metric. This yields a constructive solution in which the optimal source-basis code is given by the inverse-noise-weighted derivative response with its background-parallel component removed. We further derive an exact and universal information-retention law: the locally accessible Fisher information is reduced by a factor $1-χ^2$, where $χ$ quantifies the inverse-noise overlap between the nominal and derivative response vectors. This result establishes a precise geometric interpretation of the cost of null enforcement. Numerical examples demonstrate the null-coded TRY receivers can retain nearly the full local information and can be accurately implemented using binary and positive-only source patterns. These findings identify source-basis null engineering as a distinct and practically viable modality for derivative-mode sensing, with implications for superresolution metrology and programmable optical measurement architectures.

Related papers

• Overfitting Mitigation via Singular Value Decomposition in Minimum Bayes Risk Decoding [53.9009465845701]
  We introduce SVD-MBR, which frames the pairwise utility matrix as a noisy information signal.<n> Experiments demonstrate that SVD-MBR successfully regularizes decoding, yielding substantial gains across a range of generalized metrics.
  arXiv  Detail & Related papers  (2026-09-01T12:11:29Z)
• Reconstructing Backpropagation from Forward Fluctuations in Noise-modulated Neural Networks [0.0]
  Noise-modulated Neural Network (NNN) learns and infers only in the presence of noise treating noise as a computational resource rather than a disturbance.<n>We show that backpropagation itself can be reconstructed in the NNN from forward-pass statistics alone.
  arXiv  Detail & Related papers  (2026-07-29T05:18:34Z)
• Differential source-basis encoding for superresolved parameter estimation in a time-reversed Young interferometer [0.0]
  We develop a differential source-encoding protocol for local parameter estimation in a time-reversed Young interferometer.<n>In the local regime, the differential signal separates naturally into an envelope-gradient term, which is also present in noninterferometric differential sensing.<n>This decomposition identifies the physical origin of the interferometric advantage and clarifies why it is regime dependent rather than universal.
  arXiv  Detail & Related papers  (2026-03-28T21:05:36Z)
• Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation [32.357350666094156]
  We introduce a tuning-free estimator of $textOT_c(, hat)$ that utilizes the semi-dual OT functional and, remarkably, requires no OT solver.<n>This framework unlocks significant computational and statistical advantages in practice.<n> Numerical experiments demonstrate that our geometry-aware pipeline effectively mitigates the discretization error bottleneck.
  arXiv  Detail & Related papers  (2026-02-04T08:56:28Z)
• Robust Noise Attenuation via Adaptive Pooling of Transformer Outputs [0.0]
  This work considers problems where a subset of the input vectors contains requisite information for a downstream task (signal) while the rest are distractors (noise)<n>Standard methods used to aggregate transformer outputs, AvgPool, MaxPool, and ClsToken, are vulnerable to performance collapse as the signal-to-noise ratio (SNR) of inputs fluctuates.<n>We show that an attention-based adaptive pooling method can approximate the signal-optimal vector quantizer within derived error bounds for any SNR.
  arXiv  Detail & Related papers  (2025-06-10T20:18:32Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• On the Wasserstein Convergence and Straightness of Rectified Flow [54.580605276017096]
  Rectified Flow (RF) is a generative model that aims to learn straight flow trajectories from noise to data.<n>We provide a theoretical analysis of the Wasserstein distance between the sampling distribution of RF and the target distribution.<n>We present general conditions guaranteeing uniqueness and straightness of 1-RF, which is in line with previous empirical findings.
  arXiv  Detail & Related papers  (2024-10-19T02:36:11Z)
• Transformer Meets Boundary Value Inverse Problems [4.165221477234755]
  Transformer-based deep direct sampling method is proposed for solving a class of boundary value inverse problem. A real-time reconstruction is achieved by evaluating the learned inverse operator between carefully designed data and reconstructed images.
  arXiv  Detail & Related papers  (2022-09-29T17:45:25Z)
• Learnable Cost Volume Using the Cayley Representation [67.19770048548232]
  We propose a learnable cost volume (LCV) for optical flow estimation models. The proposed LCV is a lightweight module and can be easily plugged into existing models to replace the vanilla cost volume. Experimental results show that the LCV module not only improves the accuracy of state-of-the-art models on standard benchmarks, but also promotes their robustness against illumination change, noises, and adversarial perturbations of the input signals.
  arXiv  Detail & Related papers  (2020-07-21T01:59:36Z)
• One-Bit Compressed Sensing via One-Shot Hard Thresholding [7.594050968868919]
  A problem of 1-bit compressed sensing is to estimate a sparse signal from a few binary measurements. We present a novel and concise analysis that moves away from the widely used non-constrained notion of width.
  arXiv  Detail & Related papers  (2020-07-07T17:28:03Z)
• Neural Control Variates [71.42768823631918]
  We show that a set of neural networks can face the challenge of finding a good approximation of the integrand. We derive a theoretically optimal, variance-minimizing loss function, and propose an alternative, composite loss for stable online training in practice. Specifically, we show that the learned light-field approximation is of sufficient quality for high-order bounces, allowing us to omit the error correction and thereby dramatically reduce the noise at the cost of negligible visible bias.
  arXiv  Detail & Related papers  (2020-06-02T11:17:55Z)
• Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors [52.06292503723978]
  Motivated by advances in compressive sensing with generative models, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d.Gaussian measurements. We demonstrate that the Binary $epsilon$-Stable Embedding property, which characterizes the robustness of the reconstruction to measurement errors and noise, also holds for 1-bit compressive sensing with Lipschitz continuous generative models.
  arXiv  Detail & Related papers  (2020-02-05T09:44:10Z)

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.