{
  "id": "1705.06724",
  "version": "v1",
  "published": "2017-05-18T17:51:46.000Z",
  "updated": "2017-05-18T17:51:46.000Z",
  "title": "Self-Learning Monte Carlo Method: Continuous-Time Algorithm",
  "authors": [
    "Yuki Nagai",
    "Huitao Shen",
    "Yang Qi",
    "Junwei Liu",
    "Liang Fu"
  ],
  "comment": "6 pages, 5 figures",
  "categories": [
    "cond-mat.str-el",
    "cond-mat.dis-nn"
  ],
  "abstract": "The recently-introduced self-learning Monte Carlo method is a general-purpose numerical method that speeds up Monte Carlo simulations by training an effective model to propose uncorrelated configurations in the Markov chain. We implement this method in the framework of continuous time Monte Carlo method with auxiliary field in quantum impurity models. We introduce and train a diagram generating function (DGF) to model the probability distribution of auxiliary field configurations in continuous imaginary time, at all orders of diagrammatic expansion. By using DGF to propose global moves in configuration space, we show that the self-learning continuous-time Monte Carlo method can significantly reduce the computational complexity of the simulation.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-05-18T17:51:46.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "self-learning monte carlo method",
      "continuous-time algorithm",
      "self-learning continuous-time monte carlo method",
      "auxiliary field",
      "continuous time monte carlo method"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}