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

119238356475 · Jun 202019922001200920172026
48 results for number decomposition

We construct a Seifert surface for a given null-homologous transverse link in a contact manifold that is compatible with a planar open book decomposition, then obtain a formula of the self-linking number. It extends Bennequin's self-linking number formula for braids in the standard contact 3-sphere.

2011-03-05abs ↗pdf ↗

The paper bounds distances and transformations between pants decompositions and triangulations on surfaces.

problem Finding bounds on distances and transformations between pants decompositions and triangulations.
method Using pre-triangulations, train tracks, and Agol-Hass-Thurston algorithm.
result Upper bounds on distances and transformations between pants decompositions and triangulations.

Let KK be a tunnel number two knot. Then, by considering the (g,b)(g, b)-decompositions, KK is one of (3, 0)-, (2, 1)-, (1, 2)- or (0, 3)-knots. In the present paper, we analyze the connected sum summands of composite tunnel number two knots and give a complete table of those summands from the point of view of (g,b)(g, b)-…

2014-09-03abs ↗pdf ↗

Transformer models improve arithmetic accuracy with number decomposition.

problem Transformer models struggle with arithmetic operations without decomposition.
method Fine-tuning models with a pipeline that decomposes numbers into units, tens, etc.
result Accuracy increased by 63% in five-digit addition tasks.

We present an algorithm for the decomposition of periodic financial return data into orthogonal factors of expected return and "systemic", "productive", and "nonproductive" risk. Generally, when the number of funds does not exceed the number of periods, the expected return of a portfolio is an affine function of its pr…

2012-06-11abs ↗pdf ↗

