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

326495127 · Jun 202019922001200920172026
48 results for first-order topology

A new method learns node embeddings for signed directed networks by capturing both first-order and high-order topologies.

problem Learning representative node embeddings for signed directed networks considering both first-order and high-order topologies.
method Proposes a decoupled variational embedding (DVE) method that leverages a specially designed auto-encoder structure to capture both first-order and high-order topologies.
result Extensive experiments on real-world datasets show the effectiveness of DVE in link sign prediction and node recommendation tasks.

The paper explores how topology affects the solvability of first-order differential equations.

problem The solvability of first-order differential equations and the role of topology.
method Analysis of de Rham cohomology to determine global integrability and uniqueness of solutions.
result Triviality of the first de Rham cohomology group is a fundamental requirement for global integrability and uniqueness of solutions.

A natural way to obtain a system of partial differential equations on a manifold is to vary a suitably defined sesquilinear form. The sesquilinear forms we study are Hermitian forms acting on sections of the trivial Cn\mathbb{C}^n-bundle over a smooth mm-dimensional manifold without boundary. More specifically, we are…

2018-11-26abs ↗pdf ↗

Determining when two knots are equivalent (more precisely isotopic) is a fundamental problem in topology. Here we formulate this problem in terms of Predicate Calculus, using the formulation of knots in terms of braids and some basic topological results. Concretely, Knot theory is formulated in terms of a language with…

2012-09-17abs ↗pdf ↗

This paper formalizes the h-principle and sphere eversion in differential topology.

problem Formalizing the h-principle and sphere eversion in differential topology.
method Lean formalization of the local h-principle for first-order partial differential relations, using convex integration.
result Reproves Smale's sphere eversion theorem and formalizes advanced mathematics.

We describe two topologies on the space of unbounded Fredholm operators and we explain their K-theoretic relevance. In the process we also prove a very general result concerning the continuity of families of first order, elliptic boundary value problems.

2000-05-09abs ↗pdf ↗

We define a holographic dual to the Donaldson-Witten topological twist of N=2\mathcal{N}=2 gauge theories on a Riemannian four-manifold. This is described by a class of asymptotically locally hyperbolic solutions to N=4\mathcal{N}=4 gauged supergravity in five dimensions, with the four-manifold as conformal boundary. Und…

2017-07-26abs ↗pdf ↗

Flexible approach for normal approximations in geometric and topological statistics.

problem Normal approximation for complex statistics not expressible as sums of score functions.
method Flexible add-one cost operator combined with strong stabilization theory.
result Established normal approximation results for geometric and topological statistics.

New Skyrme model for contact geometry with topological solutions.

problem Finding BPS solutions for maps between contact 3-manifolds.
method Defined a new Skyrme energy functional for maps between contact 3-manifolds and showed existence of solutions to a first-order self-duality equation.
result Existence of solutions to the Beltrami maps equation, generalizing the original Ferreira-Zakrzewski model.

Contagions such as the spread of popular news stories, or infectious diseases, propagate in cascades over dynamic networks with unobservable topologies. However, "social signals" such as product purchase time, or blog entry timestamps are measurable, and implicitly depend on the underlying topology, making it possible …

2016-06-28abs ↗pdf ↗

Regular homotopy classes of immersions of a 3-sphere in 5-space constitute an infinite cyclic group. The classes containing embeddings form a subgroup of index 24. The obstruction for a generic immersion to be regularly homotopic to an embedding is described in terms of geometric invariants of its self intersection. Ge…

2000-02-10abs ↗pdf ↗

Extends results on smoothability of singular Fano and Calabi-Yau varieties.

problem Smoothability of singular Fano and Calabi-Yau varieties under terminal singularities.
method Generalizes deformation theory results for Calabi-Yau and Fano threefolds to higher dimensions, using higher Du Bois and rational singularities.
result Identifies a class of singularities for which smoothing results hold, including generalized Fano and Calabi-Yau varieties.

Survey uses Milnor fibrations to classify first integrals of differential systems.

problem Classifying first integrals of differential systems using geometric-topological methods.
method Utilizing Milnor fibrations and connections with harmonic morphisms to provide topological and geometric descriptions.
result Geometric-topological classifications of first integrals for both isolated and non-isolated singularities.

DESTRESS optimizes decentralized nonconvex optimization with optimal IFO complexity and efficient communication.

problem Decentralized nonconvex finite-sum optimization in multi-agent systems.
method DESTRESS uses stochastic recursive gradient updates, gradient tracking, and careful hyper-parameter choices to achieve optimal IFO complexity with efficient communication.
result DESTRESS matches the optimal IFO complexity of centralized algorithms while maintaining communication efficiency.

