Imagen de Portada

Proper losses regret at least 1/2-order

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bao, Han, Takatsu, Asuka
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A second order regret bound for NormalHedge
por: Freund, Yoav, et al.
Publicado: (2026)

On the Precise Asymptotics of Universal Inference
por: Takatsu, Kenta
Publicado: (2025)

Automated scientific minimization of regret
por: Binz, Marcel, et al.
Publicado: (2025)

Practical Efficient Global Optimization is No-regret
por: Wang, Jingyi, et al.
Publicado: (2026)

On the optimal regret of collaborative personalized linear bandits
por: Huang, Bruce, et al.
Publicado: (2025)

Linear bandits with polylogarithmic minimax regret
por: Lumbreras, Josep, et al.
Publicado: (2024)

The regret lower bound for communicating Markov Decision Processes
por: Boone, Victor, et al.
Publicado: (2025)

Asymptotically optimal regret in communicating Markov decision processes
por: Boone, Victor
Publicado: (2025)

Strategizing against No-regret Learners
por: Deng, Yuan, et al.
Publicado: (2019)

Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs
por: Maran, Davide, et al.
Publicado: (2024)

Partial Structure Discovery is Sufficient for No-regret Learning in Causal Bandits
por: Elahi, Muhammad Qasim, et al.
Publicado: (2024)

UCB algorithms for multi-armed bandits: Precise regret and adaptive inference
por: Han, Qiyang, et al.
Publicado: (2024)

Optimal No-regret Learning in Repeated First-price Auctions
por: Han, Yanjun, et al.
Publicado: (2020)

Disintegrated optimal transport for metric fiber bundles
por: Kitagawa, Jun, et al.
Publicado: (2024)

Barycenters in Disintegrated optimal transport
por: Kitagawa, Jun, et al.
Publicado: (2026)

Divergence and Deformed Exponential Family
por: Matsuzoe, Hiroshi, et al.
Publicado: (2025)

Equal area partitions of the sphere with diameter bounds, via optimal transport
por: Kitagawa, Jun, et al.
Publicado: (2023)

Sliced optimal transport: is it a suitable replacement?
por: Kitagawa, Jun, et al.
Publicado: (2023)

Learning pure quantum states (almost) without regret
por: Lumbreras, Josep, et al.
Publicado: (2024)

Optimal training-conditional regret for online conformal prediction
por: Liang, Jiadong, et al.
Publicado: (2026)

Localized exploration in contextual dynamic pricing achieves dimension-free regret
por: Chai, Jinhang, et al.
Publicado: (2024)

Proper Learnability and the Role of Unlabeled Data
por: Asilis, Julian, et al.
Publicado: (2025)

Logarithmic regret bounds for continuous-time average-reward Markov decision processes
por: Gao, Xuefeng, et al.
Publicado: (2022)

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
por: Dong, Jing, et al.
Publicado: (2024)

Proper Latent Decomposition
por: Kelshaw, Daniel, et al.
Publicado: (2024)

An $α$-regret analysis of Adversarial Bilateral Trade
por: Azar, Yossi, et al.
Publicado: (2022)

Is Risk-Sensitive Reinforcement Learning Properly Resolved?
por: Zhou, Ruiwen, et al.
Publicado: (2023)

A Proper Scoring Rule for Virtual Staining
por: Tonks, Samuel, et al.
Publicado: (2026)

Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy
por: Fujii, Kaito
Publicado: (2023)

Sample-Efficient Omniprediction for Proper Losses
por: Gibbs, Isaac, et al.
Publicado: (2025)

Proper Laplacian Representation Learning
por: Gomez, Diego, et al.
Publicado: (2023)

Equality in the logarithmic Sobolev inequality
por: Ohta, Shin-ichi, et al.
Publicado: (2019)

Pointwise confidence estimation in the non-linear $\ell^2$-regularized least squares
por: Kuzborskij, Ilja, et al.
Publicado: (2025)

Quantifying Aleatoric and Epistemic Uncertainty with Proper Scoring Rules
por: Hofman, Paul, et al.
Publicado: (2024)

Uncertainty Quantification for Regression using Proper Scoring Rules
por: Fishkov, Alexander, et al.
Publicado: (2025)

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
por: Jakob, Fabian, et al.
Publicado: (2025)

Improving Calibration by Relating Focal Loss, Temperature Scaling, and Properness
por: Komisarenko, Viacheslav, et al.
Publicado: (2024)

Better Uncertainty Calibration via Proper Scores for Classification and Beyond
por: Gruber, Sebastian G., et al.
Publicado: (2022)

Optimal sampling for least-squares approximation
por: Adcock, Ben
Publicado: (2024)

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
por: Komiyama, Junpei, et al.
Publicado: (2025)