Search Results for author: Maxim Rabinovich

Found 6 papers, 1 papers with code

Fine-Grained Entity Typing with High-Multiplicity Assignments

no code implementations ACL 2017 Maxim Rabinovich, Dan Klein

As entity type systems become richer and more fine-grained, we expect the number of types assigned to a given entity to increase.

Entity Typing Vocal Bursts Intensity Prediction +1

Abstract Syntax Networks for Code Generation and Semantic Parsing

1 code implementation ACL 2017 Maxim Rabinovich, Mitchell Stern, Dan Klein

Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs.

Code Generation Semantic Parsing

Function-Specific Mixing Times and Concentration Away from Equilibrium

no code implementations6 May 2016 Maxim Rabinovich, Aaditya Ramdas, Michael. I. Jordan, Martin J. Wainwright

These results show that it is possible for empirical expectations of functions to concentrate long before the underlying chain has mixed in the classical sense, and we show that the concentration rates we achieve are optimal up to constants.

On the accuracy of self-normalized log-linear models

no code implementations NeurIPS 2015 Jacob Andreas, Maxim Rabinovich, Dan Klein, Michael. I. Jordan

Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces.

Generalization Bounds

Variational consensus Monte Carlo

no code implementations NeurIPS 2015 Maxim Rabinovich, Elaine Angelino, Michael. I. Jordan

Practitioners of Bayesian statistics have long depended on Markov chain Monte Carlo (MCMC) to obtain samples from intractable posterior distributions.

Online Inference for Relation Extraction with a Reduced Feature Set

no code implementations18 Apr 2015 Maxim Rabinovich, Cédric Archambeau

Access to web-scale corpora is gradually bringing robust automatic knowledge base creation and extension within reach.

Relation Relation Extraction +1

Cannot find the paper you are looking for? You can Submit a new open access paper.