PulseAugur
EN
LIVE 07:21:12

TensorSketch algorithm enhanced with complex random variables for improved high-dimensional data processing

Researchers have developed a new variant of the TensorSketch algorithm that improves upon existing methods for sketching high-dimensional polynomial kernels. This novel approach reduces the variance of estimators, which previously scaled exponentially with the polynomial degree. The improved TensorSketch retains the efficiency of input-sparsity running time while achieving a better variance bound, validated by experiments on synthetic and real-world datasets. AI

IMPACT This research offers a more efficient method for processing high-dimensional data, potentially improving performance in machine learning applications that rely on kernel methods.

RANK_REASON The item describes a novel variant of an existing algorithm (TensorSketch) presented in a research paper, focusing on theoretical improvements and experimental validation. [lever_c_demoted from research: ic=1 ai=1.0]

Read on Hugging Face Daily Papers →

AI-generated summary · Google Gemini · from 2 sources. How we write summaries →

TensorSketch algorithm enhanced with complex random variables for improved high-dimensional data processing

COVERAGE [2]

  1. Hugging Face Daily Papers TIER_1 English(EN) ·

    Improving TensorSketch Using Complex Random Variables

    \texttt{TensorSketch} by~\cite{pham2013fast,kar2012random} provides efficient sketching algorithms for high-dimensional polynomial kernels $\vec{x}^{\otimes p} \in \R^{d^p}$. \cite{kar2012random} uses dense Johnson-Lindenstrauss (JL)-type projections with computational cost $O(pD…

  2. arXiv stat.ML TIER_1 English(EN) · Amit Sharma, Mohammad Azhar Khan, Rameshwar Pratap, Keegan Kang ·

    Improving TensorSketch Using Complex Random Variables

    arXiv:2608.10523v1 Announce Type: cross Abstract: \texttt{TensorSketch} by~\cite{pham2013fast,kar2012random} provides efficient sketching algorithms for high-dimensional polynomial kernels $\vec{x}^{\otimes p} \in \R^{d^p}$. \cite{kar2012random} uses dense Johnson-Lindenstrauss (…