M. Scharlemann has recently proved that any genus one tunnel number one knot is either a satellite or 2-bridge knot, as conjectured by H. Goda and M. Teragaito; all such knots admit a (1,1) decomposition. In this paper we give a classification of the family of (1,1) knots in S3S^3 with crosscap number two (i.e., boundi…

2005-10-31abs ↗pdf ↗

The paper uses tensor decompositions to improve neural network models for tree data.

problem Encoding structural knowledge from tree-structured data efficiently.
method Introduces new aggregation functions using Canonical and Tensor-Train decompositions.
result Proposed models outperform traditional methods on tree classification tasks.

In this paper we consider the use of the space vs. time Kronecker product decomposition in the estimation of covariance matrices for spatio-temporal data. This decomposition imposes lower dimensional structure on the estimated covariance matrix, thus reducing the number of samples required for estimation. To allow a sm…

2013-07-27abs ↗pdf ↗

Given a rational homology sphere which bounds rational homology balls, we investigate the complexity of these balls as measured by the number of 1-handles in a handle decomposition. We use Casson-Gordon invariants to obtain lower bounds which also lead to lower bounds on the fusion number of ribbon knots. We use Levine…

2016-10-31abs ↗pdf ↗

Researchers decompose hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.

problem Decomposing hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.
method Two different approaches to demonstrate the existence of polyhedral decompositions.
result The number of polyhedral decompositions of MM is finite.

In this paper, we introduce an algorithm for performing spectral clustering efficiently. Spectral clustering is a powerful clustering algorithm that suffers from high computational complexity, due to eigen decomposition. In this work, we first build the adjacency matrix of the corresponding graph of the dataset. To bui…

2017-04-07abs ↗pdf ↗

Enhanced Bruhat decomposition studies Morse theory and Reidemeister torsion.

problem Investigating the Bruhat numbers associated with Morse functions.
method Using a variation of the classical Bruhat decomposition for GL(F)GL(\mathbb{F}).
result The product of Bruhat numbers is independent of the Morse function and interpretable as Reidemeister torsion.

The paper bounds the handle number of sutured manifolds using Morse-Novikov numbers and tunnel numbers.

problem Bounding the handle number of sutured manifolds.
method Developed bounds on the Morse-Novikov number of a link in terms of its tunnel number, and used these to bound the handle number of Heegaard splittings.
result The handle number function is bounded, constant on rays from the origin, and locally maximal.

A new decomposition explains over-parameterized models' counterintuitive behaviors.

problem Understanding predictive error in over-parameterized models.
method Introducing the Generalized Aliasing Decomposition (GAD) to explain predictive performance.
result The GAD decomposes predictive error into three parts: model insufficiency, data insufficiency, and generalized aliasing.

DDD reformulated for sparse matrices, integrating trajectory and snapshot time series data.

problem Efficiently integrate trajectory and snapshot time series data.
method Reformulate DDD to use compact basis functions, reducing parameter scaling.
result Inference of sparse matrices reduces the number of parameters in DDD.

The paper studies families of curves on surfaces that realize all types of pants decompositions.

problem Finding the minimal size of families of curves on surfaces that realize all types of pants decompositions.
method Investigates exponential and superlinear bounds for surfaces without punctures, and provides bounds for surfaces with punctures.
result Provides bounds for the minimal size of families of curves on surfaces with and without punctures.

The mapping class group invariant ideal cell decomposition of the Teichmueller space of a punctured surface times an open simplex has been used in a number of computations. This paper answers a question about the asymptotics of this decomposition, namely, in a given cell of the decomposition, which curves can be short?…

2007-07-10abs ↗pdf ↗

New algorithms solve tensor problems with random components using SDP.

problem Exact tensor nuclear norm, decomposition, and completion for random tensors.
method Degree-4 Sum of Squares (SOS) semidefinite programs.
result Exact solutions for tensor nuclear norm, decomposition, and completion with random asymmetric components.

TWIST algorithm detects communities in multi-layer networks with tensor decomposition.

problem Community detection in multi-layer networks with multiple node-modality relationships.
method Tensor-based TWIST algorithm for global/local node and layer memberships.
result Accurate community detection with small misclassification error as network size increases.

The paper deals with regression problems, in which the nonsmooth target is assumed to switch between different operating modes. Specifically, piecewise smooth (PWS) regression considers target functions switching deterministically via a partition of the input space, while switching regression considers arbitrary switch…

2017-07-25abs ↗pdf ↗

Model predicts short-term Amazon rainforest fires with high accuracy.

problem Accurate short-term forecasting of Amazon rainforest fires is challenging.
method Used Seasonal and Trend decomposition based on Loess combined with multi-month-ahead load forecasting algorithms.
result Proposed decomposition-ensemble models provide more accurate forecasts than other models.

We determine the structure of the circular handle decompositions of the family of free genus one knots. Namely, if k is a free genus one knot, then the handle number h(k)= 0, 1 or 2, and, if k is not fibered (that is, if h(k)>0), then k is almost fibered. For this, we develop practical techniques to construct circular …

2013-10-14abs ↗pdf ↗

New method decomposes profits and losses continuously, avoiding discrete reporting issues.

problem Analyzing profits and losses at discrete dates ignores detailed paths.
method Constructs a large class of continuous-time decompositions using extended Itô's formula.
result Identifies a preferred decomposition from exactness, symmetry, and normalization axioms.

Study compact PL 4-manifolds with special handle decompositions.

problem Existence of special handlebody decompositions for simply-connected closed PL 4-manifolds.
method Investigate colored triangulations inducing handle decompositions without 1-handles or 1- and 3-handles.
result Detect a class of compact simply-connected PL 4-manifolds with empty or connected boundary that admit such decompositions.

Paper proves optimal decomposition for matrix fields, reducing convex integration steps.

problem Optimizing decomposition of symmetric matrix fields for convex integration.
method Algebraic geometry and topology applications to prove optimality.
result Optimal decomposition with fewer rank-one terms, improving Hölder regularity.

The focus of this paper is the efficient computation of counterparty credit risk exposure on portfolio level. Here, the large number of risk factors rules out traditional PDE-based techniques and allows only a relatively small number of paths for nested Monte Carlo simulations, resulting in large variances of estimator…

2016-08-03abs ↗pdf ↗

We show the existence of a thick thin decomposition of the domain of a pseudo holomorphic curve with boundary. The geometry of the thick part is bounded uniformly in the energy. Furthermore, in the thick part, there is a uniform bound on the differential which is exponential in the energy. The thin part consists of ann…

2013-11-29abs ↗pdf ↗

We propose the Relational Tucker3 (RT) decomposition for multi-relational link prediction in knowledge graphs. We show that many existing knowledge graph embedding models are special cases of the RT decomposition with certain predefined sparsity patterns in its components. In contrast to these prior models, RT decouple…

2019-02-03abs ↗pdf ↗

This paper is concerned with the problem of low rank plus sparse matrix decomposition for big data. Conventional algorithms for matrix decomposition use the entire data to extract the low-rank and sparse components, and are based on optimization problems with complexity that scales with the dimension of the data, which…

2015-02-01abs ↗pdf ↗

AL0\ell_0CORE tensor decomposition reduces computational cost for sparse count data.

problem Efficiently decompose sparse count data matrices.
method Probabilistic Tucker decomposition with 0\ell_0-norm constraint.
result AL0\ell_0CORE achieves similar results to full Tucker decomposition at a fraction of the cost.

Defines quantum intersection number on pants decompositions and relates it to hyperbolic geometry.

problem Quantum and geometric intersection numbers on surfaces and 3-manifolds.
method Using asymptotic expansions of curve operators in skein theory, we define quantum intersection numbers and relate them to geometric intersection numbers and Teichmüller geometry.
result The pants graph equipped with a metric derived from quantum intersection numbers is quasi-isometric to the Teichmüller space with the Weil-Petersson metric.