Aryeh Kontorovich

View Scopus Profile

Aryeh Kontorovich

 https://orcid.org/0000-0001-8038-8671
20042025

Research activity per year

Search results

  • 2012

    VC bounds on the cardinality of nearly orthogonal function classes

    Gottlieb, L. A., Kontorovich, A. & Mossel, E., 28 May 2012, In: Discrete Mathematics. 312, 10, p. 1766-1775 10 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    5 Scopus citations
  • 2011

    Metric anomaly detection via asymmetric risk minimization

    Kontorovich, A., Hendler, D. & Menahem, E., 5 Oct 2011, Similarity-Based Pattern Recognition - First International Workshop, SIMBAD 2011, Proceedings. p. 17-30 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7005 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    6 Scopus citations

  • Model selection for sinusoids in noise: Statistical analysis and a new penalty term

    Nadler, B. & Kontorovich, A., 1 Apr 2011, In: IEEE Transactions on Signal Processing. 59, 4, p. 1333-1345 13 p., 5685580.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    42 Scopus citations
  • 2010

    Efficient classification for metric data

    Gottlieb, L. A., Kontorovich, A. & Krauthgamer, R., 1 Dec 2010, COLT 2010 - The 23rd Conference on Learning Theory. p. 433-440 8 p. (COLT 2010 - The 23rd Conference on Learning Theory).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    19 Scopus citations

  • Lower bounds on learning random structures with statistical queries

    Angluin, D., Eisenstat, D., Kontorovich, L. & Reyzin, L., 19 Nov 2010, Algorithmic Learning Theory - 21st International Conference, ALT 2010, Proceedings. p. 194-208 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6331 LNAI).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations
  • 2009

    Universal kernel-based learning with applications to regular languages

    Kontorovich, L. & Nadler, B., 1 Jan 2009, In: Journal of Machine Learning Research. 10, p. 1095-1129 35 p.

    Research output: Contribution to journal › Article › peer-review

    6 Scopus citations
  • 2008

    Concentration inequalities for dependent random variables via the martingale method

    Kontorovich, L. & Ramanan, K., 1 Nov 2008, In: Annals of Probability. 36, 6, p. 2126-2158 33 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    103 Scopus citations

  • Constructing processes with prescribed mixing coefficients

    Kontorovich, L., 1 Dec 2008, In: Statistics and Probability Letters. 78, 17, p. 2910-2915 6 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    1 Scopus citations

  • Kernel methods for learning languages

    Kontorovich, L., Cortes, C. & Mohri, M., 17 Oct 2008, In: Theoretical Computer Science. 405, 3, p. 223-236 14 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    23 Scopus citations
  • 2007

    Learning languages with rational kernels

    Cortes, C., Kontorovich, L. & Mohri, M., 1 Jan 2007, Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings. Springer Verlag, p. 349-364 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4539 LNAI).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    9 Scopus citations
  • 2006

    Learning linearly separable languages

    Kontorovich, L., Cortes, C. & Mohri, M., 1 Jan 2006, Algorithmic Learning Theory - 17th International Conference, ALT 2006, Proceedings. Springer Verlag, p. 288-303 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4264 LNAI).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    6 Scopus citations
  • 2004

    Uniquely decodable n-gram embeddings

    Kontorovich, L., 13 Dec 2004, In: Theoretical Computer Science. 329, 1-3, p. 271-284 14 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    10 Scopus citations