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.
Develops a novel stochastic algorithm for diagonal estimation of large matrices.
In this article, we derive off-diagonal estimates of the Bergman kernel associated to tensor- products of the cotangent line bundle defined over a hyperbolic Riemann surface of finite volume.
We give an overview of the generalized Calderón-Zygmund theory for "non-integral" singular operators, that is, operators without kernels bounds but appropriate off-diagonal estimates. This theory is powerful enough to obtain weighted estimates for such operators and their commutators with $\BMO$ functions. of…
Paper estimates GMMs with unknown covariances using sparse regularization.
Two Fisher information matrix estimators are analyzed for neural networks, focusing on their variances and trade-offs.
Method estimates M-matrices in graphical models with improved accuracy.
New method for estimating financial covariance matrices efficiently.
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…
Three methods for tuning HMC diagonal scale matrices compared.
A Semi-Hidden Markov Model (SHMM) for bursty error channels is defined by a state transition probability matrix , a prior probability vector , and the state dependent output symbol error probability matrix . Several processes are utilized for estimating , and from a given empirically obtained or sim…
DGMM improves Gaussian mixture modeling efficiency and stability.
This paper solves matrix blind joint block diagonalization with noise.
Diagonalizes metrics of 3D Lorentzian manifolds.
This paper tackles model selection for MoE models in high-dimensional data.
Uncertainty estimation in large deep-learning models is a computationally challenging task, where it is difficult to form even a Gaussian approximation to the posterior distribution. In such situations, existing methods usually resort to a diagonal approximation of the covariance matrix despite, the fact that these mat…
We study the asymptotic behavior of the generalized Bergman kernel of the renormalized Bochner-Laplacian on high tensor powers of a positive line bundle on a symplectic manifold of bounded geometry. First, we establish the off-diagonal exponential estimate for the generalized Bergman kernel. As an application, we obtai…
Study Ricci vector fields on 2D space with diagonal metrics.
Octagon map accelerates diagonal changes algorithm.
New model handles complex non-linear relationships with hidden graph structures.
Study finds symmetries in a special 3D space with a diagonal metric.
New diagonal knots found with non-torus structure.
We consider moment matching techniques for estimation in Latent Dirichlet Allocation (LDA). By drawing explicit links between LDA and discrete versions of independent component analysis (ICA), we first derive a new set of cumulant-based tensors, with an improved sample complexity. Moreover, we reuse standard ICA techni…
We use mathematical induction to prove that the horizontal composition in the class of coherently diagonal complexes is indeed a binary operation. That is to say, the embedding of two coherently diagonal complexes in an alternating planar diagram produces a coherently diagonal complex.
Gaussian graphical models are widely utilized to infer and visualize networks of dependencies between continuous variables. However, inferring the graph is difficult when the sample size is small compared to the number of variables. To reduce the number of parameters to estimate in the model, we propose a non-asymptoti…
Most known four-dimensional cohomogeneity-one Einstein metrics are diagonal in the basis defined by the left-invariant one-forms, though some essentially non-diagonal ones are known. We consider the problem of explicitly seeking non-diagonal Einstein metrics, and we find solutions which in some cases exhaust the possib…
Equal diagonal energies proven on Liouville surfaces.
Diagonal linear networks converge to lasso regularization path during training.
We show that a basis of a semisimple Lie algebra of compact type, for which any diagonal left-invariant metric has a diagonal Ricci tensor, is characterized by the Lie algebraic condition of being "nice". Namely, the bracket of any two basis elements is a multiple of another basis element. This extends the work of Laur…
New diagonal move simplifies knots and links efficiently.
T-Rex uses EM to fit robust factor models in noisy data.
We obtain the natural diagonal almost product and locally product structures on the total space of the cotangent bundle of a Riemannian manifold. We find the Riemannian almost product (locally product) and the (almost) para-Hermitian cotangent bundles of natural diagonal lift type. We prove the characterization theorem…
Clustering analysis is one of the most widely used statistical tools in many emerging areas such as microarray data analysis. For microarray and other high-dimensional data, the presence of many noise variables may mask underlying clustering structures. Hence removing noise variables via variable selection is necessary…
We introduce three novel semi-parametric extensions of probabilistic canonical correlation analysis with identifiability guarantees. We consider moment matching techniques for estimation in these models. For that, by drawing explicit links between the new models and a discrete version of independent component analysis …
Study grid homology of diagonal knots, finding key terms related to prime factors and decompositions.
Study on stability of non-diagonal Einstein metrics on specific homogeneous spaces.
The author connects Poincaré embeddings to Reidemeister traces and diagonal maps.
Conditions for flat 3-manifolds with diagonal metrics are identified.
Learning RBMs using standard algorithms such as CD(k) involves gradient descent on the negative log-likelihood. One of the terms in the gradient, which involves expectation w.r.t. the model distribution, is intractable and is obtained through an MCMC estimate. In this work we show that the Hessian of the log-likelihood…
In this work we develop Curvature Propagation (CP), a general technique for efficiently computing unbiased approximations of the Hessian of any function that is computed using a computational graph. At the cost of roughly two gradient evaluations, CP can give a rank-1 approximation of the whole Hessian, and can be repe…
Constructs coordinates to diagonalize Toda flow on matrices with simple spectrum.
Adaptive gradient approaches that automatically adjust the learning rate on a per-feature basis have been very popular for training deep networks. This rich class of algorithms includes Adagrad, RMSprop, Adam, and recent extensions. All these algorithms have adopted diagonal matrix adaptation, due to the prohibitive co…
Paper proposes ABDR for convex subspace clustering with adaptive block diagonal representation.
This paper optimizes diagonal preconditioning to improve matrix condition numbers.
This paper introduces a new data-driven methodology for estimating sparse covariance matrices of the random coefficients in logit mixture models. Researchers typically specify covariance matrices in logit mixture models under one of two extreme assumptions: either an unrestricted full covariance matrix (allowing correl…
The approximate joint diagonalization of a set of matrices consists in finding a basis in which these matrices are as diagonal as possible. This problem naturally appears in several statistical learning tasks such as blind signal separation. We consider the diagonalization criterion studied in a seminal paper by Pham (…
We prove a number of convexity results for strata of the diagonal pants graph of a surface, in analogy with the extrinsic geometric properties of strata in the Weil-Petersson completion. As a consequence, we exhibit convex flat subgraphs of every possible rank inside the diagonal pants graph.
Classify projective subvarieties in Bogomolov-Guan manifolds using quasi-diagonals.
In this paper, we study deep diagonal circulant neural networks, that is deep neural networks in which weight matrices are the product of diagonal and circulant ones. Besides making a theoretical analysis of their expressivity, we introduced principled techniques for training these models: we devise an initialization s…