Robust tensor completion from uniformly dithered one-bit observations (Q7027299)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Robust tensor completion from uniformly dithered one-bit observations

scientific article; zbMATH DE number 7984613

Language	Label	Description	Also known as
default for all languages	No label defined
English	Robust tensor completion from uniformly dithered one-bit observations	scientific article; zbMATH DE number 7984613

Statements

instance of

scholarly article

0 references

title

Robust tensor completion from uniformly dithered one-bit observations (English)

0 references

0 references

0 references

0 references

SIAM Journal on Imaging Sciences

0 references

publication date

14 February 2025

0 references

zbMATH Keywords

one-bit quantization

0 references

tensor completion

0 references

uniformly distributed dither

0 references

sub-Gaussian noise

0 references

sparse corruption

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Learning with tensors: a framework based on convex optimization and spectral regularization

0 references

Tensor eigenvalues and their applications

0 references

Solving Time-Domain Audio Inverse Problems Using Nonnegative Tensor Factorization

0 references

Exact Tensor Completion Using t-SVD

0 references

Near-optimal sample complexity for convex tensor completion

0 references

Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion

0 references

The expression of a tensor or a polyadic as a sum of products.

0 references

A Multilinear Singular Value Decomposition

0 references

Tensor-train decomposition

0 references

Factorization strategies for third-order tensors

0 references

Tensor-tensor algebra for optimal representation and compression of multiway data

0 references

Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data

0 references

Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion

0 references

Tensor Q-rank: new data dependent definition of tensor rank

0 references

Robust low-rank tensor completion via new regularized model with approximate SVD

0 references

Robust tensor completion: equivalent surrogates, error bounds, and algorithms

0 references

Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization

0 references

A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion

0 references

Low-rank tensor train for tensor robust principal component analysis

0 references

Tensor Robust Principal Component Analysis From Multilevel Quantized Observations

0 references

Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors

0 references

1-bit matrix completion

0 references

Covariance estimation under one-bit quantization

0 references

High dimensional statistical estimation under uniformly dithered one-bit quantization

0 references

Quantizing heavy-tailed data in statistical estimation: (near) minimax rates, covariate quantization, and uniform recovery

0 references

Quantized low-rank multivariate regression with random dithering

0 references

Quantized compressive sensing with RIP matrices: the benefit of dithering

0 references

One-bit tensor completion via transformed tensor singular value decomposition

0 references

Learning Tensors From Partial Binary Measurements

0 references

Tensor Completion From One-Bit Observations

0 references

1-bit matrix completion: PAC-Bayesian analysis of a variational approximation

0 references

Robust matrix completion

0 references

Low-rank Matrix Recovery from Noisy, Quantized and Erroneous Measurements

0 references

Nonmonotone Spectral Projected Gradient Methods on Convex Sets

0 references

Tensor-tensor products with invertible linear transforms

0 references

High-dimensional probability. An introduction with applications in data science

0 references

Noisy low-rank matrix completion with general sampling distribution

0 references

Restricted strong convexity and weighted matrix completion: optimal bounds with noise

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers

0 references

Tensor Factorization for Low-Rank Tensor Completion

0 references

Generalized Assorted Pixel Camera: Postcapture Control of Resolution, Dynamic Range, and Spectrum

0 references

Distributed optimization and statistical learning via the alternating direction method of multipliers

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

Hankel matrix rank minimization with applications to system identification and realization

0 references

Q4830373

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion

0 references

High-dimensional statistics. A non-asymptotic viewpoint

0 references

Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015

0 references

Q4023085

0 references

Identifiers

DOI

10.1137/23M1620326

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Robust tensor completion from uniformly dithered one-bit observations