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

Trend · papers per month

12.5%25.0%37.5%50.0% · Mar 199419922001200920172026
48 results for matrix power mean

New method clusters signed graphs using matrix power means.

problem Clustering signed graphs with positive and negative relations.
method Signed Power Mean Laplacian, defined as matrix power mean of normalized standard and signless Laplacians.
result Signed power mean Laplacian captures ground truth clusters under reasonable settings.

Study of metrics on positive-definite matrices from power potential, linking to power means.

problem Understanding metrics on positive-definite matrices derived from power potential.
method Explicit expressions for geodesics and distance function derived from Hessian of power potential.
result Geodesics and distance function converge to weighted matrix geometric mean as β tends to zero.

Multilayer graphs encode different kind of interactions between the same set of entities. When one wants to cluster such a multilayer graph, the natural question arises how one should merge the information different layers. We introduce in this paper a one-parameter family of matrix power means for merging the Laplacia…

2018-03-01abs ↗pdf ↗

The paper derives Cramer-Rao bounds for Laplacian matrix estimation under various constraints.

problem Estimating Laplacian matrices with structural constraints and sparsity.
method Linear reparametrization and closed-form expressions for Cramer-Rao bounds tailored to Laplacian matrix estimation.
result The derived CRBs provide performance limits for Laplacian matrix estimation and are validated in various applications.

We present a formula for the trace of any symmetric power of a n×nn\times n matrix (with coefficients in a field) in terms of the ordinary powers of the matrix, an arbitrarily chosen linear function which vanishes on the identity matrix, and n2n-2 polynomial functions defined recursively.

2014-11-03abs ↗pdf ↗

Random feature maps are ubiquitous in modern statistical machine learning, where they generalize random projections by means of powerful, yet often difficult to analyze nonlinear operators. In this paper, we leverage the "concentration" phenomenon induced by random matrix theory to perform a spectral analysis on the Gr…

2018-05-30abs ↗pdf ↗

A class of conserved models of wealth distributions are studied where wealth (or money) is assumed to be exchanged between a pair of agents in a population like the elastically colliding molecules of a gas exchanging energy. All sorts of distributions from exponential (Boltzmann-Gibbs) to something like Gamma distribut…

2006-04-20abs ↗pdf ↗

New method improves portfolio selection by filtering noisy covariance matrices.

problem Noisy covariance matrices in financial datasets affect portfolio performance evaluation.
method Combinatorial Optimization approach using Mixed Integer Quadratic Programming.
result Our method outperforms existing filtering strategies for real financial datasets.

The mean-field variant of the model of limit order driven market introduced recently by Maslov is formulated and solved. The agents do not have any strategies and the memory of the system is kept within the order book. We show that he evolution of the order book is governed by a matrix multiplicative process. The resul…

2001-04-27abs ↗pdf ↗

This paper solves the convergence problem for estimating MGGD parameters with a convex formulation.

problem Establishing convergence properties for estimating MGGD parameters with unknown mean and precision matrix.
method Proposes a convex formulation with well-established convergence properties for robust estimation in noisy scenarios.
result Demonstrates improved accuracy in precision and covariance matrix estimation compared to existing methods.

We study an extention of total variation denoising over images to over Cartesian power graphs and its applications to estimating non-parametric network models. The power graph fused lasso (PGFL) segments a matrix by exploiting a known graphical structure, GG, over the rows and columns. Our main results shows that for …

2018-05-25abs ↗pdf ↗

Paper proposes an efficient algorithm for nonnegative binary matrix factorization.

problem Decomposing binary data using matrix factorization.
method Majorization-minimization algorithm with Beta prior for improved performance.
result Proposed algorithm offers excellent trade-off between performance, complexity, and interpretability.

A new method for distributed PCA using matrix β-mean.

problem Efficiently aggregating PCA results across multiple machines with reduced computational overhead.
method Proposes a novel DPCA method that incorporates eigenvalue information using the matrix β-mean.
result The matrix β-mean method improves robustness and stability of eigenvector ordering.

Proposes a new regularizer for semi-supervised learning on multilayer graphs.

problem Semi-supervised learning on multilayer graphs with labeled and unlabeled data.
method Generalized matrix mean regularizer and matrix-free numerical scheme.
result The regularizer outperforms state-of-the-art methods numerically.

We give a complete algorithm and source code for constructing what we refer to as heterotic risk models (for equities), which combine: i) granularity of an industry classification; ii) diagonality of the principal component factor covariance matrix for any sub-cluster of stocks; and iii) dramatic reduction of the facto…

