ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1501.07340
  4. Cited By
Sequential Probability Assignment with Binary Alphabets and Large
  Classes of Experts

Sequential Probability Assignment with Binary Alphabets and Large Classes of Experts

29 January 2015
Alexander Rakhlin
Karthik Sridharan
ArXiv (abs)PDFHTML

Papers citing "Sequential Probability Assignment with Binary Alphabets and Large Classes of Experts"

11 / 11 papers shown
Smoothed Analysis of Sequential Probability Assignment
Smoothed Analysis of Sequential Probability AssignmentNeural Information Processing Systems (NeurIPS), 2023
Alankrita Bhatt
Nika Haghtalab
Abhishek Shetty
202
10
0
08 Mar 2023
Exploring Local Norms in Exp-concave Statistical Learning
Exploring Local Norms in Exp-concave Statistical LearningAnnual Conference Computational Learning Theory (COLT), 2023
Nikita Puchkin
Nikita Zhivotovskiy
479
3
0
21 Feb 2023
Expected Worst Case Regret via Stochastic Sequential Covering
Expected Worst Case Regret via Stochastic Sequential Covering
Changlong Wu
Mohsen Heidari
A. Grama
Wojtek Szpankowski
369
15
0
09 Sep 2022
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm
Precise Regret Bounds for Log-loss via a Truncated Bayesian AlgorithmNeural Information Processing Systems (NeurIPS), 2022
Changlong Wu
Mohsen Heidari
A. Grama
Wojtek Szpankowski
189
11
0
07 May 2022
Damped Online Newton Step for Portfolio Selection
Damped Online Newton Step for Portfolio SelectionAnnual Conference Computational Learning Theory (COLT), 2022
Zakaria Mhammedi
Alexander Rakhlin
213
17
0
15 Feb 2022
Minimax Rates for Conditional Density Estimation via Empirical Entropy
Minimax Rates for Conditional Density Estimation via Empirical Entropy
Blair Bilodeau
Dylan J. Foster
Daniel M. Roy
440
29
0
21 Sep 2021
Efficient First-Order Contextual Bandits: Prediction, Allocation, and
  Triangular Discrimination
Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination
Dylan J. Foster
A. Krishnamurthy
220
59
0
05 Jul 2021
Sequential prediction under log-loss and misspecification
Sequential prediction under log-loss and misspecificationAnnual Conference Computational Learning Theory (COLT), 2021
M. Feder
Yury Polyanskiy
299
11
0
29 Jan 2021
Tight Bounds on Minimax Regret under Logarithmic Loss via
  Self-Concordance
Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance
Blair Bilodeau
Dylan J. Foster
Daniel M. Roy
204
0
0
02 Jul 2020
A Tight Excess Risk Bound via a Unified
  PAC-Bayesian-Rademacher-Shtarkov-MDL Complexity
A Tight Excess Risk Bound via a Unified PAC-Bayesian-Rademacher-Shtarkov-MDL Complexity
Peter Grünwald
Nishant A. Mehta
178
38
0
21 Oct 2017
Generalization of ERM in Stochastic Convex Optimization: The Dimension
  Strikes Back
Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes BackNeural Information Processing Systems (NeurIPS), 2016
Vitaly Feldman
373
75
0
15 Aug 2016
1
Page 1 of 1