◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jason M. Altschuler

38 papers hereh-index 181.7k citations52 works total

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

author position
  • sole author1
  • first author29
  • middle author2
  • last author6

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

fields
  • math.OC19
  • cs.DS5
  • cs.LG4
  • math.ST4
  • math.PR3
  • stat.ML2

identity via Semantic Scholar / OpenAlex

activity
20152026
most citedNear-linear time approximation algorithms for optimal transport via Sinkhorn iteration

290 citations · 492 across the 36 of their papers we have counts for

collaborators
Showing stat.MLShow all

2 papers · 1 filter

stat.ML2022

Concentration of the Langevin Algorithm's Stationary Distribution

Jason M. Altschuler, Kunal Talwar

A canonical algorithm for log-concave sampling is the Langevin Algorithm, aka the Langevin Diffusion run with some discretization stepsize η>0. This discretization leads the Lan…

stat.ML2018★ 16 cited

Massively scalable Sinkhorn distances via the Nyström method

Jason Altschuler, Francis Bach, Alessandro Rudi +1

The Sinkhorn "distance", a variant of the Wasserstein distance with entropic regularization, is an increasingly popular tool in machine learning and statistical inference. However,…

◍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.