◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Feldman

69 papers hereh-index 448k citations119 works total

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

author position
  • sole author8
  • first author28
  • middle author27
  • last author5

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

fields
  • cs.LG47
  • cs.CR10
  • cs.DS6
  • cs.CC4
  • cs.CL1
  • stat.ML1
same name
  • V. Feldman — 2 papers, h 2
  • V. Feldman — 2 papers, h 1
  • V. Feldman — 1 paper, h 0

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 citedPrivacy Amplification by Iteration

115 citations · 816 across the 62 of their papers we have counts for

collaborators
Showing 2014 · cs.LGShow all

4 papers · 2 filters

cs.LG2014★ 14 cited

Preserving Statistical Validity in Adaptive Data Analysis

Cynthia Dwork, Vitaly Feldman, Moritz Hardt +3

A great deal of effort has been devoted to reducing the risk of spurious scientific discoveries, from the use of sophisticated validation techniques, to deep statistical methods fo…

cs.LG2014★ 3 cited

Agnostic Learning of Disjunctions on Symmetric Distributions

Vitaly Feldman, Pravesh Kothari

We consider the problem of approximating and learning disjunctions (or equivalently, conjunctions) on symmetric distributions over {0,1}n. Symmetric distributions are distribu…

cs.LG2014

Approximate resilience, monotonicity, and the complexity of agnostic learning

Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan +2

A function f is d-resilient if all its Fourier coefficients of degree at most d are zero, i.e., f is uncorrelated with all low-degree parities. We study the notion of $\mat…

cs.LG2014★ 1 cited

Tight Bounds on ℓ1​ Approximation and Learning of Self-Bounding Functions

Vitaly Feldman, Pravesh Kothari, Jan Vondrák

We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube 0,1n. Informally, a function $f:{0,1}^n…

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