Cover Image

Near-optimal Rank Adaptive Inference of High Dimensional Matrices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zheng, Frédéric, Jedra, Yassir, Proutiere, Alexandre
Format:	Preprint
Published:	2025
Subjects:	Information Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Clustering in Mixture of Markov Chains
by: Lee, Junghyun, et al.
Published: (2025)

Instance-Optimal Estimation with Multiple LLM Judges on a Budget
by: Lee, Junghyun, et al.
Published: (2026)

Model-free Low-Rank Reinforcement Learning via Leveraged Entry-wise Matrix Estimation
by: Stojanovic, Stefan, et al.
Published: (2024)

Low-Rank Bandits via Tight Two-to-Infinity Singular Subspace Recovery
by: Jedra, Yassir, et al.
Published: (2024)

Minimal Order Recovery through Rank-adaptive Identification
by: Zheng, Frédéric, et al.
Published: (2025)

Conformal Predictions under Markovian Data
by: Zheng, Frédéric, et al.
Published: (2024)

Curvature-Guided LoRA: Steering in the pretrained NTK subspace
by: Zheng, Frédéric, et al.
Published: (2026)

$k$-SVD with Gradient Descent
by: Jedra, Yassir, et al.
Published: (2025)

Matrices with Gaussian noise: optimal estimates for singular subspace perturbation
by: O'Rourke, Sean, et al.
Published: (2018)

A Tensor-Train Framework for Bayesian Inference in High-Dimensional Systems: Applications to MIMO Detection and Channel Decoding
by: Schmid, Luca, et al.
Published: (2026)

Solving Quadratic Systems with Full-Rank Matrices Using Sparse or Generative Priors
by: Chen, Junren, et al.
Published: (2023)

Spectral Ranking Inferences based on General Multiway Comparisons
by: Fan, Jianqing, et al.
Published: (2023)

Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model
by: Ariu, Kaito, et al.
Published: (2023)

GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation
by: Zhang, Shihao, et al.
Published: (2026)

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability
by: Praharaj, Samya, et al.
Published: (2025)

Constrained Gaussian Wasserstein Optimal Transport with Commutative Covariance Matrices
by: Chen, Jun, et al.
Published: (2025)

Irregular Sampling of High-Dimensional Functions in Reproducing Kernel Hilbert Spaces
by: Iske, Armin, et al.
Published: (2025)

Learning Linear Dynamics from Bilinear Observations
by: Sattar, Yahya, et al.
Published: (2024)

Asymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
by: Fan, Jianqing, et al.
Published: (2025)

High-Dimensional Asymptotics of Differentially Private PCA
by: Yun, Youngjoo, et al.
Published: (2025)

Batches Stabilize the Minimum Norm Risk in High Dimensional Overparameterized Linear Regression
by: Ioushua, Shahar Stein, et al.
Published: (2023)

Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness
by: Batista, Murilo, et al.
Published: (2026)

Federated PCA and Estimation for Spiked Covariance Matrices: Optimal Rates and Efficient Algorithm
by: Li, Jingyang, et al.
Published: (2024)

Amortized Vine Copulas for High-Dimensional Density and Information Estimation
by: Safaai, Houman
Published: (2026)

Exploiting Observation Bias to Improve Matrix Completion
by: Jedra, Yassir, et al.
Published: (2023)

MIMO Detection via Gaussian Mixture Expectation Propagation: A Bayesian Machine Learning Approach for High-Order High-Dimensional MIMO Systems
by: Shayovitz, Shachar, et al.
Published: (2024)

Sub-optimality of the Separation Principle for Quadratic Control from Bilinear Observations
by: Sattar, Yahya, et al.
Published: (2025)

Policy Testing in Markov Decision Processes
by: Ariu, Kaito, et al.
Published: (2025)

Optimal Differentially Private PCA and Estimation for Spiked Covariance Matrices
by: Cai, T. Tony, et al.
Published: (2024)

Lossless and Near-Lossless Compression for Foundation Models
by: Hershcovitch, Moshik, et al.
Published: (2024)

How Does Attention Help? Insights from Random Matrices on Signal Recovery from Sequence Models
by: Seddik, Mohamed El Amine
Published: (2026)

Shift Before You Learn: Enabling Low-Rank Representations in Reinforcement Learning
by: Dubail, Bastien, et al.
Published: (2025)

Theoretical Guarantees for Low-Rank Compression of Deep Neural Networks
by: Zhang, Shihao, et al.
Published: (2025)

Learning to Compress: Local Rank and Information Compression in Deep Neural Networks
by: Patel, Niket, et al.
Published: (2024)

Byzantine-Resilient Federated PCA and Low Rank Column-wise Sensing
by: Singh, Ankit Pratap, et al.
Published: (2023)

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

Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements
by: Kızıldağ, Eren C.
Published: (2025)

Rate-Distortion Optimization for Transformer Inference
by: de Andrade, Anderson, et al.
Published: (2026)

Guaranteed Nonconvex Low-Rank Tensor Estimation via Scaled Gradient Descent
by: Wu, Tong
Published: (2025)

Statistical Inference with Limited Memory: A Survey
by: Berg, Tomer, et al.
Published: (2023)