conftrace_

logarithmic loss

13 papers

Explore in graph

Co-occurring keywords

minimax regret (74) sequential probability assignment (4) sequential prediction (57) normalized maximum likelihood (7) jeffreys prior (5) bayesian prediction (7) online prediction (32) exponential family (124) online learning (1777) contextual shtarkov sum (1)

Papers

Fast Minimization of Expected Logarithmic Loss via Stochastic Dual Averaging AISTATS 2024
Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood NIPS 2024
Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness NIPS 2023
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm NIPS 2022
Sequential prediction under log-loss with side information ALT 2021
Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination NIPS 2021
Fairness for Robust Log Loss Classification AAAI 2020
Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance ICML 2020
Adaptive Minimax Regret against Smooth Logarithmic Losses over High-Dimensional l1-Balls via Envelope Complexity AISTATS 2019
Sequential prediction with coded side information under logarithmic loss ALT 2018
The Forget-me-not Process NIPS 2016
Horizon-Independent Optimal Prediction with Log-Loss in Exponential Families COLT 2013
Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction with Jeffreys Prior AISTATS 2012