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

Trend · papers per month

91181272362 · Jun 202019922001200920172026
48 results for matrix types

In this paper we consider the Poisson algebraic structure associated with a classical rr-matrix, i.e. with a solution of the modified classical Yang--Baxter equation. In Section 1 we recall the concept and basic facts of the rr-matrix type Poisson orbits. Then we describe the rr-matrix Poisson pencil (i.e the pair o…

1998-12-25abs ↗pdf ↗

Framework for joint inference of network topology and interaction types in heterogeneous systems.

problem Joint inference of network topology, multi-type interaction kernels, and latent type assignments in heterogeneous interacting particle systems.
method Three-stage approach: shared structure recovery, discrete interaction type identification, and matrix factorization.
result The method yields accurate reconstruction of underlying dynamics and is robust to noise.

New algorithms improve RPCA for large matrices with upper rank bounds.

problem Efficiently decompose large matrices into low-rank and sparse parts.
method Combine regularization and matrix multiplication approaches with upper rank bounds.
result Proposed algorithms are faster and more robust than existing methods.

This paper analyzes privacy threats in federated matrix factorization.

problem Privacy threats in federated matrix factorization models.
method Categorizes federated matrix factorization into three types and analyzes privacy threats.
result This is the first study of privacy threats in federated matrix factorization.

We consider stochastic partial differential equations appearing as Markovian lifts of matrix valued (affine) Volterra type processes from the point of view of the generalized Feller property (see e.g., \cite{doetei:10}). We introduce in particular Volterra Wishart processes with fractional kernels and values in the con…

2019-07-02abs ↗pdf ↗

Homotopy commutativity in quasitoric manifolds depends on polytope structure and characteristic matrix type.

problem Conditions for homotopy commutativity in quasitoric manifolds.
method Analyzing characteristic matrices and polytope structures.
result Homotopy commutativity is determined by specific polytope and matrix conditions.

We study two types of preconditioners and preconditioned stochastic gradient descent (SGD) methods in a unified framework. We call the first one the Newton type due to its close relationship to the Newton method, and the second one the Fisher type as its preconditioner is closely related to the inverse of Fisher inform…

2018-09-26abs ↗pdf ↗

The paper is on the vanishing topology of singular Milnor fibres of holomorphic families of arbitrary square, symmetric and skew-symmetric matrices with sufficiently many parameters. We define vanishing cycles on such fibres, prove an extended form of the Damon-Pike μ=τμ=τ conjecture about the families of a special type…

2019-09-10abs ↗pdf ↗

The paper studies transformations of Frobenius manifolds and their properties.

problem Analyzing transformations of Frobenius manifolds and their properties.
method Analytic theory of Legendre-type transformations for Frobenius manifolds.
result Monodromy data, Stokes matrix, and central connection matrix are shared among Legendre-type transformations.

Paper proposes a new approach to optimal transport for vector and matrix densities.

problem Optimal transport for vector and matrix densities with positivity and action transitivity constraints.
method Gauge-theoretic approach using semi-direct product groups of diffeomorphisms and gauge transformations.
result Bures-type metrics on semi-direct product groups relate to Wasserstein-type metrics on vector and matrix densities via Riemannian submersions.

Generalized Precision Matrix for scalable estimation of nonparametric Markov networks.

problem Estimating conditional independence structure in general distributions for all data types.
method Generalized Precision Matrix (GPM) for mixed-type variables, regularized score matching framework for scalability.
result Validated theoretical results and demonstrated scalability in various settings.

Derives matrix Harnack inequalities for semilinear heat equations on manifolds.

problem Bounding solutions of semilinear heat equations on manifolds with geometric constraints.
method Applies Li-Yau estimates to derive Harnack inequalities for positive solutions.
result Derives matrix Harnack inequalities for positive solutions of semilinear heat equations.

We study the statistical decision process of detecting the signal from a `signal+noise' type matrix model with an additive Wigner noise. We propose a hypothesis test based on the linear spectral statistics of the data matrix, which does not depend on the distribution of the signal or the noise. The test is optimal unde…

2020-01-16abs ↗pdf ↗

This work establishes always-valid risk bounds for online matrix completion.

problem Challenges in establishing always-valid concentration inequalities for online matrix completion.
method Combines non-asymptotic martingale concentration and regularized low-rank matrix regression.
result Establishes always-valid risk bound process for online matrix completion.

Study real logarithms of semi-simple matrices, focusing on differential structure.

problem Understanding the differential structure of real logarithms of semi-simple matrices.
method Examines the differential structure of real logarithms of semi-simple matrices under specific matrix types.
result Characterizes the differential structure of real logarithms of semi-simple matrices.

The paper examines when real matrix Schubert varieties are minimal submanifolds.

problem When are real matrix Schubert varieties minimal submanifolds?
method The authors establish minimality conditions using geometric arguments and partial permutations.
result The paper identifies specific conditions for real matrix Schubert varieties to be minimal submanifolds.

New Hessian estimates for heat equations on manifolds.

problem Estimating Hessian matrices for heat-type equations on Riemannian manifolds.
method Using Bismut-Stroock Hessian formula, with explicit coefficients and delay/growth rate functions.
result Novel backward weak Harnack inequality and precise pointwise Hessian estimates for eigenfunctions.

We use topological methods to prove a semicontinuity property of the Hodge spectra for analytic germs defined on an isolated surface singularity. For this we introduce an analogue of the Seifert matrix (the fractured Seifert matrix), and of the Levine--Tristram signatures associated with it, defined for null-homologous…

2013-08-23abs ↗pdf ↗

Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in da…

2014-10-01abs ↗pdf ↗

Study generalizes matrix completion with side info in low noise settings.

problem Matrix completion with side information in low noise conditions.
method Inductive matrix completion with i.i.d. subgaussian noise, uniform sampling, and side information.
result Generalization bounds with noise scaling, convergence to zero, and logarithmic dependence on matrix size.

Paper explores subdifferential chain rules for matrix factorization and related machine learning models.

problem Clarke subdifferential chain rules for matrix factorization and factorization machines.
method Analyzes conditions for subdifferential chain rules to hold, especially for overparameterized models.
result Subdifferential chain rules hold for matrix factorization and factorization machines under certain conditions.

In this paper we give definitions of matrix rates of return which do not depend on the choice of basis describing baskets. We give their economic interpretation. The matrix rate of return describes baskets of arbitrary type and extends portfolio analysis to the complex variable domain. This allows us for simultaneous a…

2006-07-19abs ↗pdf ↗

We consider the problem of matrix completion on an n×mn \times m matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the problem can be reformulated as a binary convex optimization problem. We design Opt…

2018-12-17abs ↗pdf ↗

A method for community detection in multilayer networks using data matrices.

problem Community detection in multilayer networks with various node attributes.
method Data matrix representation and regular decomposition method extension for compression.
result Method identifies community structures well-aligned with real-world network hierarchies.

Advances neural tri-factorization for clustering and discordance analysis of multi-typed data.

problem Challenges in analyzing heterogeneous, multimodal relational data.
method Deep collective matrix tri-factorization for spectral clustering and cluster association learning.
result Demonstrates efficacy over previous non-neural approaches in clustering and discordance analysis.

The paper models stochastic interest rates for life insurance using phase-type distributions.

problem Modeling stochastic interest rates in life insurance with matrix approach.
method Integrates piecewise deterministic interest rates into a Markov jump process framework.
result Explicit formulas for reserves and future payments can be derived.

The paper proposes methods for predicting missing values in mixed data matrices.

problem Matrix completion for mixed data types (continuous, binary, ordinal).
method Generalized latent factor models for low-rank matrix estimation with entrywise consistency.
result Tight probabilistic error bounds for the proposed estimators.

The paper connects Riemannian Gaussian distributions to random matrix theory and diffusion kernels.

problem Analyzing Riemannian Gaussian distributions on symmetric spaces.
method Analytical computation of marginals using orthogonal and skew orthogonal polynomials, and diffusion kernels.
result Riemannian Gaussian distributions are random matrix types, and their probability density functions can be computed analytically.

We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced on the graph defined by the consensus matrix and the eigenvalues of the associated transition proba…

2014-08-05abs ↗pdf ↗

Proposes a method to cluster multi-aspect data using manifold learning with NMF.

problem Clustering multi-aspect data with diverse features and views.
method Includes inter-manifold learning in NMF framework to handle different data types.
result The method improves clustering accuracy and efficiency on various datasets.

Matrix factorization is a key tool in data analysis; its applications include recommender systems, correlation analysis, signal processing, among others. Binary matrices are a particular case which has received significant attention for over thirty years, especially within the field of data mining. Dictionary learning …

2018-04-16abs ↗pdf ↗

We introduce a novel Bayesian hybrid matrix factorisation model (HMF) for data integration, based on combining multiple matrix factorisation methods, that can be used for in- and out-of-matrix prediction of missing values. The model is very general and can be used to integrate many datasets across different entity type…

2017-04-17abs ↗pdf ↗