Research map / Federated learning and privacy / Differential privacy
Scaling Up Differentially Private LASSO Regularized Logistic Regression via Faster Frank-Wolfe Iterations
Edward Raff, Amol Ashish Khanna, Fred Lu
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use the Big-Step Little-Step sampler instead of brute-force noisy-max (ablation) | Sparse DP Frank-Wolfe · News20, ε=1 | speedup: 17.83 -> 81.69 | Improved |
| Use the Big-Step Little-Step sampler instead of brute-force noisy-max (ablation) | Sparse DP Frank-Wolfe · URL, ε=1 | speedup: 1.02 -> 9.99 | Improved |
| Use the Big-Step Little-Step sampler instead of brute-force noisy-max (ablation) | Sparse DP Frank-Wolfe · RCV1, ε=0.1 | speedup: 1.82 -> 20.37 | Improved |
| Use the Big-Step Little-Step sampler instead of brute-force noisy-max (ablation) | Sparse DP Frank-Wolfe · Web, ε=1 | speedup: 21.24 -> 581.25 | Improved |
| Use the Big-Step Little-Step sampler instead of brute-force noisy-max (ablation) | Sparse DP Frank-Wolfe · KDDA, ε=0.1 | speedup: 368.96 -> 2245.56 | Improved |
| Apply sparse-aware mathematically equivalent Frank-Wolfe updates | Non-private Frank-Wolfe · RCV1, News20, URL, Web, and KDDA | test accuracy | No clear effect |
| Use the sparse non-private Frank-Wolfe implementation | Non-private Frank-Wolfe · Sparse datasets | runtime | No clear effect |
Closest papers by meaning
- Better Locally Private Sparse Estimation Given Multiple Samples Per User (ICML 2024 · similarity 0.87)
- Differentially Private High-dimensional Variable Selection via Integer Programming (NeurIPS 2025 · similarity 0.86)
- Improved Analysis of Sparse Linear Regression in Local Differential Privacy Model (ICLR 2024 · similarity 0.85)
- Private Gradient Descent for Linear Regression: Tighter Error Bounds and Instance-Specific Uncertainty Estimation (ICML 2024 · similarity 0.85)
- On the Computational Complexity of Private High-dimensional Model Selection (NeurIPS 2024 · similarity 0.84)
- Sarah Frank-Wolfe: Methods for Constrained Optimization with Best Rates and Practical Features (ICML 2024 · similarity 0.84)
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.
