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.

Michael J. Tobia

dblp:34/11221 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0002-5013-0597ORCID · reported

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 75% Parallel and multicore computing · 25%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
High-performance computing › tensor computation › tensor decomposition
MTTKRP
0.312018
Shared-memory parallelization of MTTKRP for dense tensors · PPoPP 2018
Parallel and multicore computing › parallel programming models
shared-memory parallelization
0.312018
Shared-memory parallelization of MTTKRP for dense tensors · PPoPP 2018
High-performance computing
tensor computation
0.312018
Shared-memory parallelization of MTTKRP for dense tensors · PPoPP 2018
High-performance computing › tensor computation
tensor decomposition
0.312018
Shared-memory parallelization of MTTKRP for dense tensors · PPoPP 2018
Algorithms and data structures
numerical linear algebra
0.112018
Shared-memory parallelization of MTTKRP for dense tensors · PPoPP 2018
YearPublicationVenuePosition
2018 Shared-memory parallelization of MTTKRP for dense tensors
abstract
The matricized-tensor times Khatri-Rao product (MTTKRP) is the computational bottleneck for algorithms computing CP decompositions of tensors. In this work, we develop shared-memory parallel algorithms for MTTKRP involving dense tensors. The algorithms cast nearly all of the computation as matrix operations in order to use optimized BLAS subroutines, and they avoid reordering tensor entries in memory. We use our parallel implementation to compute a CP decomposition of a neuroimaging data set and achieve a speedup of up to 7.4X over existing parallel software.
Koby Hayashi, Grey Ballard, Michael J. Tobia
PPoPP4
2014 Risk-Sensitive Reinforcement Learning
abstract
We derive a family of risk-sensitive reinforcement learning methods for agents, who face sequential decision-making tasks in uncertain environments. By applying a utility function to the temporal difference (TD) error, nonlinear transformations are effectively applied not only to the received rewards but also to the true transition probabilities of the underlying Markov decision process. When appropriate utility functions are chosen, the agents' behaviors express key features of human behavior as predicted by prospect theory (Kahneman & Tversky, 1979 ), for example, different risk preferences for gains and losses, as well as the shape of subjective probability curves. We derive a risk-sensitive Q-learning algorithm, which is necessary for modeling human behavior when transition probabilities are unknown, and prove its convergence. As a proof of principle for the applicability of the new framework, we apply it to quantify human behavior in a sequential investment task. We find that the risk-sensitive variant provides a significantly better fit to the behavioral data and that it leads to an interpretation of the subject's responses that is indeed consistent with prospect theory. The analysis of simultaneously measured fMRI signals shows a significant correlation of the risk-sensitive TD error with BOLD signal change in the ventral striatum. In addition we find a significant correlation of the risk-sensitive Q-values with neural activity in the striatum, cingulate cortex, and insula that is not present if standard Q-values are used.
Michael J. Tobia, Tobias Sommer, Klaus Obermayer
Neural Comput.2