New method improves Pham's algorithm for joint diagonalization.
problem Optimizing joint diagonalization of matrices for statistical learning.
method Quasi-Newton method for Pham's diagonalization criterion.
result Proposed method outperforms Pham's algorithm in experiments.
This paper solves matrix blind joint block diagonalization with noise.
problem Identifying the diagonalizer and block diagonal structure of matrices under noise.
method Bi-block diagonalization method.
result The method can identify the exact solution under certain conditions.
New method improves Latent Dirichlet Allocation using ICA techniques.
problem Improving Latent Dirichlet Allocation (LDA) estimation.
method Moment matching techniques linking LDA to discrete ICA, using joint diagonalization of tensors.
result New combination of tensors and orthogonal joint diagonalization outperforms existing methods.
New probabilistic CCA extensions with moment matching for multi-view models.
problem Estimating multi-view models with identifiability guarantees.
method Moment matching techniques, generalized covariance matrices, non-orthogonal joint diagonalization.
result Improved sample complexity and simplified algorithms.
Non-orthogonal joint diagonalization (NJD) free of prewhitening has been widely studied in the context of blind source separation (BSS) and array signal processing, etc. However, NJD is used to retrieve the jointly diagonalizable structure for a single set of target matrices which are mostly formulized with a single da…
Improved spectral methods of moments for robust latent variable model learning.
problem Limited robustness of spectral methods of moments to model misspecification.
method Hierarchical approach using approximate joint diagonalization instead of tensor decomposition.
result Our method outperforms previous tensor decomposition methods in speed and model quality.
Recently, there has been a trend to combine independent component analysis and canonical polyadic decomposition (ICA-CPD) for an enhanced robustness for the computation of CPD, and ICA-CPD could be further converted into CPD of a 5th-order partially symmetric tensor, by calculating the eigenmatrices of the 4th-order cu…
Framework for incomplete multi-view learning improves efficiency and clustering accuracy.
problem Incomplete representation in multi-view data.
method Joint Embedding Learning and Low-Rank Approximation (JELLA) framework.
result Improves efficiency and clustering accuracy in incomplete multi-view data.
Develops large-sample theory for non-stationary source separation.
problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.
New method approximates geometric mean of covariance matrices efficiently.
problem Estimating geometric mean of SPD matrices efficiently.
method Approximate Joint Diagonalization (AJD) algorithm.
result Quadratic convergence and low computational complexity.
Joint learning framework for clustering and graph construction.
problem Graph construction not fitting clustering requirements.
method Joint learning framework to learn graph and clustering simultaneously.
result Improved clustering accuracy on 10 datasets.
backShift learns causal cyclic models from unknown shift interventions.
problem Learning causal cyclic graphs in the presence of latent variables.
method backShift uses second moments and joint matrix diagonalization to estimate shift interventions.
result backShift can identify causal cyclic models under certain conditions.
A fair PCA method using JEVD ensures balanced data representation.
problem PCA's bias in data with demographic characteristics.
method Joint Eigenvalue Decomposition (JEVD) for fair PCA.
result JEVD optimally balances fairness and PCA's data structure.
Bayesian hyperprior stabilizes image restoration for noisy and missing data.
problem Stability and adaptability in image restoration for noisy and missing data.
method Proposes a hyperprior approach to stabilize Bayesian image restoration.
result Effective restoration of high dynamic range images from a single sensor.
Quantizes Toda systems using geometric methods.
problem Quantizing Toda systems with geometric quantization.
method Geometric quantization of Toda systems as a coadjoint orbit of a group of matrices.
result Found unitary and non-unitary finite dimensional quantum Hilbert spaces.
In the first quarter of 2006 Chicago Board Options Exchange (CBOE) introduced, as one of the listed products, options on its implied volatility index (VIX). This created the challenge of developing a pricing framework that can simultaneously handle European options, forward-starts, options on the realized variance and …
Researchers find non-diagonal Einstein metrics in various signatures.
problem Finding non-diagonal four-dimensional cohomogeneity-one Einstein metrics in different signatures.
method Explicitly seeking and constructing new examples of non-diagonal Einstein metrics, particularly in neutral signature.
result Construct new examples of neutral signature non-diagonal Bianchi type VIII Einstein metrics with self-dual Weyl tensor.
Diagonalizes metrics of 3D Lorentzian manifolds.
problem Diagonalizing metrics of 3D Lorentzian manifolds.
method Applying the technique of moving frames.
result Every smooth Lorentzian 3-manifold admits an atlas with a diagonal metric.
Proposes a method to predict responses from covariates over time.
problem Predicting responses from covariates with changing conditional distributions over time.
method Invariant Subspace Decomposition (ISD) framework that splits the conditional distribution into time-invariant and time-dependent components.
result The decomposition can be used for zero-shot and time-adaptation prediction tasks.
Develops a novel stochastic algorithm for diagonal estimation of large matrices.
problem Efficient diagonal estimation for large or implicit matrices.
method Adaptive parameter selection in a stochastic algorithm.
result Lower bound on random query vectors needed for estimation.
Study Ricci vector fields on 2D space with diagonal metrics.
problem Understanding Ricci vector fields on 2D space with specific metrics.
method Examined Ricci vector fields on R2 with a diagonal metric. result Characterized Ricci vector fields on R2 with a diagonal metric. Octagon map accelerates diagonal changes algorithm.
problem Improving the efficiency of diagonal changes algorithm.
method Octagon Farey map as an acceleration.
result Octagon map accelerates diagonal changes algorithm.
New diagonal knots found with non-torus structure.
problem Identifying knots with diagonal grid diagrams.
method Analysis of knots represented by diagonal grid diagrams.
result All diagonal knots are positive, and a new non-torus example is found.
Study finds symmetries in a special 3D space with a diagonal metric.
problem Identifying symmetries in a specific 3D space.
method Determining Killing vector fields on a diagonal metric in R3. result Killing vector fields on the space R3 with a diagonal metric have been identified. Framework estimates precision matrices for heterogeneous populations.
problem Estimating precision matrices in populations with subpopulations.
method Laplacian shrinkage penalty, ADMM algorithm, hierarchical clustering.
result Consistent estimation of precision matrices in heterogeneous populations.
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.
Quaternionic Brownian motion on flag manifold linked to sphere diffusion.
problem Modeling quaternionic stochastic areas on quaternionic flag manifolds.
method Relating quaternionic Brownian motion to symplectic Brownian motion and using radial dynamics.
result Quaternionic stochastic areas follow a multivariate normal distribution.
Proposes a new algorithm to estimate invariant subspaces across multilayer networks.
problem Estimating invariant subspaces across heterogeneous multiple networks.
method Bias-corrected joint spectral embedding algorithm that recursively calibrates diagonal bias and iteratively updates the subspace estimator.
result Established entrywise subspace perturbation bound and entrywise eigenvector central limit theorem for the algorithm.
New method tests independence using ROC analysis and bipartite ranking.
problem Testing independence of two random variables with unknown marginals.
method Nonparametric framework based on ROC analysis and bipartite ranking.
result The method detects small departures from independence in high dimensions.
Equal diagonal energies proven on Liouville surfaces.
problem Diagonal energies on Liouville surfaces.
method Analyzing parameter curves and rectangles on Liouville surfaces.
result Diagonal energies are equal in n-dimensional Liouville manifolds.
Diagonal linear networks converge to lasso regularization path during training.
problem Understanding the regularization behavior of diagonal linear networks.
method Analyzing the training trajectory of diagonal linear networks and comparing it to the lasso regularization path.
result The training trajectory of diagonal linear networks is closely related to the lasso regularization path.
Develops a new method to compute risk-sharing allocations using Laplace transforms.
problem Complex integrals in computing conditional mean risk-sharing allocations.
method Uses Laplace-Stieltjes transforms to compute risk-sharing allocations from joint transforms.
result Provides closed-form or semi-analytic solutions for a broad class of distributions.
Diagonal RNNs improve music modeling performance and speed.
problem Improving symbolic music modeling efficiency and accuracy.
method Introduced diagonal recurrent matrices in RNNs for music modeling.
result Diagonal RNNs achieve better test likelihood and faster convergence.
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.
problem Efficiently unknotting knots and links.
method Introduces diagonal move, proving its effectiveness for classical and welded knots.
result Diagonal move reduces any knot or link to the unknot or unlink with fewer operations.
Quantum probability theory reveals hidden structure in joint probability distributions.
problem Understanding hidden structure in joint probability distributions.
method Modeling joint probability distributions as density operators and applying partial trace.
result Decoding extra information in reduced density operators that captures subsystem interactions.
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…
Study grid homology of diagonal knots, finding key terms related to prime factors and decompositions.
problem Determine grid homology of diagonal knots and compare them to other knot types.
method Use grid diagrams and combinatorial knot Floer homology to analyze diagonal knots.
result Grid homology detects the number of prime factors and decompositions of the knot into non-integer tangles.
Study on stability of non-diagonal Einstein metrics on specific homogeneous spaces.
problem Stability analysis of non-diagonal Einstein metrics on HimesH/ΔK. method Formula for scalar curvature, study of stability with Hilbert action.
result Non-diagonal Einstein metrics on M are unstable with different coindexes. The author connects Poincaré embeddings to Reidemeister traces and diagonal maps.
problem Existence of Poincaré embeddings for specific spaces.
method Relates total obstruction to Reidemeister trace and uses Poincaré duality.
result Diagonal maps admit Poincaré embeddings under certain conditions.
Conditions for flat 3-manifolds with diagonal metrics are identified.
problem Characterizing flat 3-manifolds with diagonal metrics.
method Provided necessary and sufficient conditions for flatness.
result Characterized flat manifolds of warped product-type.
Haantjes algebras help in diagonalizing operators on manifolds.
problem Diagonalizing operators on differentiable manifolds.
method Introducing Haantjes algebra, a family of operator fields with vanishing Haantjes torsion and compatibility conditions.
result Simultaneous diagonalization of operators in local coordinates or block-diagonal form in general cases.
Constructs coordinates to diagonalize Toda flow on matrices with simple spectrum.
problem Diagonalizing the Toda flow on matrices with simple spectrum.
method Lie theoretic methods applied to complex semisimple Lie algebras and their real forms.
result Decouples the Toda vector field into simpler components.
Paper proposes ABDR for convex subspace clustering with adaptive block diagonal representation.
problem Subspace clustering with block diagonal structure for noisy data.
method ABDR explicitly pursues block diagonality without sacrificing convexity, using a specially designed convex regularizer.
result Experimental results show ABDR outperforms state-of-the-arts.
This paper optimizes diagonal preconditioning to improve matrix condition numbers.
problem Optimizing diagonal preconditioning to reduce matrix condition numbers.
method Reformulated as a quasi-convex problem, solved with bisection and Newton updates.
result Optimal diagonal preconditioners can significantly improve iterative methods.
Paper studies deep diagonal circulant neural networks and introduces training techniques.
problem Understanding and training deep neural networks with structured weight matrices.
method Theoretical analysis and practical training techniques including initialization and non-linearity use.
result Deep diagonal circulant networks outperform other structured models in accuracy and weight efficiency.
Classify projective subvarieties in Bogomolov-Guan manifolds using quasi-diagonals.
problem Classify projective subvarieties in non-Kahler holomorphically symplectic manifolds.
method Use quasi-diagonals to classify projective subvarieties.
result Prove that any projective subvariety belongs to a fiber of the Lagrangian fibration.
New adaptive methods improve deep learning performance.
problem Training deep networks efficiently and effectively.
method Block-diagonal matrix adaptation for gradient updates.
result Block-diagonal methods outperform adaptive diagonal methods and vanilla SGD.