On the public citation graph
Estimation of low rank density matrices: Bounds in Schatten norms and other distances
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-22147-7openalex-snapshot
Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems
inferredcites →https://doi.org/10.1007/978-3-642-41136-6_19openalex-snapshot
Sharp Oracle Inequalities in Low Rank Estimation
inferredcites →https://doi.org/10.1007/bf00938486openalex-snapshot
A finite algorithm for finding the projection of a point onto the canonical simplex of ? n
inferredcites →https://doi.org/10.1007/s10208-011-9099-zopenalex-snapshot
User-Friendly Tail Bounds for Sums of Random Matrices
inferredcites →https://doi.org/10.1038/npjqi.2015.18openalex-snapshot
Quantum tomography protocols with positivity are compressed sensing protocols
inferredcites →https://doi.org/10.1063/1.3657929openalex-snapshot
Continuity bounds on the quantum relative entropy — II
inferredcites →https://doi.org/10.1088/1367-2630/14/9/095022openalex-snapshot
Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
inferredcites →https://doi.org/10.1103/physreva.88.032113openalex-snapshot
Rank-penalized estimation of a quantum system
inferredcites →https://doi.org/10.1103/physrevlett.105.150401openalex-snapshot
Quantum State Tomography via Compressed Sensing
inferredcites →https://doi.org/10.1109/tit.2007.896888openalex-snapshot
Interaction in Quantum Communication
inferredcites →https://doi.org/10.1109/tit.2010.2044061openalex-snapshot
The Power of Convex Relaxation: Near-Optimal Matrix Completion
inferredcites →https://doi.org/10.1109/tit.2011.2104999openalex-snapshot
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
inferredcites →https://doi.org/10.1109/tit.2011.2111771openalex-snapshot
Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
inferredcites →https://doi.org/10.1109/tit.2015.2487541openalex-snapshot
Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms
inferredcites →https://doi.org/10.1137/080738970openalex-snapshot
A Singular Value Thresholding Algorithm for Matrix Completion
inferredcites →https://doi.org/10.1214/10-aos850openalex-snapshot
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
inferredcites →https://doi.org/10.1214/11-aos894openalex-snapshot
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
inferredcites →https://doi.org/10.1214/11-aos926openalex-snapshot
Von Neumann entropy penalization and low-rank matrix estimation
inferredcites →https://doi.org/10.1214/12-imscoll915openalex-snapshot
A remark on low rank matrix recovery and noncommutative Bernstein type inequalities
inferredcites →https://doi.org/10.3150/12-bej486openalex-snapshot
Noisy low-rank matrix completion with general sampling distribution
inferredcites →https://doi.org/10.48550/arxiv.1103.2816openalex-snapshot
Universal Low-rank Matrix Recovery from Pauli Measurements
inferredcites →https://doi.org/10.48550/arxiv.1507.05131openalex-snapshot
Optimal Estimation of Low Rank Density Matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1088/1751-8121/aa682eopenalex-snapshot
Statistical analysis of compressive low rank tomography with random measurements
inferred← citeshttps://doi.org/10.1088/1751-8121/ab8111openalex-snapshot
Fast state tomography with optimal error bounds
inferred← citeshttps://doi.org/10.1109/tit.2019.2924900openalex-snapshot
Confidence Region of Singular Subspaces for Low-Rank Matrix Regression
inferred← citeshttps://doi.org/10.1214/16-ejs1222openalex-snapshot
Estimation of low rank density matrices by Pauli measurements
inferred← citeshttps://doi.org/10.1214/19-ejs1630openalex-snapshot
Matrix factorization for multivariate time series analysis
inferred← citeshttps://doi.org/10.1214/20-ejs1731openalex-snapshot
Confidence regions and minimax rates in outlier-robust estimation on the probability simplex
inferred← citeshttps://doi.org/10.1214/24-aos2473openalex-snapshot
Computationally efficient and statistically optimal robust high-dimensional linear regression
inferred← citeshttps://doi.org/10.1214/25-aos2588openalex-snapshot
Online tensor learning: Computational and statistical trade-offs, adaptivity and optimal regret
inferred← citeshttps://doi.org/10.1371/journal.pone.0225397openalex-snapshot
Accelerated sparsity based reconstruction of compressively sensed multichannel EEG signals
inferred← citeshttps://doi.org/10.4171/msl/1-1-1openalex-snapshot
Optimal Kullback–Leibler aggregation in mixture density estimation by maximum likelihood
inferred← citeshttps://doi.org/10.48550/arxiv.1507.05131openalex-snapshot
Optimal Estimation of Low Rank Density Matrices
inferred← citeshttps://doi.org/10.70675/01e09f51z98f1z4f02zbdfdza5677e639c41openalex-snapshot
PAC-Bayesian estimation of low-rank matrices
inferred← citeshttps://doi.org/10.70675/6945fc38z3514z49f1zaa88z29ad63cb66a6openalex-snapshot
On unsupervised learning in high dimension
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.