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

82163245326 · Jun 202019922001200920172026
48 results for Multiplicative decomposition

Paper shows unique decomposition of 3-manifolds and multiplicative property of Reidemeister torsion.

problem Unique decomposition of compact 3-manifolds.
method Study of adjoint Reidemeister torsion on disk sum decompositions.
result Adjoint Reidemeister torsion has a multiplicative property on unique decompositions.

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and always minimizes the KL divergence from an inpu…

2018-02-13abs ↗pdf ↗

The study improves theoretical understanding of using multiple synthetic datasets for better model accuracy.

problem Lack of theoretical understanding of using multiple synthetic datasets for supervised learning.
method Derive bias-variance decompositions for multiple synthetic datasets settings.
result A simple rule of thumb to select the appropriate number of synthetic datasets.

New method evaluates multiple social disparities using machine learning.

problem Reduction of educational disparities across multiple dimensions.
method Triply-Robust Machine Learning Approach for Causal Decomposition Analysis.
result Simultaneous interventions across multiple domains reduce disparities.

No arbitrage in financial markets with special semimartingales.

problem Proving the absence of arbitrage in non-numéraire financial markets.
method Proving the absence of arbitrage using a multiplicative special semimartingale deflator.
result The market is free of arbitrage if and only if there exists a multiplicative special semimartingale deflator.

BIDIFAC+ factorizes linked matrices for cancer studies.

problem Integrating multiple omics platforms across various cancer types.
method Flexible approach to simultaneous factorization and decomposition of linked matrices using BIDIFAC+.
result Identifies shared and specific modes of variability across multiple omics platforms and cancer types.

Given a handle decomposition of a 4-manifold with boundary, and an open book decomposition of the boundary, we show how to produce a trisection diagram of a trisection of the 4-manifold inducing the given open book. We do this by making the original proof of the existence of relative trisections more explicit, in terms…

2018-01-26abs ↗pdf ↗

We give a formula of the connected component decomposition of the Alexander quandle: Z[t±1]/(f1(t),,fk(t))=i=0a1Orb(i)\mathbb{Z}[t^{\pm1}]/(f_1(t),\ldots, f_k(t))=\bigsqcup^{a-1}_{i=0}\mathrm{Orb}(i), where a=gcd(f1(1),,fk(1))a=\gcd (f_1(1),\ldots, f_k(1)). We show that the connected component Orb(i)\mathrm{Orb}(i) is isomorphic to Z[t±1]/J\mathbb{Z}[t^{\pm1}]/J with an expli…

2017-04-25abs ↗pdf ↗

Identifies conditions for multiple invariant probabilities in Markov kernels.

problem Global irreducibility and recurrence do not guarantee uniqueness of invariant probabilities.
method Uses Jordan decomposition of the difference of two invariant probabilities.
result A Markov kernel has more than one invariant probability if and only if it admits a visible absorbing decomposition.

Higher-order tensors have received increased attention across science and engineering. While most tensor decomposition methods are developed for a single tensor observation, scientific studies often collect side information, in the form of node features and interactions thereof, together with the tensor data. Such data…

2019-10-21abs ↗pdf ↗

We consider knots whose diagrams have a high amount of twisting of multiple strands. By encircling twists on multiple strands with unknotted curves, we obtain a link called a generalized augmented link. Dehn filling this link gives the original knot. We classify those generalized augmented links that are Seifert fibere…

2009-06-24abs ↗pdf ↗

This work presents a general unified theory for coupled nonlinear elastic and inelastic deformations of curved thin shells. The coupling is based on a multiplicative decomposition of the surface deformation gradient. The kinematics of this decomposition is examined in detail. In particular, the dependency of various ki…

2018-10-23abs ↗pdf ↗

A new method for analyzing multi-source, multi-way data reduces dimensionality and reveals shared and individual structures.

problem Analyzing multi-source, multi-way data from different high-throughput technologies.
method Multiple Linked Tensor Factorization (MULTIFAC) extending CP decomposition with L2 penalties and EM algorithm for incomplete data.
result MULTIFAC approximates underlying signal, identifies shared and unshared structures, and imputes missing data.

