Pages that link to "Item:Q5945695"

The following pages link to Relative loss bounds for on-line density estimation with the exponential family of distributions (Q5945695):

Displayed 32 items.

• Adaptive and optimal online linear regression on \(\ell^1\)-balls (Q391734) ‎ (← links)
• Learning noisy linear classifiers via adaptive and selective sampling (Q413852) ‎ (← links)
• Weighted last-step min-max algorithm with improved sub-logarithmic regret (Q465257) ‎ (← links)
• Kernelization of matrix updates, when and how? (Q465262) ‎ (← links)
• A generalized online mirror descent with applications to classification and regression (Q493737) ‎ (← links)
• Classification into Kullback-Leibler balls in exponential families (Q739585) ‎ (← links)
• Leading strategies in competitive on-line prediction (Q950203) ‎ (← links)
• A primal-dual perspective of online learning algorithms (Q1009218) ‎ (← links)
• Adaptive and self-confident on-line learning algorithms (Q1604218) ‎ (← links)
• Relative expected instantaneous loss bounds (Q1604219) ‎ (← links)
• Smooth calibration, leaky forecasts, finite recall, and Nash dynamics (Q1753290) ‎ (← links)
• A quasi-Bayesian perspective to online clustering (Q1786586) ‎ (← links)
• Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory (Q1879959) ‎ (← links)
• Deformed statistics Kullback-Leibler divergence minimization within a scaled Bregman framework (Q1928038) ‎ (← links)
• Multiclass classification with bandit feedback using adaptive regularization (Q1945036) ‎ (← links)
• Sequential model aggregation for production forecasting (Q2009841) ‎ (← links)
• Exact minimax risk for linear least squares, and the lower tail of sample covariance matrices (Q2091833) ‎ (← links)
• Suboptimality of constrained least squares and improvements via non-linear predictors (Q2108490) ‎ (← links)
• Distribution-free robust linear regression (Q2113267) ‎ (← links)
• Computing statistical divergences with sigma points (Q2117925) ‎ (← links)
• Learning rates of gradient descent algorithm for classification (Q2519710) ‎ (← links)
• An Upper Bound for Aggregating Algorithm for Regression with Changing Dependencies (Q2830280) ‎ (← links)
• Online regularized generalized gradient classification algorithms (Q3110496) ‎ (← links)
• Aggregating Algorithm for a Space of Analytic Functions (Q3529922) ‎ (← links)
• New aspects of Bregman divergence in regression and classification with parametric and nonparametric estimation (Q3636244) ‎ (← links)
• (Q4558560) ‎ (← links)
• (Q4637035) ‎ (← links)
• Monte Carlo Information-Geometric Structures (Q4967756) ‎ (← links)
• On the Bias, Risk, and Consistency of Sample Means in Multi-armed Bandits (Q5018902) ‎ (← links)
• Quasiconvex Jensen Divergences and Quasiconvex Bregman Divergences (Q5021900) ‎ (← links)
• (Q5054630) ‎ (← links)
• Online Learning Based on Online DCA and Application to Online Classification (Q5131197) ‎ (← links)