◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Viderman

3 papers hereh-index 10271 citations21 works total

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

author position
  • sole author2
  • middle author1

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

fields
  • cs.CC1
  • cs.IT1
  • cs.LG1

identity via Semantic Scholar / OpenAlex

activity
20112018
most citedLP decoding of expander codes: a simpler proof

2 citations · 3 across the 2 of their papers we have counts for

collaborators

3 papers

cs.LG2018★ 1 cited

Interpreting Complex Regression Models

Noa Avigdor-Elgrabli, Alex Libov, Michael Viderman +1

Interpretation of a machine learning induced models is critical for feature engineering, debugging, and, arguably, compliance. Yet, best of breed machine learning models tend to be…

cs.IT2012★ 2 cited

LP decoding of expander codes: a simpler proof

Michael Viderman

A code $C \subseteq \F_2^n$ is a (c,ε,δ)-expander code if it has a Tanner graph, where every variable node has degree c, and every subset of variable nodes L0​ such that $|L_…

cs.CC2011

A Combination of Testability and Decodability by Tensor Products

Michael Viderman

Ben-Sasson and Sudan (RSA 2006) showed that repeated tensor products of linear codes with a very large distance are locally testable. Due to the requirement of a very large distanc…

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