Nikita Zhivotovskiy

According to our database1, Nikita Zhivotovskiy authored at least 25 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Majority-of-Three: The Simplest Optimal Learner?
CoRR, 2024

2023
High-Probability Risk Bounds via Sequential Predictors.
CoRR, 2023

Statistically Optimal Robust Mean and Covariance Estimation for Anisotropic Gaussians.
CoRR, 2023

Optimal PAC Bounds without Uniform Convergence.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Exploring Local Norms in Exp-concave Statistical Learning.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Local Risk Bounds for Statistical Aggregation.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

The One-Inclusion Graph Algorithm is not Always Optimal.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Exponential Savings in Agnostic Active Learning Through Abstention.
IEEE Trans. Inf. Theory, 2022

Robustifying Markowitz.
CoRR, 2022

A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture.
CoRR, 2022

Covariance Estimation: Optimal Dimension-free Guarantees for Adversarial Corruption and Heavy Tails.
CoRR, 2022

A Regret-Variance Trade-Off in Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Distribution-Free Robust Linear Regression.
CoRR, 2021

Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
When are epsilon-nets small?
J. Comput. Syst. Sci., 2020

On Mean Estimation for Heteroscedastic Random Variables.
CoRR, 2020

Suboptimality of Constrained Least Squares and Improvements via Non-Linear Predictors.
CoRR, 2020

Robust k-means Clustering for Distributions with Two Moments.
CoRR, 2020

Fast Rates for Online Prediction with Abstention.
Proceedings of the Conference on Learning Theory, 2020

Sharper Bounds for Uniformly Stable Algorithms.
Proceedings of the Conference on Learning Theory, 2020

Proper Learning, Helly Number, and an Optimal SVM Bound.
Proceedings of the Conference on Learning Theory, 2020

2019
Fast classification rates without standard margin assumptions.
CoRR, 2019

2018
Localization of VC classes: Beyond local Rademacher complexities.
Theor. Comput. Sci., 2018

2017
Optimal learning via local entropies and sample compression.
Proceedings of the 30th Conference on Learning Theory, 2017

2015
Permutational Rademacher Complexity - A New Complexity Measure for Transductive Learning.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015


  Loading...