AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Sparse Approximate Conic Hulls

Greg Van Buskirk, Benjamin Raichel, Nicholas Ruozzi

NeurIPS 2017 · Learning theory and algorithms › Matrix and tensor methods · approach: Matrix completion and factorization · 5 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use convex hull greedy algorithm instead of conic hull greedy for feature selectionGreedy hull feature selection with SVM · Reuters and BBC text (TF-IDF)SVM accuracyImproved
Add gamma-shift (gamma=10) to the input matrix before the conic hull algorithm (ablation)Conic hull greedy algorithm · TF-IDF text datasetsSVM accuracyImproved
Add thresholding when constructing the feature matrix (ablation)X-RAY and conic hull algorithms · Text datasetsSVM accuracyImproved
Select point with largest residual (mutant X-RAY) instead of standard X-RAY maxX-RAY · Six feature selection datasetsSVM accuracyImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy