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

Brandon G. Jacques

dblp:211/8041 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2023
—ORCID · unresolved

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 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
2 papers
Deep learning architectures and training · 65% Representation and self-supervised learning · 35%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
convolutional neural network
0.612022
A deep convolutional neural network that is invariant to time rescaling · ICML 2022
Machine learning › Representation and self-supervised learning › representation learning › sequence representation
temporal representation learning
0.612022
A deep convolutional neural network that is invariant to time rescaling · ICML 2022
Machine learning › Deep learning architectures and training
recurrent neural network
0.512021
DeepSITH: Efficient Learning via Decomposition of What and When Across Time Scales · NeurIPS 2021
Visualization and visual analytics › time series analysis
time series prediction
0.112021
DeepSITH: Efficient Learning via Decomposition of What and When Across Time Scales · NeurIPS 2021

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

time cells · 1.0scale-invariant temporal history · 1.0temporal convolution network · 0.6
YearPublicationVenuePosition
2023 Representing Latent Dimensions Using Compressed Number Lines
abstract
Humans use log-compressed number lines to represent different quantities, including elapsed time, traveled distance, numerosity, sound frequency, etc. Inspired by recent cognitive science and computational neuroscience work, we developed a neural network that learns to construct log-compressed number lines. The network computes a discrete approximation of a real-domain Laplace transform using an RNN with analytically derived weights giving rise to a log-compressed timeline of the past. The network learns to extract latent variables from the input and uses them for global modulation of the recurrent weights turning a timeline into a number line over relevant dimensions. The number line representation greatly simplifies learning on a set of problems that require learning associations in different spaces - problems that humans can typically solve easily. This approach illustrates how combining deep learning with cognitive models can result in systems that learn to represent latent variables in a brain-like manner and exhibit human-like behavior manifested through Weber-Fechner law.
Sahaj Singh Maini, James Mochizuki-Freeman, Chirag Shankar Indi, Brandon G. Jacques, Per B. Sederberg, Marc W. Howard, Zoran Tiganj
IJCNN4
2022 A deep convolutional neural network that is invariant to time rescaling
abstract
Human learners can readily understand speech, or a melody, when it is presented slower or faster than usual. This paper presents a deep CNN (SITHCon) that uses a logarithmically compressed temporal representation at each level. Because rescaling the time of the input results in a translation of $\log$ time, and because the output of the convolution is invariant to translations, this network can generalize to out-of-sample data that are temporal rescalings of a learned pattern. We compare the performance of SITHCon to a Temporal Convolution Network (TCN) on classification and regression problems with both univariate and multivariate time series. We find that SITHCon, unlike TCN, generalizes robustly over rescalings of about an order of magnitude. Moreover, we show that the network can generalize over exponentially large scales without retraining the weights simply by extending the range of the logarithmically-compressed temporal memory.
Brandon G. Jacques, Zoran Tiganj, Aakash Sarkar, Marc W. Howard, Per B. Sederberg
ICML1
2021 DeepSITH: Efficient Learning via Decomposition of What and When Across Time Scales
abstract
Extracting temporal relationships over a range of scales is a hallmark ofhuman perception and cognition---and thus it is a critical feature of machinelearning applied to real-world problems. Neural networks are either plaguedby the exploding/vanishing gradient problem in recurrent neural networks(RNNs) or must adjust their parameters to learn the relevant time scales(e.g., in LSTMs). This paper introduces DeepSITH, a deep network comprisingbiologically-inspired Scale-Invariant Temporal History (SITH) modules inseries with dense connections between layers. Each SITH module is simply aset of time cells coding what happened when with a geometrically-spaced set oftime lags. The dense connections between layers change the definition of whatfrom one layer to the next. The geometric series of time lags implies thatthe network codes time on a logarithmic scale, enabling DeepSITH network tolearn problems requiring memory over a wide range of time scales. We compareDeepSITH to LSTMs and other recent RNNs on several time series prediction anddecoding tasks. DeepSITH achieves results comparable to state-of-the-artperformance on these problems and continues to perform well even as the delaysare increased.
Brandon G. Jacques, Zoran Tiganj, Marc W. Howard, Per B. Sederberg
NeurIPS1