Open problem: The statistical query complexity of learning sparse halfspaces
- Vitaly Feldman
- 2014
- JMLR
Publications
56 results at JMLR
Sample complexity bounds on differentially private learning via communication complexity
- Vitaly Feldman
- David Xiao
- 2014
- JMLR
Efficient and accurate methods for updating generalized linear models with multiple feature additions
- Amit Dhurandhar
- Marek Petrik
- 2014
- JMLR
Sparse/robust estimation and kalman smoothing with nonsmooth log-concave densities: Modeling, computation, and theory
- Aleksandr Y. Aravkin
- James V. Burke
- et al.
- 2013
- JMLR
Semi-supervised learning using greedy max-cut
- Jun Wang
- Tony Jebara
- et al.
- 2013
- JMLR
Random projections for support vector machines
- Saurabh Paul
- Christos Boutsidis
- et al.
- 2013
- JMLR
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
Central limit theorems for conditional Markov chains
- Mathieu Sinn
- Bei Chen
- 2013
- JMLR
A parallel, block greedy method for sparse inverse covariance estimation for ultra-high dimensions
- Prabhanjan Kambadur
- Aurélie Lozano
- 2013
- JMLR