In this article, we introduce rack invariants of oriented Legendrian knots in the 3-dimensional Euclidean space endowed with the standard contact structure, which we call Legendrian racks. These invariants form a generalization of the quandle invariants of knots. These rack invariants do not result in a complete invari…

2017-06-23abs ↗pdf ↗

Study first-order locally convex Lie algebroids in Bastiani calculus.

problem Define and study first-order locally convex Lie algebroids.
method Define sheaves of Lie algebroid forms and morphisms, prove category structure, study representations and cohomology.
result First-order locally convex Lie algebroids form a category and have applications in Lie II theorems.

Extends a theorem for first-order elliptic operators on manifolds.

problem Proving the relative index theorem for general first-order elliptic operators.
method Using boundary value problems and graphical decomposition of elliptically regular boundary conditions.
result Proves the relative index theorem for general first-order elliptic operators.

Unknot recognition is one of the fundamental questions in low dimensional topology. In this work, we show that this problem can be encoded as a validity problem in the existential fragment of the first-order theory of real closed fields. This encoding is derived using a well-known result on SU(2) representations of kno…

2018-02-27abs ↗pdf ↗

New algorithm improves understanding of decentralized SBO transient iteration complexity.

problem Limited understanding of how network topology, data heterogeneity, and nested structures affect SBO.
method D-SOBA framework with two variants: D-SOBA-SO and D-SOBA-FO, providing non-asymptotic convergence analysis and transient iteration complexity.
result First theoretical understanding of how network topology, data heterogeneity, and nested structures influence decentralized SBO.

We consider first order expansions of convex penalized estimators in high-dimensional regression problems with random designs. Our setting includes linear regression and logistic regression as special cases. For a given penalty function hh and the corresponding penalized estimator β^\hatβ, we construct a quantity ηη,…

2019-10-12abs ↗pdf ↗

It is shown that, in the 1-jet space of the circle, the swapping and the flyping procedures, which produce topologically equivalent links, can produce nonequivalent legendrian links. Each component of the links considered is legendrian isotopic to the 1-jet of the 0-function, and thus cannot be distinguished by the cla…

2001-10-20abs ↗pdf ↗

Match van Stockum dust to vacuum metrics with a single parameter.

problem Matching van Stockum dust to vacuum metrics.
method 1-parametric family of non-static Papapetrou vacuum metrics, Ehlers and Kramer--Neugebauer transformations.
result Explicit examples of matching, including Bonnor metric and Lanczos--van Stockum dust metric.

Optimal first-order methods are shown to be fundamental limits in functional estimation.

problem Optimal functional estimation under weak conditions.
method Formalization of functional estimation with black-box nuisance function estimates and derivation of minimax lower bounds.
result First-order methods are optimal under weak conditions, but higher-order methods can outperform them when nuisance function structure is known.

First order discretizations of Langevin diffusion can achieve better generalization error with additional smoothness assumptions.

problem Analyzing generalization error for first order discretizations of Langevin diffusion.
method Providing a sufficient smoothness condition to show that first order methods can achieve arbitrarily runtime complexity for a given expected generalization error.
result First order methods can achieve arbitrarily runtime complexity with additional smoothness assumptions.

The aim of this paper is fourfold. Firstly, we introduce and study the f-ultra-harmonic maps. Secondly, we recall the geometric dynamics generated by a first order normal PDE system and we give original results regarding the geometric dynamics generated by other first order PDE systems. Thirdly, we determine the Gauss …

2011-10-13abs ↗pdf ↗

CEFOL uses deep learning for dynamic programming with recursive utility.

problem Challenges in solving dynamic programming problems with recursive utility.
method Introduces a separate neural network for certainty equivalent, uses first-order optimality conditions to learn value and policy functions.
result CEFOL achieves high accuracy in learning value and policy functions, matching VFI benchmarks.

In this paper we obtain natural boundary conditions for a large class of variational problems with free boundary values. In comparison with the already existing examples, our framework displays complete freedom concerning the topology of YY, the manifold of dependent and independent variables underlying a given proble…

2013-01-14abs ↗pdf ↗

New algorithm reduces online decision-making regret with efficient LP re-solving and parallel first-order method.

problem Worse regret guarantees and high computational cost of LP-based OLP algorithms.
method Combines LP-based and first-order OLP methods, re-solving LP subproblems periodically and using parallel first-order method.
result Achieves O(log(T/f)+f)\mathscr{O}(\log (T/f) + \sqrt{f}) regret, balancing computational efficiency and superior regret guarantee.