Logarithmic regret algorithms for online convex optimization (Q1009221): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10994-007-5016-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2129160848
@@ Property / OpenAlex ID: W2129160848 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal portfolios with and without transaction costs.
+Normal rank
@@ Property / cites work @@
+Communicating Sequential Processes. The First 25 Years
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Prediction, Learning, and Games
@@ Property / cites work: Prediction, Learning, and Games / rank @@
+Normal rank
@@ Property / cites work @@
+Universal Portfolios
@@ Property / cites work: Universal Portfolios / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic nonstationary optimization for finding universal portfolios
+Normal rank
@@ Property / cites work @@
+Q3245635
@@ Property / cites work: Q3245635 / rank @@
+Normal rank
@@ Property / cites work @@
+.1162/153244303321897672
@@ Property / cites work: 10.1162/153244303321897672 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for online decision problems
@@ Property / cites work: Efficient algorithms for online decision problems / rank @@
+Normal rank
@@ Property / cites work @@
+Relative loss bounds for multidimensional regression problems
+Normal rank
@@ Property / cites work @@
+Applications of second-order cone programming
@@ Property / cites work: Applications of second-order cone programming / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for minimizing convex functions over convex sets
+Normal rank