Search arXivSearch

arXiv subjects

Yanting Ma

Publications and source records attributed to Yanting Ma.

At least 19 recordsLinked to original sources

A Stabilized Path-Space Approach to Diffusion-Based Posterior Sampling

Diffusion models provide expressive data-driven priors for Bayesian inverse problems, but many diffusion posterior samplers rely on heuristic guidance approximations that can fail for nonlinear operators and multimodal posteriors. In this work, we develop a stabilized path-space framework for diffusion-based posterior sampling. Starting from a base diffusion process whose terminal marginal represents the prior, we define a likelihood-weighted target measure on trajectories and cast posterior sampling as learning a controlled stochastic process whose path measure matches this target. This formulation connects diffusion posterior sampling to stochastic optimal control while preserving the Bayesian structure needed for uncertainty quantification. We introduce a time reparameterization that makes the path-space control problem well posed by removing the bias induced by the unknown initial value function, without auxiliary training. We then learn the control via a trust-region path-space optimization method with log-variance objectives. The path-space perspective also unifies our learned control approach with existing guidance-based samplers, quantifies the sampling error induced by approximate controls, and yields importance sampling corrections for asymptotically exact posterior expectations. We evaluate the proposed framework on a suite of benchmark inverse problems with analytically characterized or high-quality reference posteriors, enabling principled assessment of sampling accuracy and uncertainty quantification. These experiments provide insight into the behavior of diffusion-based posterior samplers and demonstrate improved accuracy and robustness over leading approaches.

cs.LG

ProxiCBO: A Provably Convergent Consensus-Based Method for Composite Optimization

This paper introduces an interacting-particle optimization method tailored to possibly non-convex composite optimization problems, which arise widely in signal processing. The proposed method, \emph{ProxiCBO}, integrates consensus-based optimization (CBO) with proximal gradient techniques to handle challenging optimization landscapes and exploit the composite structure of the objective function. We establish global convergence guarantees for the continuous-time finite-particle dynamics and develop an alternating update scheme for efficient practical implementation. Simulation results for signal processing tasks, including signal recovery from one-bit quantized measurements and parameter estimation from single-photon lidar data, demonstrate that ProxiCBO outperforms existing proximal gradient methods and CBO methods in terms of both accuracy and particle-efficiency.

math.OC

Application of Optimal Control to Time-Resolution Protocol for Quantum Sensing

Time-resolution protocol of quantum sensing aims to measure the fast temporal variation of an external field and demands a high field sensitivity in a short interrogation time $\tau$. Since any operation that evolves the quantum state takes time and is counted as part of the interrogation, evaluating the performance of time-resolution protocol requires a complete end-to-end description of the measurement process. In particular, the initial state has to be one of the sensor qubit's eigenstates in the absence of external fields, and the final projective measurements must be performed in the same eigenstate basis. Building upon prior works which proposed limits for time-resolved sensing using a quantum sensor, we apply optimal control theory to optimize the time-resolution protocol. Our analysis indicates that there exists a critical interrogation time $T^*$: when $\tau T^*$ the optimal protocol involves a singular control during the interrogation. In the short-$\tau$ regime, which is relevant to high time resolution, we propose a ``detune protocol'' that involves only smooth control during the entire interrogation. As the discontinuities of control pose the main obstacles to experimental realization, we expect the presented detune protocol to be practically useful. In the long-$\tau$ regime, the optimal protocol closely resembles the Ramsey sequence; protocols based on maximizing Quantum Fisher Information are constructed to highlight the difference between the theoretically optimal and practically implementable measurements. Effective use of the time-resolution protocol requires a setup where the unknown time-domain signal of interest can be identically and repeatedly generated. As a potentially relevant application, we outline the calibration of baseband flux pulse distortion in the control of superconducting qubits.

quant-ph

Free-running vs. Synchronous: Single-Photon Lidar for High-flux 3D Imaging

Conventional wisdom suggests that single-photon lidar (SPL) should operate in low-light conditions to minimize dead-time effects. Many methods have been developed to mitigate these effects in synchronous SPL systems. However, solutions for free-running SPL remain limited despite the advantage of reduced histogram distortion from dead times. To improve the accuracy of free-running SPL, we propose a computationally efficient joint maximum likelihood estimator of the signal flux, the background flux, and the depth using only histograms, along with a complementary regularization framework that incorporates a learned point cloud score model as a prior. Simulations and experiments demonstrate that free-running SPL yields lower estimation errors than its synchronous counterpart under identical conditions, with our regularization further improving accuracy.

eess.SP

Time-optimal single-scalar control on a qubit of unitary dynamics

