default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYevgeny Seldin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i26]Yi-Shan Wu, Yijie Zhang, Badr-Eddine Chérief-Abdellatif, Yevgeny Seldin:
Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss. CoRR abs/2405.14681 (2024)- 2023
- [c32]Emmanuel Esposito, Saeed Masoudian, Hao Qiu, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Delayed Bandits: When Do Intermediate Observations Help? ICML 2023: 9374-9395 - [i25]Emmanuel Esposito, Saeed Masoudian, Hao Qiu, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Delayed Bandits: When Do Intermediate Observations Help? CoRR abs/2305.19036 (2023) - [i24]Saeed Masoudian, Julian Zimmert, Yevgeny Seldin:
An Improved Best-of-both-worlds Algorithm for Bandits with Delayed Feedback. CoRR abs/2308.10675 (2023) - 2022
- [c31]Yi-Shan Wu, Yevgeny Seldin:
Split-kl and PAC-Bayes-split-kl Inequalities for Ternary Random Variables. NeurIPS 2022 - [c30]Saeed Masoudian, Julian Zimmert, Yevgeny Seldin:
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback. NeurIPS 2022 - [c29]Chloé Rouyer, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs. NeurIPS 2022 - [i23]Chloé Rouyer, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs. CoRR abs/2206.00557 (2022) - [i22]Yi-Shan Wu, Yevgeny Seldin:
Split-kl and PAC-Bayes-split-kl Inequalities. CoRR abs/2206.00706 (2022) - [i21]Saeed Masoudian, Julian Zimmert, Yevgeny Seldin:
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback. CoRR abs/2206.14906 (2022) - 2021
- [j5]Julian Zimmert, Yevgeny Seldin:
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits. J. Mach. Learn. Res. 22: 28:1-28:49 (2021) - [c28]Saeed Masoudian, Yevgeny Seldin:
Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions. COLT 2021: 3330-3350 - [c27]Chloé Rouyer, Yevgeny Seldin, Nicolò Cesa-Bianchi:
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs. ICML 2021: 9127-9135 - [c26]Yi-Shan Wu, Andrés R. Masegosa, Stephan Sloth Lorenzen, Christian Igel, Yevgeny Seldin:
Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote. NeurIPS 2021: 12625-12636 - [i20]Chloé Rouyer, Yevgeny Seldin, Nicolò Cesa-Bianchi:
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs. CoRR abs/2102.09864 (2021) - [i19]Saeed Masoudian, Yevgeny Seldin:
Improved Analysis of Robustness of the Tsallis-INF Algorithm to Adversarial Corruptions in Stochastic Multiarmed Bandits. CoRR abs/2103.12487 (2021) - [i18]Yi-Shan Wu, Andrés R. Masegosa, Stephan Sloth Lorenzen, Christian Igel, Yevgeny Seldin:
Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote. CoRR abs/2106.13624 (2021) - 2020
- [c25]Julian Zimmert, Yevgeny Seldin:
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays. AISTATS 2020: 3285-3294 - [c24]Chloé Rouyer, Yevgeny Seldin:
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits. COLT 2020: 3227-3249 - [c23]Andrés R. Masegosa, Stephan Sloth Lorenzen, Christian Igel, Yevgeny Seldin:
Second Order PAC-Bayesian Bounds for the Weighted Majority Vote. NeurIPS 2020 - [i17]Andrés R. Masegosa, Stephan Sloth Lorenzen, Christian Igel, Yevgeny Seldin:
Second Order PAC-Bayesian Bounds for the Weighted Majority Vote. CoRR abs/2007.13532 (2020)
2010 – 2019
- 2019
- [j4]Stephan Sloth Lorenzen
, Christian Igel, Yevgeny Seldin:
On PAC-Bayesian bounds for random forests. Mach. Learn. 108(8-9): 1503-1522 (2019) - [c22]Julian Zimmert, Yevgeny Seldin:
An Optimal Algorithm for Stochastic and Adversarial Bandits. AISTATS 2019: 467-475 - [c21]Tobias Sommer Thune, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Nonstochastic Multiarmed Bandits with Unrestricted Delays. NeurIPS 2019: 6538-6547 - [i16]Tobias Sommer Thune, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Nonstochastic Multiarmed Bandits with Unrestricted Delays. CoRR abs/1906.00670 (2019) - [i15]Julian Zimmert, Yevgeny Seldin:
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays. CoRR abs/1910.06054 (2019) - 2018
- [c20]Julian Zimmert, Yevgeny Seldin:
Factored Bandits. NeurIPS 2018: 2840-2849 - [c19]Tobias Sommer Thune, Yevgeny Seldin:
Adaptation to Easy Data in Prediction with Limited Advice. NeurIPS 2018: 2914-2923 - [i14]Tobias Sommer Thune, Yevgeny Seldin:
Adaptation to Easy Data in Prediction with Limited Advice. CoRR abs/1807.00636 (2018) - [i13]Julian Zimmert, Yevgeny Seldin:
Factored Bandits. CoRR abs/1807.01488 (2018) - [i12]Julian Zimmert, Yevgeny Seldin:
An Optimal Algorithm for Stochastic and Adversarial Bandits. CoRR abs/1807.07623 (2018) - [i11]Stephan Sloth Lorenzen, Christian Igel, Yevgeny Seldin:
On PAC-Bayesian Bounds for Random Forests. CoRR abs/1810.09746 (2018) - 2017
- [c18]Niklas Thiemann, Christian Igel, Olivier Wintenberger, Yevgeny Seldin:
A Strongly Quasiconvex PAC-Bayesian Bound. ALT 2017: 466-492 - [c17]Yevgeny Seldin, Gábor Lugosi:
An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits. COLT 2017: 1743-1759 - [i10]Yevgeny Seldin, Gábor Lugosi:
An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits. CoRR abs/1702.06103 (2017) - 2016
- [c16]Brian Brost, Yevgeny Seldin, Ingemar J. Cox, Christina Lioma:
Multi-Dueling Bandits and Their Application to Online Ranker Evaluation. CIKM 2016: 2161-2166 - [c15]Brian Brost, Ingemar J. Cox, Yevgeny Seldin, Christina Lioma:
An Improved Multileaving Algorithm for Online Ranker Evaluation. SIGIR 2016: 745-748 - [i9]Brian Brost, Ingemar J. Cox, Yevgeny Seldin, Christina Lioma:
An Improved Multileaving Algorithm for Online Ranker Evaluation. CoRR abs/1608.00788 (2016) - [i8]Niklas Thiemann, Christian Igel, Yevgeny Seldin:
PAC-Bayesian Aggregation without Cross-Validation. CoRR abs/1608.05610 (2016) - [i7]Brian Brost, Yevgeny Seldin, Ingemar J. Cox, Christina Lioma:
Multi-Dueling Bandits and Their Application to Online Ranker Evaluation. CoRR abs/1608.06253 (2016) - 2014
- [c14]Yevgeny Seldin, Peter L. Bartlett, Koby Crammer, Yasin Abbasi-Yadkori:
Prediction with Limited Advice and Multiarmed Bandits with Paid Observations. ICML 2014: 280-287 - [c13]Yevgeny Seldin, Aleksandrs Slivkins:
One Practical Algorithm for Both Stochastic and Adversarial Bandits. ICML 2014: 1287-1295 - 2013
- [c12]Yevgeny Seldin, Bernhard Schölkopf:
On the Relations and Differences Between Popper Dimension, Exclusion Dimension and VC-Dimension. Empirical Inference 2013: 53-57 - [c11]Yevgeny Seldin, Koby Crammer, Peter L. Bartlett:
Open Problem: Adversarial Multiarmed Bandits with Limited Advice. COLT 2013: 1067-1072 - [c10]Ilya O. Tolstikhin, Yevgeny Seldin:
PAC-Bayes-Empirical-Bernstein Inequality. NIPS 2013: 109-117 - [c9]Yasin Abbasi-Yadkori, Peter L. Bartlett, Varun Kanade, Yevgeny Seldin, Csaba Szepesvári:
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions. NIPS 2013: 2508-2516 - [i6]Yevgeny Seldin, Peter L. Bartlett, Koby Crammer:
Advice-Efficient Prediction with Expert Advice. CoRR abs/1304.3708 (2013) - 2012
- [j3]Yevgeny Seldin, François Laviolette, Nicolò Cesa-Bianchi, John Shawe-Taylor, Peter Auer:
PAC-Bayesian Inequalities for Martingales. IEEE Trans. Inf. Theory 58(12): 7086-7093 (2012) - [c8]Yevgeny Seldin, Csaba Szepesvári, Peter Auer, Yasin Abbasi-Yadkori:
Evaluation and Analysis of the Performance of the EXP3 Algorithm in Stochastic Environments. EWRL 2012: 103-116 - [c7]Yevgeny Seldin, François Laviolette, Nicolò Cesa-Bianchi, John Shawe-Taylor, Peter Auer:
PAC-Bayesian Inequalities for Martingales. UAI 2012: 12 - [c6]Yevgeny Seldin, Nicolò Cesa-Bianchi, Peter Auer, François Laviolette, John Shawe-Taylor:
PAC-Bayes-Bernstein Inequality for Martingales and its Application to Multiarmed Bandits. ICML On-line Trading of Exploration and Exploitation 2012: 98-111 - 2011
- [c5]Yevgeny Seldin, Peter Auer, François Laviolette, John Shawe-Taylor, Ronald Ortner:
PAC-Bayesian Analysis of Contextual Bandits. NIPS 2011: 1683-1691 - [i5]Yevgeny Seldin, François Laviolette, John Shawe-Taylor, Jan Peters, Peter Auer:
PAC-Bayesian Analysis of Martingales and Multiarmed Bandits. CoRR abs/1105.2416 (2011) - [i4]Yevgeny Seldin, Nicolò Cesa-Bianchi, François Laviolette, Peter Auer, John Shawe-Taylor, Jan Peters:
PAC-Bayesian Analysis of the Exploration-Exploitation Trade-off. CoRR abs/1105.4585 (2011) - [i3]Yevgeny Seldin, Nicolò Cesa-Bianchi, Peter Auer, François Laviolette, John Shawe-Taylor:
PAC-Bayes-Bernstein Inequality for Martingales and its Application to Multiarmed Bandits. CoRR abs/1110.6755 (2011) - [i2]Yevgeny Seldin, François Laviolette, Nicolò Cesa-Bianchi, John Shawe-Taylor, Peter Auer:
PAC-Bayesian Inequalities for Martingales. CoRR abs/1110.6886 (2011) - 2010
- [j2]Yevgeny Seldin, Naftali Tishby:
PAC-Bayesian Analysis of Co-clustering and Beyond. J. Mach. Learn. Res. 11: 3595-3646 (2010) - [i1]Yevgeny Seldin:
A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clustering. CoRR abs/1009.0499 (2010)
2000 – 2009
- 2009
- [b1]Yevgeny Seldin:
A PAC-Bayesian approach to structure learning (עם תקציר בעברית ושער נוסף: גישה PAC-ביסיאנית ללמידת מבנה.; Probably approximately correct learning.). Hebrew University of Jerusalem, Israel, 2009 - [c4]Yevgeny Seldin, Naftali Tishby:
PAC-Bayesian Generalization Bound for Density Estimation with Application to Co-clustering. AISTATS 2009: 472-479 - 2008
- [c3]Yevgeny Seldin, Naftali Tishby:
Multi-classification by categorical features via clustering. ICML 2008: 920-927 - 2006
- [c2]Yevgeny Seldin, Noam Slonim, Naftali Tishby:
Information Bottleneck for Non Co-Occurrence Data. NIPS 2006: 1241-1248 - 2001
- [j1]Gill Bejerano, Yevgeny Seldin, Hanah Margalit, Naftali Tishby:
Markovian domain fingerprinting: statistical segmentation of protein sequences. Bioinform. 17(10): 927-934 (2001) - [c1]Yevgeny Seldin, Gill Bejerano, Naftali Tishby:
Unsupervised Sequence Segmentation by a Mixture of Switching Variable Memory Markov Sources. ICML 2001: 513-520
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-10-07 21:19 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:
