◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Michael I. Jordan

317 papers hereh-index 188270.4k citations900 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author4
  • middle author99
  • last author206

Across the 310 of 317 papers where every author was matched, so the position is known.

fields
  • cs.LG115
  • stat.ML60
  • math.OC34
  • math.ST33
  • stat.ME22
  • cs.AI11
same name
  • Michael I. Jordan — 46 papers, h 22
  • Michael I. Jordan — 17 papers, h 7
  • Michael I. Jordan — 10 papers, h 8
  • Michael I. Jordan — 9 papers, h 3
  • Michael I. Jordan — 9 papers, h 4
  • Michael I. Jordan — 8 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
19962026
most citedTrust Region Policy Optimization

3k citations · 24.2k across the 299 of their papers we have counts for

collaborators
Showing 2018 · stat.MEShow all

4 papers · 2 filters

stat.ME2018★ 16 cited

Asynchronous Online Testing of Multiple Hypotheses

Tijana Zrnic, Aaditya Ramdas, Michael I. Jordan

We consider the problem of asynchronous online testing, aimed at providing control of the false discovery rate (FDR) during a continual stream of data collection and testing, where…

stat.ME2018

Evaluating Sensitivity to the Stick-Breaking Prior in Bayesian Nonparametrics

Ryan Giordano, Runjing Liu, Michael I. Jordan +1

Bayesian models based on the Dirichlet process and other stick-breaking priors have been proposed as core ingredients for clustering, topic modeling, and other unsupervised learnin…

stat.ME2018★ 25 cited

A Swiss Army Infinitesimal Jackknife

Ryan Giordano, Will Stephenson, Runjing Liu +2

The error or variability of machine learning algorithms is often assessed by repeatedly re-fitting a model with different weighted versions of the observed data. The ubiquitous too…

stat.ME2018★ 34 cited

SAFFRON: an adaptive algorithm for online control of the false discovery rate

Aaditya Ramdas, Tijana Zrnic, Martin Wainwright +1

In the online false discovery rate (FDR) problem, one observes a possibly infinite sequence of p-values P1​,P2​,…, each testing a different null hypothesis, and an algorith…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.