Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Strict saddle points"”.

  1. Bilinear inverse problems with sparsity: Optimal identifiability conditions and efficient recovery

    … to an inherent sign and shift ambiguity, and all saddle points have strictly negative curvatures. This geometric structure allows successful recovery of $f$ and $x_i$ using a simple manifold gradient descent algorithm with random initialization. Our theoretical findings are complemented by …

    uiuc Repository record for Bilinear inverse problems with sparsity: Optimal identifiability conditions and efficient recovery (opens in a new tab)