iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/163/1814.rss
dblp: Nikita Zhivotovskiy https://dblp.org/pid/163/1814.html dblp person page RSS feed Wed, 11 Dec 2024 20:39:40 +0100 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Nikita Zhivotovskiyhttps://dblp.org/pid/163/1814.html14451 Majority-of-Three: The Simplest Optimal Learner?https://proceedings.mlr.press/v247/aden-ali24a.html, , , :
Majority-of-Three: The Simplest Optimal Learner? COLT : 22-45]]>
https://dblp.org/rec/conf/colt/Aden-AliHLZ24Mon, 01 Jan 2024 00:00:00 +0100
Revisiting Agnostic PAC Learning.https://doi.org/10.1109/FOCS61266.2024.00118, , :
Revisiting Agnostic PAC Learning. FOCS : 1968-1982]]>
https://dblp.org/rec/conf/focs/HannekeLZ24Mon, 01 Jan 2024 00:00:00 +0100
Majority-of-Three: The Simplest Optimal Learner?https://doi.org/10.48550/arXiv.2403.08831, , , :
Majority-of-Three: The Simplest Optimal Learner? CoRR abs/2403.08831 ()]]>
https://dblp.org/rec/journals/corr/abs-2403-08831Mon, 01 Jan 2024 00:00:00 +0100
Revisiting Agnostic PAC Learning.https://doi.org/10.48550/arXiv.2407.19777, , :
Revisiting Agnostic PAC Learning. CoRR abs/2407.19777 ()]]>
https://dblp.org/rec/journals/corr/abs-2407-19777Mon, 01 Jan 2024 00:00:00 +0100
Refined Risk Bounds for Unbounded Losses via Transductive Priors.https://doi.org/10.48550/arXiv.2410.21621, , :
Refined Risk Bounds for Unbounded Losses via Transductive Priors. CoRR abs/2410.21621 ()]]>
https://dblp.org/rec/journals/corr/abs-2410-21621Mon, 01 Jan 2024 00:00:00 +0100
Dimension-free Private Mean Estimation for Anisotropic Distributions.https://doi.org/10.48550/arXiv.2411.00775, , , , :
Dimension-free Private Mean Estimation for Anisotropic Distributions. CoRR abs/2411.00775 ()]]>
https://dblp.org/rec/journals/corr/abs-2411-00775Mon, 01 Jan 2024 00:00:00 +0100
The One-Inclusion Graph Algorithm is not Always Optimal.https://proceedings.mlr.press/v195/aden-ali23a.html, , , :
The One-Inclusion Graph Algorithm is not Always Optimal. COLT : 72-88]]>
https://dblp.org/rec/conf/colt/Aden-AliCSZ23Sun, 01 Jan 2023 00:00:00 +0100
Exploring Local Norms in Exp-concave Statistical Learning.https://proceedings.mlr.press/v195/puchkin23a.html, :
Exploring Local Norms in Exp-concave Statistical Learning. COLT : 1993-2013]]>
https://dblp.org/rec/conf/colt/PuchkinZ23Sun, 01 Jan 2023 00:00:00 +0100
Local Risk Bounds for Statistical Aggregation.https://proceedings.mlr.press/v195/mourtada23a.html, , :
Local Risk Bounds for Statistical Aggregation. COLT : 5697-5698]]>
https://dblp.org/rec/conf/colt/MourtadaVZ23Sun, 01 Jan 2023 00:00:00 +0100
Optimal PAC Bounds without Uniform Convergence.https://doi.org/10.1109/FOCS57990.2023.00071, , , :
Optimal PAC Bounds without Uniform Convergence. FOCS : 1203-1223]]>
https://dblp.org/rec/conf/focs/Aden-AliCSZ23Sun, 01 Jan 2023 00:00:00 +0100
Statistically Optimal Robust Mean and Covariance Estimation for Anisotropic Gaussians.https://doi.org/10.48550/arXiv.2301.09024, :
Statistically Optimal Robust Mean and Covariance Estimation for Anisotropic Gaussians. CoRR abs/2301.09024 ()]]>
https://dblp.org/rec/journals/corr/abs-2301-09024Sun, 01 Jan 2023 00:00:00 +0100
Exploring Local Norms in Exp-concave Statistical Learning.https://doi.org/10.48550/arXiv.2302.10726, :
Exploring Local Norms in Exp-concave Statistical Learning. CoRR abs/2302.10726 ()]]>
https://dblp.org/rec/journals/corr/abs-2302-10726Sun, 01 Jan 2023 00:00:00 +0100
Optimal PAC Bounds Without Uniform Convergence.https://doi.org/10.48550/arXiv.2304.09167, , , :
Optimal PAC Bounds Without Uniform Convergence. CoRR abs/2304.09167 ()]]>
https://dblp.org/rec/journals/corr/abs-2304-09167Sun, 01 Jan 2023 00:00:00 +0100
Local Risk Bounds for Statistical Aggregation.https://doi.org/10.48550/arXiv.2306.17151, , :
Local Risk Bounds for Statistical Aggregation. CoRR abs/2306.17151 ()]]>
https://dblp.org/rec/journals/corr/abs-2306-17151Sun, 01 Jan 2023 00:00:00 +0100
High-Probability Risk Bounds via Sequential Predictors.https://doi.org/10.48550/arXiv.2308.07588, , :
High-Probability Risk Bounds via Sequential Predictors. CoRR abs/2308.07588 ()]]>
https://dblp.org/rec/journals/corr/abs-2308-07588Sun, 01 Jan 2023 00:00:00 +0100
Exponential Savings in Agnostic Active Learning Through Abstention.https://doi.org/10.1109/TIT.2022.3156592, :
Exponential Savings in Agnostic Active Learning Through Abstention. IEEE Trans. Inf. Theory 68(7): 4651-4665 ()]]>
https://dblp.org/rec/journals/tit/PuchkinZ22Sat, 01 Jan 2022 00:00:00 +0100
A Regret-Variance Trade-Off in Online Learning.http://papers.nips.cc/paper_files/paper/2022/hash/e473f29459a4a006d4e968537b135e40-Abstract-Conference.html, , :
A Regret-Variance Trade-Off in Online Learning. NeurIPS ]]>
https://dblp.org/rec/conf/nips/HoevenZC22Sat, 01 Jan 2022 00:00:00 +0100
Covariance Estimation: Optimal Dimension-free Guarantees for Adversarial Corruption and Heavy Tails.https://doi.org/10.48550/arXiv.2205.08494, :
Covariance Estimation: Optimal Dimension-free Guarantees for Adversarial Corruption and Heavy Tails. CoRR abs/2205.08494 ()]]>
https://dblp.org/rec/journals/corr/abs-2205-08494Sat, 01 Jan 2022 00:00:00 +0100
A Regret-Variance Trade-Off in Online Learning.https://doi.org/10.48550/arXiv.2206.02656, , :
A Regret-Variance Trade-Off in Online Learning. CoRR abs/2206.02656 ()]]>
https://dblp.org/rec/journals/corr/abs-2206-02656Sat, 01 Jan 2022 00:00:00 +0100
A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture.https://doi.org/10.48550/arXiv.2206.08734, , :
A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture. CoRR abs/2206.08734 ()]]>
https://dblp.org/rec/journals/corr/abs-2206-08734Sat, 01 Jan 2022 00:00:00 +0100
The One-Inclusion Graph Algorithm is not Always Optimal.https://doi.org/10.48550/arXiv.2212.09270, , , :
The One-Inclusion Graph Algorithm is not Always Optimal. CoRR abs/2212.09270 ()]]>
https://dblp.org/rec/journals/corr/abs-2212-09270Sat, 01 Jan 2022 00:00:00 +0100
Robustifying Markowitz.https://doi.org/10.48550/arXiv.2212.13996, , , :
Robustifying Markowitz. CoRR abs/2212.13996 ()]]>
https://dblp.org/rec/journals/corr/abs-2212-13996Sat, 01 Jan 2022 00:00:00 +0100
Exponential savings in agnostic active learning through abstention.http://proceedings.mlr.press/v134/puchkin21a.html, :
Exponential savings in agnostic active learning through abstention. COLT : 3806-3832]]>
https://dblp.org/rec/conf/colt/PuchkinZ21Fri, 01 Jan 2021 00:00:00 +0100
Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$.https://proceedings.neurips.cc/paper/2021/hash/286674e3082feb7e5afb92777e48821f-Abstract.html, :
Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$. NeurIPS : 5065-5076]]>
https://dblp.org/rec/conf/nips/KlochkovZ21Fri, 01 Jan 2021 00:00:00 +0100
Exponential Savings in Agnostic Active Learning through Abstention.https://arxiv.org/abs/2102.00451, :
Exponential Savings in Agnostic Active Learning through Abstention. CoRR abs/2102.00451 ()]]>
https://dblp.org/rec/journals/corr/abs-2102-00451Fri, 01 Jan 2021 00:00:00 +0100
Distribution-Free Robust Linear Regression.https://arxiv.org/abs/2102.12919, , :
Distribution-Free Robust Linear Regression. CoRR abs/2102.12919 ()]]>
https://dblp.org/rec/journals/corr/abs-2102-12919Fri, 01 Jan 2021 00:00:00 +0100
Stability and Deviation Optimal Risk Bounds with Convergence Rate O(1/n).https://arxiv.org/abs/2103.12024, :
Stability and Deviation Optimal Risk Bounds with Convergence Rate O(1/n). CoRR abs/2103.12024 ()]]>
https://dblp.org/rec/journals/corr/abs-2103-12024Fri, 01 Jan 2021 00:00:00 +0100
When are epsilon-nets small?https://doi.org/10.1016/j.jcss.2019.12.006, :
When are epsilon-nets small? J. Comput. Syst. Sci. 110: 22-36 ()]]>
https://dblp.org/rec/journals/jcss/KupavskiiZ20Wed, 01 Jan 2020 00:00:00 +0100
Proper Learning, Helly Number, and an Optimal SVM Bound.http://proceedings.mlr.press/v125/bousquet20a.html, , , :
Proper Learning, Helly Number, and an Optimal SVM Bound. COLT : 582-609]]>
https://dblp.org/rec/conf/colt/BousquetHMZ20Wed, 01 Jan 2020 00:00:00 +0100
Sharper Bounds for Uniformly Stable Algorithms.http://proceedings.mlr.press/v125/bousquet20b.html, , :
Sharper Bounds for Uniformly Stable Algorithms. COLT : 610-626]]>
https://dblp.org/rec/conf/colt/BousquetKZ20Wed, 01 Jan 2020 00:00:00 +0100
Fast Rates for Online Prediction with Abstention.http://proceedings.mlr.press/v125/neu20a.html, :
Fast Rates for Online Prediction with Abstention. COLT : 3030-3048]]>
https://dblp.org/rec/conf/colt/NeuZ20Wed, 01 Jan 2020 00:00:00 +0100
Fast Rates for Online Prediction with Abstention.https://arxiv.org/abs/2001.10623, :
Fast Rates for Online Prediction with Abstention. CoRR abs/2001.10623 ()]]>
https://dblp.org/rec/journals/corr/abs-2001-10623Wed, 01 Jan 2020 00:00:00 +0100
Robust k-means Clustering for Distributions with Two Moments.https://arxiv.org/abs/2002.02339, , :
Robust k-means Clustering for Distributions with Two Moments. CoRR abs/2002.02339 ()]]>
https://dblp.org/rec/journals/corr/abs-2002-02339Wed, 01 Jan 2020 00:00:00 +0100
Proper Learning, Helly Number, and an Optimal SVM Bound.https://arxiv.org/abs/2005.11818, , , :
Proper Learning, Helly Number, and an Optimal SVM Bound. CoRR abs/2005.11818 ()]]>
https://dblp.org/rec/journals/corr/abs-2005-11818Wed, 01 Jan 2020 00:00:00 +0100
Suboptimality of Constrained Least Squares and Improvements via Non-Linear Predictors.https://arxiv.org/abs/2009.09304, :
Suboptimality of Constrained Least Squares and Improvements via Non-Linear Predictors. CoRR abs/2009.09304 ()]]>
https://dblp.org/rec/journals/corr/abs-2009-09304Wed, 01 Jan 2020 00:00:00 +0100
On Mean Estimation for Heteroscedastic Random Variables.https://arxiv.org/abs/2010.11537, , , :
On Mean Estimation for Heteroscedastic Random Variables. CoRR abs/2010.11537 ()]]>
https://dblp.org/rec/journals/corr/abs-2010-11537Wed, 01 Jan 2020 00:00:00 +0100
Sharper bounds for uniformly stable algorithms.http://arxiv.org/abs/1910.07833, , :
Sharper bounds for uniformly stable algorithms. CoRR abs/1910.07833 ()]]>
https://dblp.org/rec/journals/corr/abs-1910-07833Tue, 01 Jan 2019 00:00:00 +0100
Fast classification rates without standard margin assumptions.http://arxiv.org/abs/1910.12756, :
Fast classification rates without standard margin assumptions. CoRR abs/1910.12756 ()]]>
https://dblp.org/rec/journals/corr/abs-1910-12756Tue, 01 Jan 2019 00:00:00 +0100
Localization of VC classes: Beyond local Rademacher complexities.https://doi.org/10.1016/j.tcs.2017.12.029, :
Localization of VC classes: Beyond local Rademacher complexities. Theor. Comput. Sci. 742: 27-49 ()]]>
https://dblp.org/rec/journals/tcs/ZhivotovskiyH18Mon, 01 Jan 2018 00:00:00 +0100
Optimal learning via local entropies and sample compression.http://proceedings.mlr.press/v65/nikita17a.html:
Optimal learning via local entropies and sample compression. COLT : 2023-2065]]>
https://dblp.org/rec/conf/colt/Nikita17Sun, 01 Jan 2017 00:00:00 +0100
When are epsilon-nets small?http://arxiv.org/abs/1711.10414, :
When are epsilon-nets small? CoRR abs/1711.10414 ()]]>
https://dblp.org/rec/journals/corr/abs-1711-10414Sun, 01 Jan 2017 00:00:00 +0100
Localization of VC Classes: Beyond Local Rademacher Complexities.https://doi.org/10.1007/978-3-319-46379-7_2, :
Localization of VC Classes: Beyond Local Rademacher Complexities. ALT : 18-33]]>
https://dblp.org/rec/conf/alt/ZhivotovskiyH16Fri, 01 Jan 2016 00:00:00 +0100
Permutational Rademacher Complexity - A New Complexity Measure for Transductive Learning.https://doi.org/10.1007/978-3-319-24486-0_14, , :
Permutational Rademacher Complexity - A New Complexity Measure for Transductive Learning. ALT : 209-223]]>
https://dblp.org/rec/conf/alt/TolstikhinZB15Thu, 01 Jan 2015 00:00:00 +0100
Permutational Rademacher Complexity: a New Complexity Measure for Transductive Learning.http://arxiv.org/abs/1505.02910, , :
Permutational Rademacher Complexity: a New Complexity Measure for Transductive Learning. CoRR abs/1505.02910 ()]]>
https://dblp.org/rec/journals/corr/TolstikhinZB15Thu, 01 Jan 2015 00:00:00 +0100