:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Wang, Yinjian
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2410.05412
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
by: Cai, HanQin, et al.
Published: (2024)

Matrix Completion from One-Bit Dither Samples
by: Eamaz, Arian, et al.
Published: (2023)

Nonconvex Deterministic Matrix Completion by Projected Gradient Descent Methods
by: Xu, Hang, et al.
Published: (2024)

Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions
by: Wang, Tianming, et al.
Published: (2024)

Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
by: Cai, HanQin, et al.
Published: (2022)

Discrete Aware Tensor Completion via Convexized $\ell_0$-Norm Approximation
by: Führling, Niclas, et al.
Published: (2026)

Subspace-Informed Matrix Completion
by: Ardakani, Hamideh. Sadat Fazael, et al.
Published: (2024)

Fast and Provable Nonconvex Robust Matrix Completion
by: Fu, Yichen, et al.
Published: (2026)

Computing Augustin Information via Hybrid Geodesically Convex Optimization
by: Wang, Guan-Ren, et al.
Published: (2024)

Matrix Completion via Nonsmooth Regularization of Fully Connected Neural Networks
by: Faramarzi, Sajad, et al.
Published: (2024)

Near-Optimal Weighted Matrix Completion
by: López, Oscar
Published: (2022)

SINR Estimation under Limited Feedback via Online Convex Optimization
by: Maggi, Lorenzo, et al.
Published: (2026)

A Matrix Completion Approach for the Construction of MDP Convolutional Codes
by: Dang, Sakshi, et al.
Published: (2025)

Matrix Completion in Group Testing: Bounds and Simulations
by: Tran, Trung-Khang, et al.
Published: (2025)

Matrix Completion with Hypergraphs:Sharp Thresholds and Efficient Algorithms
by: Ma, Zhongtian, et al.
Published: (2024)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
by: Yu, Qian, et al.
Published: (2024)

Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)

Low-Complexity and Basis-Free Channel Estimation for Switch-Based mmWave MIMO Systems via Matrix Completion
by: Hu, Rui, et al.
Published: (2016)

Covariance Matrix Construction with Preprocessing-Based Spatial Sampling for Robust Adaptive Beamforming
by: Mohammadzadeh, Saeed, et al.
Published: (2025)

Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
by: Dang, Sakshi, et al.
Published: (2026)

Matrix Completion-Based Channel Estimation for MmWave Communication Systems With Array-Inherent Impairments
by: Hu, Rui, et al.
Published: (2018)

Global Convergence Analysis of Vanilla Gradient Descent for Asymmetric Matrix Completion
by: Zhang, Xu, et al.
Published: (2025)

Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization
by: Kim, Daesung, et al.
Published: (2022)

A Deterministic Dimension Property of Twisted Goppa Codes
by: Wang, Kai
Published: (2025)

Convex Optimization of Distributed Cooperative Detection in Multi-Receiver Molecular Communication
by: Fang, Yuting, et al.
Published: (2016)

Decentralizing Coherent Joint Transmission Precoding via Deterministic Equivalents
by: Liu, Yuhao, et al.
Published: (2024)

Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels
by: Boche, Holger, et al.
Published: (2025)

From Quasi-Isometric Embeddings to Finite-Volume Property: A Theoretical Framework for Quantized Matrix Completion
by: Eamaz, Arian, et al.
Published: (2023)

Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication
by: Karpuk, David, et al.
Published: (2023)

Matrix Majorization in Large Samples with Varying Support Restrictions
by: Verhagen, Frits, et al.
Published: (2024)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
by: Cui, Chengyu, et al.
Published: (2026)

Robust Spectral Recovery for Dynamical Sampling
by: Cai, HanQin, et al.
Published: (2026)

Decentralizing Coherent Joint Transmission Precoding via Fast ADMM with Deterministic Equivalents
by: Bian, Xinyu, et al.
Published: (2024)

Deterministic Identification Codes for Fading Channels
by: Vorobyev, Ilya, et al.
Published: (2024)

Support Recovery and $\ell_2$-Error Bound for Sparse Regression with Quadratic Measurements via Weakly-Convex-Concave Regularization
by: Fan, Jun, et al.
Published: (2026)

Distributionally Robust Degree Optimization for BATS Codes
by: Yin, Hoover H. F., et al.
Published: (2024)

Precoder Design for Massive MIMO Downlink with Matrix Manifold Optimization
by: Sun, Rui, et al.
Published: (2023)

From Asymptotic to Finite-Sample Minimax Robust Hypothesis Testing
by: Gül, Gökhan
Published: (2026)

Convexity of Mutual Information along the Fokker-Planck Flow
by: Zou, Jiayang, et al.
Published: (2025)

On the Unification of Deterministic and Stochastic Electromagnetic Information Theory via Symplectic Geometry
by: Migliore, Marco Donald
Published: (2025)