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,742 papers · 148 categories

Trend · papers per month

219437656874 · Jun 202019922001200920172026
48 results for descending algorithms

Descending phase retrieval algorithms show a phase transition with increasing sample complexity.

problem Theoretical limits of descending phase retrieval algorithms.
method Utilizing Random duality theory (RDT), the study develops a generic program to characterize algorithm performance.
result As sample complexity increases, the parametric manifold transitions from multi to single funneling points, leading to a phase transition in algorithm success.

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, we introduce a new type of relation between knots called the descendant relation. One knot HH is a descendant of another knot KK if HH can be obtained from a minimal crossing diagram of KK by some number of crossing changes. We explore properties of the descendant relation and study how certain knots…

2017-05-24abs ↗pdf ↗

The paper characterizes and examines nilpotent complex structures on stratified Lie algebras.

problem Characterizing and understanding nilpotent complex structures on stratified Lie algebras.
method Introduced a new descending series pj\mathfrak{p}_j to prove a new characterization of nilpotent complex structures and examined whether these structures preserve the strata.
result Found that there exists a JJ-invariant stratification on a step 2 nilpotent Lie algebra with a complex structure.

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the notion of descending diagram for knots and links in the real space is extended to…

2002-07-31abs ↗pdf ↗

Suppose TM{0}TM\setminus \{0\} and TM~{0}T\widetilde M\setminus\{0\} are slashed tangent bundles of two smooth manifolds MM and M~\widetilde M, respectively. In this paper we characterize those diffeomorphisms F ⁣:TM{0}TM~{0}F\colon TM\setminus\{0\} \to T\widetilde M\setminus\{0\} that can be written as F=(Dφ)TM{0}F = (Dφ)|_{TM\setminus\{0\}} for…

2009-03-30abs ↗pdf ↗

This is the second part in a series of two papers. The kk-Dirac complex is a complex of differential operators which are natural to a particular 2|2|-graded parabolic geometry. In this paper we will consider the kk-Dirac complex over a homogeneous space of the parabolic geometry and as a first result, we will prove …

2017-05-29abs ↗pdf ↗

The paper studies unknotting operations and numbers for plus-welded knotoids.

problem Understanding unknotting operations and numbers for plus-welded knotoids.
method The paper proves transformations and introduces new operations to calculate unknotting numbers.
result Upper bounds for unknotting numbers of plus-welded knotoids are found.

