Skip to content
naulon
Get started

Not checked for notices yet.

Flexible and efficient simulation-based inference for models of decision-making

Jan Boelts, Jan-Matthis Lueckmann, Richard Gao and 1 more

eLife · 2022

doi:10.7554/elife.77220

References 79

  1. 1.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  2. 2.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  3. 3.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  4. 4.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  5. 5.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  6. 6.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  7. 7.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  8. 8.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  9. 9.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  10. 10.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  11. 11.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  12. 12.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  13. 13.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  14. 14.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  15. 15.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  16. 16.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  17. 17.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  18. 18.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  19. 19.
    HDDM: Hierarchical Bayesian estimation of the Drift-Diffusion Model in Python · 2013
    No notice
  20. 20.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  21. 21.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  22. 22.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  23. 23.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  24. 24.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  25. 25.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  26. 26.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  27. 27.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  28. 28.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  29. 29.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  30. 30.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  31. 31.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  32. 32.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  33. 33.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  34. 34.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  35. 35.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  36. 36.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  37. 37.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  38. 38.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  39. 39.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  40. 40.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  41. 41.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  42. 42.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  43. 43.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  44. 44.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  45. 45.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  46. 46.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  47. 47.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  48. 48.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  49. 49.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  50. 50.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  51. 51.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  52. 52.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  53. 53.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  54. 54.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  55. 55.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  56. 56.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  57. 57.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  58. 58.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  59. 59.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  60. 60.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  61. 61.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  62. 62.
    Array programming with NumPy · 2020
    No notice
  63. 63.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  64. 64.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  65. 65.
    Training deep neural density estimators to identify mechanistic models of neural dynamics · 2020
    No notice
  66. 66.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  67. 67.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  68. 68.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  69. 69.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  70. 70.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  71. 71.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  72. 72.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  73. 73.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  74. 74.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  75. 75.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  76. 76.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  77. 77.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  78. 78.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  79. 79.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.