Neural network analysis of sensory processing and active data collection
by DiMattina, Christopher, Ph.D., THE JOHNS HOPKINS UNIVERSITY, 2009, 343 pages; 3392301

Abstract:

For over 50 years, sensory neurophysiology has utilized a 'black-box' paradigm, describing the functional relationship between stimuli and neural responses without explicitly considering underlying brain circuitry. In this thesis, we consider two avenues of research which can help to better understand how the functional relationships measured in experiments are ultimately generated by neural circuitry.

In Part I, we demonstrate how the architectural properties of neural networks constrain optimal and invariant stimuli for sensory neurons. In Chapter 2 we demonstrate for neurons whose functional networks are convergent the optimal stimulus must lie on the boundary of a topologically compact set of permissible input unit activities, implying that such a network cannot have a firing rate peak in this space. Applying this to network models of sensory processing predicts monotonic tuning for stimulus contrast, as is observed experimentally. In Chapter 3 we consider quadratic analysis of neural networks and its implications for finding optimal and invariant stimuli. We show how quadratic analysis is constrained by the architecture of the underlying neural network, and how quadratic analysis describes stimulus invariances arising from the first layer but not higher layers of network processing.

In Part II, we consider an approach to sensory neurophysiology based on fitting multiple models in on-line experiments and generating critical stimuli to distinguish competing models. In Chapter 4 we consider the problem of identifying the true parameters of neural network models from finite, noisy data. By solving a differential equation, we show that is only possible for a continuum of different parameters to implement the same input-output function when the hidden unit gains are given by power, exponential or logarithm functions. However, even in networks with standard gains functions continuous parameter confounding can occur as well, making unique recovery of network parameters impossible with standard training sets. Finally, in Chapter 5 we demonstrate how active data collection may overcome the problem of continuum confounding, and illustrate with an experimentally interesting example how on-line stimulus generation may be far more effective for model estimation and comparison than presenting random stimuli.

 
AdviserKechen Zhang
SchoolTHE JOHNS HOPKINS UNIVERSITY
SourceDAI/B 71-01, p. , Mar 2010
Source TypeDissertation
SubjectsNeurosciences; Artificial intelligence; Computer science
Publication Number3392301
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3392301
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.