Hugging Face Trending Papers August 11, 2026

Improving TensorSketch Using Complex Random Variables

Read the original on Hugging Face Trending Papers →

\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(pDd)$, where $D$ denotes the sketch dimension, whereas~\cite{pham2013fast} extends the sparse \texttt{CountSketch}~\citep{count_sketch} algorithm, yielding a faster algorithm for high-dimensional sparse inputs with running time $O\big(p(\nnz{\vec{x}} + D \log D)\big)$.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

efficiency

arXiv AI

Aug 12

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}$.

By Amit Sharma, Mohammad Azhar Khan, Rameshwar Pratap, Keegan Kang

efficiency

arXiv Machine Learning

Jul 21

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

arXiv:2602. 20376v3 Announce Type: replace-cross Abstract: We study the problem of maximizing a complex-valued quadratic form over the $K^{\text{th}}$ roots of unity.

By Ria Stevens, Fangshuo Liao, Barbara Su, Thanasis Hadjidimoulas, Jianqiang Li, Anastasios Kyrillidis

benchmarks

arXiv Machine Learning

Jun 9

Wedge Sampling: Efficient Tensor Completion with Nearly-Linear Sample Complexity

arXiv:2602. 05869v2 Announce Type: replace-cross Abstract: We introduce Wedge Sampling, a new non-adaptive sampling scheme for low-rank tensor completion.

By Hengrui Luo, Anna Ma, Ludovic Stephan, Yizhe Zhu

arXiv Machine Learning

Jul 20

Improving Improved Kernel PLS

arXiv:2607. 16138v1 Announce Type: new Abstract: Improved Kernel Partial Least Squares (IKPLS) algorithms 1 and 2 are among the fastest PLS calibration algorithms.

By Ole-Christian Galbo Engstr{\o}m

benchmarks

arXiv Machine Learning

Jun 24

Exact Schur-Sylvester Dimensionality Reductions for Non-Smooth Stochastic Complexity and Manifold Sampling

arXiv:2606. 23867v1 Announce Type: new Abstract: The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.

By Trenton Lau, Gary P. T. Choi

benchmarks

arXiv Machine Learning

Jun 16

Stochastic trace estimation with tensor train random vectors

arXiv:2606. 15679v1 Announce Type: cross Abstract: Stochastic trace estimation is a standard tool for approximating the trace of a large-scale matrix available only through matrix-vector products.

By Zvonimir Bujanovi\'c, Daniel Kressner, Hrvoje Oli\'c

Related stories

Improving TensorSketch Using Complex Random Variables

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

Wedge Sampling: Efficient Tensor Completion with Nearly-Linear Sample Complexity

Improving Improved Kernel PLS

Exact Schur-Sylvester Dimensionality Reductions for Non-Smooth Stochastic Complexity and Manifold Sampling

Stochastic trace estimation with tensor train random vectors