VLDB 2026 Research / reviewers in the wild / expert
Guy Isley
dblp:10/8760
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1
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 · 50% Learning theory · 50% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory
compressed sensing |
0.1 | 1 | 2010 | Deciphering subsampled data: adaptive compressive sampling as a principle of brain communication · NIPS 2010 |
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding |
0.1 | 1 | 2010 | Deciphering subsampled data: adaptive compressive sampling as a principle of brain communication · NIPS 2010 |
Bioinformatics and computational biology › computational neuroscience
neural coding |
0.1 | 1 | 2010 | Deciphering subsampled data: adaptive compressive sampling as a principle of brain communication · NIPS 2010 |
Methods — techniques the papers use, named apart from their topics
sparse coding · 0.2compressive sampling · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Adaptive compressed sensing - A new class of self-organizing coding models for neuroscienceabstractSparse coding networks, which utilize unsupervised learning to maximize coding efficiency, have successfully reproduced response properties found in primary visual cortex [1]. However, conventional sparse coding models require that the coding circuit can fully sample the sensory data in a one-to-one fashion, a requirement not supported by experimental data from the thalamo-cortical projection. To relieve these strict wiring requirements, we propose a sparse coding network constructed by introducing synaptic learning in the framework of compressed sensing. We demonstrate a new model that evolves biologically realistic, spatially smooth receptive fields despite the fact that the feedforward connectivity subsamples the input and thus the learning must rely on an impoverished and distorted account of the original visual data. Further, we demonstrate that the model could form a general scheme of cortical communication: it can form meaningful representations in a secondary sensory area, which receives input from the primary sensory area through a “compressing” cortico-cortical projection. Finally, we prove that our model belongs to a new class of sparse coding algorithms in which recurrent connections are essential in forming the spatial receptive fields. William K. Coulter, Christopher Hillar, Guy Isley, Friedrich T. Sommer |
ICASSP | 3 |
| 2010 | Deciphering subsampled data: adaptive compressive sampling as a principle of brain communicationabstractA new algorithm is proposed for a) unsupervised learning of sparse representations from subsampled measurements and b) estimating the parameters required for linearly reconstructing signals from the sparse codes. We verify that the new algorithm performs efficient data compression on par with the recent method of compressive sampling. Further, we demonstrate that the algorithm performs robustly when stacked in several stages or when applied in undercomplete or overcomplete situations. The new algorithm can explain how neural populations in the brain that receive subsampled input through fiber bottlenecks are able to form coherent response properties. Guy Isley, Christopher Hillar, Friedrich T. Sommer |
NIPS | 1 |