2015-08-20abs ↗pdf ↗

We show that the objective function of conventional k-means clustering can be expressed as the Frobenius norm of the difference of a data matrix and a low rank approximation of that data matrix. In short, we show that k-means clustering is a matrix factorization problem. These notes are meant as a reference and intende…

2015-12-23abs ↗pdf ↗

Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related characteristics. Based on several natural complex dynamical systems, like the str…

2001-12-14abs ↗pdf ↗

Paper analyzes singular subspace estimation in noisy matrix models.

problem Estimating low-rank signals in noisy matrix data.
method Asymptotic distributional theory, extreme value theory, saddle point approximation, random matrix theory.
result Plug-in test statistic based on two-to-infinity norm has higher power for detecting structured alternatives.

M-learner estimates treatment effects in mediation models with subgroup identification.

problem Estimating heterogeneous treatment effects in mediation models.
method Four-step procedure: compute conditional effects, construct distance matrix, apply tSNE and K-means clustering, refine clusters.
result Validates robustness and effectiveness in real-world dataset.

In this article we consider means of positive operators on a Hilbert space. We extend the theory of matrix power means to arbitrary operator means in the sense of Kubo-Ando. The basis of the extension is relying on ideas coming from differential geometry. We consider generalized Karcher equations for positive operators…

2012-08-28abs ↗pdf ↗

A wide variety of application domains are concerned with data consisting of entities and their relationships or connections, formally represented as graphs. Within these diverse application areas, a common problem of interest is the detection of a subset of entities whose connectivity is anomalous with respect to the r…

2014-01-29abs ↗pdf ↗

New method estimates log-determinant using trace powers, avoiding classical limitations.

problem Estimating log-determinant of large matrices efficiently and accurately.
method Interpolating moment-generating function and its derivative at zero using trace powers.
result No continuous estimator using finite moments can be uniformly accurate over unbounded conditioning.

Novel mean estimation method under user-level differential privacy reduces noise in continual mean estimates.

problem Maintaining accurate running mean estimates under user-level differential privacy.
method Developed a novel mean estimation specific factorization under approximate differential privacy.
result Achieved asymptotically lower mean-squared error bounds in continual mean estimation.

EPMF factorizes matrices by adjusting their entries to match a specified power.

problem Factorizing matrices with adjusted entries to match a specified power.
method Analyzes the computational complexity of exact and approximate EPMF problems.
result Exact EPMF is strongly NP-hard, but can be solved in polynomial time when rank is fixed.

Entropy regularization improves power k-means for high-dimensional data.

problem Power k-means' tendency to get stuck in local minima and performance in high dimensions.
method Entropy regularization to learn feature relevance, combined with majorization-minimization algorithm.
result Consistent learning and scalable algorithm with closed-form updates and convergence guarantees.

We accelerate the power method for strong low-rank approximation using fast sketching.

problem Efficiency bottleneck in power method for large target ranks.
method Developed an algorithmic and theoretical framework for accelerating the power method using fast sketching.
result Simple and provably efficient methods for singular value decomposition, low-rank factorization, and Nyström approximation.

The paper introduces a new kernel-based Maximum Mean Discrepancy (MMD) statistic for measuring the distance between two distributions given finitely-many multivariate samples. When the distributions are locally low-dimensional, the proposed test can be made more powerful to distinguish certain alternatives by incorpora…

2017-09-14abs ↗pdf ↗

If a knot K has Seifert matrix V_K and has a prime power cyclic branched cover that is not a homology sphere, then there is an infinite family of non-concordant knots having Seifert matrix V_K.

2001-01-04abs ↗pdf ↗

A clustering algorithm uses the left Gram matrix for high dimensional data.

problem Clustering high dimensional data with many features and few objects.
method The algorithm uses the normalized left Gram matrix G = XX'/P to cluster objects based on row means.
result The algorithm provides the most accurate cluster configuration more than twice as often as competitors.

Diffusion models' consistency across splits explained by random matrix theory.

problem Consistency of diffusion models trained on non-overlapping subsets.
method Random matrix theory framework to quantify dataset effects on denoiser and sampling map.
result The theory explains and predicts cross-split disagreement in diffusion models.

Neural-Kernel CME tackles scalability and expressiveness challenges in conditional distribution representation.

problem Scalability and expressiveness challenges in kernel conditional mean embeddings.
method Combines deep learning with CMEs using a neural network optimization framework.
result Achieves competitive and often superior performance in conditional density estimation and RL.