◍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 2013Show all

4 papers · 1 filter

cs.DS2013★ 25 cited

Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas

Vitaly Feldman, Jan Vondrak

We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the…

cs.LG2013

Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy

Maria Florina Balcan, Vitaly Feldman

We describe a framework for designing efficient active learning algorithms that are tolerant to random classification noise and are differentially-private. The framework is based o…

cs.LG2013★ 22 cited

Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees

Vitaly Feldman, Pravesh Kothari, Jan Vondrak

We study the complexity of approximate representation and learning of submodular functions over the uniform distribution on the Boolean hypercube {0,1}n. Our main result is th…

cs.LG2013★ 5 cited

Learning Coverage Functions and Private Release of Marginals

Vitaly Feldman, Pravesh Kothari

We study the problem of approximating and learning coverage functions. A function c:2[n]→R+ is a coverage function, if there exists a universe U wit…

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