Optimal control theory is applied to analyze the time-optimal solution with a single scalar control knob in a two-level quantum system without quantum decoherence. Emphasis is \change{placed} on the dependence on the maximum control strength $u_\text{max}$. General constraints on the optimal protocol are derived and used to rigorously parameterize the time-optimal solution. Two concrete problems are investigated. For generic state preparation problems, both multiple bang-bang and bang-singular-bang are legitimate and should be considered. Generally, the optimal is bang-bang for small $u_\text{max}$, and there exists a state-dependent critical amplitude above which singular control emerges. For the X-gate operation of a qubit, the optimal protocol \change{is exclusively} multiple bang-bang. The minimum gate time is about 80\% of that based on the resonant Rabi $\pi$-pulse over a wide range of control strength; in the $u_\text{max} \rightarrow 0$ limit this ratio is derived to be $\pi/4$. To develop practically feasible protocols, we present methods to smooth the abrupt changes in the bang-bang control while preserving perfect gate fidelity. \change{The presence of bang-bang segments in the time-optimal protocol} indicates that the high-frequency components and a full calculation (instead of the commonly adopted Rotating Wave Approximation) are essential for the ultimate quantum speed limit.

quant-ph

Asymptotic behavior of continuous weak measurement and its application to real-time parameter estimation

The asymptotic quantum trajectory of weak continuous measurement for the magnetometer is investigated. The magnetometer refers to a setup where the field-to-estimate and the measured moment are orthogonal, and the quantum state is governed by the stochastic master equation which, in addition to a deterministic part, depends on the measurement outcomes. We find that the asymptotic behavior is insensitive to the initial state in the following sense: given one realization, the quantum trajectories starting from arbitrary initial states asymptotically converge to the {\em same} realization-specific {\em pure} state. For single-qubit systems, we are able to prove this statement within the framework of Probability Theory by deriving and analyzing an effective one-dimensional stochastic equation. Numerical simulations strongly indicate that the same statement holds for multi-qubit systems. Built upon this conclusion, we consider the problem of real-time parameter estimation whose feasibility hinges on the insensitivity to the initial state, and explicitly propose and test a scheme where the quantum state and the field-to-estimate are updated simultaneously.

quant-ph

Application of Pontryagin's Maximum Principle to Quantum Metrology in Dissipative Systems

Optimal control theory, also known as Pontryagin's Maximum Principle, is applied to the quantum parameter estimation in the presence of decoherence. An efficient procedure is devised to compute the gradient of quantum Fisher information with respect to the control parameters and is used to construct the optimal control protocol. The proposed procedure keeps the control problem in the time-invariant form so that both first-order and second-order optimality conditions derived from Pontryagin's Maximum Principle apply; the second-order condition turns out to be crucial when the optimal control contains singular arcs. Concretely we look for the optimal control that maximizes quantum Fisher information for "twist and turn" problem. We find that the optimal control is singular without dissipation but can become unbounded once the quantum decoherence is introduced. An amplitude constraint is needed to guarantee a bounded solution. With quantum decoherence, the maximum quantum Fisher information happens at a finite time due to the decoherence, and the asymptotic value depends on the specific decoherence channel and the control of consideration.

quant-ph

Optimal Control for Quantum Metrology via Pontryagin's principle

Quantum metrology comprises a set of techniques and protocols that utilize quantum features for parameter estimation which can in principle outperform any procedure based on classical physics. We formulate the quantum metrology in terms of an optimal control problem and apply Pontryagin's Maximum Principle to determine the optimal protocol that maximizes the quantum Fisher information for a given evolution time. As the quantum Fisher information involves a derivative with respect to the parameter which one wants to estimate, we devise an augmented dynamical system that explicitly includes gradients of the quantum Fisher information. The necessary conditions derived from Pontryagin's Maximum Principle are used to quantify the quality of the numerical solution. The proposed formalism is generalized to problems with control constraints, and can also be used to maximize the classical Fisher information for a chosen measurement.

quant-ph

Multiview Sensing With Unknown Permutations: An Optimal Transport Approach

In several applications, including imaging of deformable objects while in motion, simultaneous localization and mapping, and unlabeled sensing, we encounter the problem of recovering a signal that is measured subject to unknown permutations. In this paper we take a fresh look at this problem through the lens of optimal transport (OT). In particular, we recognize that in most practical applications the unknown permutations are not arbitrary but some are more likely to occur than others. We exploit this by introducing a regularization function that promotes the more likely permutations in the solution. We show that, even though the general problem is not convex, an appropriate relaxation of the resulting regularized problem allows us to exploit the well-developed machinery of OT and develop a tractable algorithm.

cs.IT

Stochastic optimal control formalism for an open quantum system

