37 citations · 64 across the 6 of their papers we have counts for
8 papers
Lower bounds in multiple testing: A framework based on derandomized proxies
Max Rabinovich, Michael I. Jordan, Martin J. Wainwright
The large bulk of work in multiple testing has focused on specifying procedures that control the false discovery rate (FDR), with relatively less attention being paid to the corres…
Optimal Rates and Tradeoffs in Multiple Testing
Maxim Rabinovich, Aaditya Ramdas, Michael I. Jordan +1
Multiple hypothesis testing is a central topic in statistics, but despite abundant work on the false discovery rate (FDR) and the corresponding Type-II error concept known as the f…
Fine-Grained Entity Typing with High-Multiplicity Assignments
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. However, most fine-grained typing work has focused…
Abstract Syntax Networks for Code Generation and Semantic Parsing
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. We introduce abstract syntax netwo…
Function-Specific Mixing Times and Concentration Away from Equilibrium
Maxim Rabinovich, Aaditya Ramdas, Michael I. Jordan +1
Slow mixing is the central hurdle when working with Markov chains, especially those used for Monte Carlo approximations (MCMC). In many applications, it is only of interest to esti…
On the accuracy of self-normalized log-linear models
Jacob Andreas, Maxim Rabinovich, Dan Klein +1
Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces. The problem of fast normalizer computation has th…
Variational consensus Monte Carlo
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. Unfortunately, MCMC algorithm…
Online Inference for Relation Extraction with a Reduced Feature Set
Maxim Rabinovich, Cédric Archambeau
Access to web-scale corpora is gradually bringing robust automatic knowledge base creation and extension within reach. To exploit these large unannotated---and extremely difficult…