Co-occurring keywords · papers mentioning both
Papers
Second-Order Bounds for $[0,1]$-Valued Regression via Betting Loss
COLT 2026
When and How Often is Weighted Majority Vote Optimal Under Log Loss?
UAI 2026
Improving Multi-Class Calibration through Normalization-Aware Isotonic Techniques
ICML 2025
Efficient Contextual Bandits with Uninformed Feedback Graphs
ICML 2024
Switching the Loss Reduces the Cost in Batch Reinforcement Learning
ICML 2024
Direct Loss Minimization for Sparse Gaussian Processes
AISTATS 2021
Label Inference Attacks from Log-loss Scores
ICML 2021
Fairness for Robust Log Loss Classification
AAAI 2020
Improved Natural Language Generation via Loss Truncation
ACL 2020
On Log-Loss Scores and (No) Privacy
EMNLP 2020
Low-Complexity Nonparametric Bayesian Online Prediction with Universal Guarantees
NeurIPS 2019
On GAP Coreference Resolution Shared Task: Insights from the 3rd Place Solution
ACL 2019
Toward a Characterization of Loss Functions for Distribution Learning
NeurIPS 2019
Universality of Bayesian mixture predictors
ALT 2017
Mixability is Bayes Risk Curvature Relative to Log Loss
JMLR 2012
Bounds on Individual Risk for Log-loss Predictors
COLT 2011
Mixability is Bayes Risk Curvature Relative to Log Loss
COLT 2011
Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction
NeurIPS 2011
Empirical Risk Minimization with Approximations of Probabilistic Grammars
NeurIPS 2010