Vitaly Feldman

Available identifiers

zbMath Open feldman.vitalyWikidataQ48503988 ScholiaQ48503988MaRDI QIDQ439988

List of research outcomes

Publication	Date of Publication	Type
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization	2021-09-14	Paper
Private stochastic convex optimization: optimal rates in linear time	2021-01-19	Paper
Interaction is necessary for distributed learning with privacy or communication constraints	2021-01-19	Paper
Does learning require memorization? a short tale about a long tail	2021-01-19	Paper
Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions	2020-01-29	Paper
Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity	2019-10-15	Paper
https://portal.mardi4nfdi.de/entity/Q4645666	2019-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4645673	2019-01-10	Paper
Sorting and Selection with Imprecise Comparisons	2018-10-30	Paper
On the Complexity of Random Satisfiability Problems with Planted Solutions	2018-07-17	Paper
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization	2018-07-16	Paper
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques	2018-05-17	Paper
https://portal.mardi4nfdi.de/entity/Q4638095	2018-05-03	Paper
Approximate resilience, monotonicity, and the complexity of agnostic learning	2017-10-05	Paper
The reusable holdout: Preserving validity in adaptive data analysis	2017-02-15	Paper
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas	2016-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q2788415	2016-02-19	Paper
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity	2015-11-25	Paper
On the Complexity of Random Satisfiability Problems with Planted Solutions	2015-08-21	Paper
Preserving Statistical Validity in Adaptive Data Analysis	2015-08-21	Paper
Statistical active learning algorithms for noise tolerance and differential privacy	2015-05-21	Paper
Hardness of approximate two-level logic minimization and PAC learning with membership queries	2014-11-25	Paper
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces	2014-09-12	Paper
Statistical algorithms and a lower bound for detecting planted cliques	2014-08-07	Paper
Agnostic Learning of Monomials by Halfspaces Is Hard	2014-07-25	Paper
A Complete Characterization of Statistical Query Learning with Applications to Evolvability	2014-07-25	Paper
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces	2014-05-13	Paper
Agnostic Learning of Monomials by Halfspaces Is Hard	2013-03-19	Paper
A complete characterization of statistical query learning with applications to evolvability	2012-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q2880876	2012-04-17	Paper
https://portal.mardi4nfdi.de/entity/Q3174124	2011-10-12	Paper
On Agnostic Learning of Parities, Monomials, and Halfspaces	2010-04-29	Paper
Experience-Induced Neural Circuits That Achieve High Capacity	2009-10-12	Paper
Sorting and Selection with Imprecise Comparisons	2009-07-14	Paper
Separating models of learning with faulty teachers	2009-05-12	Paper
Hardness of approximate two-level logic minimization and PAC learning with membership queries	2009-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q5302086	2009-01-05	Paper
Separating Models of Learning with Faulty Teachers	2008-08-19	Paper
The complexity of properly learning simple concept classes	2007-11-30	Paper
Learning Theory	2006-06-22	Paper
10.1162/153244302760200669	2002-11-27	Paper
https://portal.mardi4nfdi.de/entity/Q3148825	2002-09-22	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Vitaly Feldman