Vitaly Feldman

From MaRDI portal
Person:439988

Available identifiers

zbMath Open feldman.vitalyDBLP67/1162WikidataQ48503988 ScholiaQ48503988MaRDI QIDQ439988

List of research outcomes





PublicationDate of PublicationType
Stronger privacy amplification by shuffling for Renyi and approximate differential privacy2024-05-14Paper
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization2021-09-14Paper
Does learning require memorization? a short tale about a long tail2021-01-19Paper
Private stochastic convex optimization: optimal rates in linear time2021-01-19Paper
Interaction is necessary for distributed learning with privacy or communication constraints2021-01-19Paper
Private Stochastic Convex Optimization: Optimal Rates in Linear Time2020-05-10Paper
Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions2020-01-29Paper
Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity2019-10-15Paper
https://portal.mardi4nfdi.de/entity/Q46456732019-01-10Paper
https://portal.mardi4nfdi.de/entity/Q46456662019-01-10Paper
Sorting and Selection with Imprecise Comparisons2018-10-30Paper
On the Complexity of Random Satisfiability Problems with Planted Solutions2018-07-17Paper
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization2018-07-16Paper
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques2018-05-17Paper
On the Power of Learning from k-Wise Queries2018-05-03Paper
Approximate resilience, monotonicity, and the complexity of agnostic learning2017-10-05Paper
The reusable holdout: Preserving validity in adaptive data analysis2017-02-15Paper
Optimal bounds on approximation of submodular and XOS functions by juntas2016-07-04Paper
Agnostic learning of disjunctions on symmetric distributions2016-02-19Paper
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity2015-11-25Paper
On the Complexity of Random Satisfiability Problems with Planted Solutions2015-08-21Paper
Preserving Statistical Validity in Adaptive Data Analysis2015-08-21Paper
Statistical active learning algorithms for noise tolerance and differential privacy2015-05-21Paper
Hardness of approximate two-level logic minimization and PAC learning with membership queries2014-11-25Paper
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces2014-09-12Paper
Statistical algorithms and a lower bound for detecting planted cliques2014-08-07Paper
Agnostic Learning of Monomials by Halfspaces Is Hard2014-07-25Paper
A Complete Characterization of Statistical Query Learning with Applications to Evolvability2014-07-25Paper
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's2014-07-10Paper
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces2014-05-13Paper
Agnostic Learning of Monomials by Halfspaces Is Hard2013-03-19Paper
A complete characterization of statistical query learning with applications to evolvability2012-08-17Paper
On the power of membership queries in agnostic learning2012-04-17Paper
https://portal.mardi4nfdi.de/entity/Q31741242011-10-12Paper
On agnostic learning of parities, monomials, and halfspaces2010-04-29Paper
Experience-Induced Neural Circuits That Achieve High Capacity2009-10-12Paper
Sorting and Selection with Imprecise Comparisons2009-07-14Paper
Separating models of learning with faulty teachers2009-05-12Paper
Hardness of approximate two-level logic minimization and PAC learning with membership queries2009-01-09Paper
https://portal.mardi4nfdi.de/entity/Q53020862009-01-05Paper
Separating Models of Learning with Faulty Teachers2008-08-19Paper
The complexity of properly learning simple concept classes2007-11-30Paper
Learning Theory2006-06-22Paper
10.1162/1532443027602006692002-11-27Paper
https://portal.mardi4nfdi.de/entity/Q31488252002-09-22Paper

Research outcomes over time

This page was built for person: Vitaly Feldman