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
-
ICML 20162016In this paper we focus on the anomaly detection problem for dynamic data streams through the lens of random cut forests. We investigate a robust random cut data structure that can be used as a sketch or synopsis of the input stream. We provide a plausible definition of non-parametric anomalies based on the influence of an unseen point on the remainder of the data, i.e., the externality imposed by that point
-
VLDB 20162016Machine Learning (ML) has become a mature technology that is being applied to a wide range of business problems such as web search, online advertising, product recommendations, object recognition, and so on. As a result, it has become imperative for researchers and practitioners to have a fundamental understanding of ML concepts and practical knowledge of end-to-end modeling. This tutorial takes a hands-on
-
WWW 20182016Inverse Propensity Score estimator (IPS) is a basic, unbiased, offpolicy evaluation technique to measure the impact of a user-interactive system without serving live traffic. We present our work on applying IPS to real-world settings by addressing some practical challenges, thereby enabling successful policy evaluation. In particular, we show that off-policy evaluation can be impossible in the absence of
-
NeurIPS 20162016We propose a technique that combines generative adversarial networks with probabilistic graphical models to explicitly model dependencies in structured distributions. Generative adversarial structured networks (GASNs) produce samples by passing random inputs through a neural network to construct the potentials of a graphical model; maximum a-posteriori inference in this graphical model then yields a sample
-
NeurIPS 20162016We introduce dropout compaction, a novel method for training feed-forward neural networks which realizes the performance gains of training a large model with dropout regularization, yet extracts a compact neural network for run-time efficiency. In the proposed method, we introduce a sparsity-inducing prior on the per unit dropout retention probability so that the optimizer can effectively prune hidden units
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all