Home » Publications » Posters

Category Archives: Posters

My postdoc first productions: SFN2013 abstract and IEEE2013 article

This work is a smooth transition between being a doctoral candidate and being a post doctoral fellow. This abstract (SFN2013) and this article (IEEE2013) both deal with how well a threshold linear unit (TLU) is capable of approximating the feature binding problem (FBP) -of two objects made of two independent features -. One might wonder why we wanted to answer this question; I chose it because it is trivial to compute the FBP when the neuron has a non-linear dendritic subunit. We already know from previous work that it is impossible for a TLU to perfectly solve this problem, but not if it can approximate the FBP. This is why, I think, it is interesting to wonder if a neuron without a non-linear dendritic subunit, e.g. a TLU, is capable of approximating the solution.

The answer to this problem seems binary. Either yes a TLU can approximate well this function, or no a TLU cannot approximate this function. In fact, the answer depends on the input space, the sensorium of the neuron. When the input space of the neuron is made of all possible input vectors the answer is yes.  And when the input space is made of input vectors half made of ones the answer is no. The reason for that is not breaking news, but our point can be useful experimentally. It implies that to test the role of non-linearities in dendrites it is important to choose a particular subset of stimulations that corresponds to these vectors.

Despite the small attendance to the poster (SFN2013poster) -I like it- at least it triggered interesting exchanges of ideas with Simon (my new boss).

SFN 2012: Saturations and the global strategy

This abstract, written for SFN, introduces the main result of my PLoS Computational Biology paper and makes a remark about neural tuning (SFN2012). I wrote this abstract while the NIPS and the PloS paper were under review. The poster (SFN2012poster) shows that a single saturating  dendritic subunit enables a neuron to compute linearly inseparable functions, but I presented also another result. This work also showed that a neuron computing such function is broadly tuned;  it is a prequel to what I am currently working on, i.e. neural tuning and coding. It demonstrates that a broad neural tuning is compatible with a positive impact of non-linear summation in dendrites.

My First SFN meeting in 2010

I submitted this abstract to the Society For Neuroscience conference 2010 in San Diego (SFN2010). It presents a pseudo experimental protocol to test whether supralinear dendrites have an impact on the spiking property of a neuron. This work looks like a study from Polsky et al titled “Computational subunits in thin dendrites of pyramidal cells”. In this study, however, the neuron is silent, Polsky and colleagues focus on the subthreshold behavior of the neuron whereas in this poster the emphasis is on the spiking behavior of the neuron (SFN2010poster). Sadly, no experimentalist has yet tried to demonstrate this particular spiking behavior.

Dealing with intrinsic plasticity: FENS 2010 abstract

This abstract, submitted to FENS in 2010, deals with intrinsic plasticity in dendrites (FENS2010). Despite being one of my favorite, this topic is absent from my thesis manuscript. Also, the two main results of this study are absent from the abstract but present in the poster (Fens2010poster). Before talking about the result this poster defines the notion of storage capacity as the number of functions a neuron can compute. The two results are: first the storage capacity increases with the number of subunits; second the necessary range of synaptic weights to reach this capacity diminishes. The second result is by far the most interesting, one expects that the information storage capacity is boosted by the number of dendritic subunits, but it is a bit more surprising that dendritic subunits increase the efficiency of this storage. The intuition of this result is that as the maximal capacity can be reached with only binary weights with an unbounded number of dendritic subunits.

Going back where it began: Cosyne 2010 abstract

After my thesis manuscript. I am uploading my first abstract (Cosyne2010A). I wrote it with the help of Mark Humphries and Boris Gutkin. This abstract partly deals with the feature binding problem, even if we didn’t know its name at the time. Interestingly, the same year at COSYNE, another abstract also dealt with “binding problems”: Legenstein and Maass had wrote this abstract and they published the following year an article titled “Branch-specific plasticity enables self-organization of nonlinear computation in single neurons” where they presented the feature binding problem at the single neuron level. The poster is a bit messy and contains too much information (Cosyne2010Aposter) but I had a lot of useful feedbacks in this conference.

Design a site like this with WordPress.com
Get started