scientific article; zbMATH DE number 7049740
From MaRDI portal
Publication:4633029
zbMath1483.62092arXiv1703.06327MaRDI QIDQ4633029
Publication date: 2 May 2019
Full work available at URL: https://arxiv.org/abs/1703.06327
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Smoothness of Schatten norms and sliding-window matrix streams ⋮ Comparison of matrix norm sparsification ⋮ On Approximating Matrix Norms in Data Streams
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Finding and counting small induced subgraphs efficiently
- Smooth function topological structure descriptors based on graph-spectra
- Finding and counting given length cycles
- Characteristic vectors of bordered matrices with infinite dimensions
- Improved bounds on sample size for implicit matrix trace estimators
- Parameter estimation in high dimensional Gaussian distributions
- Chebyshev approximation of log-determinants of spatial weight matrices
- A projection method for generalized eigenvalue problems using numerical integration.
- Rate of convergence to the semi-circular law
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Spectrum estimation from samples
- A spectrum slicing method for the Kohn-Sham problem
- A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
- Exact matrix completion via convex optimization
- How Accurately Should I Compute Implicit Matrix-Vector Products When Applying the Hutchinson Trace Estimator?
- Hierarchical Probing for Estimating the Trace of the Matrix Inverse on Toroidal Lattices
- Efficient estimation of eigenvalue counts in an interval
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Robust principal component analysis?
- Randomized Algorithms for Matrices and Data
- Approximate implementation of the logarithm of the matrix determinant in Gaussian process regression
- An algorithm for counting short cycles in bipartite graphs
- The Parameterized Complexity of Counting Problems
- Gaussian Markov Random Fields
- Fast computation of low rank matrix approximations
- A MEASURE FOR THE LEXICOGRAPHICALLY FIRST MAXIMAL INDEPENDENT SET PROBLEM AND ITS LIMITS
- A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality
- Matrix Completion From a Few Entries
- Spectral techniques applied to sparse random graphs
- Tight Lower Bound for Linear Sketches of Moments
- Approximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev Approximations
- On approximating functions of the singular values in a stream
- Concentration and regularization of random graphs
- On Sketching Matrix Norms and the Top Singular Vector
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Low-rank matrix completion using alternating minimization
- Concentration and Moment Inequalities for Polynomials of Independent Random Variables
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
This page was built for publication:
