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…
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.
169,181 papers · 148 categories
Trend · papers per month
48 results for “Kronecker decomposition”
Bayesian method estimates Kronecker graphical models from autoregressive processes.
problem Estimating Kronecker graphical models from autoregressive Gaussian processes.
method Bayesian approach to estimate Kronecker graphical models.
result Effectiveness demonstrated through numerical experiments and real-world data application.
Machine learning predicts Kronecker coefficients with high accuracy.
problem Predicting Kronecker coefficients from tensor products of symmetric group representations.
method Training machine learning models (NN, CNN, GBDT) to classify Kronecker coefficients as zero or non-zero.
result Trained models achieve high accuracy () in classifying Kronecker coefficients.
Paper proposes a new method for approximating high-dimensional matrices using Kronecker products.
problem Discovering low-dimensional structure in high-dimensional data.
method Hybrid Kronecker Product Approximation (hKoPA) and estimation procedures.
result The proposed methods provide flexible and effective dimension reduction.
A parallel algorithm learns efficient Kronecker product dictionaries.
problem Sparse representation of 2D signals like images and hyperspectral data.
method Highly parallelizable algorithm for learning separable dictionaries.
result Competitive sparse representations at lower computational cost.
KoPA approximates matrices using Kronecker products for better flexibility.
problem Matrix approximation and denoising with Kronecker product decomposition.
method Approximate a matrix as a sum of Kronecker products of smaller matrices using extended information criteria for configuration selection.
result KoPA selects the true configuration with high probability under suitable conditions.
New methods improve Fisher Matrix approximations for neural networks at low cost.
problem High cost of solving Fisher Information Matrix (FIM) in neural networks.
method Direct minimization via Kronecker product singular value decomposition.
result Improved approximations to FIM provide more accurate and faster optimization.
Extended wMEM approach for MEG inverse problem using wavelet and spatial filters.
problem Infer brain activity from full space-time data in MEG.
method Wavelet decomposition, spatial filters, Kronecker product modeling, numerical optimization.
result Smooth numerical optimization problem solved with reasonable dimensionality.
SINGD improves KFAC for memory-efficiency and stability in low-precision training.
problem Memory inefficiency and numerical instability of KFAC in low-precision training.
method Formulated inverse-free KFAC update and imposed structures in Kronecker factors.
result SINGD is memory-efficient and numerically robust, often outperforming AdamW in half precision.
Improved GCRF model for multi-scale networks with reduced computation time.
problem Scaling issues in GCRF for large networks.
method Factor graph decomposition using Kronecker product, new Laplacian eigenvalue estimations.
result High prediction accuracy with improved computational complexity.
RKCA combines sparse dictionary learning and robust component analysis for robust low-rank modeling.
problem Learning robust low-rank representations from noisy data.
method Kronecker-decomposable component analysis (RKCA) with efficient learning algorithm.
result RKCA achieves robustness to gross corruption and low-rank modeling.
Determinantal Point Processes (DPPs) are probabilistic models over all subsets a ground set of items. They have recently gained prominence in several applications that rely on "diverse" subsets. However, their applicability to large problems is still limited due to the complexity of core tasks suc…
We propose a penalized likelihood method to fit the linear discriminant analysis model when the predictor is matrix valued. We simultaneously estimate the means and the precision matrix, which we assume has a Kronecker product decomposition. Our penalties encourage pairs of response category mean matrices to have equal…
Dictionary learning and component analysis are part of one of the most well-studied and active research fields, at the intersection of signal and image processing, computer vision, and statistical machine learning. In dictionary learning, the current methods of choice are arguably K-SVD and its variants, which learn a …
Researchers solve the realization of Jordan-Kronecker invariants in Lie algebras.
problem Identifying which Jordan-Kronecker invariants can be realized by Lie algebras.
method Analyzing the Kronecker and Jordan cases, proving impossibility for certain invariants, and describing realizability for others.
result Complete solution for Jordan and Kronecker cases, partial answers for others.
In this work we consider the problem of detecting anomalous spatio-temporal behavior in videos. Our approach is to learn the normative multiframe pixel joint distribution and detect deviations from it using a likelihood based approach. Due to the extreme lack of available training samples relative to the dimension of t…
KF-RTRL approximates RTRL for online learning of long-term dependencies.
problem Lack of efficient algorithms for learning long-term dependencies in RNNs.
method KF-RTRL uses Kronecker factorization to approximate RTRL gradients.
result KF-RTRL is an unbiased, memory-efficient online learning algorithm with lower noise than UORO.
Paper develops SKPD framework for signal region detection in image regression.
problem Limited research on image region detection in high-resolution image regression.
method Sparse Kronecker Product Decomposition (SKPD) framework for matrices and tensors.
result Computed solutions converge to truth with guaranteed consistency.
Study on rotational hypersurfaces with constant Gauss-Kronecker curvature.
problem Exploring hypersurfaces with constant Gauss-Kronecker curvature.
method Solving ODE for generating curves and analyzing geometric properties.
result Discovery of non-compact rotational hypersurfaces with negative Gauss-Kronecker curvature and finite volume.
TensorSketch solves Kronecker product regression and non-negative regression.
problem Solving regression problems with Kronecker product matrices.
method Extending TensorSketch to other norms for Kronecker product regression.
result Solving Kronecker product regression and non-negative regression in sublinear time.
We consider the problem of recovering a low-rank tensor from its noisy observation. Previous work has shown a recovery guarantee with signal to noise ratio for recovering a th order rank one tensor of size by recursive unfolding. In this paper, we first improve…
Graphical notation simplifies tensor operations and decompositions.
problem Complex tensor operations are difficult to understand and represent.
method Introduces graphical notation to represent tensor operations.
result Simplified representation of tensor operations and decompositions.
EiGLasso speeds up sparse Kronecker-sum covariance estimation.
problem Sparse Kronecker-sum inverse covariance estimation challenges in scalability and parameter identification.
method Newton's method combined with eigendecomposition of sample and feature graphs, approximating Hessian for speed.
result Two to three orders-of-magnitude speed-up on simulated and real-world data.
Scalable Gaussian processes with latent Kronecker structure for large datasets.
problem Limited scalability of Gaussian processes for large datasets.
method Leveraging latent Kronecker structure, projecting kernel matrix onto latent Kronecker product, using iterative linear system solvers and pathwise conditioning.
result Outperforms state-of-the-art sparse and variational GPs on real-world datasets with up to five million examples.
This paper speeds up K-FAC for deep learning by focusing on only a few eigen-modes.
problem Time-consuming computation of Kronecker factors in K-FAC for large layers.
method Theoretical analysis and randomized numerical linear algebra to approximate eigen-spectrum decay.
result Reduces time complexity from cubic to quadratic in layer width, improving efficiency.
Complete minimal hypersurfaces in the hyperbolic space with vanishing Gauss-Kronecker curvaturemath.DG
We investigate 3-dimensional complete minimal hypersurfaces in the hyperbolic space with Gauss-Kronecker curvature identically zero. More precisely, we give a classification of complete minimal hypersurfaces with Gauss-Kronecker curvature identically zero, nowhere vanishing second fundamental form and …
New method for scalable stochastic neural networks using Kronecker Flow.
problem Scaling stochastic neural networks to high dimensions.
method Kronecker Flow, a scalable parameterization of noise generation.
result Competitive performance on various tasks compared to existing methods.
The present paper discusses that a prescribed Gauss-Kronecker curvature problem on the product of unit spheres.
Efficiently models learning curves using Gaussian processes with latent Kronecker structure.
problem Joint modeling of machine learning model performance across hyper-parameters and training progress.
method Imposes latent Kronecker structure to leverage efficient product kernels and handle missing values.
result Matches the performance of a Transformer on a learning curve prediction task.
How can we model networks with a mathematically tractable model that allows for rigorous analysis of network properties? Networks exhibit a long list of surprising properties: heavy tails for the degree distribution; small diameters; and densification and shrinking diameters over time. Most present network models eithe…
STARK learns structured dictionaries for tensor data.
problem Representing multidimensional data with structured dictionaries.
method Solves a convex relaxation of a nonconvex rank-1 tensor recovery problem.
result Empirical results show promising performance for tensors of any order.
We investigate the structure of 3-dimensional complete minimal hypersurfaces in the unit sphere with Gauss-Kronecker curvature identically zero.
Detects missing tensor signals in a KS subspace with high probability.
problem Detecting tensor signals with many missing entities in a KS subspace.
method Projecting the signal onto the KS subspace and bounding residual energy.
result Reliable detection is possible if the missing signal cardinality exceeds KS subspace dimensions.
The study predicts Kronecker coefficients using interpretable machine learning models.
problem Predicting Kronecker coefficients of the symmetric group.
method Employed interpretable machine learning models with input features of triples of partitions and b-loadings.
result Achieved an accuracy of approximately 83% and over 99% with transformer-based models.
Paper provides conditions for local recovery of tensor data's Kronecker-structured dictionaries.
problem Local recovery of Kronecker-structured dictionaries for tensor data.
method Derives sufficient conditions for local recovery of coordinate dictionaries.
result Sufficient conditions guarantee recovery of individual coordinate dictionaries up to specified error.
New method for faster graph parameter inference from large random Kronecker graphs.
problem Efficiently infer graph parameters from large random Kronecker graphs.
method Decompose adjacency matrix into signal and noise components, then use denoising and solving approach.
result Proposed method achieves comparable or better performance than existing methods at lower computational cost.
We investigate complete minimal hypersurfaces in the Euclidean space , with Gauss-Kronecker curvature identically zero. We prove that, if is a complete minimal hypersurface with Gauss-Kronecker curvature identically zero, nowhere vanishing second fundamental form and scalar curvature b…
This paper studies iteration convergence of Kronecker graphical lasso (KGLasso) algorithms for estimating the covariance of an i.i.d. Gaussian random sample under a sparse Kronecker-product covariance model and MSE convergence rates. The KGlasso model, originally called the transposable regularized covariance model by …
Kronecker product kernel provides the standard approach in the kernel methods literature for learning from graph data, where edges are labeled and both start and end vertices have their own feature representations. The methods allow generalization to such new edges, whose start and end vertices do not appear in the tra…
In this paper we present a local description for complete minimal hypersurfaces in with zero Gauss-Kronecker curvature, zero -mean curvature and nowhere zero second fundamental form.
New method for matrix completion using Kronecker product approximation.
problem Matrix completion with low Kronecker rank structure.
method Alternative matrix representation using Kronecker product, identification through mean squared error and modified cross-validation.
result Consistency of the method under suitable signal-to-noise ratio conditions.
Shampoo optimizes preconditioners for faster convergence in machine learning.
problem Improving convergence speed in machine learning optimization.
method Explicit connection between Shampoo's Kronecker product approximation and optimal matrix approximations.
result The square of Shampoo's approximation is equivalent to a single power iteration step for optimal Kronecker product approximation.
Complete minimal hypersurfaces in with constant scalar curvature and zero Gauss-Kronecker curvaturemath.DG
Totally geodesic minimal hypersurfaces in with specific curvature properties.
problem Characterizing minimal hypersurfaces in hyperbolic space with certain curvature conditions.
method Analyzing properties of minimal hypersurfaces in with constant scalar curvature and zero Gauss-Kronecker curvature.
result Any complete minimal hypersurface in with constant scalar curvature and zero Gauss-Kronecker curvature is totally geodesic.
Study mapping class group action on character varieties, proving Kronecker's Theorem.
problem Topological-dynamical action of mapping class group on character varieties.
method Analyzes -character variety and dense orbit conditions.
result Provides a dynamical proof of Kronecker's Theorem.
A new method for optimizing deep neural networks using TKFAC.
problem Optimizing deep neural networks with second-order methods.
method Proposes Trace-restricted Kronecker-factored Approximate Curvature (TKFAC) for Fisher information matrix approximation.
result TKFAC improves performance on deep network architectures compared to state-of-the-art algorithms.
We give a partial local description of minimal hypersurfaces with identically zero Gauß-Kronecker curvature function in the unit 4-sphere , without assumption on the compactness of .
MCCA extracts shared structure from multiple tensor datasets.
problem Extracting shared structure from multiple tensor datasets.
method Multilinear common component analysis (MCCA) using Kronecker products of mode-wise covariance matrices.
result MCCA constructs a common basis that retains information from multiple tensor datasets.
Stochastic Kronecker graphs supply a parsimonious model for large sparse real world graphs. They can specify the distribution of a large random graph using only three or four parameters. Those parameters have however proved difficult to choose in specific applications. This article looks at method of moments estimators…