
Dimensionfree Bounds for Sums of Independent Matrices and Simple Tensors via the Variational Principle
We consider the deviation inequalities for the sums of independent d by ...
read it

Stability and Deviation Optimal Risk Bounds with Convergence Rate O(1/n)
The sharpest known high probability generalization bounds for uniformly ...
read it

DistributionFree Robust Linear Regression
We study random design linear regression with no assumptions on the dist...
read it

Exponential Savings in Agnostic Active Learning through Abstention
We show that in poolbased active classification without assumptions on ...
read it

On Mean Estimation for Heteroscedastic Random Variables
We study the problem of estimating the common mean μ of n independent sy...
read it

Suboptimality of Constrained Least Squares and Improvements via NonLinear Predictors
We study the problem of predicting as well as the best linear predictor ...
read it

Proper Learning, Helly Number, and an Optimal SVM Bound
The classical PAC sample complexity bounds are stated for any Empirical ...
read it

Robust kmeans Clustering for Distributions with Two Moments
We consider the robust algorithms for the kmeans clustering problem whe...
read it

Fast Rates for Online Prediction with Abstention
In the setting of sequential prediction of individual {0, 1}sequences w...
read it

Fast classification rates without standard margin assumptions
We consider the classical problem of learning rates for classes with fin...
read it

Sharper bounds for uniformly stable algorithms
The generalization bounds for stable algorithms is a classical question ...
read it

Uniform HansonWright type concentration inequalities for unbounded entries via the entropy method
This paper is devoted to uniform versions of the HansonWright inequalit...
read it

Robust covariance estimation under L_4L_2 norm equivalence
Let X be a centered random vector taking values in R^d and let Σ= E(X⊗ X...
read it

When are epsilonnets small?
In many interesting situations the size of epsilonnets depends only on ...
read it

Permutational Rademacher Complexity: a New Complexity Measure for Transductive Learning
Transductive learning considers situations when a learner observes m lab...
read it
Nikita Zhivotovskiy
is this you? claim profile