The following pages link to Leonid (Aryeh) Kontorovich (Q950198):
Displayed 50 items.
- (Q249077) (redirect page) (← links)
- The state complexity of random DFAs (Q338393) (← links)
- Exploiting label dependencies for improved sample complexity (Q374170) (← links)
- An explicit bound on the transportation cost distance (Q380692) (← links)
- Deciding unique decodability of bigram counts via finite automata (Q386046) (← links)
- VC bounds on the cardinality of nearly orthogonal function classes (Q418881) (← links)
- The missing mass problem (Q426696) (← links)
- Boosting conditional probability estimators (Q513339) (← links)
- (Q693351) (redirect page) (← links)
- Statistical estimation with bounded memory (Q693352) (← links)
- (Q706632) (redirect page) (← links)
- Uniquely decodable \(n\)-gram embeddings (Q706633) (← links)
- On the concentration of the missing mass (Q742962) (← links)
- Apportioned margin approach for cost sensitive large margin classifiers (Q825011) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- Constructing processes with prescribed mixing coefficients (Q956363) (← links)
- A sharp estimate of the binomial mean absolute deviation with applications (Q1950779) (← links)
- Universal Bayes consistency in metric spaces (Q2054482) (← links)
- Non-uniform packings (Q2059874) (← links)
- On biased random walks, corrupted intervals, and learning under adversarial design (Q2202524) (← links)
- Statistical estimation of ergodic Markov chain kernel over discrete state space (Q2214258) (← links)
- Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model (Q2328061) (← links)
- Mixing time estimation in reversible Markov chains from a single sample path (Q2330466) (← links)
- Optimality of SVM: novel proofs and tighter bounds (Q2333789) (← links)
- Concentration of measure without independence: a unified approach via the martingale method (Q2406342) (← links)
- Concentration inequalities for dependent random variables via the martingale method (Q2519678) (← links)
- Adaptive Metric Dimensionality Reduction (Q2859224) (← links)
- AN INEQUALITY INVOLVING THE ℓ<sub>1</sub>, ℓ<sub>2</sub>, AND ℓ<sub>∞</sub> NORMS (Q2867062) (← links)
- Obtaining Measure Concentration from Markov Contraction (Q2869216) (← links)
- (Q2880920) (← links)
- (Q2933851) (← links)
- Efficient Classification for Metric Data (Q2986185) (← links)
- Minimum KL-Divergence on Complements of <inline-formula> <tex-math notation="TeX">$L_{1}$ </tex-math></inline-formula> Balls (Q2986314) (← links)
- On the Learnability of Shuffle Ideals (Q3164814) (← links)
- Learning Linearly Separable Languages (Q3522993) (← links)
- Active Nearest-Neighbor Learning in Metric Spaces (Q4558521) (← links)
- Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term (Q4572874) (← links)
- Lower Bounds on Learning Random Structures with Statistical Queries (Q4930699) (← links)
- Learning Convex Polyhedra With Margin (Q5080039) (← links)
- Uniform Chernoff and Dvoretzky-Kiefer-Wolfowitz-type inequalities for Markov chains and related processes (Q5176523) (← links)
- (Q5361299) (← links)
- Efficient Regression in Metric Spaces via Approximate Lipschitz Extension (Q5369840) (← links)
- Near-Optimal Sample Compression for Nearest Neighbors (Q5375566) (← links)
- Learning Languages with Rational Kernels (Q5434061) (← links)
- (Q5744810) (← links)
- Adaptive metric dimensionality reduction (Q5964069) (← links)
- Improved estimation of relaxation time in nonreversible Markov chains (Q6126104) (← links)
- Tree Density Estimation (Q6193587) (← links)
- Dimension-Free Empirical Entropy Estimation (Q6197490) (← links)
- Virus Dynamics on Starlike Graphs (Q6228762) (← links)