Inductive Biases for Learning Long-Horizon Manipulation Skills
Abstract: Enabling robots to execute temporally extended sequences of behaviors is a challenging problem for learned systems, due to the difficulty of learning both high-level task information and low-level control. In this talk, I will discuss three approaches that we have developed to address this problem. Each of these approaches centers on an inductive bias [...]
Estimating Robustness using Proxies
ABSTRACT: This talk covers some of our recent explorations on estimating the robustness of black-box machine learning models across data subpopulations. In other words, if a trained model is uniformly accurate across different types of inputs, or if there are significant performance disparities affecting the different subpopulations. Measuring such a characteristic is fairly straightforward if [...]
Analogy-Forming Transformers for Few-Shot 3D Parsing
Abstract: How do we build agents that can fast generalize to novel scenarios given only a single example? In this talk, I will present analogy-forming transformers, a semi-parametric model that segments 3D object scenes by retrieving related memories and predicting analogous part structures for the input. This enables a single neural network to continually learn [...]
Range-based Gaussian Process Maps for Mobile Exploration Robots
Abstract: Mobile robots exploring unknown, natural environments with limited communication must map their surroundings using onboard sensors. In this context, terrain mapping can rely on Gaussian process models to incorporate spatial correlations and provide uncertainty estimates when predicting ground height - however, these models fail to account for the oblique viewpoint of a sensor on [...]
Learning Exploration Strategies to Solve Real-World Marble Runs
Abstract: Tasks involving locally unstable or discontinuous dynamics (such as bifurcations and collisions) remain challenging in robotics, because small variations in the environment can have a significant impact on task outcomes. In this talk, we present a robot system that we developed to evaluate learning algorithms on real-world physical problem solving tasks which incorporate these [...]
Beyond NeRF Underwater: Learning Neural Reflectance Fields for True Color Correction of Marine Imagery
Abstract: Underwater imagery often exhibits distorted coloration as a result of light-water interactions, which complicates the study of benthic environments in marine biology and geography. In this research, we propose an algorithm to restore the true color (albedo) in underwater imagery by jointly learning the effects of the medium and neural scene representations. Our approach [...]
RI Faculty Business Meeting
Meeting for RI Faculty. Discussions include various department topics, policies, and procedures. Generally meets weekly.
Carnegie Mellon University
Optimization of Small Unmanned Ground Vehicle Design using Reconfigurability, Mobility, and Complexity
Abstract: Unmanned ground vehicles are being deployed in increasingly diverse and complex environments. With modern developments in sensing and planning, the field of ground vehicle mobility presents rich possibilities for mechanical innovations that may be especially relevant for unmanned systems. In particular, reconfigurability may enable vehicles to traverse a wider set of terrains with greater [...]
Force-Torque Sensors – Calibration & Estimation
Abstract: Wrist force-torque sensors were among the first proprioception sensors to be developed when robotics emerged as a field. They are now a mature technology already used in structured industrial applications like sanding and drilling. While they provide essential feedback in many manipulation algorithms, they do not garner as much excitement as exteroception sensors like [...]
Optimized Tradeoffs for Differentially Private Majority Ensembling
Abstract: Inspired by the common subtask of ensembling or calibrating private models, we study the problem of computing an m*epsilon-differentially private majority of K epsilon-differentially private algorithms for m < K. We introduce a general framework to compute the private majority via Randomized Response (RRM) with a data-dependent noise function gamma that subsumes any non-trivial [...]