AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

HOGWILD!-Gibbs can be PanAccurate

Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti

NeurIPS 2018 · Learning theory and algorithms › Sample complexity · approach: Minimax estimation rates · 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 asynchronous rather than sequential Gibbs updatesGibbs sampling under Dobrushin's condition · Functions Lipschitz in the d-th power of Hamming distanceexpectation bias: K.(C(\tau, \alpha,d)\log^d n+1)Mixed
Use asynchronous rather than sequential Gibbs updatesGibbs sampling under Dobrushin's condition · Degree-d polynomials of high-temperature Ising modelsvariance: \mbox{\bf Var}\left[ f(Y_t) \right] \le \inftynorm{a}^2C(d,\alpha,\tau) n^{d}No clear effect
Increase the number of asynchronous processorsHOGWILD!-Gibbs on CW(n, 0.5) · CW(n, 0.5)average read delay: approximately 0.4 stepsHurt
Increase nHOGWILD!-Gibbs on CW(n, 0.5) · CW(n, 0.5)average read delayNo clear effect

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