◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Misha Ivkov

2 papers hereh-index 327 citations4 works total

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

author position
  • first author2

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

fields
  • cs.DS2
same name
  • Misha Ivkov — 1 paper

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

collaborators

2 papers

cs.DS2026

Easy, robust approximate message passing for planted spike models

Misha Ivkov, Tselil Schramm

We present a simple and efficient algorithm for robust approximate message passing (AMP) in the spiked matrix setting. In particular, let ε be a sufficiently small cons…

cs.DS2024

Fast, robust approximate message passing

Misha Ivkov, Tselil Schramm

We give a fast, spectral procedure for implementing approximate-message passing (AMP) algorithms robustly. For any quadratic optimization problem over symmetric matrices X with i…

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