The purpose of this note is introduce a new axiom (called the Descent Axiom) in the theory of rr-spin cohomological field theories. This axiom explains the origin of gravitational descendants in this theory. Furthermore, the Descent Axiom immediately implies the Vanishing Axiom, explicating the latter (which has no a …

2000-09-06abs ↗pdf ↗

A new algorithm FastGM speeds up generating Gumbel-Max variables.

problem Efficiently generating multiple Gumbel-Max variables from high-dimensional vectors.
method FastGM reduces time complexity from O(kn+)O(kn^+) to O(klnk+n+)O(k \ln k + n^+) by generating variables in descending order.
result Significantly reduces computation time for generating kk Gumbel-Max variables.

New method for selective prediction under interventions learns causal structure from data.

problem Tight uncertainty sets in selective conformal prediction under unknown interventional settings.
method Partial causal structure learning for descendant indicators, contamination-robust coverage theorem, algorithms for descendant discovery and distance estimation.
result Valid selective conformal prediction under contamination up to 30% with controlled coverage.

We study the existence of S1S^1-equivariant characteristic classes on certain natural infinite rank bundles over the loop space LMLM of a manifold MM. We discuss the different S1S^1-equivariant cohomology theories in the literature and clarify their relationships. We attempt to use S1S^1-equivariant Chern-Weil techniq…

2015-07-30abs ↗pdf ↗

Phylogenetic tree inference using deep DNA sequencing is reshaping our understanding of rapidly evolving systems, such as the within-host battle between viruses and the immune system. Densely sampled phylogenetic trees can contain special features, including "sampled ancestors" in which we sequence a genotype along wit…

2018-05-28abs ↗pdf ↗

The Regularized Nonlinear Acceleration (RNA) algorithm is an acceleration method capable of improving the rate of convergence of many optimization schemes such as gradient descend, SAGA or SVRG. Until now, its analysis is limited to convex problems, but empirical observations shows that RNA may be extended to wider set…

2018-06-01abs ↗pdf ↗

Study on theoretical limits of 0\ell_0 sparse-regression algorithms using Fl RDT.

problem Understanding the performance limits of 0\ell_0 norm based optimization algorithms in compressed sensing and sparse regression.
method Utilized Fully lifted random duality theory (Fl RDT) to analyze the maximum-likelihood (ML) decoding performance.
result Uncovered phase-transition (PT) and descending 0\ell_0 (d0\ell_0) curves that separate successful and unsuccessful algorithm performance.

The concept of a C-class of differential equations goes back to E. Cartan with the upshot that generic equations in a C-class can be solved without integration. While Cartan's definition was in terms of differential invariants being first integrals, all results exhibiting C-classes that we are aware of are based on the…

2017-09-04abs ↗pdf ↗

A new approach to maximum likelihood learning of discrete graphical models and RBM in particular is introduced. Our method, Perturb and Descend (PD) is inspired by two ideas (I) perturb and MAP method for sampling (II) learning by Contrastive Divergence minimization. In contrast to perturb and MAP, PD leverages trainin…

2014-05-06abs ↗pdf ↗

Study on descent properties of complex affine surfaces under proper morphisms.

problem Understanding descent behavior of homotopy-theoretic properties of smooth affine surfaces.
method Examined Eilenberg-MacLane property and introduced finite homotopy rank-sum property. Proved descent under proper morphisms for surfaces of log Kodaira dimension ≤0.
result Finite homotopy rank-sum property descends under proper morphisms for smooth affine surfaces of log Kodaira dimension ≤0.

Discrete linear Weingarten surfaces in space forms are characterized as special discrete ΩΩ-nets, a discrete analogue of Demoulin's ΩΩ-surfaces. It is shown that the Lie-geometric deformation of ΩΩ-nets descends to a Lawson transformation for discrete linear Weingarten surfaces, which coincides with the well-known L…

2014-06-05abs ↗pdf ↗

The purpose of this paper is to describe certain natural 4-vector fields on quaternionic flag manifolds, which geometrically determine the Bruhat cell decomposition. This structure naturally descends from the symplectic group, where it is related to the dressing action given by the Iwasawa decomposition of the general …

2001-04-09abs ↗pdf ↗

Two critical questions about intergenerational outcomes are: one, whether significant barriers or traps exist between different social or economic strata; and two, the extent to which intergenerational outcomes do (or can be used to) affect individual investment and consumption decisions. We develop a model to explicit…

2018-04-30abs ↗pdf ↗

Paper connects neural networks to Gaussian processes for understanding double-descent.

problem Understanding the double-descent phenomenon in neural networks.
method Uses techniques from random matrix theory and Gaussian processes.
result Establishes a connection between NNGP and random matrix theory for neural networks.

We propose a new algorithm that uses an auxiliary neural network to express the potential of the optimal transport map between two data distributions. In the sequel, we use the aforementioned map to train generative networks. Unlike WGANs, where the Euclidean distance is implicitly{\it implicitly} used, this new method allows …

2019-10-01abs ↗pdf ↗

Bayesian methods are appealing in their flexibility in modeling complex data and ability in capturing uncertainty in parameters. However, when Bayes' rule does not result in tractable closed-form, most approximate inference algorithms lack either scalability or rigorous guarantees. To tackle this challenge, we propose …

2015-06-09abs ↗pdf ↗

A second-order differential identity for the Riemann tensor is obtained, on a manifold with symmetric connection. Several old and some new differential identities for the Riemann and Ricci tensors descend from it. Applications to manifolds with Recurrent or Symmetric structures are discussed. The new structure of K-rec…

2008-02-05abs ↗pdf ↗

We discuss the Ribaucour transformation of Legendre maps in Lie sphere geometry. In this context, we give a simple conceptual proof of Bianchi's original Permutability Theorem and its generalisation by Dajczer--Tojeiro. We go on to formulate and prove a higher dimensional version of the Permutability Theorem. It is sho…

2004-07-14abs ↗pdf ↗

NGP selects N features from P using neural networks in a greedy, iterative process.

problem Feature selection for non-linear prediction problems.
method Neural Greedy Pursuit (NGP) algorithm, selecting features sequentially in an iterative loss minimization procedure.
result NGP provides better performance than DeepLIFT and Drop-one-out loss methods.

Constructs explicit pp-harmonic functions on Grassmannians and flag manifolds.

problem Finding proper pp-harmonic functions on Grassmannians and flag manifolds.
method Using the method of eigenfamilies to construct explicit functions.
result Explicit complex-valued proper pp-harmonic functions on compact real Grassmannians and non-descending functions on real flag manifolds.

Improved multi-class AdaBoost algorithm with stronger weak learnability condition.

problem Multi-class classification problem with at least two labels.
method Recursive ensemble algorithm inspired by SAMME, strengthening weak learnability condition.
result Final hypothesis converges to correct label with probability 1 and generalization error bounds exponentially.

We prove two tropical gluing formulae for Gromov-Witten invariants of exploded manifolds, useful for calculating Gromov-Witten invariants of a symplectic manifold using a normal-crossing degeneration. The first formula generalizes the symplectic-sum formula for Gromov-Witten invariants. The second formula is stronger, …

2017-03-16abs ↗pdf ↗

In this work we construct Calabi quasi-morphisms on the universal cover of the group Ham(M) of Hamiltonian diffeomorphisms for some non-monotone symplectic manifolds. This complements a result by Entov and Polterovich which applies in the monotone case. Moreover, in contrast to their work, we show that these quasi-morp…

2005-08-04abs ↗pdf ↗

We extend the theory of the universal eta-invariant to the case of relative bordism groups of manifolds with boundaries. This allows the construction of secondary descendants of the universal eta-invariant. We obtain an interpretation of Laures' f-invariant as an example of this general construction. As an aside we imp…

2014-03-09abs ↗pdf ↗

We construct low regularity solutions of the vacuum Einstein constraint equations. In particular, on 3-manifolds we obtain solutions with metrics in $H^s\loc$ with s>32s>{3\over 2}. The theory of maximal asymptotically Euclidean solutions of the constraint equations descends completely the low regularity setting. Moreove…

2004-05-17abs ↗pdf ↗

Study 3d N=1 vacua from M-theory compactification on Spin(7) space.

problem Quantum corrections in 3d N=1 vacua from M-theory compactification.
method Use Higgs bundles to analyze 3d N=1 vacua and track corrections.
result Topological anomalies are robust and calculable in 3d effective field theory.

Feature selection plays a critical role in biomedical data mining, driven by increasing feature dimensionality in target problems and growing interest in advanced but computationally expensive methodologies able to model complex associations. Specifically, there is a need for feature selection methods that are computat…

2017-11-22abs ↗pdf ↗

In this paper we compute explicit formulas for the holonomy map for a gerbe with connection over an orbifold. We show that the holonomy descends to a transgression map in Deligne cohomology. We prove that this recovers both the inner local systems in Ruan's theory of twisted orbifold cohomology and the local system of …

2003-07-09abs ↗pdf ↗