researcher

Ohad Shamir

103 papers hereh-index 6215.8k citations155 works total

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

author position

sole author17
first author3
middle author27
last author56

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

fields

cs.LG85
math.OC13
stat.ML2
cs.AI1
cs.CE1
cs.DS1

same name

Ohad Shamir — 11 papers, h 4
Ohad Shamir — 1 paper, 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

20092026

most citedOptimal Distributed Online Prediction using Mini-Batches

536 citations · 4.4k across the 97 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.OC2026

A Simple Complexity Lower Bound for Solving $A x = b$

Ohad Shamir

In this note, we provide a short and direct proof that approximately solving $A x = b$ to relative error $ε$ , where $A$ has condition number $κ$ and unrestricted dimension,…

cs.DS2026

Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory

Michael Menart, Aleksandar Nikolov, Ohad Shamir

We prove two lower bounds for the first order oracle complexity of minimizing a $d$ -dimensional $1$ -Lipschitz convex function over the unit ball with $m$ bits of memory. We first s…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

A Simple Complexity Lower Bound for Solving Ax=b

Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory

A Simple Complexity Lower Bound for Solving $A x = b$