On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

count % of corpus

3 results for “root-entropy”

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropycs.LG

Study minimax regret in sequential probability assignment with and without side information.

problem Minimax regret analysis in sequential probability assignment.

method Upper and lower bounds on minimax regret using square-root entropy.

result Lower bound matches upper bound for Donsker classes, up to log factors.

minimax regret sequential probability assignment logarithmic loss square-root entropy covering numbers

2025-03-22abs ↗pdf ↗

Entropy rigidity for cusped Hitchin representationsmath.GR

Entropy rigidity theorem for cusped Hitchin representations.

problem Entropy rigidity for Hitchin representations of cusped groups.

method Introduction of (1,1,2)-hypertransverse groups and transverse representations.

result Hausdorff dimension of conical limit set agrees with simple root entropy.

entropy rigidity Hitchin representations cusped groups Hausdorff dimension conical limit set

2022-01-13abs ↗pdf ↗

Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic Regularizationstat.ML

Adapting Hedge algorithm for semi-adversarial data with root-entropy regularization.

problem Minimizing regret in prediction with expert advice under varying distributions.

method Follow-the-Regularized-Leader (FTRL) with root-entropy regularization.

result Adaptive minimax optimal regret across all levels of constraint sets.

Hedge algorithm semi-adversarial root-entropy FTRL minimax

2020-07-13abs ↗pdf ↗