High throughput biomedical measurements normally capture multiple overlaid biologically relevant signals and often also signals representing different types of technical artefacts like e.g. batch effects. Signal identification and decomposition are accordingly main objectives in statistical biomedical modeling and data…

2017-10-23abs ↗pdf ↗

Tensor decompositions are powerful tools for large data analytics as they jointly model multiple aspects of data into one framework and enable the discovery of the latent structures and higher-order correlations within the data. One of the most widely studied and used decompositions, especially in data mining and machi…

2018-07-03abs ↗pdf ↗

MSD removes dequantization bottleneck in LLM inference by approximating high-precision activations.

problem Dequantization bottleneck in LLM inference on modern AI accelerators.
method MSD decomposes high-precision activations into multiple low-precision components for direct multiplication with quantized weights.
result MSD avoids INT8-to-BF16 weight conversion, reducing dequantization cycles and HBM traffic.

The paper introduces new measures to quantify variability in decision tree models due to observational multiplicity.

problem The variability in decision tree models due to observational multiplicity.
method Introduces leaf regret and structural regret to decompose observational multiplicity.
result Structural regret is the primary driver of observational multiplicity, accounting for over 15 times the variability of leaf regret in some datasets.

ST-MTM models complex time series by decomposing and masking seasonal and trend components.

problem Forecasting complex time series with intricate temporal variations.
method Seasonal-Trend Decomposition with Masking and Contrastive Learning.
result ST-MTM achieves superior forecasting performance compared to existing methods.

The paper describes decompositions of geometric measures on Anosov homogeneous spaces.

problem Decomposing geometric measures on Anosov homogeneous spaces.
method Ergodic decompositions of Burger-Roblin and Bowen-Margulis-Sullivan measures.
result The space of non-trivial invariant ergodic measures is homeomorphic to a product space.

Left invariant affine structures in a Lie group GG are in one-to-one correspondence with left-symmetric algebras over its Lie algebra g=TeG\mathfrak g=T_eG (``over'' means that the commutator [x,y]=xyyx[x,y]=xy-yx coincides with the Lie bracket; left-symmetric algebras can be defined as Lie-admissible algebras such that the mult…

2005-12-24abs ↗pdf ↗

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.

Tensor decomposition, a collection of factorization techniques for multidimensional arrays, are among the most general and powerful tools for scientific analysis. However, because of their increasing size, today's data sets require more complex tensor decomposition involving factorization with multiple matrices and dia…

2019-05-24abs ↗pdf ↗

Often, large, high dimensional datasets collected across multiple modalities can be organized as a higher order tensor. Low-rank tensor decomposition then arises as a powerful and widely used tool to discover simple low dimensional structures underlying such data. However, we currently lack a theoretical understanding …

2018-10-23abs ↗pdf ↗

This paper derives a portfolio decomposition formula when the agent maximizes utility of her wealth at some finite planning horizon. The financial market is complete and consists of multiple risky assets (stocks) plus a risk free asset. The stocks are modelled as exponential Brownian motions with drift and volatility b…

2007-02-24abs ↗pdf ↗

Develops methods to analyze feature-outcome associations in subpopulations.

problem Challenges in understanding feature-outcome associations in high-dimensional data.
method Geometric decomposition framework using gradient flow and co-monotonicity decomposition.
result Identifies context-dependent patterns and improves statistical power and interpretability.

This paper introduces \infty- and nn-fold vector bundles as special functors from the \infty- and nn-cube categories to the category of smooth manifolds. We study the cores and "n-pullbacks" of nn-fold vector bundles and we prove that any nn-fold vector bundle admits a non-canonical isomorphism to a decomposed …

2018-09-05abs ↗pdf ↗

Develops a new tensor PCA method for analyzing multiple network data.

problem Analyzing multiple large networks for dimensionality reduction.
method Semi-Symmetric Tensor PCA (SS-TPCA) for principal components analysis.
result SS-TPCA achieves the same estimation accuracy as classical matrix PCA, with error proportional to the square root of the number of vertices.