{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/inverse-ising-problem-in-continuous-time-a","title":"Inverse Ising problem in continuous time: A latent variable approach","arxiv_id":"1709.04495","date":"2017-09-04","proceeding":null,"authors":["Christian Donner","Manfred Opper"],"abstract":"We consider the inverse Ising problem, i.e. the inference of network\ncouplings from observed spin trajectories for a model with continuous time\nGlauber dynamics. By introducing two sets of auxiliary latent random variables\nwe render the likelihood into a form, which allows for simple iterative\ninference algorithms with analytical updates. The variables are: (1) Poisson\nvariables to linearise an exponential term which is typical for point process\nlikelihoods and (2) P\\'olya-Gamma variables, which make the likelihood\nquadratic in the coupling parameters. Using the augmented likelihood, we derive\nan expectation-maximization (EM) algorithm to obtain the maximum likelihood\nestimate of network parameters. Using a third set of latent variables we extend\nthe EM algorithm to sparse couplings via L1 regularization. Finally, we develop\nan efficient approximate Bayesian inference algorithm using a variational\napproach. We demonstrate the performance of our algorithms on data simulated\nfrom an Ising model. For data which are simulated from a more biologically\nplausible network with spiking neurons, we show that the Ising model captures\nwell the low order statistics of the data and how the Ising couplings are\nrelated to the underlying synaptic structure of the simulated network.","url_abs":"http://arxiv.org/abs/1709.04495v3","url_pdf":"http://arxiv.org/pdf/1709.04495v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"inverse-ising-problem-in-continuous-time-a","repo_url":"https://github.com/christiando/dynamic_ising","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"christiando/dynamic_ising","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5263e9f371ed18582bf68ce77beb9d12efe9ceb95192f51e17ffa84bd4a3af5e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}