default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre B. Tsybakov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Arya Akhavan, Davit Gogolashvili, Alexandre B. Tsybakov:
Estimating the Minimizer and the Minimum Value of a Regression Function under Passive Design. J. Mach. Learn. Res. 25: 11:1-11:37 (2024)- [i6]Arya Akhavan, Karim Lounici, Massimiliano Pontil, Alexandre B. Tsybakov:
Contextual Continuum Bandits: Static Versus Dynamic Regret. CoRR abs/2406.05714 (2024) - 2022
- [j12]Mohamed Ndaoud
, Suzanne Sigalla, Alexandre B. Tsybakov:
Improved Clustering Algorithms for the Bipartite Stochastic Block Model. IEEE Trans. Inf. Theory 68(3): 1960-1975 (2022) - [c12]Arya Akhavan, Evgenii Chzhen, Massimiliano Pontil, Alexandre B. Tsybakov:
A gradient estimator via L1-randomization for online zero-order optimization with two point feedback. NeurIPS 2022 - [i5]Julien Chhor, Suzanne Sigalla, Alexandre B. Tsybakov:
Benign overfitting and adaptive nonparametric regression. CoRR abs/2206.13347 (2022) - 2021
- [c11]Arya Akhavan, Massimiliano Pontil, Alexandre B. Tsybakov:
Distributed Zero-Order Optimization under Adversarial Noise. NeurIPS 2021: 10209-10220 - 2020
- [j11]Mohamed Ndaoud, Alexandre B. Tsybakov:
Optimal Variable Selection and Adaptive Noisy Compressed Sensing. IEEE Trans. Inf. Theory 66(4): 2517-2532 (2020) - [c10]Arya Akhavan, Massimiliano Pontil, Alexandre B. Tsybakov:
Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits. NeurIPS 2020 - [i4]Arya Akhavan, Massimiliano Pontil, Alexandre B. Tsybakov:
Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits. CoRR abs/2006.07862 (2020)
2010 – 2019
- 2019
- [j10]Alexander V. Nazin, Arkadi S. Nemirovsky, Alexandre B. Tsybakov, Anatoli B. Juditsky:
Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method. Autom. Remote. Control. 80(9): 1607-1627 (2019) - [j9]Alexandra Carpentier, Olivier Collier, Laëtitia Comminges, Alexandre B. Tsybakov, Yuhao Wang:
Minimax Rate of Testing in Sparse Linear Regression. Autom. Remote. Control. 80(10): 1817-1834 (2019) - [c9]Mikhail Belkin, Alexander Rakhlin, Alexandre B. Tsybakov:
Does data interpolation contradict statistical optimality? AISTATS 2019: 1611-1619 - 2018
- [i3]Mikhail Belkin, Alexander Rakhlin, Alexandre B. Tsybakov:
Does data interpolation contradict statistical optimality? CoRR abs/1806.09471 (2018) - 2015
- [j8]Pierre C. Bellec, Alexandre B. Tsybakov:
Sharp oracle bounds for monotone and convex regression through aggregation. J. Mach. Learn. Res. 16: 1879-1892 (2015) - [j7]Olga Klopp, Alexandre B. Tsybakov:
Estimation of matrices with row sparsity. Probl. Inf. Transm. 51(4): 335-348 (2015) - 2013
- [c8]Eric Gautier, Alexandre B. Tsybakov:
Pivotal Estimation in High-Dimensional Regression via Linear Programming. Empirical Inference 2013: 195-204 - [i2]Alexander Rakhlin, Karthik Sridharan, Alexandre B. Tsybakov:
Empirical Entropy, Minimax Regret and Minimax Risk. CoRR abs/1308.1147 (2013) - 2012
- [j6]Arnak S. Dalalyan, Alexandre B. Tsybakov:
Sparse regression learning by aggregation and Langevin Monte-Carlo. J. Comput. Syst. Sci. 78(5): 1423-1443 (2012) - [j5]Boris S. Tsybakov, Alexandre B. Tsybakov:
On Walsh code assignment. Probl. Inf. Transm. 48(4): 334-341 (2012) - [i1]Boris S. Tsybakov, Alexandre B. Tsybakov:
On Walsh code assignment. CoRR abs/1210.3075 (2012)
2000 – 2009
- 2009
- [b1]Alexandre B. Tsybakov:
Introduction to Nonparametric Estimation. Springer series in statistics, Springer 2009, ISBN 978-0-387-79051-0, pp. I-XII, 1-214 - [c7]Arnak S. Dalalyan, Alexandre B. Tsybakov:
Sparse Regression Learning by Aggregation and Langevin Monte-Carlo. COLT 2009 - [c6]Karim Lounici, Massimiliano Pontil, Alexandre B. Tsybakov, Sara A. van de Geer:
Taking Advantage of Sparsity in Multi-Task Learning. COLT 2009 - 2008
- [j4]Arnak S. Dalalyan, Alexandre B. Tsybakov:
Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity. Mach. Learn. 72(1-2): 39-61 (2008) - 2007
- [c5]Arnak S. Dalalyan, Alexandre B. Tsybakov:
Aggregation by Exponential Weighting and Sharp Oracle Inequalities. COLT 2007: 97-111 - [c4]Florentina Bunea, Alexandre B. Tsybakov, Marten H. Wegkamp:
Sparse Density Estimation with l1 Penalties. COLT 2007: 530-543 - 2006
- [j3]Anatoli B. Juditsky, Alexander V. Nazin, Alexandre B. Tsybakov, Nicolas Vayatis:
Remark on "Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging" published in Probl. Peredachi Inf., 2005, no. 4. Probl. Inf. Transm. 42(3): 262 (2006) - [c3]Florentina Bunea, Alexandre B. Tsybakov, Marten H. Wegkamp:
Aggregation and Sparsity Via l1 Penalized Least Squares. COLT 2006: 379-391 - 2005
- [j2]Anatoli B. Juditsky, Alexander V. Nazin, Alexandre B. Tsybakov, Nicolas Vayatis:
Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging. Probl. Inf. Transm. 41(4): 368-384 (2005) - [c2]Anatoli B. Juditsky, Alexander V. Nazin, Alexandre B. Tsybakov, Nicolas Vayatis:
Generalization Error Bounds for Aggregation by Mirror Descent with Averaging. NIPS 2005: 603-610 - 2003
- [c1]Alexandre B. Tsybakov:
Optimal Rates of Aggregation. COLT 2003: 303-313
1990 – 1999
- 1992
- [j1]Alexander V. Nazin, Boris T. Polyak, Alexandre B. Tsybakov:
Optimal and robust kernel algorithms for passive stochastic approximation. IEEE Trans. Inf. Theory 38(5): 1577-1583 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 01:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
