AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Optimization for Classical Machine Learning Problems on the GPU

Sören Laue, Mark Blacher, Joachim Giesen

AAAI 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization · 4 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 the GPU-efficient GENO solver instead of cuOSQPDual SVM · cod-rnarunning time (seconds): 55.7 -> 0.6Improved
Use the GPU-efficient GENO solver instead of SCS GPUDual SVM · cod-rnarunning time (seconds): 2342.0 -> 0.6Improved
Use the GPU-efficient GENO solver instead of FairlearnFairness optimization · adult, logistic constraint, 42500 samplesrunning time (seconds): $30.0\pm 0.2$ -> $0.8\pm 0.0$Improved
Use the GPU-efficient GENO solver instead of cuOSQPDual SVM · adult a1a–a8a, 11220 samplesrunning time (seconds): $42.9$ -> $0.4$Improved
Run the GENO solver on GPU rather than CPUNNLS · data set 1, 10000running time (seconds): $3.7\pm 0.4$ -> $0.8\pm 0.1$Improved
Use the GPU-efficient GENO solver instead of GENO CPUNNLS · data set 2, 44400running time (seconds): $6.4\pm 0.1$ -> $1.6\pm 0.2$Improved
Run the GENO solver on GPU rather than CPUJoint probability optimization · entropy regularizer, data set 1, 1000running time (seconds): $4.6$ -> $1.1$Improved
Use the GPU-efficient GENO solver instead of GENO CPUJoint probability optimization · Gaussian regularizer, data set 2, 3000running time (seconds): $2622.4\pm 236.7$ -> $92.3\pm 1.9$Improved
Replace original L-BFGS-B with the GPU-efficient L-BFGS-B method, avoiding sequential Cauchy point computationL-BFGS-B on GPU · NNLS, problem size 12,000total running time (seconds): 5.2 -> 0.8Improved
Port original L-BFGS-B from CPU to GPU, retaining its sequential Cauchy point computationOriginal L-BFGS-B · NNLS, problem size 12,000total running time (seconds): 4.9 -> 5.2Hurt

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