AI Paper Atlas

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

Efficient Top-K Feature Selection Using Coordinate Descent Method

AAAI 2023 · Learning theory and algorithms › Matrix and tensor methods · approach: Structured low-rank learning · 15 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 CD-LSR instead of RPFS to optimize the l2,0-constrained LSRLSR feature selection · SRBCT, k=1, k=5, and k=10converged objective function value: 49.08±3.5 -> 45.71±4.1; 29.81±9.2 -> 12.91±2.1; 12.28±2.5 -> 6.994±1.0Helped
Use CD-LSR instead of RPFS to optimize the l2,0-constrained LSRLSR feature selection · JAFFE, k=1, k=5, and k=10converged objective function value: 180.0±2.7 -> 175.4±1.9; 124.2±4.9 -> 118.0±7.1; 74.07±4.8 -> 68.36±8.5Helped
Use CD-LSR instead of IPFSl2,0-constrained LSR · JAFFE, k=5CPU time in second: 0.477±0.03 -> 0.342±0.01Helped
Use CD-LSR instead of RPFSl2,0-constrained LSR · USPS, k=5CPU time in second: 3.114±0.31 -> 3.376±0.66Hurt
Use CD-LSR instead of IPFSl2,0-constrained LSR · SRBCT, k=5CPU time in second: 1.761±0.02 -> 5.913±0.07Hurt

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