Lipschitz Analysis of Generalized Phase Retrievable Matrix Frames

• URL: http://arxiv.org/abs/2109.14522v2
• Date: Fri, 1 Oct 2021 02:15:47 GMT
• Title: Lipschitz Analysis of Generalized Phase Retrievable Matrix Frames
• Authors: Radu Balan, Chris B. Dock
• Abstract summary: We provide computable global stability bounds for the quasi-linear analysis map $beta$. We show that for the impure state case no such global stability bounds can be obtained for the non-linear computation analysis map $alpha$. Our computation of the global lower Lipschitz constant for the $beta$ analysis map provides novel conditions for a frame to be generalized phase retrievable.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The classical phase retrieval problem arises in contexts ranging from speech recognition to x-ray crystallography and quantum state tomography. The generalization to matrix frames is natural in the sense that it corresponds to quantum tomography of impure states. We provide computable global stability bounds for the quasi-linear analysis map $\beta$ and a path forward for understanding related problems in terms of the differential geometry of key spaces. In particular, we manifest a Whitney stratification of the positive semidefinite matrices of low rank which allows us to ``stratify'' the computation of the global stability bound. We show that for the impure state case no such global stability bounds can be obtained for the non-linear analysis map $\alpha$ with respect to certain natural distance metrics. Finally, our computation of the global lower Lipschitz constant for the $\beta$ analysis map provides novel conditions for a frame to be generalized phase retrievable.

Related papers

• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Stability and Concentration in Nonlinear Inverse Problems with Block-Structured Parameters: Lipschitz Geometry, Identifiability, and an Application to Gaussian Splatting [0.552480439325792]
  We develop an operator-theoretic framework for stability and statistical concentration in nonlinear inverse problems with block-structured parameters.<n>Overall, the analysis characterizes operator-level limits for a broad class of high-dimensional nonlinear inverse problems arising in modern imaging and differentiable rendering.
  arXiv  Detail & Related papers  (2026-02-10T05:11:06Z)
• A Mirror-Descent Algorithm for Computing the Petz-Rényi Capacity of Classical-Quantum Channels [13.098901971644656]
  We study the computation of the capacity of a classical-quantum (c-q) channel for $in(0,1)$.<n>We propose an exponentiated-gradient (mirror descent) that generalizes the Blahut-Arimoto algorithm.
  arXiv  Detail & Related papers  (2026-01-15T16:22:52Z)
• Towards A Unified PAC-Bayesian Framework for Norm-based Generalization Bounds [63.47271262149291]
  We propose a unified framework for PAC-Bayesian norm-based generalization.<n>The key to our approach is a sensitivity matrix that quantifies the network outputs with respect to structured weight perturbations.<n>We derive a family of generalization bounds that recover several existing PAC-Bayesian results as special cases.
  arXiv  Detail & Related papers  (2026-01-13T00:42:22Z)
• Classical feature map surrogates and metrics for quantum control landscapes [0.0]
  We derive and analyze three feature maps of parametrized quantum dynamics, which generalize variational quantum circuits.<n>The Lie-Fourier representation is shown to have a dense spectrum with discrete peaks, that reflects control Hamiltonian properties, but that is compressible in typically found symmetric systems.
  arXiv  Detail & Related papers  (2025-09-30T08:24:13Z)
• Path integral analysis of Schrödinger-type eigenvalue problems in the complex plane: Establishing the relation between instantons and resonant states [0.0]
  We study eigenvalue problems for which the boundary conditions are provided in specific angular sectors of the complex plane.<n>We find that the arising functional integrals are naturally defined on a complexified integration contour.<n>We identify the previously elusive one-to-one correspondence between decay rates derived from real-time quantum tunneling dynamics.
  arXiv  Detail & Related papers  (2025-07-30T22:05:02Z)
• Asymptotic Exceptional Steady States in Dissipative Dynamics [0.0]
  We show how a system mayally approach the forbidden scenario of an exceptional steady state in the thermodynamic limit. Treating the strength $W$ of quantum jumps as a parameter, we show that exceptional steady states at the physical value $W=1$ may be understood as a critical pointing the onset of dynamical instability.
  arXiv  Detail & Related papers  (2025-04-03T18:00:02Z)
• A holographic view of topological stabilizer codes [0.6290982779160698]
  We provide an explicit and general framework for understanding the bulk-boundary correspondence in Pauli topological stabilizer codes. We show that the boundary Hilbert space cannot be realized via local degrees of freedom. We show how linear and fractal subsystem symmetries naturally arise at the boundaries of fracton phases.
  arXiv  Detail & Related papers  (2023-12-07T19:00:00Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds [77.4346324549323]
  We show that a step size agnostic to the curvature of the manifold achieves a curvature-independent and linear last-iterate convergence rate. To the best of our knowledge, the possibility of curvature-independent rates and/or last-iterate convergence has not been considered before.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• A Robustness Analysis of Blind Source Separation [91.3755431537592]
  Blind source separation (BSS) aims to recover an unobserved signal from its mixture $X=f(S)$ under the condition that the transformation $f$ is invertible but unknown. We present a general framework for analysing such violations and quantifying their impact on the blind recovery of $S$ from $X$. We show that a generic BSS-solution in response to general deviations from its defining structural assumptions can be profitably analysed in the form of explicit continuity guarantees.
  arXiv  Detail & Related papers  (2023-03-17T16:30:51Z)
• Stability and Generalization for Markov Chain Stochastic Gradient Methods [49.981789906200035]
  We provide a comprehensive generalization analysis of MC-SGMs for both minimization and minimax problems. We establish the optimal excess population risk bounds for both smooth and non-smooth cases. We develop the first nearly optimal convergence rates for convex-concave problems both in expectation and with high probability.
  arXiv  Detail & Related papers  (2022-09-16T15:42:51Z)
• Stability of the scattering transform for deformations with minimal regularity [0.0]
  We investigate the relationship between the scattering structure and the regularity of the deformation in the H"older regularity scale $Calpha$, $alpha >0$. We are able to precisely identify the stability threshold, proving that stability is still achievable for deformations of class $Calpha$, $alpha>1$.
  arXiv  Detail & Related papers  (2022-05-23T09:08:21Z)
• Nonconvex Stochastic Scaled-Gradient Descent and Generalized Eigenvector Problems [98.34292831923335]
  Motivated by the problem of online correlation analysis, we propose the emphStochastic Scaled-Gradient Descent (SSD) algorithm. We bring these ideas together in an application to online correlation analysis, deriving for the first time an optimal one-time-scale algorithm with an explicit rate of local convergence to normality.
  arXiv  Detail & Related papers  (2021-12-29T18:46:52Z)
• On Asymptotic Linear Convergence of Projected Gradient Descent for Constrained Least Squares [22.851500417035947]
  This manuscript presents a unified framework for the analysis of projected gradient descent in the context of constrained least squares. We present a recipe for the convergence analysis of PGD and demonstrate it via a beginning-to-end application of the recipe on four fundamental problems.
  arXiv  Detail & Related papers  (2021-12-22T09:49:51Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Towards Understanding Generalization via Decomposing Excess Risk Dynamics [13.4379473119565]
  We analyze the generalization dynamics to derive algorithm-dependent bounds, e.g., stability. Inspired by the observation that neural networks show a slow convergence rate when fitting noise, we propose decomposing the excess risk dynamics. Under the decomposition framework, the new bound accords better with the theoretical and empirical evidence compared to the stability-based bound and uniform convergence bound.
  arXiv  Detail & Related papers  (2021-06-11T03:42:45Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descent [55.85456985750134]
  We introduce a new stability measure called on-average model stability, for which we develop novel bounds controlled by the risks of SGD iterates. This yields generalization bounds depending on the behavior of the best model, and leads to the first-ever-known fast bounds in the low-noise setting. To our best knowledge, this gives the firstever-known stability and generalization for SGD with even non-differentiable loss functions.
  arXiv  Detail & Related papers  (2020-06-15T06:30:19Z)

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.