Research map / Learning theory and algorithms / Matrix and tensor methods
Asynchronous Doubly Stochastic Sparse Kernel Learning
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 changed | Where | Measured | Effect |
|---|---|---|---|
| AsyDSSKL vs LIBSVM(P), AsyGCD, DoubleSGD | AsyDSSKL · Covtype B, RCV1, SUSY | accuracy at fixed training time | Helped |
| AsyDSSKL vs LIBSVM(P) | AsyDSSKL · Covtype M, MNIST, Aloi | MSE at fixed training time | Helped |
| sparse constraint in AsyDSSKL | AsyDSSKL · Covtype B and Covtype M | testing time vs number of test samples | Helped |
| asynchronous lock-free parallelism, 1 to 16 cores (ablation) | AsyDSSKL · Covtype B and Covtype M | speedup | Helped |
| doubly stochastic updates with asynchrony | AsyDSSKL · large datasets | convergence time: 60 seconds | Helped |
Closest papers by meaning
- Faster Derivative-Free Stochastic Algorithm for Shared Memory Machines (ICML 2018 · similarity 0.87)
- Fast Asynchronous Parallel Stochastic Gradient Descent: A Lock-Free Approach with Convergence Guarantee (AAAI 2016 · similarity 0.87)
- Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees (AAAI 2021 · similarity 0.86)
- Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity (ICML 2025 · similarity 0.85)
- Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity (NeurIPS 2026 · similarity 0.85)
- Stability and Generalization of Asynchronous SGD: Sharper Bounds Beyond Lipschitz and Smoothness (NeurIPS 2024 · similarity 0.85)
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.