default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalázs Szörényi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c31]Róbert Busa-Fekete, Heejin Choi, Krzysztof Dembczynski, Claudio Gentile, Henry Reeve, Balázs Szörényi:
Regret Bounds for Multilabel Classification in Sparse Label Regimes. NeurIPS 2022- 2021
- [c30]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Emmanouil Zampetakis
:
Identity testing for Mallows model. NeurIPS 2021: 23179-23190 - 2020
- [c29]Gal Dalal, Balázs Szörényi, Gugan Thoppe:
A Tale of Two-Timescale Reinforcement Learning with the Tightest Finite-Time Bound. AAAI 2020: 3701-3708 - [c28]Utkarsh Upadhyay, Róbert Busa-Fekete, Wojciech Kotlowski, Dávid Pál, Balázs Szörényi:
Learning to Crawl. AAAI 2020: 6046-6053
2010 – 2019
- 2019
- [c27]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Manolis Zampetakis:
Optimal Learning of Mallows Block Model. COLT 2019: 529-532 - [c26]Alina Beygelzimer, Dávid Pál, Balázs Szörényi, Devanathan Thiruvenkatachari, Chen-Yu Wei, Chicheng Zhang:
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case. ICML 2019: 624-633 - [c25]Alexander Golovnev, Dávid Pál, Balázs Szörényi:
The information-theoretic value of unlabeled data in semi-supervised learning. ICML 2019: 2328-2336 - [i12]Alexander Golovnev, Dávid Pál, Balázs Szörényi:
The information-theoretic value of unlabeled data in semi-supervised learning. CoRR abs/1901.05515 (2019) - [i11]Alina Beygelzimer, Dávid Pál, Balázs Szörényi, Devanathan Thiruvenkatachari, Chen-Yu Wei, Chicheng Zhang:
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case. CoRR abs/1902.02244 (2019) - [i10]Utkarsh Upadhyay, Róbert Busa-Fekete, Wojciech Kotlowski, Dávid Pál, Balázs Szörényi:
Learning to Crawl. CoRR abs/1905.12781 (2019) - [i9]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Manolis Zampetakis:
Optimal Learning of Mallows Block Model. CoRR abs/1906.01009 (2019) - [i8]Gal Dalal, Balázs Szörényi, Gugan Thoppe:
A Tale of Two-Timescale Reinforcement Learning with the Tightest Finite-Time Bound. CoRR abs/1911.09157 (2019) - 2018
- [c24]Gal Dalal, Balázs Szörényi, Gugan Thoppe, Shie Mannor:
Finite Sample Analyses for TD(0) With Function Approximation. AAAI 2018: 6144-6160 - [c23]Gal Dalal, Gugan Thoppe, Balázs Szörényi, Shie Mannor:
Finite Sample Analysis of Two-Timescale Stochastic Approximation with Applications to Reinforcement Learning. COLT 2018: 1199-1233 - [c22]Yahel David, Balázs Szörényi, Mohammad Ghavamzadeh, Shie Mannor, Nahum Shimkin:
PAC Bandits with Risk Constraints. ISAIM 2018 - 2017
- [c21]Róbert Busa-Fekete, Balázs Szörényi, Paul Weng, Shie Mannor:
Multi-objective Bandits: Optimizing the Generalized Gini Index. ICML 2017: 625-634 - [c20]Balázs Szörényi, Snir Cohen, Shie Mannor:
Non-parametric Online AUC Maximization. ECML/PKDD (2) 2017: 575-590 - [i7]Gal Dalal, Balázs Szörényi, Gugan Thoppe, Shie Mannor:
Concentration Bounds for Two Timescale Stochastic Approximation with Applications to Reinforcement Learning. CoRR abs/1703.05376 (2017) - [i6]Gal Dalal, Balázs Szörényi, Gugan Thoppe, Shie Mannor:
Finite Sample Analysis for TD(0) with Linear Function Approximation. CoRR abs/1704.01161 (2017) - [i5]Róbert Busa-Fekete, Balázs Szörényi, Paul Weng, Shie Mannor:
Multi-objective Bandits: Optimizing the Generalized Gini Index. CoRR abs/1706.04933 (2017) - 2016
- [c19]Nathan Korda, Balázs Szörényi, Shuai Li:
Distributed Clustering of Linear Bandits in Peer to Peer Networks. ICML 2016: 1301-1309 - [i4]Nathan Korda, Balázs Szörényi, Shuai Li:
Distributed Clustering of Linear Bandits in Peer to Peer Networks. CoRR abs/1604.07706 (2016) - 2015
- [c18]Balázs Szörényi, Róbert Busa-Fekete, Paul Weng, Eyke Hüllermeier:
Qualitative Multi-Armed Bandits: A Quantile-Based Approach. ICML 2015: 1660-1668 - [c17]Róbert Busa-Fekete, Balázs Szörényi, Krzysztof Dembczynski, Eyke Hüllermeier:
Online F-Measure Optimization. NIPS 2015: 595-603 - [c16]Balázs Szörényi, Róbert Busa-Fekete, Adil Paul, Eyke Hüllermeier:
Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach. NIPS 2015: 604-612 - 2014
- [j8]Róbert Busa-Fekete, Balázs Szörényi, Paul Weng, Weiwei Cheng, Eyke Hüllermeier:
Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm. Mach. Learn. 97(3): 327-351 (2014) - [j7]Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi:
Supervised learning and Co-training. Theor. Comput. Sci. 519: 68-87 (2014) - [c15]Róbert Busa-Fekete, Balázs Szörényi, Eyke Hüllermeier:
PAC Rank Elicitation through Adaptive Sampling of Stochastic Pairwise Preferences. AAAI 2014: 1701-1707 - [c14]Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán:
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. DCFS 2014: 174-185 - [c13]Róbert Busa-Fekete, Eyke Hüllermeier, Balázs Szörényi:
Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows. ICML 2014: 1071-1079 - [c12]Balázs Szörényi, Gunnar Kedenburg, Rémi Munos:
Optimistic Planning in Markov Decision Processes Using a Generative Model. NIPS 2014: 1035-1043 - [i3]Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán:
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal. CoRR abs/1406.0017 (2014) - 2013
- [c11]Balázs Szörényi, Róbert Busa-Fekete, István Hegedüs, Róbert Ormándi, Márk Jelasity, Balázs Kégl:
Gossip-based distributed stochastic bandit algorithms. ICML (3) 2013: 19-27 - [c10]Róbert Busa-Fekete, Balázs Szörényi, Weiwei Cheng, Paul Weng, Eyke Hüllermeier:
Top-k Selection based on Adaptive Sampling of Noisy Preferences. ICML (3) 2013: 1094-1102 - [c9]Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi:
Unlabeled Data Does Provably Help. STACS 2013: 185-196 - 2012
- [c8]Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Belief Contraction: Remainders, Envelopes and Complexity. KR 2012 - 2011
- [c7]Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Belief Contraction: Remainders, Envelopes and Complexity. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011 - [c6]Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi:
Supervised Learning and Co-training. ALT 2011: 425-439 - 2010
- [j6]Hans Ulrich Simon, Balázs Szörényi:
One-inclusion hypergraph density revisited. Inf. Process. Lett. 110(8-9): 341-344 (2010) - [p1]Robert H. Sloan, Balázs Szörényi, György Turán, Yves Crama, Peter L. Hammer:
Learning Boolean Functions with Queries. Boolean Models and Methods 2010: 221-256
2000 – 2009
- 2009
- [c5]Balázs Szörényi:
Characterizing Statistical Query Learning: Simplified Notions and Proofs. ALT 2009: 186-200 - 2008
- [j5]Robert H. Sloan, Balázs Szörényi, György Turán:
Projective DNF formulae and their revision. Discret. Appl. Math. 156(4): 530-544 (2008) - [j4]Balázs Szörényi:
Disjoint DNF Tautologies with Conflict Bound Two. J. Satisf. Boolean Model. Comput. 4(1): 1-14 (2008) - [j3]Robert H. Sloan, Balázs Szörényi, György Turán:
On k-Term DNF with the Largest Number of Prime Implicants. SIAM J. Discret. Math. 21(4): 987-998 (2008) - [c4]Marina Langlois, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Complements: Towards Horn-to-Horn Belief Revision. AAAI 2008: 466-471 - 2007
- [j2]Robert H. Sloan, Balázs Szörényi, György Turán:
Revising threshold functions. Theor. Comput. Sci. 382(3): 198-208 (2007) - 2005
- [i2]Robert H. Sloan, Balázs Szörényi, György Turán:
On k-term DNF with largest number of prime implicants. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j1]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
Theory revision with queries: Horn, read-once, and parity formulas. Artif. Intell. 156(2): 139-176 (2004) - [c3]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
New Revision Algorithms. ALT 2004: 395-409 - 2003
- [c2]Robert H. Sloan, Balázs Szörényi, György Turán:
Projective DNF Formulae and Their Revision. COLT 2003: 625-639 - [i1]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
Theory Revision with Queries: Horn, Read-once, and Parity Formulas. Electron. Colloquium Comput. Complex. TR03 (2003) - 2000
- [c1]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
Improved Algorithms for Theory Revision with Queries. COLT 2000: 236-247
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-05-08 21:00 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:
