Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Chamy Allenberg

dblp:98/2126 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 100%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › online learning › sequence prediction
individual sequence prediction		 0.011999
Individual Sequence Prediction - Upper Bounds and Application for Complexity · COLT 1999
Machine learning › Learning theory
online learning		 0.011999
Individual Sequence Prediction - Upper Bounds and Application for Complexity · COLT 1999
Information theory › algorithmic information theory
universal prediction		 0.011999
Individual Sequence Prediction - Upper Bounds and Application for Complexity · COLT 1999

Methods — techniques the papers use, named apart from their topics

upper bound analysis · 0.0
YearPublicationVenuePosition
2006 Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
Chamy Allenberg, Peter Auer, László Györfi, György Ottucsák
 ALT1
1999 Individual Sequence Prediction - Upper Bounds and Application for Complexity
abstract
Article Free Access Share on Individual sequence prediction—upper bounds and application for complexity Author: Chamy Allenberg School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, IsraelView Profile Authors Info & Claims COLT '99: Proceedings of the twelfth annual conference on Computational learning theoryJuly 1999 Pages 233–242https://doi.org/10.1145/307400.307446Published:06 July 1999Publication History 3citation243DownloadsMetricsTotal Citations3Total Downloads243Last 12 Months10Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Chamy Allenberg
 COLT1