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

Trend · papers per month

69137206274 · Jun 202019922001200920172026
48 results for bow solutions

Instantons on the Taub-NUT space are related to `bow solutions' via a generalization of the ADHM-Nahm transform. Both are related to complex geometry, either via the twistor transform or via the Kobayashi-Hitchin correspondence. We explore various aspects of this complex geometry, exhibiting equivalences. For both the …

2017-09-01abs ↗pdf ↗

Instantons on multi-Taub-NUT spaces are mapped to bow representations.

problem Mapping instantons to bow representations for multi-Taub-NUT spaces.
method Proving gauge equivalence classes correspondence and isometry of moduli spaces.
result Instantons on multi-Taub-NUT spaces are isometric to bow representations.

Yang-Mills instantons on ALE gravitational instantons were constructed by Kronheimer and Nakajima in terms of matrices satisfying algebraic equations. These were conveniently organized into a quiver. We construct generic Yang-Mills instantons on ALF gravitational instantons. Our data are formulated in terms of matrix-v…

2010-06-30abs ↗pdf ↗

Understanding tie strength in social networks, and the factors that influence it, have received much attention in a myriad of disciplines for decades. Several models incorporating indicators of tie strength have been proposed and used to quantify relationships in social networks, and a standard set of structural networ…

2017-10-11abs ↗pdf ↗

Singular monopoles are nonabelian monopoles with prescribed Dirac-type singularities. All of them are delivered by the Nahm's construction. In practice, however, the effectiveness of the latter is limited to the cases of one or two singularities. We present an alternative construction of singular monopoles formulated i…

2010-10-05abs ↗pdf ↗

Researchers create coordinates for hyperbolic surfaces, proving a magic formula.

problem Constructing coordinates for hyperbolic structures on genus-2 surfaces.
method Developed Fenchel-Nielsen coordinates and Wolpert's magic formula analogues.
result Found Darboux charts for the Goldman symplectic form on branched hyperbolic structures.

Systemic risks of default contagion in the Russian interbank market are investigated. The analysis is based on considering the bow-tie structure of the weighted oriented graph describing the structure of the interbank loans. A probabilistic model of interbank contagion explicitly taking into account the empirical bow-t…

2014-09-03abs ↗pdf ↗

The bag of words (BOW) represents a corpus in a matrix whose elements are the frequency of words. However, each row in the matrix is a very high-dimensional sparse vector. Dimension reduction (DR) is a popular method to address sparsity and high-dimensionality issues. Among different strategies to develop DR method, Un…

2017-12-16abs ↗pdf ↗

Modelling of contagion in interbank networks is discussed. A model taking into account bow-tie structure and dissasortativity of interbank networks is developed. The model is shown to provide a good quantitative description of the Russian interbank market. Detailed arguments favoring the non-percolative nature of conta…

2014-10-01abs ↗pdf ↗

We solve structure learning for cyclic linear causal models using observational data.

problem Learning the structure of cyclic linear causal models from observational data.
method Assuming simple graphs, we use a criterion for distributional equivalence and implement a greedy search method.
result We show that simple cyclic models are of expected dimension and justify score-based methods for structure learning.

This paper shows that a simple baseline based on a Bag-of-Words (BoW) representation learns surprisingly good knowledge graph embeddings. By casting knowledge base completion and question answering as supervised classification problems, we observe that modeling co-occurences of entities and relations leads to state-of-…

2017-10-30abs ↗pdf ↗

Text classification has become indispensable due to the rapid increase of text in digital form. Over the past three decades, efforts have been made to approach this task using various learning algorithms and statistical models based on bag-of-words (BOW) features. Despite its simple implementation, BOW features lack se…

2018-06-08abs ↗pdf ↗

This is the third companion paper of arXiv:1601.03586. When a gauge theory has a flavor symmetry group, we construct a partial resolution of the Coulomb branch as a variant of the definition. We identify the partial resolution with a partial resolution of a generalized slice in the affine Grassmannian, Hilbert scheme o…

2018-05-30abs ↗pdf ↗

We present ADHM-Nahm data for instantons on the Taub-NUT space and encode these data in terms of Bow Diagrams. We study the moduli spaces of the instantons and present these spaces as finite hyperkahler quotients. As an example, we find an explicit expression for the metric on the moduli space of one SU(2) instanton. W…

2008-05-08abs ↗pdf ↗

Characterizes submanifolds with minimum ratio of diameter to focal radius.

problem Finding submanifolds with the minimum ratio of extrinsic diameter to focal radius.
method Combining K. Sakamoto's classification of submanifolds with planar geodesics and A. Schur's Bow Lemma for space curves.
result Essentially round spheres or Veronese embeddings of projective spaces achieve the minimum ratio.

The structure of the control network of transnational corporations affects global market competition and financial stability. So far, only small national samples were studied and there was no appropriate methodology to assess control globally. We present the first investigation of the architecture of the international …

2011-07-28abs ↗pdf ↗

Quantifies Schur's theorem for curves in CAT(k) spaces.

problem Quantifying Schur's comparison theorem for curves in CAT(k) spaces.
method Comparison formula for curves in model planes, curvature measures, moment arm, and Reshetnyak's theorem.
result Sharpens and extends classical arm and bow lemmas and Riemannian analogues.

We improve robust parameter estimation in causal models from observational data.

problem Robustly estimating parameters in linear structural equation models from observational data.
method Extending Sankararaman et al. (2019) to a broader class of models, providing sufficient conditions for robust identifiability.
result For a large set of parameters, robust identifiability holds and existing algorithms achieve robust identifiability.

In this paper, we present a new comparative study on automatic essay scoring (AES). The current state-of-the-art natural language processing (NLP) neural network architectures are used in this work to achieve above human-level accuracy on the publicly available Kaggle AES dataset. We compare two powerful language model…

2019-09-18abs ↗pdf ↗

Persistent homology (PH) is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs) which are 2D multisets of points. Their variable size makes them, however, difficult to combine with typical machine learning workflows. In this paper we introduce persistence c…

2018-02-13abs ↗pdf ↗

New method learns graph structure with hidden causes from observational data.

problem Learning the structure of linear non-Gaussian models with hidden causes.
method Augments hidden variable structure by learning multidirected edges and uses higher order cumulants.
result Correct structure recovery for bow-free acyclic mixed graphs with multi-directed edges.

Compressive Sensing (CS) theory asserts that sparse signal reconstruction is possible from a small number of linear measurements. Although CS enables low-cost linear sampling, it requires non-linear and costly reconstruction. Recent literature works show that compressive image classification is possible in CS domain wi…

2018-10-15abs ↗pdf ↗

Bayesian neural networks improve deep learning's accuracy and uncertainty estimation.

problem Overconfident predictions, adversarial attacks, and variability underestimation in deep models.
method Stochastic relaxation of feed-forward rectified neural networks with sparsity-promoting priors and Polya-Gamma data augmentation.
result Improved scalability and robustness to architectural design through approximate variational inference.

Music genre classification is a widely researched topic in music information retrieval (MIR). Being able to automatically tag genres will benefit music streaming service providers such as JOOX, Apple Music, and Spotify for their content-based recommendation. However, most studies on music classification have been done …

2019-08-23abs ↗pdf ↗

We consider the numerical stability of the parameter recovery problem in Linear Structural Equation Model ($\LSEM$) of causal inference. A long line of work starting from Wright (1920) has focused on understanding which sub-classes of $\LSEM$ allow for efficient parameter recovery. Despite decades of study, this questi…

2019-05-16abs ↗pdf ↗

Study financial contagion and risk in sparse networks with directed edges.

problem Analyzing systemic risk in sparse financial networks with balance-sheet interactions.
method Linear fraction of institutions with zero out-degree, sender-truncated subgraph G_sh, adversarial and random systemic events, explicit fan-in accumulation bound.
result Maximal forward reachability in G_sh is O(log n) with high probability in the subcritical regime, and multi-hit defaults are negligible in the supercritical regime.

The paper examines partial regularity of Lipschitz solutions to minimal surface system.

problem Understanding the regularity of solutions to the minimal surface system.
method Investigation of stationary, integral weak, and viscosity solutions; interior gradient estimate using maximum principle.
result Partial regularity results for Lipschitz solutions, including interior gradient estimate.

The paper constructs solutions to a critical Dirac equation on spheres.

problem Solving the critical Dirac equation on spheres with singularities.
method Constructing Delaunay-type solutions and another kind of singular solutions.
result The constructed solutions are building blocks for singular solutions on Spin manifolds.