Close Menu
techwavedispatch.com

    Subscribe to Updates

    Get the latest creative news from FooBar about art, design and business.

    What's Hot

    The Internet Archive’s Workers Are Unionizing

    November 20, 2026

    [2611.25424] Coordinate Basis Linear Bandits with Sublinear Regret over Low-Rank Clusters

    November 20, 2026

    Incoming House chair threatens SpaceX funding over Ukraine controversy

    November 20, 2026
    Facebook X (Twitter) Instagram
    Trending
    • The Internet Archive’s Workers Are Unionizing
    • [2611.25424] Coordinate Basis Linear Bandits with Sublinear Regret over Low-Rank Clusters
    • Incoming House chair threatens SpaceX funding over Ukraine controversy
    • Efficient Tensor Completion with Nearly-Linear Sample Complexity
    • Google rolls out new search homepage with AI chat history and no search button
    • How To Stream GTA 6 On Your iPhone, iPad Or Mac
    • From Sequence Uncertainty to Phenotype Hypotheses: Uncertainty-Conditioned Inference over Biomedical Knowledge Graphs
    • Meta reconsiders 2030 net-zero goal amid record emissions from AI data centers
    Facebook X (Twitter) Instagram
    techwavedispatch.com
    Subscribe
    Friday, November 20
    • Home
    • AI Tools & Software
    • Machine Learning
    • Generative AI
    • Robotics & Automation
    • Future Tech & Hardware
    • AI in Business
    • Ethics & Regulations
    • More
      • Gadgets & Smart Devices
      • Cybersecurity & AI
      • Tech Breakthroughs
    techwavedispatch.com
    Home»Machine Learning»Efficient Tensor Completion with Nearly-Linear Sample Complexity
    Machine Learning

    Efficient Tensor Completion with Nearly-Linear Sample Complexity

    adminBy adminNovember 20, 2026No Comments2 Mins Read
    Facebook Twitter Pinterest LinkedIn Tumblr Email
    Efficient Tensor Completion with Nearly-Linear Sample Complexity
    Share
    Facebook Twitter LinkedIn Pinterest Email

    [Submitted on 5 Feb 2026 (v1), last revised 18 Nov 2026 (this version, v4)]

    View a PDF of the paper titled Wedge Sampling: Efficient Tensor Completion with Nearly-Linear Sample Complexity, by Hengrui Luo and 3 other authors

    View PDF
    HTML (experimental)

    Abstract:We introduce wedge sampling, a non-adaptive sampling scheme for recovering an order-$k$ low-rank tensor of side length $n$ from structured observations of its entries. The scheme samples pairs of entries in the same column of a tensor unfolding, forming length-two paths (wedges) in the associated bipartite sampling graph. The products of the paired entries supply the row correlations needed for spectral initialization in regimes where uniform sampling yields too few wedges. For fixed rank, incoherence, tensor order, and condition number, wedge sampling enables polynomial-time recovery with nearly linear sample complexity in $n$. The spectral initializer can be combined with existing refinement procedures using only an additional $\tilde O(n)$ uniformly sampled entries. Spectral refinement achieves weak recovery to any fixed relative Frobenius error. For symmetric third-order tensors with incoherent canonical polyadic factors, gradient descent achieves exact recovery in the noiseless setting, with error decreasing geometrically. The improvement over the $\tilde O(n^{k/2})$ sample complexity typical of efficient methods under uniform entry sampling shows how the conjectured computational barrier depends on the observation model. A key ingredient for the gradient descent analysis is a concentration bound for sparse random tensors in an incoherent spectral norm. We also give error bounds for both procedures under additive Gaussian noise and explicit signal-to-noise conditions. Beyond tensor completion, the same sampling scheme improves the sample complexity of one-sided matrix completion, where the goal is to recover the left singular subspace of a matrix with many more columns than rows.

    Submission history

    From: Anna Ma [view email]
    [v1]
    Thu, 5 Feb 2026 16:47:13 UTC (335 KB)
    [v2]
    Sat, 6 Jun 2026 14:29:26 UTC (330 KB)
    [v3]
    Tue, 4 Aug 2026 23:18:01 UTC (399 KB)
    [v4]
    Wed, 18 Nov 2026 20:19:38 UTC (419 KB)

    Completion Complexity efficient NearlyLinear Sample Tensor
    Share. Facebook Twitter Pinterest LinkedIn Tumblr Email
    admin
    • Website

    Related Posts

    [2611.25424] Coordinate Basis Linear Bandits with Sublinear Regret over Low-Rank Clusters

    November 20, 2026

    From Sequence Uncertainty to Phenotype Hypotheses: Uncertainty-Conditioned Inference over Biomedical Knowledge Graphs

    November 20, 2026

    [2510.21798] Does AI Assistance Preserve or Collapse Disagreement? A Study of Pre-Annotations in Ambiguous Video Labeling

    November 20, 2026
    Leave A Reply Cancel Reply

    Top Posts

    NVIDIA Is Investigating Reports That CEO Jensen Huang Was The Target Of Chinese Spy Efforts

    November 8, 202619 Views

    ADIndex: Layer-Adaptive Sparse Attention Indexing via Group-Level Distillation

    November 11, 20265 Views

    Anthropic releases new Mythos and Fable models amid RSI concerns

    November 9, 20265 Views

    If AGI is so close, why is everyone leaving? The neolabs and their bets

    November 6, 20265 Views
    Don't Miss
    Gadgets & Smart Devices

    The Internet Archive’s Workers Are Unionizing

    By adminNovember 20, 20260

    They asked founder Brewster Kahle to voluntarily recognize the union, but will go to an…

    [2611.25424] Coordinate Basis Linear Bandits with Sublinear Regret over Low-Rank Clusters

    November 20, 2026

    Incoming House chair threatens SpaceX funding over Ukraine controversy

    November 20, 2026

    Efficient Tensor Completion with Nearly-Linear Sample Complexity

    November 20, 2026
    About Us

    Welcome to TechWave Dispatch

    At TechWave Dispatch, we bring you the latest news, insights, and developments from the ever-evolving world of technology. Our mission is to keep readers informed about the innovations shaping our digital future.

    From artificial intelligence and machine learning to cybersecurity, robotics, smart devices, and groundbreaking technologies, we cover the topics that matter in today's fast-moving tech landscape.

    Our Picks

    The Internet Archive’s Workers Are Unionizing

    November 20, 2026

    [2611.25424] Coordinate Basis Linear Bandits with Sublinear Regret over Low-Rank Clusters

    November 20, 2026

    Incoming House chair threatens SpaceX funding over Ukraine controversy

    November 20, 2026
    Most Popular

    After blocking Muse, Amazon now lets users text Alexa to help them shop

    November 6, 20260 Views

    A controlled world for robot learning and evaluation

    November 6, 20260 Views

    Egyptian and Nigerian English join the Open ASR Leaderboard

    November 6, 20260 Views
    Facebook X (Twitter) Instagram Pinterest
    • Terms and Conditions
    • Privacy Policy
    • Contact Us
    • About Us
    © 2026 TechWave Dispatch. All Rights Reserved.

    Type above and press Enter to search. Press Esc to cancel.