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
-
EMNLP 2019 Workshop on Noisy User-Generated Text2019Robustness to capitalization errors is a highly desirable characteristic of named entity recognizers, yet we find standard models for the task are surprisingly brittle to such noise. Existing methods to improve robustness to the noise completely discard given orthographic information, which significantly degrades their performance on well-formed text. We propose a simple alternative approach based on data
-
ICLR 2019 Second Workshop on Learning from Limited Labeled Data2019In this paper, we propose a weak supervision framework for neural ranking tasks based on the data programming paradigm (Ratner et al., 2016), which enables us to leverage multiple weak supervision signals from different sources. Empirically, we consider two sources of weak supervision signals, unsupervised ranking functions and semantic feature similarities. We train a BERT-based passageranking model (which
-
ICDAR 2019 Workshop on Machine Learning2019Offline handwriting recognition with deep neural networks is usually limited to words or lines due to large computational costs. In this paper, a less computationally expensive full page offline handwritten text recognition framework is introduced. This framework includes a pipeline that locates handwritten text with an object detection neural network and recognises the text within the detected regions
-
ACL 20192019Relation Extraction is the task of identifying entity mention spans in raw text and then identifying relations between pairs of the entity mentions. Recent approaches for this spanlevel task have been token-level models which have inherent limitations. They cannot easily define and implement span-level features, cannot model overlapping entity mentions and have cascading errors due to the use of sequential
-
UAI 20192019On-policy reinforcement learning (RL) algorithms have high sample complexity while offpolicy algorithms are difficult to tune. Merging the two holds the promise to develop efficient algorithms that generalize across diverse environments. It is however challenging in practice to find suitable hyper-parameters that govern this trade off. This paper develops a simple algorithm named P3O that interleaves offpolicy
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all