ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1604.00419
  4. Cited By
Estimating the interaction graph of stochastic neural dynamics

Estimating the interaction graph of stochastic neural dynamics

1 April 2016
A. Duarte
A. Galves
E. Löcherbach
G. Ost
ArXivPDFHTML

Papers citing "Estimating the interaction graph of stochastic neural dynamics"

9 / 9 papers shown
Title
Efficiently learning Ising models on arbitrary graphs
Efficiently learning Ising models on arbitrary graphs
Guy Bresler
71
203
0
22 Nov 2014
Sharp oracle inequalities and slope heuristic for specification
  probabilities estimation in discrete random fields
Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields
M. Lerasle
D. Takahashi
65
9
0
13 Jun 2011
An Oracle Approach for Interaction Neighborhood Estimation in Random
  Fields
An Oracle Approach for Interaction Neighborhood Estimation in Random Fields
M. Lerasle
D. Takahashi
88
5
0
22 Oct 2010
High-dimensional Ising model selection using ${\ell_1}$-regularized
  logistic regression
High-dimensional Ising model selection using ℓ1{\ell_1}ℓ1​-regularized logistic regression
Pradeep Ravikumar
Martin J. Wainwright
John D. Lafferty
270
957
0
02 Oct 2010
Identifying interacting pairs of sites in Ising models on a countable
  set
Identifying interacting pairs of sites in Ising models on a countable set
A. Galves
E. Orlandi
D. Takahashi
87
7
0
02 Jun 2010
Neighborhood radius estimation in Variable-neighborhood Random Fields
Neighborhood radius estimation in Variable-neighborhood Random Fields
E. Loecherbach
E. Orlandi
87
18
0
25 Feb 2010
Which graphical models are difficult to learn?
Which graphical models are difficult to learn?
Andrea Montanari
J. A. Pereira
93
90
0
30 Oct 2009
Reconstruction of Markov Random Fields from Samples: Some Easy
  Observations and Algorithms
Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms
Guy Bresler
Elchanan Mossel
Allan Sly
93
159
0
10 Dec 2007
Exponential inequalities for empirical unbounded context trees
Exponential inequalities for empirical unbounded context trees
A. Galves
Florencia Leonardi
109
25
0
31 Oct 2007
1