Open problem: The statistical query complexity of learning sparse halfspaces
- Vitaly Feldman
- 2014
- JMLR
Publications
Date
Featured collections
Popular topics
47 results for Vitaly Feldman
Sample complexity bounds on differentially private learning via communication complexity
- Vitaly Feldman
- David Xiao
- 2014
- JMLR
Statistical active learning algorithms
- Maria Florina Balcan
- Vitaly Feldman
- 2013
- NeurIPS 2013
Optimal bounds on approximation of submodular and XOS functions by juntas
- Vitaly Feldman
- Jan Vondrak
- 2013
- FOCS 2013
Cognitive computing building block: A versatile and efficient digital neuron model for neurosynaptic cores
- Andrew S. Cassidy
- Paul Merolla
- et al.
- 2013
- IJCNN 2013
Provenance-based dictionary refinement in information extraction
- Sudeepa Roy
- Laura Chiticariu
- et al.
- 2013
- SIGMOD 2013
Statistical algorithms and a lower bound for detecting planted cliques
- Vitaly Feldman
- Elena Grigorescu
- et al.
- 2013
- STOC 2013
Representation, approximation and learning of submodular functions using low-rank decision trees
- Vitaly Feldman
- Pravesh Kothari
- et al.
- 2013
- JMLR
Learning using local membership queries
- Pranjal Awasthi
- Vitaly Feldman
- et al.
- 2013
- JMLR
Agnostic learning of monomials by halfspaces is hard
- Vitaly Feldman
- Venkatesan Guruswami
- et al.
- 2012
- SIAM Journal on Computing