← Mathematics
Mathematics & Optimization › Mathematics ›

Linear Algebra

480 directly classified papers

Papers per year

Papers

Vector Transport Free Riemannian LBFGS for Optimization on Symmetric Positive Definite Matrix Manifolds ACML 2021
Dynamic Trace Estimation NIPS 2021
Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021
Projection techniques to update the truncated SVD of evolving matrices with applications ICML 2021
Additive Error Guarantees for Weighted Low Rank Approximation ICML 2021
Faster Kernel Matrix Algebra via Density Estimation ICML 2021
Fast Tucker Rank Reduction for Non-Negative Tensors Using Mean-Field Approximation NIPS 2021
Unique sparse decomposition of low rank matrices NIPS 2021
Analysis of stochastic Lanczos quadrature for spectrum approximation ICML 2021
Reproducing kernel Hilbert C*-module and kernel mean embeddings JMLR 2021
Landscape analysis of an improved power method for tensor decomposition NIPS 2021
Regularized spectral methods for clustering signed networks JMLR 2021
A Unified Framework for Spectral Clustering in Sparse Graphs JMLR 2021
Heuristic Search for Approximating One Matrix in Terms of Another Matrix IJCAI 2021
Identification of Matrix Joint Block Diagonalization AISTATS 2021
Fully-Connected Tensor Network Decomposition and Its Application to Higher-Order Tensor Completion AAAI 2021
A Blind Block Term Decomposition of High Order Tensors AAAI 2021
On the Riemannian Search for Eigenvector Computation JMLR 2021
Low-Rank Subspaces in GANs NIPS 2021
On the Faster Alternating Least-Squares for CCA AISTATS 2021
Fast and accurate randomized algorithms for low-rank tensor decompositions NIPS 2021
Near-Optimal Entrywise Anomaly Detection for Low-Rank Matrices with Sub-Exponential Noise ICML 2021
Streaming and Distributed Algorithms for Robust Column Subset Selection ICML 2021
Learning Tensor Low-Rank Prior for Hyperspectral Image Reconstruction CVPR 2021
Expert advice problem with noisy low rank loss ACML 2021