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

Thomas Powers

dblp:152/4045 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2018
—ORCID · none

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

Databases, data management, data science and information retrieval · 5 · 4 first-authorArtificial intelligence and machine learning · 1Graphics, 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
Deep learning architectures and training · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
recurrent neural network
0.212016
Full-Capacity Unitary Recurrent Neural Networks · NIPS 2016
Machine learning › Deep learning architectures and training › recurrent neural network
unitary recurrent neural network
0.212016
Full-Capacity Unitary Recurrent Neural Networks · NIPS 2016
Machine learning › Deep learning architectures and training › training dynamics
vanishing and exploding gradients
0.212016
Full-Capacity Unitary Recurrent Neural Networks · NIPS 2016

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

unitary parameterization · 0.5multiplicative gradient step · 0.5
YearPublicationVenuePosition
2018 Deep Generative Acoustic Models for Real-Time Sonar Systems
abstract
High-fidelity acoustic models are crucial to the performance of sonar systems since they identify where there is signal excess in the surrounding environment. Sonar operators use these models to optimize sonar parameters in applications like target detection and tracking. Unfortunately, high-fidelity generative models like Comprehensive Acoustic System Simulation (CASS) are very computationally intensive and can not be run in real time. One way around this limitation is to pre-compute maps for a region given expected environmental parameters, but this approach is impractical in highly variable littoral regions. Instead, we propose to emulate a high-fidelity acoustic model with a deep neural network (DNN). DNNs are very efficient at test time, requiring only a few iterations of simple linear and nonlinear operations, and can easily be run in real-time on a sonar platform. Deep models continue to advance the state-of-the-art in fields like speech and audio processing, computer vision, and natural language processing. These advances motivate the use of deep learning for a real-time generative acoustic model. We train a deep feedforward sigmoid network on a dataset generated by CASS and demonstrate promising results.
Thomas Powers, David W. Krout
FUSION1
2017 Building recurrent networks by unfolding iterative thresholding for sequential sparse recovery
abstract
Historically, sparse methods and neural networks, particularly modern deep learning methods, have been relatively disparate areas. Sparse methods are typically used for signal enhancement, compression, and recovery, usually in an unsupervised framework, while neural networks commonly rely on a supervised training set. In this paper, we use the specific problem of sequential sparse recovery, which models a sequence of observations over time using a sequence of sparse coefficients, to show how algorithms for sparse modeling can be combined with supervised deep learning to improve sparse recovery. Specifically, we show that the iterative soft-thresholding algorithm (ISTA) for sequential sparse recovery corresponds to a stacked recurrent neural network (RNN) under specific architecture and parameter constraints. Then we demonstrate the benefit of training this RNN with backpropagation using supervised data for the task of column-wise compressive sensing of images. This training corresponds to adaptation of the original iterative thresholding algorithm and its parameters. Thus, we show by example that sparse modeling can provide a rich source of principled and structured deep network architectures that can be trained to improve performance on specific tasks.
Scott Wisdom, Thomas Powers, James W. Pitton, Les E. Atlas
ICASSP2
2016 Constrained robust submodular sensor selection with applications to multistatic sonar arrays
Thomas Powers, Jeff A. Bilmes, David W. Krout, Les E. Atlas
FUSION1
2016 Full-Capacity Unitary Recurrent Neural Networks
abstract
Recurrent neural networks are powerful models for processing sequential data, but they are generally plagued by vanishing and exploding gradient problems. Unitary recurrent neural networks (uRNNs), which use unitary recurrence matrices, have recently been proposed as a means to avoid these issues. However, in previous experiments, the recurrence matrices were restricted to be a product of parameterized unitary matrices, and an open question remains: when does such a parameterization fail to represent all unitary matrices, and how does this restricted representational capacity limit what can be learned? To address this question, we propose full-capacity uRNNs that optimize their recurrence matrix over all unitary matrices, leading to significantly improved performance over uRNNs that use a restricted-capacity recurrence matrix. Our contribution consists of two main components. First, we provide a theoretical argument to determine if a unitary parameterization has restricted capacity. Using this argument, we show that a recently proposed unitary parameterization has restricted capacity for hidden state dimension greater than 7. Second,we show how a complete, full-capacity unitary recurrence matrix can be optimized over the differentiable manifold of unitary matrices. The resulting multiplicative gradient step is very simple and does not require gradient clipping or learning rate adaptation. We confirm the utility of our claims by empirically evaluating our new full-capacity uRNNs on both synthetic and natural data, achieving superior performance compared to both LSTMs and the original restricted-capacity uRNNs.
Scott Wisdom, Thomas Powers, John R. Hershey, Jonathan Le Roux, Les E. Atlas
NIPS2
2015 Sensor selection from independence graphs using submodularity
Thomas Powers, David W. Krout, Les E. Atlas
FUSION1
2014 Sensor management for multistatics
David W. Krout, Thomas Powers
FUSION2
2014 Track to track fusion: PACsim data set
Thomas Powers, Les E. Atlas, Evan Hanusa, David W. Krout
FUSION1