Robust tensor completion from uniformly dithered one-bit observations
From MaRDI portal
Cites work
- 1-bit matrix completion
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- A Multilinear Singular Value Decomposition
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Covariance estimation under one-bit quantization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Exact Tensor Completion Using t-SVD
- Factorization strategies for third-order tensors
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
- Generalized Assorted Pixel Camera: Postcapture Control of Resolution, Dynamic Range, and Spectrum
- Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
- Hankel matrix rank minimization with applications to system identification and realization
- High dimensional statistical estimation under uniformly dithered one-bit quantization
- High-dimensional probability. An introduction with applications in data science
- High-dimensional statistics. A non-asymptotic viewpoint
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Learning Tensors From Partial Binary Measurements
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Low-rank Matrix Recovery from Noisy, Quantized and Erroneous Measurements
- Low-rank tensor train for tensor robust principal component analysis
- Near-optimal sample complexity for convex tensor completion
- Noisy low-rank matrix completion with general sampling distribution
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- One-bit tensor completion via transformed tensor singular value decomposition
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Quantized compressive sensing with RIP matrices: the benefit of dithering
- Quantized low-rank multivariate regression with random dithering
- Quantizing heavy-tailed data in statistical estimation: (near) minimax rates, covariate quantization, and uniform recovery
- Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust low-rank tensor completion via new regularized model with approximate SVD
- Robust matrix completion
- Robust tensor completion: equivalent surrogates, error bounds, and algorithms
- Solving Time-Domain Audio Inverse Problems Using Nonnegative Tensor Factorization
- Tensor Completion From One-Bit Observations
- Tensor eigenvalues and their applications
- Tensor Factorization for Low-Rank Tensor Completion
- Tensor Q-rank: new data dependent definition of tensor rank
- Tensor Robust Principal Component Analysis From Multilevel Quantized Observations
- Tensor-tensor algebra for optimal representation and compression of multiway data
- Tensor-tensor products with invertible linear transforms
- Tensor-train decomposition
- The expression of a tensor or a polyadic as a sum of products.
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(1)
This page was built for publication: Robust tensor completion from uniformly dithered one-bit observations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027299)
