Aryeh Kontorovich

Orcid: 0000-0001-8038-8671

Affiliations:
  • Ben-Gurion University, Beersheba, Israel


According to our database1, Aryeh Kontorovich authored at least 89 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Distribution Estimation under the Infinity Norm.
CoRR, 2024

2023
Dimension-Free Empirical Entropy Estimation.
IEEE Trans. Inf. Theory, May, 2023

Tree Density Estimation.
IEEE Trans. Inf. Theory, February, 2023

Splitting the Difference on Adversarial Training.
CoRR, 2023

Efficient Agnostic Learning with Average Smoothness.
CoRR, 2023

Near-optimal learning with average Hölder smoothness.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Open problem: log(n) factor in "Local Glivenko-Cantelli.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Local Glivenko-Cantelli.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Domain Invariant Adversarial Learning.
Trans. Mach. Learn. Res., 2022

Learning Convex Polyhedra With Margin.
IEEE Trans. Inf. Theory, 2022

Improved Generalization Bounds for Adversarially Robust Learning.
J. Mach. Learn. Res., 2022

Non-uniform packings.
Inf. Process. Lett., 2022

Differentially-Private Bayes Consistency.
CoRR, 2022

Metric-valued regression.
CoRR, 2022

Adaptive Data Analysis with Correlated Observations.
Proceedings of the International Conference on Machine Learning, 2022

Learning with metric losses.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Fat-shattering dimension of k-fold maxima.
CoRR, 2021

Apportioned margin approach for cost sensitive large margin classifiers.
Ann. Math. Artif. Intell., 2021

Functions with average smoothness: structure, algorithms, and learning.
Proceedings of the Conference on Learning Theory, 2021

Stable Sample Compression Schemes: New Applications and an Optimal SVM Margin Bound.
Proceedings of the Algorithmic Learning Theory, 2021

Nested Barycentric Coordinate System as an Explicit Feature Map.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Non-parametric Binary regression in metric spaces with KL loss.
CoRR, 2020

On biased random walks, corrupted intervals, and learning under adversarial design.
Ann. Math. Artif. Intell., 2020

Learning discrete distributions with infinite support.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Universal Bayes Consistency in Metric Spaces.
Proceedings of the Information Theory and Applications Workshop, 2020

Algorithmic Learning Theory 2020: Preface.
Proceedings of the Algorithmic Learning Theory, 2020

Minimax Testing of Identity to a Reference Ergodic Markov Chain.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Fast and Bayes-consistent nearest neighbors.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Optimality of SVM: Novel proofs and tighter bounds.
Theor. Comput. Sci., 2019

Regression via Kirszbraun Extension with Applications to Imitation Learning.
CoRR, 2019

Estimating the Mixing Time of Ergodic Markov Chains.
Proceedings of the Conference on Learning Theory, 2019

Minimax Learning of Ergodic Markov Chains.
Proceedings of the Algorithmic Learning Theory, 2019

Sample Compression for Real-Valued Learners.
Proceedings of the Algorithmic Learning Theory, 2019

A Sharp Lower Bound for Agnostic Learning with Sample Compression Schemes.
Proceedings of the Algorithmic Learning Theory, 2019

Improved Generalization Bounds for Robust Learning.
Proceedings of the Algorithmic Learning Theory, 2019

Temporal Anomaly Detection: Calibrating the Surprise.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Near-Optimal Sample Compression for Nearest Neighbors.
IEEE Trans. Inf. Theory, 2018

Agnostic Sample Compression for Linear Regression.
CoRR, 2018

A New Lower Bound for Agnostic Learning with Sample Compression Schemes.
CoRR, 2018

Advanced Analytics for Connected Car Cybersecurity.
Proceedings of the 87th IEEE Vehicular Technology Conference, 2018

Learning convex polytopes with margin.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension.
IEEE Trans. Inf. Theory, 2017

Active Nearest-Neighbor Learning in Metric Spaces.
J. Mach. Learn. Res., 2017

Nearly optimal classification for semimetrics.
J. Mach. Learn. Res., 2017

The Expected Missing Mass under an Entropy Constraint.
Entropy, 2017

Advanced Analytics for Connected Cars Cyber Security.
CoRR, 2017

Mixing time estimation in reversible Markov chains from a single sample path.
CoRR, 2017

Boosting conditional probability estimators.
Ann. Math. Artif. Intell., 2017

Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
Adaptive metric dimensionality reduction.
Theor. Comput. Sci., 2016

The state complexity of random DFAs.
Theor. Comput. Sci., 2016

Concentration of measure without independence: a unified approach via the martingale method.
CoRR, 2016

Exact Lower Bounds for the Agnostic Probably-Approximately-Correct (PAC) Machine Learning Model.
CoRR, 2016

2015
A finite sample analysis of the Naive Bayes classifier.
J. Mach. Learn. Res., 2015

Local-shapelets for fast classification of spectrographic measurements.
Expert Syst. Appl., 2015

Nearly optimal classification for semimetrics.
CoRR, 2015

Mixing Time Estimation in Reversible Markov Chains from a Single Sample Path.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

A Bayes consistent 1-NN classifier.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014
On the Additive Properties of the Fat-Shattering Dimension.
IEEE Trans. Neural Networks Learn. Syst., 2014

Efficient Classification for Metric Data.
IEEE Trans. Inf. Theory, 2014

Minimum KL-Divergence on Complements of $L_{1}$ Balls.
IEEE Trans. Inf. Theory, 2014

Deciding unique decodability of bigram counts via finite automata.
J. Comput. Syst. Sci., 2014

Uniform Chernoff and Dvoretzky-Kiefer-Wolfowitz-Type Inequalities for Markov Chains and Related Processes.
J. Appl. Probab., 2014

Near-optimal sample compression for nearest neighbors.
CoRR, 2014

Consistency of weighted majority votes.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Maximum Margin Multiclass Nearest Neighbors.
Proceedings of the 31th International Conference on Machine Learning, 2014

Concentration in unbounded metric spaces and algorithmic stability.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Exploiting label dependencies for improved sample complexity.
Mach. Learn., 2013

On the learnability of shuffle ideals.
J. Mach. Learn. Res., 2013

Predictive PAC Learning and Process Decompositions.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Determining the unique decodability of a string in linear time.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Efficient determination of the unique decodability of a string.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On learning parametric-output HMMs.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Statistical estimation with bounded memory.
Stat. Comput., 2012

VC bounds on the cardinality of nearly orthogonal function classes.
Discret. Math., 2012

A Reverse Pinsker Inequality
CoRR, 2012

Efficiently decoding strings from their shingles
CoRR, 2012

String reconciliation with unknown edit distance.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On the Learnability of Shuffle Ideals.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term.
IEEE Trans. Signal Process., 2011

Unique decodability of bigram counts by finite automata
CoRR, 2011

Metric Anomaly Detection via Asymmetric Risk Minimization.
Proceedings of the Similarity-Based Pattern Recognition - First International Workshop, 2011

2010
Lower Bounds on Learning Random Structures with Statistical Queries.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
Universal Kernel-Based Learning with Applications to Regular Languages.
J. Mach. Learn. Res., 2009

2008
Kernel methods for learning languages.
Theor. Comput. Sci., 2008

2007
A Universal Kernel for Learning Regular Languages.
Proceedings of the Mining and Learning with Graphs, 2007

Learning Languages with Rational Kernels.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
Learning Linearly Separable Languages.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2004
Uniquely decodable n-gram embeddings.
Theor. Comput. Sci., 2004


  Loading...