Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

316293124 · May 202619922001200920172026
48 results for Wirtinger flow

We study the phase retrieval problem, which solves quadratic system of equations, i.e., recovers a vector xRn\boldsymbol{x}\in \mathbb{R}^n from its magnitude measurements yi=ai,x,i=1,...,my_i=|\langle \boldsymbol{a}_i, \boldsymbol{x}\rangle|, i=1,..., m. We develop a gradient-like algorithm (referred to as RWF representing reshaped W…

2016-05-25abs ↗pdf ↗

We consider the robust phase retrieval problem of recovering the unknown signal from the magnitude-only measurements, where the measurements can be contaminated by both sparse arbitrary corruption and bounded random noise. We propose a new nonconvex algorithm for robust phase retrieval, namely Robust Wirtinger Flow to …

2017-04-20abs ↗pdf ↗

The paper connects complex normalizing flows to Kähler-Ricci flows using geometric and statistical perspectives.

problem Understanding the relationship between complex normalizing flows and Kähler-Ricci flows.
method Develops connections between complex normalizing flows and Kähler-Ricci flows by relating the log determinant to Ricci curvature and using a Bayesian perspective.
result Reconciles the complex normalizing flow and Kähler-Ricci flow, showing they are related under certain conditions.

This paper considers the noisy sparse phase retrieval problem: recovering a sparse signal xRpx \in \mathbb{R}^p from noisy quadratic measurements yj=(ajx)2+εjy_j = (a_j' x )^2 + ε_j, j=1,,mj=1, \ldots, m, with independent sub-exponential noise εjε_j. The goals are to understand the effect of the sparsity of xx on the estimation prec…

2015-06-10abs ↗pdf ↗

The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger number of a virtual link equals its virtual bridge number. Since the Wirtinger number…

2018-01-09abs ↗pdf ↗

We define the Wirtinger width of a knot. Then we prove the Wirtinger width of a knot equals its Gabai width. The algorithmic nature of the Wirtinger width leads to an efficient technique for establishing upper bounds on Gabai width. As an application, we use this technique to calculate the Gabai width of approximately …

2019-12-04abs ↗pdf ↗

We define the {\it Wirtinger number} of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. …

2017-05-08abs ↗pdf ↗

The computation of the fundamental group of the complement of an algebraic plane curve has been theoretically solved since Zariski-van Kampen, but actual computations are usually cumbersome. In this work, we describe the notion of Wirtinger presentation of such a group relying on the real picture of the curve and with …

2017-05-09abs ↗pdf ↗

Considering Wirtinger's inequality for piece-wise equipartite functions we find a discrete version of this classical inequality. The main tool we use is the theorem of classification of isometries. Our approach provides a new elementary proof of Wirtinger's inequality that also allows to study the case of equality. Mor…

2019-05-14abs ↗pdf ↗

New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.

problem Calculating bridge indices for spatial graphs efficiently.
method Extending Wirtinger number to spatial graphs, implementing Python algorithm, combining algebraic structures and clasping techniques.
result Exact bridge indices for almost unknotted graphs of large bridge index.

New formula for knot group representations and hyperbolic structures.

problem Understanding representations of knot groups and their geometric implications.
method Direct algebraic formula for geometric parameters of octahedral decompositions.
result Explicit criterion for critical points in Neumann-Zagier--Yokota potential function.

We study optimal curvature-free inequalities of the type discovered by C. Loewner and M. Gromov, using a generalisation of the Wirtinger inequality for the comass. Using a model for the classifying space BS^3 built inductively out of BS^1, we prove that the symmetric metrics of certain two-point homogeneous manifolds t…

2006-08-01abs ↗pdf ↗

Existing nonconvex statistical optimization theory and methods crucially rely on the correct specification of the underlying "true" statistical models. To address this issue, we take a first step towards taming model misspecification by studying the high-dimensional sparse phase retrieval problem with misspecified link…

2017-12-18abs ↗pdf ↗

Study on weakly G-slim complexes and non-positive immersions for group presentations.

problem Conditions for non-positive immersions in group presentations.
method Investigation of weakly G-slim complexes and their relationship to left-orderable groups.
result Conditions on generalized Wirtinger presentations guaranteeing non-positive immersions for their associated 2-complexes.

For any subvariety of a compact holomorphic symplectic Kaehler manifold, we define the number W(X), which we call Wirtinger number. We show that W(X)1W(X)\leq 1, and the equality is reached if and only if the subvariety XMX\subset M is trianalytic, i. e. compactible with the hyperkaehler structure on M. For a sequence $X_…

1998-12-14abs ↗pdf ↗

The paper proves existence and uniqueness of slant immersions in complex space forms.

problem Existence and uniqueness of slant immersions in complex space forms.
method Established existence and uniqueness theorems for pointwise slant immersions of Riemannian manifolds into a complex space form.
result Existence and uniqueness theorems for pointwise slant immersions of Riemannian manifolds into a complex space form.

This research explores complex-valued neural networks and their implementation.

problem The challenges of implementing complex-valued neural networks and their potential for non-complex data.
method Detailed theory and implementation of CVNN, including Wirtinger calculus, complex backpropagation, and modules like complex layers and activation functions. Python implementation using cvnn toolbox.
result Demonstrates the potential of CVNN for non-complex data through simulations.

We consider the problem of demixing a sequence of source signals from the sum of noisy bilinear measurements. It is a generalized mathematical model for blind demixing with blind deconvolution, which is prevalent across the areas of dictionary learning, image processing, and communications. However, state-of- the-art c…

2018-09-18abs ↗pdf ↗

This paper solves quadratic systems with sparse or generative priors.

problem Recovering signals from quadratic systems with full-rank matrices.
method Thresholded Wirtinger flow (TWF) and projected gradient descent (PGD) algorithms.
result The proposed methods significantly outperform existing algorithms in signal recovery.

New method for quandle presentations of surface knots in 4-manifolds.

problem Computing fundamental quandle presentations for surface knots in arbitrary 4-manifolds.
method Wirtinger type presentation of the fundamental quandle for surface links in 4-manifolds.
result Infinitely many pairwise non-local surface knots with specific bridge numbers in certain 4-manifolds.

We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph Reidemeister moves, generalizing the Dehn presentation of the knot group analogously to…

2016-10-21abs ↗pdf ↗

This paper presents a new algorithm, termed \emph{truncated amplitude flow} (TAF), to recover an unknown vector x\bm{x} from a system of quadratic equations of the form yi=ai,x2y_i=|\langle\bm{a}_i,\bm{x}\rangle|^2, where ai\bm{a}_i's are given random measurement vectors. This problem is known to be \emph{NP-hard} in genera…

2016-05-26abs ↗pdf ↗

We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on meridional rank are obtained via Coxeter quotients of the groups of link complement…

2019-07-05abs ↗pdf ↗

This paper considers the problem of solving systems of quadratic equations, namely, recovering an object of interest xRn\mathbf{x}^{\natural}\in\mathbb{R}^{n} from mm quadratic equations/samples yi=(aix)2y_{i}=(\mathbf{a}_{i}^{\top}\mathbf{x}^{\natural})^{2}, 1im1\leq i\leq m. This problem, also dubbed as phase retrieval, span…

2018-03-21abs ↗pdf ↗

New algorithms handle phase retrieval with rank d measurements, revealing phase transitions.

problem Phase retrieval with rank d measurements.
method Random duality theory (RDT) and descending phase retrieval algorithms (dPR).
result Minimal sample complexity ratio for dPR's success exhibits phase transitions.

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As in the quandle theory, one can define Alexander quandle and get Alexander polynom…

2017-03-17abs ↗pdf ↗

Continuous-time mirror descent solves sparse phase retrieval efficiently.

problem Recovering sparse signals from magnitude-only measurements.
method Continuous-time mirror descent applied to unconstrained empirical risk minimization problem.
result Mirror descent recovers kk-sparse vectors with minimum non-zero entry order of x2/k\| \mathbf{x}^\star \|_2/\sqrt{k} from k2k^2 Gaussian measurements.

New groups defined from knot diagrams, invariant under Reidemeister moves.

problem Classical knot groups are not invariant under all Reidemeister moves.
method Define quotient groups based on knot diagrams, invariant under Reidemeister moves.
result New groups include extended knot groups and are invariant under all Reidemeister moves.

Following an idea of Dadok, Harvey and Lawson, we apply the triality property of SO(8) to study the comass of certain self-dual 4-forms on R^8. In particular, we prove that the Cayley 4-form has comass 1 and that any self-dual 4-form realizing the maximal Wirtinger ratio is SO(8)-conjugate to the Cayley 4-form. We also…

2008-01-01abs ↗pdf ↗

A {\em word labeled oriented graph} (WLOG) is an oriented graph G\cal G on vertices X={x1,,xk}X=\{ x_1,\ldots ,x_k\}, where each oriented edge is labeled by a word in X±1X^{\pm1}. WLOGs give rise to presentations which generalize Wirtinger presentations of knots. WLOG presentations, where the underlying graph is a tree are of …

2014-08-17abs ↗pdf ↗

The paper derives new inequalities on manifolds and applies them to convex hypersurfaces.

problem Deriving new inequalities on manifolds and convex hypersurfaces.
method Using Fourier theory and geometric implications of Poincare-type inequalities.
result Sharp Minkowski-type inequalities, including stability and Alexandrov-Fenchel inequalities.

New approach to quantify posterior concentration rates using Wasserstein dynamics.

problem Quantifying the speed of posterior distribution concentration in Bayesian statistics.
method Combining local Lipschitz-continuity with dynamic formulation of Wasserstein distance.
result Optimal posterior contraction rates in finite and infinite-dimensional models.

A classical result of H. S. M. Coxeter asserts that a certain quotient B(m,n)B(m,n) of the braid group B(m)B(m) on mm strands is finite if and only if (m,n)(m,n) corresponds to the type of one of the five Platonic solids. If k{\bf k} is a knot or virtual knot, one can study similar quotients G(k,n)G({\bf k}, n) for the correspond…

2015-05-23abs ↗pdf ↗