Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jan Grewe

dblp:136/7335 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-6254-2425ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 67% Learning theory · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
feature extraction
0.212013
Least Informative Dimensions · NIPS 2013
Machine learning › Learning theory
information-theoretic learning
0.212013
Least Informative Dimensions · NIPS 2013
Machine learning › Representation and self-supervised learning › mutual information
mutual information estimation
0.212013
Least Informative Dimensions · NIPS 2013
Bioinformatics and computational biology
computational neuroscience
0.012013
Least Informative Dimensions · NIPS 2013
Bioinformatics and computational biology › computational neuroscience
neural response modeling
0.012013
Least Informative Dimensions · NIPS 2013

Methods — techniques the papers use, named apart from their topics

spike-triggered covariance · 0.3kernel hilbert space · 0.3integral probability metrics · 0.3
YearPublicationVenuePosition
2023 Receptive field sizes and neuronal encoding bandwidth are constrained by axonal conduction delays
abstract
Studies on population coding implicitly assume that spikes from the presynaptic cells arrive simultaneously at the integrating neuron. In natural neuronal populations, this is usually not the case-neuronal signaling takes time and populations cover a certain space. The spread of spike arrival times depends on population size, cell density and axonal conduction velocity. Here we analyze the consequences of population size and axonal conduction delays on the stimulus encoding performance in the electrosensory system of the electric fish Apteronotus leptorhynchus. We experimentally locate p-type electroreceptor afferents along the rostro-caudal body axis and relate locations to neurophysiological response properties. In an information-theoretical approach we analyze the coding performance in homogeneous and heterogeneous populations. As expected, the amount of information increases with population size and, on average, heterogeneous populations encode better than the average same-size homogeneous population, if conduction delays are compensated for. The spread of neuronal conduction delays within a receptive field strongly degrades encoding of high-frequency stimulus components. Receptive field sizes typically found in the electrosensory lateral line lobe of A. leptorhynchus appear to be a good compromise between the spread of conduction delays and encoding performance. The limitations imposed by finite axonal conduction velocity are relevant for any converging network as is shown by model populations of LIF neurons. The bandwidth of natural stimuli and the maximum meaningful population sizes are constrained by conduction delays and may thus impact the optimal design of nervous systems.
Tim C. Hladnik, Jan Grewe
PLoS Comput. Biol.2
2013 Least Informative Dimensions
abstract
We present a novel non-parametric method for finding a subspace of stimulus features that contains all information about the response of a system. Our method generalizes similar approaches to this problem such as spike triggered average, spike triggered covariance, or maximally informative dimensions. Instead of maximizing the mutual information between features and responses directly, we use integral probability metrics in kernel Hilbert spaces to minimize the information between uninformative features and the combination of informative features and responses. Since estimators of these metrics access the data via kernels, are easy to compute, and exhibit good theoretical convergence properties, our method can easily be generalized to populations of neurons or spike patterns. By using a particular expansion of the mutual information, we can show that the informative features must contain all information if we can make the uninformative features independent of the rest.
Fabian H. Sinz, Anna Stockl, Jan Grewe, Jan Benda
NIPS3
2013 Framework for automatic generation of graphical layout compatible with multiple platforms
abstract
Most data management systems include a database in the backend to store data and the associated metadata and a web-based user interface to access and modify the data/metadata. User interfaces are specifically tailored for representing a unique database structure and cannot be easily reused for other database structure. Furthermore the generated web-based layouts are often not compatible for other platform such as desktop applications or mobile devices. We are proposing here a general framework for designing a graphical layout compatible with different platforms including mobile devices and independent of the database structure. This framework is based on a model-driven approach using annotations of database entities that will be used to create desired layouts. A use case study is presented on a database designed for neuroscience experiments.
Petr Jezek, Roman Moucek, Yann Le Franc, Thomas Wachtler, Jan Grewe
VL/HCC5