Customer-obsessed science
Research areas
-
November 16, 202611 min readNew open-source tool turns existing test suites into sets of formal-verification tasks, which catch buggy solutions that tests alone would miss.
-
November 11, 20265 min read
-
-
-
Featured news
-
Journal of Causal Inference2021The Principle of Insufficient Reason (PIR) assigns equal probabilities to each alternative of a random experiment whenever there is no reason to prefer one over the other. The Maximum Entropy Principle (MaxEnt) generalizes PIR to the case where statistical information like expectations are given. It is known that both principles result in paradoxical probability updates for joint distributions of cause
-
NeurIPS 2021 Workshop on CtrlGen2021Learning-based methods for training embodied agents typically require a large number of high-quality scenes that contain realistic layouts and support meaningful interactions. However, current simulators for Embodied AI (EAI) challenges only provide simulated indoor scenes with a limited number of layouts. This paper presents LUMINOUS, the first research framework that employs stateof-the-art indoor scene
-
PRX Quantum2021As quantum computers approach the fault tolerance threshold, diagnosing and characterizing the noise on large scale quantum devices is increasingly important. One of the most important classes of noise channels is the class of Pauli channels, for reasons of both theoretical tractability and experimental relevance. Here we present a practical algorithm for estimating the s nonzero Pauli error rates in an
-
PRX Quantum2021Efficiently estimating properties of large and strongly coupled quantum systems is a central focus in many-body physics and quantum information theory. While quantum computers promise speedups for many of these tasks, near-term devices are prone to noise that will generally reduce the accuracy of such estimates. Here, we propose a sample-efficient and noise-resilient protocol for learning properties of
-
ICML 20212021Motivated by modern applications, such as online advertisement and recommender systems, we study the top-k eXtreme contextual bandits problem, where the total number of arms can be enormous, and the learner is allowed to select k arms and observe all or some of the rewards for the chosen arms. We first propose an algorithm for the non-eXtreme realizable setting, utilizing the Inverse Gap Weighting strategy
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all