Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,341 papers · 148 categories

Trend · papers per month

count% of corpus
0111 · Jul 201519922001200920182026
3 results for “SSE-hard”
On the Worst-Case Approximability of Sparse PCAstat.ML

New algorithm approximates Sparse PCA with n^{-1/3}, proving hardness of better approximations.

problem Approximating Sparse PCA on worst-case instances.
method Simple and efficient algorithm achieving n^{-1/3} approximation, NP-hardness proofs, SSE-hardness, and quasi-quasi-polynomial gap.
result Achieved n^{-1/3} approximation, proved hardness of better approximations.
Sparse PCAApproximationNP-hardSSE-hardQuasi-quasi-polynomial
2015-07-21abs ↗pdf ↗
Subspace approximation with outlierscs.CG

Algorithm finds a subspace minimizing distances to inliers with outliers.

problem Finding a kk-dimensional subspace minimizing distances to inliers with outliers.
method Extends dimension reduction techniques and bi-criteria approximations based on sampling.
result Efficient algorithm for multiplicative (1+ε)(1+ε)-approximation of optimal solution.
subspace approximationoutliersrobust PCAdimension reductionmultiplicative approximation
2020-06-30abs ↗pdf ↗