A stochastic procedure is developed which allows one to express Pontryagin's maximum principle for dissipative quantum system solely in terms of stochastic wave functions. Time-optimal controls can be efficiently computed without computing the density matrix. Specifically, the proper dynamical update rules are presented for the stochastic costate variables introduced by Pontryagin's maximum principle and restrictions on the form of the terminal cost function are discussed. The proposed procedure is confirmed by comparing the results to those obtained from optimal control on Lindbladian dynamics. Numerically, the proposed formalism becomes time and memory efficient for large systems, and it can be generalized to describe non-Markovian dynamics.

quant-ph

Local Convergence of an AMP Variant to the LASSO Solution in Finite Dimensions

A common sparse linear regression formulation is the l1 regularized least squares, which is also known as least absolute shrinkage and selection operator (LASSO). Approximate message passing (AMP) has been proved to asymptotically achieve the LASSO solution when the regression matrix has independent and identically distributed (i.i.d.) Gaussian entries in the sense that the averaged per-coordinate l2 distance between the AMP iterates and the LASSO solution vanishes as the signal dimension goes to infinity before the iteration number. However, in finite dimensional settings, characterization of AMP iterates in the limit of large iteration number has not been established. In this work, we propose an AMP variant by including a parameter that depends on the largest singular value of the regression matrix. The proposed algorithm can also be considered as a primal dual hybrid gradient algorithm with adaptive stepsizes. We show that whenever the AMP variant converges, it converges to the LASSO solution for arbitrary finite dimensional regression matrices. Moreover, we show that the AMP variant is locally stable around the LASSO solution under the condition that the LASSO solution is unique and that the regression matrix is drawn from a continuous distribution. Our local stability result implies that in the special case where the regression matrix is large and has i.i.d. random entries, the original AMP, which is a special case of the proposed AMP variant, is locally stable around the LASSO solution.

cs.IT

Two-Dimensional Non-Line-of-Sight Scene Estimation from a Single Edge Occluder

Passive non-line-of-sight imaging methods are often faster and stealthier than their active counterparts, requiring less complex and costly equipment. However, many of these methods exploit motion of an occluder or the hidden scene, or require knowledge or calibration of complicated occluders. The edge of a wall is a known and ubiquitous occluding structure that may be used as an aperture to image the region hidden behind it. Light from around the corner is cast onto the floor forming a fan-like penumbra rather than a sharp shadow. Subtle variations in the penumbra contain a remarkable amount of information about the hidden scene. Previous work has leveraged the vertical nature of the edge to demonstrate 1D (in angle measured around the corner) reconstructions of moving and stationary hidden scenery from as little as a single photograph of the penumbra. In this work, we introduce a second reconstruction dimension: range measured from the edge. We derive a new forward model, accounting for radial falloff, and propose two inversion algorithms to form 2D reconstructions from a single photograph of the penumbra. Performances of both algorithms are demonstrated on experimental data corresponding to several different hidden scene configurations. A Cramer-Rao bound analysis further demonstrates the feasibility (and utility) of the 2D corner camera.

eess.IV

On the modes of convergence of Stochastic Optimistic Mirror Descent (OMD) for saddle point problems

In this article, we study the convergence of Mirror Descent (MD) and Optimistic Mirror Descent (OMD) for saddle point problems satisfying the notion of coherence as proposed in Mertikopoulos et al. We prove convergence of OMD with exact gradients for coherent saddle point problems, and show that monotone convergence only occurs after some sufficiently large number of iterations. This is in contrast to the claim in Mertikopoulos et al. of monotone convergence of OMD with exact gradients for coherent saddle point problems. Besides highlighting this important subtlety, we note that the almost sure convergence guarantees of MD and OMD with stochastic gradients for strictly coherent saddle point problems that are claimed in Mertikopoulos et al. are not fully justified by their proof. As such, we fill out the missing details in the proof and as a result have only been able to prove convergence with high probability. We would like to note that our analysis relies heavily on the core ideas and proof techniques introduced in Zhou et al. and Mertikopoulos et al., and we only aim to re-state and correct the results in light of what we were able to prove rigorously while filling in the much needed missing details in their proofs.

math.OC

Analysis of Approximate Message Passing with Non-Separable Denoisers and Markov Random Field Priors

