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
-
MSOM 20212021We study a joint assortment and inventory optimization problem faced by an online retailer who needs to decide on both the assortment along with the inventories of a set of N substitutable products before the start of the selling season to maximize the expected profit. The problem raises both algorithmic and modeling challenges. One of the main challenges is to tractably model dynamic stock-out based substitution
-
CSCML 20212021The KEM BIKE is a Round-3 alternative finalist in the NIST Post-Quantum Cryptography project. It uses the FO6⊥ transformation so that an instantiation with a decoder that has a DFR of 2−128 will make it IND-CCA secure. The current BIKE design does not bind the randomness of the ciphertexts (i.e., the error vectors) to a specific public key. We propose to change this design, although currently, there is
-
FLAIRS 20212021Accurately learning from user data while ensuring quantifiable privacy guarantees provides an opportunity to build better Machine Learning (ML) models while maintaining user trust. Recent literature has demonstrated the applicability of a generalized form of Differential Privacy to provide guarantees over text queries. Such mechanisms add privacy preserving noise to vectorial representations of text in
-
NAACL 20212021Traditional goal-oriented dialogue systems rely on various components such as natural language understanding, dialogue state tracking, policy learning and response generation. Training each component requires annotations which are hard to obtain for every new domain, limiting scalability of such systems. Similarly, rule-based dialogue systems require extensive writing and maintenance of rules and do not
-
ICLR 20212021We tackle the adversarial best arm identification problem, in its extension where different arms are associated with different costs. This extension is a natural abstraction of the cost-aware multi-fidelity hyperparameter optimization (CAMF-HPO) problem, where the costs, e.g. monetary or wall-clock time, of evaluations with different hyperparameter configurations are not uniform. We provide an algorithm
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all