- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i19 |      | Vitaly Feldman, Pravesh Kothari, Jan Vondrák: Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees. CoRR abs/1304.0730 (2013) |
| i18 | | |
| 2012 | ||
| j14 | | Vitaly Feldman: A complete characterization of statistical query learning with applications to evolvability. J. Comput. Syst. Sci. 78(5): 1444-1459 (2012) |
| j13 | | Vitaly Feldman, Varun Kanade: Computational Bounds on Statistical Query Learning. Journal of Machine Learning Research - Proceedings Track 23: 16.1-16.22 (2012) |
| j12 | | Vitaly Feldman: Learning DNF Expressions from Fourier Spectrum. Journal of Machine Learning Research - Proceedings Track 23: 17.1-17.19 (2012) |
| j11 | | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu: Agnostic Learning of Monomials by Halfspaces Is Hard. SIAM J. Comput. 41(6): 1558-1590 (2012) |
| c17 | | Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio: Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. STOC 2012: 729-746 |
| i17 | | Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala: The Complexity of Statistical Algorithms. CoRR abs/1201.1214 (2012) |
| i16 | | |
| i15 | | Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio: Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. CoRR abs/1206.0985 (2012) |
| i14 | | Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao: Statistical Algorithms and a Lower Bound for Planted Clique. Electronic Colloquium on Computational Complexity (ECCC) 19: 64 (2012) |
| i13 | | Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio: Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 19: 72 (2012) |
| 2011 | ||
| j10 | | Vitaly Feldman: Distribution-Independent Evolvability of Linear Threshold Functions. Journal of Machine Learning Research - Proceedings Track 19: 253-272 (2011) |
| j9 | | Vitaly Feldman, Homin K. Lee, Rocco A. Servedio: Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. Journal of Machine Learning Research - Proceedings Track 19: 273-292 (2011) |
| i12 | | Vitaly Feldman: Distribution-Independent Evolvability of Linear Threshold Functions. CoRR abs/1103.4904 (2011) |
| 2010 | ||
| c16 | | |
| i11 | | Vitaly Feldman: A Complete Characterization of Statistical Query Learning with Applications to Evolvability. CoRR abs/1002.3183 (2010) |
| i10 | | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu: Agnostic Learning of Monomials by Halfspaces is Hard. CoRR abs/1012.0729 (2010) |
| i9 | | Vitaly Feldman: A Complete Characterization of Statistical Query Learning with Applications to Evolvability. Electronic Colloquium on Computational Complexity (ECCC) 17: 18 (2010) |
| i8 | | Vitaly Feldman, Homin K. Lee, Rocco A. Servedio: Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. Electronic Colloquium on Computational Complexity (ECCC) 17: 22 (2010) |
| i7 | | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu: Agnostic Learning of Monomials by Halfspaces is Hard. Electronic Colloquium on Computational Complexity (ECCC) 17: 185 (2010) |
| 2009 | ||
| j8 | | Vitaly Feldman: Hardness of approximate two-level logic minimization and PAC learning with membership queries. J. Comput. Syst. Sci. 75(1): 13-26 (2009) |
| j7 | | Vitaly Feldman: On The Power of Membership Queries in Agnostic Learning. Journal of Machine Learning Research 10: 163-182 (2009) |
| j6 | | Vitaly Feldman, Leslie G. Valiant: Experience-Induced Neural Circuits That Achieve High Capacity. Neural Computation 21(10): 2715-2754 (2009) |
| j5 | | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: On Agnostic Learning of Parities, Monomials, and Halfspaces. SIAM J. Comput. 39(2): 606-645 (2009) |
| j4 | | Vitaly Feldman, Shrenik Shah: Separating models of learning with faulty teachers. Theor. Comput. Sci. 410(19): 1903-1912 (2009) |
| c15 | | |
| c14 | | Vitaly Feldman: A Complete Characterization of Statistical Query Learning with Applications to Evolvability. FOCS 2009: 375-384 |
| c13 | | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu: Agnostic Learning of Monomials by Halfspaces Is Hard. FOCS 2009: 385-394 |
| c12 | | Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson: Sorting and Selection with Imprecise Comparisons. ICALP (1) 2009: 37-48 |
| i6 | | |
| 2008 | ||
| j3 | | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: The complexity of properly learning simple concept classes. J. Comput. Syst. Sci. 74(1): 16-34 (2008) |
| c11 | | |
| c10 | | |
| c9 | | |
| r2 | | |
| r1 | | |
| i5 | | Vitaly Feldman: On The Power of Membership Queries in Agnostic Learning. Electronic Colloquium on Computational Complexity (ECCC) 15(091) (2008) |
| 2007 | ||
| j2 | | Vitaly Feldman: Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions. Journal of Machine Learning Research 8: 1431-1460 (2007) |
| c8 | | Vitaly Feldman, Shrenik Shah, Neal Wadhwa: Separating Models of Learning with Faulty Teachers. ALT 2007: 94-106 |
| 2006 | ||
| c7 | | Vitaly Feldman: Optimal Hardness Results for Maximizing Agreements with Monomials. IEEE Conference on Computational Complexity 2006: 226-236 |
| c6 | | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. FOCS 2006: 563-574 |
| c5 | | Vitaly Feldman: Hardness of approximate two-level logic minimization and PAC learning with membership queries. STOC 2006: 363-372 |
| i4 | | Vitaly Feldman: Optimal Hardness Results for Maximizing Agreements with Monomials. Electronic Colloquium on Computational Complexity (ECCC) 13(032) (2006) |
| i3 | | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 13(059) (2006) |
| i2 | | Vitaly Feldman: On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. Electronic Colloquium on Computational Complexity (ECCC) 13(066) (2006) |
| 2005 | ||
| c4 | | Vitaly Feldman: On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. COLT 2005: 576-590 |
| i1 | | Vitaly Feldman: Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries. Electronic Colloquium on Computational Complexity (ECCC)(127) (2005) |
| 2004 | ||
| c3 | | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: Learnability and Automatizability. FOCS 2004: 621-630 |
| 2002 | ||
| j1 | | Nader H. Bshouty, Vitaly Feldman: On Using Extended Statistical Queries to Avoid Membership Queries. Journal of Machine Learning Research 2: 359-395 (2002) |
| 2001 | ||
| c2 | | Nader H. Bshouty, Vitaly Feldman: On Using Extended Statistical Queries to Avoid Membership Queries. COLT/EuroCOLT 2001: 529-545 |
| 2000 | ||
| c1 | | |
Colors in the list of coauthors
Last update Tue May 21 10:58:32 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page