Approximate message passing (AMP) is a class of low-complexity, scalable algorithms for solving high-dimensional linear regression tasks where one wishes to recover an unknown signal from noisy, linear measurements. AMP is an iterative algorithm that performs estimation by updating an estimate of the unknown signal at each iteration and the performance of AMP (quantified, for example, by the mean squared error of its estimates) depends on the choice of a "denoiser" function that is used to produce these signal estimates at each iteration. An attractive feature of AMP is that its performance can be tracked by a scalar recursion referred to as state evolution. Previous theoretical analysis of the accuracy of the state evolution predictions has been limited to the use of only separable denoisers or block-separable denoisers, a class of denoisers that underperform when sophisticated dependencies exist between signal entries. Since signals with entrywise dependencies are common in image/video-processing applications, in this work we study the high-dimensional linear regression task when the dependence structure of the input signal is modeled by a Markov random field prior distribution. We provide a rigorous analysis of the performance of AMP, demonstrating the accuracy of the state evolution predictions, when a class of non-separable sliding-window denoisers is applied. Moreover, we provide numerical examples where AMP with sliding-window denoisers can successfully capture local dependencies in images.

cs.IT

Dead Time Compensation for High-Flux Ranging

Dead time effects have been considered a major limitation for fast data acquisition in various time-correlated single photon counting applications, since a commonly adopted approach for dead time mitigation is to operate in the low-flux regime where dead time effects can be ignored. Through the application of lidar ranging, this work explores the empirical distribution of detection times in the presence of dead time and demonstrates that an accurate statistical model can result in reduced ranging error with shorter data acquisition time when operating in the high-flux regime. Specifically, we show that the empirical distribution of detection times converges to the stationary distribution of a Markov chain. Depth estimation can then be performed by passing the empirical distribution through a filter matched to the stationary distribution. Moreover, based on the Markov chain model, we formulate the recovery of arrival distribution from detection distribution as a nonlinear inverse problem and solve it via provably convergent mathematical optimization. By comparing per-detection Fisher information for depth estimation from high- and low-flux detection time distributions, we provide an analytical basis for possible improvement of ranging performance resulting from the presence of dead time. Finally, we demonstrate the effectiveness of our formulation and algorithm via simulations of lidar ranging.

eess.SP

Accelerated Image Reconstruction for Nonlinear Diffractive Imaging

The problem of reconstructing an object from the measurements of the light it scatters is common in numerous imaging applications. While the most popular formulations of the problem are based on linearizing the object-light relationship, there is an increased interest in considering nonlinear formulations that can account for multiple light scattering. In this paper, we propose an image reconstruction method, called CISOR, for nonlinear diffractive imaging, based on a nonconvex optimization formulation with total variation (TV) regularization. The nonconvex solver used in CISOR is our new variant of fast iterative shrinkage/thresholding algorithm (FISTA). We provide fast and memory-efficient implementation of the new FISTA variant and prove that it reliably converges for our nonconvex optimization problem. In addition, we systematically compare our method with other state-of-the-art methods on simulated as well as experimentally measured data in both 2D and 3D settings.

cs.CV

Analysis of Approximate Message Passing with a Class of Non-Separable Denoisers

Approximate message passing (AMP) is a class of efficient algorithms for solving high-dimensional linear regression tasks where one wishes to recover an unknown signal \beta_0 from noisy, linear measurements y = A \beta_0 + w. When applying a separable denoiser at each iteration, the performance of AMP (for example, the mean squared error of its estimates) can be accurately tracked by a simple, scalar iteration referred to as state evolution. Although separable denoisers are sufficient if the unknown signal has independent and identically distributed entries, in many real-world applications, like image or audio signal reconstruction, the unknown signal contains dependencies between entries. In these cases, a coordinate-wise independence structure is not a good approximation to the true prior of the unknown signal. In this paper we assume the unknown signal has dependent entries, and using a class of non-separable sliding-window denoisers, we prove that a new form of state evolution still accurately predicts AMP performance. This is an early step in understanding the role of non-separable denoisers within AMP, and will lead to a characterization of more general denoisers in problems including compressive image reconstruction.

cs.IT

Multiprocessor Approximate Message Passing with Column-Wise Partitioning

Solving a large-scale regularized linear inverse problem using multiple processors is important in various real-world applications due to the limitations of individual processors and constraints on data sharing policies. This paper focuses on the setting where the matrix is partitioned column-wise. We extend the algorithmic framework and the theoretical analysis of approximate message passing (AMP), an iterative algorithm for solving linear inverse problems, whose asymptotic dynamics are characterized by state evolution (SE). In particular, we show that column-wise multiprocessor AMP (C-MP-AMP) obeys an SE under the same assumptions when the SE for AMP holds. The SE results imply that (i) the SE of C-MP-AMP converges to a state that is no worse than that of AMP and (ii) the asymptotic dynamics of C-MP-AMP and AMP can be identical. Moreover, for a setting that is not covered by SE, numerical results show that damping can improve the convergence performance of C-MP-AMP.

cs.IT