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

Jared Miller

dblp:61/10919 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 5Applied, interdisciplinary, general and emerging computing · 3Human-computer interaction and ubiquitous computing · 2

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 · 100%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 77% Health and well-being technologies · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.412019
Solving Interpretable Kernel Dimensionality Reduction · NeurIPS 2019
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
kernel dimension reduction
0.412019
Solving Interpretable Kernel Dimensionality Reduction · NeurIPS 2019
Human-robot interaction › robot communication
spatial language
0.112012
Spatial language experiments for a robot fetch task · HRI 2012
Health and well-being technologies
elderly care
0.012012
Spatial language experiments for a robot fetch task · HRI 2012

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

manifold optimization · 0.4iterative spectral method · 0.4eigendecomposition · 0.4virtual environment experiment · 0.1
YearPublicationVenuePosition
2019 Solving Interpretable Kernel Dimensionality Reduction
abstract
Kernel dimensionality reduction (KDR) algorithms find a low dimensional representation of the original data by optimizing kernel dependency measures that are capable of capturing nonlinear relationships. The standard strategy is to first map the data into a high dimensional feature space using kernels prior to a projection onto a low dimensional space. While KDR methods can be easily solved by keeping the most dominant eigenvectors of the kernel matrix, its features are no longer easy to interpret. Alternatively, Interpretable KDR (IKDR) is different in that it projects onto a subspace \textit{before} the kernel feature mapping, therefore, the projection matrix can indicate how the original features linearly combine to form the new features. Unfortunately, the IKDR objective requires a non-convex manifold optimization that is difficult to solve and can no longer be solved by eigendecomposition. Recently, an efficient iterative spectral (eigendecomposition) method (ISM) has been proposed for this objective in the context of alternative clustering. However, ISM only provides theoretical guarantees for the Gaussian kernel. This greatly constrains ISM's usage since any kernel method using ISM is now limited to a single kernel. This work extends the theoretical guarantees of ISM to an entire family of kernels, thereby empowering ISM to solve any kernel method of the same objective. In identifying this family, we prove that each kernel within the family has a surrogate $\Phi$ matrix and the optimal projection is formed by its most dominant eigenvectors. With this extension, we establish how a wide range of IKDR applications across different learning paradigms can be solved by ISM. To support reproducible results, the source code is made publicly available on \url{https://github.com/ANONYMIZED}.
Chieh Wu, Jared Miller, Yale Chang, Mario Sznaier, Jennifer G. Dy
NeurIPS2
2013 Assessing the effectiveness of older adults' spatial descriptions in a fetch task
Laura A. Carlson, Marjorie Skubic, Jared Miller, Zhiyu Huo, Tatiana Alexenko
CogSci3
2013 Testing an assistive fetch robot with spatial language from older and younger adults
abstract
Methods and experimental results are presented for interpreting 3D spatial language descriptions used for human to robot communication in a fetch task. The work is based on human subject experiments in which spatial language descriptions were logged from younger and older adult participants. A spatial language model is proposed, and methods are presented for translating natural spatial language descriptions into robot commands that allow the robot to find the requested object. Robot command representation and robot behavior are also discussed. Experimental results compare path metrics of the robot system and human subjects in a common simulation environment. The overall success rate of the robot trials is 85%.
Marjorie Skubic, Zhiyu Huo, Tatiana Alexenko, Laura A. Carlson, Jared Miller
RO-MAN5
2012 Spatial language experiments for a robot fetch task
abstract
This paper outlines a new study that investigates spatial language for use in human-robot communication. The scenario studied is a home setting in which the elderly resident has misplaced an object, such as eyeglasses, and the robot will help the resident find the object. We present results from phase I of the study in which we investigate spatial language generated to a human addressee or a robot addressee in a virtual environment.
Marjorie Skubic, Laura A. Carlson, Jared Miller, Xiao Ou Li, Zhiyu Huo
HRI3
2011 Defining salience for landmark selection
Laura A. Carlson, Jared Miller
CogSci2