<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (cshalizi)</title>
    <link>https://pinboard.in/u:cshalizi/public/</link>
    <description>recent bookmarks from cshalizi</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://projecteuclid.org/euclid.aos/1176348140"/>
	<rdf:li rdf:resource="http://link.springer.com/article/10.1007/s10994-013-5418-8"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1307.5944"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1304.3708"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/cs/0508127"/>
	<rdf:li rdf:resource="http://jmlr.csail.mit.edu/papers/v14/gerchinovitz13a.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1301.0534"/>
	<rdf:li rdf:resource="http://faculty.cs.gwu.edu/~cmontel/mssa11.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1207.1965"/>
	<rdf:li rdf:resource="http://normaldeviate.wordpress.com/2012/07/04/statistics-without-probability-individual-sequences/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1206.4604"/>
	<rdf:li rdf:resource="http://www.cs.bme.hu/~oti/portfolio/"/>
	<rdf:li rdf:resource="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6191328"/>
	<rdf:li rdf:resource="http://www-stat.wharton.upenn.edu/~rakhlin/courses/stat928/stat928_notes.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1204.5721"/>
	<rdf:li rdf:resource="http://www.nowpublishers.com/product.aspx?product=MAL&amp;doi=2200000018"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1202.3323"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/math/0701419"/>
	<rdf:li rdf:resource="http://www.princeton.edu/~sbubeck/BubeckLectureNotes.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1111.6337"/>
	<rdf:li rdf:resource="http://jmlr.csail.mit.edu/proceedings/papers/v15/saha11a.html"/>
	<rdf:li rdf:resource="http://jmlr.csail.mit.edu/proceedings/papers/v15/odalric11a.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1110.2755"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1110.2529"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1106.2436"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1103.0949"/>
	<rdf:li rdf:resource="http://jmlr.csail.mit.edu/papers/v12/vyugin11a.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1011.3168"/>
	<rdf:li rdf:resource="http://infostructuralist.wordpress.com/2010/11/05/divergence-in-everything-bounding-the-regret-in-online-optimization/"/>
	<rdf:li rdf:resource="http://www.springerlink.com/content/68386v04t03752n1/"/>
	<rdf:li rdf:resource="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1327806"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://projecteuclid.org/euclid.aos/1176348140">
    <title>Foster : Prediction in the Worst Case</title>
    <dc:date>2016-04-16T13:14:27+00:00</dc:date>
    <link>http://projecteuclid.org/euclid.aos/1176348140</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["A predictor is a method of estimating the probability of future events over an infinite data sequence. One predictor is as strong as another if for all data sequences the former has at most the mean square error (MSE) of the latter. Given any countable set 𝒟 of predictors, we explicitly construct a predictor S that is at least as strong as every element of 𝒟. Finite sample bounds are also given which hold uniformly on the space of all possible data."]]></description>
<dc:subject>to:NB individual_sequence_prediction low-regret_learning prediction ensemble_methods have_read foster.dean_p. statistics calibration</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:371d45a2bee5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ensemble_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:foster.dean_p."/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:calibration"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://link.springer.com/article/10.1007/s10994-013-5418-8">
    <title>Regret bounded by gradual variation for online convex optimization - Machine Learning</title>
    <dc:date>2014-04-07T12:12:40+00:00</dc:date>
    <link>http://link.springer.com/article/10.1007/s10994-013-5418-8</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Recently, it has been shown that the regret of the Follow the Regularized Leader (FTRL) algorithm for online linear optimization can be bounded by the total variation of the cost vectors rather than the number of rounds. In this paper, we extend this result to general online convex optimization. In particular, this resolves an open problem that has been posed in a number of recent papers. We first analyze the limitations of the FTRL algorithm as proposed by Hazan and Kale (in Machine Learning 80(2–3), 165–188, 2010) when applied to online convex optimization, and extend the definition of variation to a gradual variation which is shown to be a lower bound of the total variation. We then present two novel algorithms that bound the regret by the gradual variation of cost functions. Unlike previous approaches that maintain a single sequence of solutions, the proposed algorithms maintain two sequences of solutions that make it possible to achieve a variation-based regret bound for online convex optimization.
"To establish the main results, we discuss a lower bound for FTRL that maintains only one sequence of solutions, and a necessary condition on smoothness of the cost functions for obtaining a gradual variation bound. We extend the main results three-fold: (i) we present a general method to obtain a gradual variation bound measured by general norm; (ii) we extend algorithms to a class of online non-smooth optimization with gradual variation bound; and (iii) we develop a deterministic algorithm for online bandit optimization in multipoint bandit setting."]]></description>
<dc:subject>to_read learning_theory low-regret_learning individual_sequence_prediction optimization re:growing_ensemble_project in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:63c75a023a08/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1307.5944">
    <title>[1307.5944] Online Optimization in Dynamic Environments</title>
    <dc:date>2013-07-24T12:19:05+00:00</dc:date>
    <link>http://arxiv.org/abs/1307.5944</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Online optimization methods are often designed to have a total accumulated loss comparable to that achievable by some comparator, such as a batch algorithm with access to all the data and infinite computational resources. In many settings, this comparator is allowed to vary with time, and the associated "tracking regret" bounds scale with the overall variation of the comparator sequence. However, in practical scenarios ranging from motion imagery to network analysis, the environment is nonstationary and comparator sequences with small variation are quite weak, resulting in large losses. This paper describes a "dynamic mirror descent" method which addresses this challenge, yielding low regrets bounds for comparators with small deviations from a given dynamical model. This approach is then used within a broader class of online learning methods to simultaneously track the best dynamical model and form predictions based on that model. This concept is demonstrated empirically in the context of sequential compressed sensing of a dynamic scene, solar flare detection from satellite data with missing elements, and tracking a dynamic social network."]]></description>
<dc:subject>low-regret_learning non-stationarity time_series prediction individual_sequence_prediction heard_the_talk re:growing_ensemble_project have_read in_NB willett.rebecca_m.</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:cee6cdfb34f9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:non-stationarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:heard_the_talk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:willett.rebecca_m."/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1304.3708">
    <title>[1304.3708] Advice-Efficient Prediction with Expert Advice</title>
    <dc:date>2013-04-23T18:11:18+00:00</dc:date>
    <link>http://arxiv.org/abs/1304.3708</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are allowed to ask for advice of a limited number $M$ out of $N$ experts. This setting is especially interesting when asking for advice of every expert on every round is expensive. We present an algorithm for advice-efficient prediction with expert advice that achieves $O(\sqrt{\frac{N}{M}T\ln N})$ regret on $T$ rounds of the game."]]></description>
<dc:subject>low-regret_learning individual_sequence_prediction re:growing_ensemble_project in_NB bartlett.peter_l.</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:f69f84a4e327/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:bartlett.peter_l."/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/cs/0508127">
    <title>[cs/0508127] On context-tree prediction of individual sequences</title>
    <dc:date>2013-04-13T22:10:47+00:00</dc:date>
    <link>http://arxiv.org/abs/cs/0508127</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Motivated by the evident success of context-tree based methods in lossless data compression, we explore, in this paper, methods of the same spirit in universal prediction of individual sequences. By context-tree prediction, we refer to a family of prediction schemes, where at each time instant $t$, after having observed all outcomes of the data sequence $x_1,...,x_{t-1}$, but not yet $x_t$, the prediction is based on a ``context'' (or a state) that consists of the $k$ most recent past outcomes $x_{t-k},...,x_{t-1}$, where the choice of $k$ may depend on the contents of a possibly longer, though limited, portion of the observed past, $x_{t-k_{\max}},...x_{t-1}$. This is different from the study reported in [1], where general finite-state predictors as well as ``Markov'' (finite-memory) predictors of fixed order, were studied in the regime of individual sequences. 
"Another important difference between this study and [1] is the asymptotic regime. While in [1], the resources of the predictor (i.e., the number of states or the memory size) were kept fixed regardless of the length $N$ of the data sequence, here we investigate situations where the number of contexts or states is allowed to grow concurrently with $N$. We are primarily interested in the following fundamental question: What is the critical growth rate of the number of contexts, below which the performance of the best context-tree predictor is still universally achievable, but above which it is not? We show that this critical growth rate is linear in $N$. In particular, we propose a universal context-tree algorithm that essentially achieves optimum performance as long as the growth rate is sublinear, and show that, on the other hand, this is impossible in the linear case."]]></description>
<dc:subject>to:NB information_theory prediction individual_sequence_prediction markov_models re:AoS_project variable-length_markov_models_aka_context_trees</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:54fe82cb3afa/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:information_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:markov_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:AoS_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:variable-length_markov_models_aka_context_trees"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jmlr.csail.mit.edu/papers/v14/gerchinovitz13a.html">
    <title>Sparsity Regret Bounds for Individual Sequences in Online Linear Regression</title>
    <dc:date>2013-04-08T01:52:53+00:00</dc:date>
    <link>http://jmlr.csail.mit.edu/papers/v14/gerchinovitz13a.html</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We consider the problem of online linear regression on arbitrary deterministic sequences when the ambient dimension d can be much larger than the number of time rounds T. We introduce the notion of sparsity regret bound, which is a deterministic online counterpart of recent risk bounds derived in the stochastic setting under a sparsity scenario. We prove such regret bounds for an online-learning algorithm called SeqSEW and based on exponential weighting and data-driven truncation. In a second part we apply a parameter-free version of this algorithm to the stochastic setting (regression model with random design). This yields risk bounds of the same flavor as in Dalalyan and Tsybakov (2012a) but which solve two questions left open therein. In particular our risk bounds are adaptive (up to a logarithmic factor) to the unknown variance of the noise if the latter is Gaussian. We also address the regression model with fixed design."]]></description>
<dc:subject>low-regret_learning individual_sequence_prediction regression machine_learning sparsity in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:d7456f1f12b0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:regression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:sparsity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1301.0534">
    <title>[1301.0534] Follow the Leader If You Can, Hedge If You Must</title>
    <dc:date>2013-01-07T23:07:12+00:00</dc:date>
    <link>http://arxiv.org/abs/1301.0534</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Follow-the-Leader (FTL) is an intuitive sequential prediction strategy that guarantees constant regret in the stochastic setting, but has terrible performance for worst-case data. Other hedging strategies have better worst-case guarantees but may perform much worse than FTL if the data are not maximally adversarial. We introduce the FlipFlop algorithm, which is the first method that provably combines the best of both worlds. 
"As part of our construction, we develop AdaHedge, which is a new way of dynamically tuning the learning rate in Hedge without using the doubling trick. AdaHedge refines a method by Cesa-Bianchi, Mansour and Stoltz (2007), yielding slightly improved worst-case guarantees. By interleaving AdaHedge and FTL, the FlipFlop algorithm achieves regret within a constant factor of the FTL regret, without sacrificing AdaHedge's worst-case guarantees. 
"AdaHedge and FlipFlop do not need to know the range of the losses in advance; moreover, unlike earlier methods, both have the intuitive property that the issued weights are invariant under rescaling and translation of the losses. The losses are also allowed to be negative, in which case they may be interpreted as gains."]]></description>
<dc:subject>to_read individual_sequence_prediction low-regret_learning learning_theory re:growing_ensemble_project grunwald.peter in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:46c837991e65/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:grunwald.peter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://faculty.cs.gwu.edu/~cmontel/mssa11.pdf">
    <title>TRACKING CLIMATE MODELS</title>
    <dc:date>2012-11-19T23:36:13+00:00</dc:date>
    <link>http://faculty.cs.gwu.edu/~cmontel/mssa11.pdf</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Climate models are complex mathematical models designed by meteorologists, geophysicists, and climate scientists, and run as computer simulations, to predict climate. There is currently high variance among the predictions of 20 global climate models, from various laboratories around the world, that inform the Intergovernmental Panel on Climate Change (IPCC). Given temperature predictions from 20 IPCC global climate models, and over 100 years of historical temperature data, we track the changing sequence of which model predicts best at any given time. We use an algorithm due to Monteleoni and Jaakkola that models the sequence of observations using a hierarchical learner, based on a set of generalized Hidden Markov Models, where the identity of the current best climate model is the hidden variable. The transition probabilities between climate models are learned online, simultaneous to tracking the temperature predictions.
"On historical global mean temperature data, our online learning algorithm’s average prediction loss nearly matches that of the best performing climate model in hindsight. Moreover its performance surpasses that of the average model prediction, which is the default practice in climate science, the median prediction, and least squares linear regression. We also experimented on climate model predictions through the year 2098. Simulating labels with the predictions of any one climate model, we found significantly improved performance using our online learning algorithm with respect to the other climate models, and techniques. To complement our global results, we also ran experiments on IPCC global climate model temperature predictions for the specific geographic regions of Africa, Europe, and North America. On historical data, at both annual and monthly time-scales, and in future simulations, our algorithm typically outperformed both the best climate model per region, and linear regression. Notably, our algorithm consistently outperformed the average prediction over models, the current benchmark."

--- Appears to supersede the MS. of the same title at http://www1.ccls.columbia.edu/~cmontel/mss10.pdf

--- Re teaching in "Data over Space and Time", I'm mostly thinking of the data sets.]]></description>
<dc:subject>re:growing_ensemble_project non-stationarity time_series climate_change statistics individual_sequence_prediction monteleoni.claire in_NB have_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:6c35cd76ad26/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:non-stationarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:climate_change"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:monteleoni.claire"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1207.1965">
    <title>[1207.1965] Forecasting electricity consumption by aggregating specialized experts</title>
    <dc:date>2012-07-10T10:31:56+00:00</dc:date>
    <link>http://arxiv.org/abs/1207.1965</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We consider the setting of sequential prediction of arbitrary sequences based on specialized experts. We first provide a review of the relevant literature and present two theoretical contributions: a general analysis of the specialist aggregation rule of Freund et al. (1997) and an adaptation of fixed-share rules of Herbster and Warmuth (1998) in this setting. We then apply these rules to the sequential short-term (one-day-ahead) forecasting of electricity consumption; to do so, we consider two data sets, a Slovakian one and a French one, respectively concerned with hourly and half-hourly predictions. We follow a general methodology to perform the stated empirical studies and detail in particular tuning issues of the learning parameters. The introduced aggregation rules demonstrate an improved accuracy on the data sets at hand; the improvements lie in a reduced mean squared error but also in a more robust behavior with respect to large occasional errors."]]></description>
<dc:subject>have_read individual_sequence_prediction online_learning mixture_models machine_learning prediction re:growing_ensemble_project in_NB to:blog</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:aeab63e18d74/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixture_models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:blog"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://normaldeviate.wordpress.com/2012/07/04/statistics-without-probability-individual-sequences/">
    <title>Statistics Without Probability (Individual Sequences) « Normal Deviate</title>
    <dc:date>2012-07-04T15:39:26+00:00</dc:date>
    <link>http://normaldeviate.wordpress.com/2012/07/04/statistics-without-probability-individual-sequences/</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>individual_sequence_prediction kith_and_kin wasserman.larry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:99246af55a1e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:kith_and_kin"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:wasserman.larry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1206.4604">
    <title>[1206.4604] Learning the Experts for Online Sequence Prediction</title>
    <dc:date>2012-06-23T13:45:07+00:00</dc:date>
    <link>http://arxiv.org/abs/1206.4604</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Online sequence prediction is the problem of predicting the next element of a sequence given previous elements. This problem has been extensively studied in the context of individual sequence prediction, where no prior assumptions are made on the origin of the sequence. Individual sequence prediction algorithms work quite well for long sequences, where the algorithm has enough time to learn the temporal structure of the sequence. However, they might give poor predictions for short sequences. A possible remedy is to rely on the general model of prediction with expert advice, where the learner has access to a set of $r$ experts, each of which makes its own predictions on the sequence. It is well known that it is possible to predict almost as well as the best expert if the sequence length is order of $log(r)$. But, without firm prior knowledge on the problem, it is not clear how to choose a small set of {em good} experts. In this paper we describe and analyze a new algorithm that learns a good set of experts using a training set of previously observed sequences. We demonstrate the merits of our approach by applying it on the task of click prediction on the web."]]></description>
<dc:subject>to_read re:growing_ensemble_project individual_sequence_prediction machine_learning time_series online_learning in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:8e7e455d30c4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.bme.hu/~oti/portfolio/">
    <title>Log-optimal portfolio</title>
    <dc:date>2012-06-22T20:00:15+00:00</dc:date>
    <link>http://www.cs.bme.hu/~oti/portfolio/</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["The purpose of this site is to collect results (papers, programs) of Portfolio Group (László Györfi, Gábor Gelencsér, György Ottucsák, András Urbán and István Vajda) at Budapest University of Technology and Economics which are closely connected to sequential investment strategies for financial markets. 
"Investment strategies are allowed to use information collected from the past of the market and determine, at the beginning of a trading period, a portfolio, that is, a way to distribute their current capital among the available assets. The goal of the investor is to maximize his wealth on the long run without knowing the underlying distribution generating the stock prices. Since accurate statistical modeling of stock market behavior has been known as a notoriously difficult problem, we take an extreme point of view and work with minimal assumptions on the distribution of the time series. In fact, the only assumption that we use in our mathematical analysis is that the daily price relatives form a stationary and ergodic process. Under this assumption the asymptotic rate of growth has a well-defined maximum which can be achieved in full knowledge of the distribution of the entire process. The fundamental limits reveal that the so-called log-optimal portfolio is the best possible choice."]]></description>
<dc:subject>to:NB individual_sequence_prediction prediction machine_learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:577a909a059c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6191328">
    <title>Interior-Point Methods for Full-Information and Bandit Online Learning</title>
    <dc:date>2012-06-12T22:03:59+00:00</dc:date>
    <link>http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6191328</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We study the problem of predicting individual sequences with linear loss with full and partial (or bandit) feedback. Our main contribution is the first efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal ${tilde{O}}(sqrt{T})$ regret. In addition, for the full-information setting, we give a novel regret minimization algorithm. These results are made possible by the introduction of interior-point methods for convex optimization to online learning."]]></description>
<dc:subject>to:NB individual_sequence_prediction optimization machine_learning rakhlin.sasha re:growing_ensemble_project bandit_problems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:0f20090d6199/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:rakhlin.sasha"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:bandit_problems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www-stat.wharton.upenn.edu/~rakhlin/courses/stat928/stat928_notes.pdf">
    <title>Statistical Learning Theory and Sequential Prediction</title>
    <dc:date>2012-06-05T12:24:22+00:00</dc:date>
    <link>http://www-stat.wharton.upenn.edu/~rakhlin/courses/stat928/stat928_notes.pdf</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[Rakhlin + Sridharan; apparently (?) the summer tome for the statistical learning reading group.]]></description>
<dc:subject>to_read statistics machine_learning learning_theory optimization learning_in_games low-regret_learning individual_sequence_prediction regression classifiers empirical_processes ensemble_methods online_learning in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:92e251d24aeb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_in_games"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:regression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:classifiers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ensemble_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1204.5721">
    <title>[1204.5721] Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems</title>
    <dc:date>2012-04-26T03:12:16+00:00</dc:date>
    <link>http://arxiv.org/abs/1204.5721</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Multi-armed bandit problems are the most basic examples of sequential decision problems with an exploration-exploitation trade-off. This is the balance between staying with the option that gave highest payoffs in the past and exploring new options that might give higher payoffs in the future. Although the study of bandit problems dates back to the Thirties, exploration-exploitation trade-offs arise in several modern applications, such as ad placement, website optimization, and packet routing. Mathematically, a multi-armed bandit is defined by the payoff process associated with each option. In this survey, we focus on two extreme cases in which the analysis of regret is particularly simple and elegant: i.i.d. payoffs and adversarial payoffs. Besides the basic setting of finitely many actions, we also analyze some of the most important variants and extensions, such as the contextual bandit model."]]></description>
<dc:subject>to:NB individual_sequence_prediction online_learning bandit_problems re:knightian_uncertainty low-regret_learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:631fe225f62c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:bandit_problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:knightian_uncertainty"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nowpublishers.com/product.aspx?product=MAL&amp;doi=2200000018">
    <title>Online Learning and Online Convex Optimization</title>
    <dc:date>2012-03-30T14:24:09+00:00</dc:date>
    <link>http://www.nowpublishers.com/product.aspx?product=MAL&amp;doi=2200000018</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["Online learning is a well established learning paradigm which has both theoretical and practical appeals. The goal of online learning is to make a sequence of accurate predictions given knowledge of the correct answer to previous prediction tasks and possibly additional available information. Online learning has been studied in several research fields including game theory, information theory, and machine learning. It also became of great interest to practitioners due the recent emergence of large scale applications such as online advertisement placement and online web ranking. In this survey we provide a modern overview of online learning. Our goal is to give the reader a sense of some of the interesting ideas and in particular to underscore the centrality of convexity in deriving efficient online learning algorithms. We do not mean to be comprehensive but rather to give a high-level, rigorous yet easy to follow, survey."

Ungated version (via shivak): http://www.cs.huji.ac.il/~shais/papers/OLsurvey.pdf]]></description>
<dc:subject>online_learning individual_sequence_prediction optimization learning_theory machine_learning learning_in_games low-regret_learning in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:c9de70393195/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_in_games"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1202.3323">
    <title>[1202.3323] A new look at shifting regret</title>
    <dc:date>2012-02-29T18:16:29+00:00</dc:date>
    <link>http://arxiv.org/abs/1202.3323</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[We investigate extensions of well-known online learning algorithms such as fixed-share of Herbster and Warmuth (1998) or the methods proposed by Bousquet and Warmuth (2002). These algorithms use weight sharing schemes to perform as well as the best sequence of experts with a limited number of changes. Here we show, with a common, general, and simpler analysis, that weight sharing in fact achieves much more than what it was designed for. We use it to simultaneously prove new shifting regret bounds for online convex optimization on the simplex in terms of the total variation distance as well as new bounds for the related setting of adaptive regret. Finally, we exhibit the first logarithmic shifting bounds for exp-concave loss functions on the simplex.]]></description>
<dc:subject>online_learning to_read individual_sequence_prediction non-stationarity re:growing_ensemble_project in_NB low-regret_learning have_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:ade1de531f10/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:non-stationarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/math/0701419">
    <title>[math/0701419] Strategies for prediction under imperfect monitoring</title>
    <dc:date>2012-02-21T04:13:36+00:00</dc:date>
    <link>http://arxiv.org/abs/math/0701419</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but rather to a feedback signal. The proposed strategies are consistent in the sense that they achieve, asymptotically, the best possible average reward. It was Rustichini (1999) who first proved the existence of such consistent predictors. The forecasters presented here offer the first constructive proof of consistency. Moreover, the proposed algorithms are computationally efficient. We also establish upper bounds for the rates of convergence. In the case of deterministic feedback, these rates are optimal up to logarithmic terms."]]></description>
<dc:subject>to:NB prediction individual_sequence_prediction learning_in_games re:growing_ensemble_project</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:8a46f026681f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_in_games"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.princeton.edu/~sbubeck/BubeckLectureNotes.pdf">
    <title>Introduction to Online Optimization (Bubeck)</title>
    <dc:date>2011-12-23T21:22:29+00:00</dc:date>
    <link>http://www.princeton.edu/~sbubeck/BubeckLectureNotes.pdf</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["to_teach" tag a sudden brainstorm for how to make next year's statistical computing class either unbeatably awesome or an absolute disaster]]></description>
<dc:subject>online_learning regression individual_sequence_prediction optimization machine_learning learning_theory via:mraginsky to_read to_teach:statcomp re:freshman_seminar_on_optimization in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:5b8e6bad6c1d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:regression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:via:mraginsky"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:statcomp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:freshman_seminar_on_optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1111.6337">
    <title>[1111.6337] Regret Bound by Variation for Online Convex Optimization</title>
    <dc:date>2011-12-01T14:04:08+00:00</dc:date>
    <link>http://arxiv.org/abs/1111.6337</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In citep{Hazan-2008-extract}, the authors showed that the regret of online linear optimization can be bounded by the total variation of the cost vectors. In this paper, we extend this result to general online convex optimization. We first analyze the limitations of the algorithm in citep{Hazan-2008-extract} when applied it to online convex optimization. We then present two algorithms for online convex optimization whose regrets are bounded by the variation of cost functions. We finally consider the bandit setting, and present a randomized algorithm for online bandit convex optimization with a variation-based regret bound. We show that the regret bound for online bandit convex optimization is optimal when the variation of cost functions is independent of the number of trials."]]></description>
<dc:subject>to_read re:growing_ensemble_project learning_theory individual_sequence_prediction in_NB bandit_problems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:2dacf3479f48/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:bandit_problems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jmlr.csail.mit.edu/proceedings/papers/v15/saha11a.html">
    <title>Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback</title>
    <dc:date>2011-11-01T12:20:50+00:00</dc:date>
    <link>http://jmlr.csail.mit.edu/proceedings/papers/v15/saha11a.html</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[The study of online convex optimization in the bandit setting was initiated by Kleinberg (2004) and Flaxman et al. (2005). Such a setting models a decision maker that has to make decisions in the face of adversarially chosen convex loss functions. Moreover, the only information the decision maker receives are the losses. The identity of the loss functions themselves is not revealed. In this setting, we reduce the gap between the best known lower and upper bounds for the class of smooth convex functions, i.e. convex functions with a Lipschitz continuous gradient. Building upon existing work on self-concordant regularizers and one-point gradient estimation, we give the first algorithm whose expected regret, ignoring constant and logarithmic factors, is O(T^{2/3}). ]]></description>
<dc:subject>decision_theory learning_theory machine_learning bandit_problems individual_sequence_prediction in_NB tewari.ambuj low-regret_learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:3c23a4b198f1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:decision_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:bandit_problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:tewari.ambuj"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jmlr.csail.mit.edu/proceedings/papers/v15/odalric11a.html">
    <title>Adaptive Bandits: Towards the Best History-Dependent Strategy</title>
    <dc:date>2011-11-01T12:19:19+00:00</dc:date>
    <link>http://jmlr.csail.mit.edu/proceedings/papers/v15/odalric11a.html</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We consider multi-armed bandit games with possibly adaptive opponents. We introduce models Theta of constraints based on equivalence classes on the common history (information shared by the player and the opponent) which define two learning scenarios: (1) The opponent is constrained, i.e.~he provides rewards that are stochastic functions of equivalence classes defined by some model theta* in Theta. The regret is measured with respect to (w.r.t.) the best history-dependent strategy. (2) The opponent is arbitrary and we measure the regret w.r.t.~the best strategy among all mappings from classes to actions (i.e.~the best history-class-based strategy) for the best model in Theta. This allows to model opponents (case 1) or strategies (case 2) which handles finite memory, periodicity, standard stochastic bandits and other situations. When Theta={theta}, i.e.~only one model is considered, we derive tractable algorithms achieving a tight regret (at time T) bounded by tilde O(sqrt{TAC}), where C is the number of classes of theta. Now, when many models are available, all known algorithms achieving a nice regret O(sqrt{T}) are unfortunately not tractable and scale poorly with the number of models $|Theta|$. Our contribution here is to provide tractable algorithms with regret bounded by T^{2/3}C^{1/3}log(|Theta|)^{1/2}. "]]></description>
<dc:subject>to:NB decision_theory learning_theory machine_learning bandit_problems individual_sequence_prediction</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:1b31392c16b9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to:NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:decision_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:bandit_problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1110.2755">
    <title>[1110.2755] Efficient Tracking of Large Classes of Experts</title>
    <dc:date>2011-10-13T12:35:00+00:00</dc:date>
    <link>http://arxiv.org/abs/1110.2755</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["In the framework for prediction of individual sequences, sequential prediction methods are to be constructed that perform nearly as well as the best expert from a given class. We consider prediction strategies that compete with the class of switching strategies that can segment a given sequence into several blocks, and follow the advice of a different "base" expert in each block. As usual, the performance of the algorithm is measured by the regret defined as the excess loss relative to the best switching strategy %(with an arbitrary number of switches) selected in hindsight for the particular sequence to be predicted. In this paper we construct %strongly sequential (i.e., horizon-independent) prediction strategies of low computational cost for the case where the set of base experts is large. In particular we derive a family of efficient tracking algorithms that, for any prediction algorithm $A$ designed for the base class, can be implemented with time and space complexity $O(n^{gamma} log n)$ times larger than that of $A$, where $n$ is the time horizon and $gamma ge 0$ is a parameter of the algorithm. With $A$ properly chosen, our algorithm achieves a regret bound of optimal order for $gamma>0$, and only $O(log n)$ times larger than the optimal order for $gamma=0$ for all typical regret bound types we examined. For example, for predicting binary sequences with switching parameters, our method achieves the optimal $O(log n)$ regret rate with time complexity $O(n^{1+gamma}log n)$ for any $gammain (0,1)$."]]></description>
<dc:subject>to_read re:growing_ensemble_project learning_theory individual_sequence_prediction lugosi.gabor in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:80aeab90a23a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:lugosi.gabor"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1110.2529">
    <title>[1110.2529] The Generalization Ability of Online Algorithms for Dependent Data</title>
    <dc:date>2011-10-13T12:33:26+00:00</dc:date>
    <link>http://arxiv.org/abs/1110.2529</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["We study the generalization performance of arbitrary online learning algorithms trained on samples coming from a dependent source of data. We show that the generalization error of any stable online algorithm concentrates around its regret--an easily computable statistic of the online performance of the algorithm--when the underlying ergodic process is $beta$- or $phi$-mixing. We show high probability error bounds assuming the loss function is convex, and we also establish sharp convergence rates and deviation bounds for strongly convex losses and several linear prediction problems such as linear and logistic regression, least-squares SVM, and boosting on dependent data. In addition, our results have straightforward applications to stochastic optimization with dependent data, and our analysis requires only martingale convergence arguments; we need not rely on more powerful statistical tools such as empirical process theory."]]></description>
<dc:subject>learning_theory individual_sequence_prediction ergodic_theory mixing re:growing_ensemble_project re:XV_for_mixing stability_of_learning concentration_of_measure have_read re:your_favorite_dsge_sucks in_NB</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:cshalizi/b:0891bd9c9846/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ergodic_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:XV_for_mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:stability_of_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1106.2436">
    <title>[1106.2436] From Bandits to Experts: On the Value of Side-Observations</title>
    <dc:date>2011-06-16T04:05:48+00:00</dc:date>
    <link>http://arxiv.org/abs/1106.2436</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>learning_theory individual_sequence_prediction to_read bandit_problems in_NB</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:b448f550879f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:bandit_problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1103.0949">
    <title>[1103.0949] Adapting to Non-stationarity with Growing Expert Ensembles</title>
    <dc:date>2011-03-07T01:28:00+00:00</dc:date>
    <link>http://arxiv.org/abs/1103.0949</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>self-promotion individual_sequence_prediction non-stationarity re:growing_ensemble_project ensemble_methods time_series to_teach:data_over_space_and_time</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:f2d8cecf5a2c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:self-promotion"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:non-stationarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ensemble_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:time_series"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:to_teach:data_over_space_and_time"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jmlr.csail.mit.edu/papers/v12/vyugin11a.html">
    <title>Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm</title>
    <dc:date>2011-02-04T07:36:05+00:00</dc:date>
    <link>http://jmlr.csail.mit.edu/papers/v12/vyugin11a.html</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>individual_sequence_prediction online_learning learning_theory re:growing_ensemble_project in_NB low-regret_learning</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:cd208d1b9202/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:in_NB"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1011.3168">
    <title>[1011.3168] Online Learning: Beyond Regret</title>
    <dc:date>2010-11-21T23:07:17+00:00</dc:date>
    <link>http://arxiv.org/abs/1011.3168</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>individual_sequence_prediction learning_theory calibration prediction have_read</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:96de5e39b805/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:calibration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://infostructuralist.wordpress.com/2010/11/05/divergence-in-everything-bounding-the-regret-in-online-optimization/">
    <title>Divergence in everything: bounding the regret in online optimization « The Information Structuralist</title>
    <dc:date>2010-11-21T23:05:18+00:00</dc:date>
    <link>http://infostructuralist.wordpress.com/2010/11/05/divergence-in-everything-bounding-the-regret-in-online-optimization/</link>
    <dc:creator>cshalizi</dc:creator><dc:subject>information_theory individual_sequence_prediction online_learning raginsky.maxim have_read</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:d63f6e631541/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:information_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:raginsky.maxim"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.springerlink.com/content/68386v04t03752n1/">
    <title>Extracting certainty from uncertainty: regret bounded by variation in costs</title>
    <dc:date>2010-07-21T15:19:22+00:00</dc:date>
    <link>http://www.springerlink.com/content/68386v04t03752n1/</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA[Cool, but not sure it works really for our setting.
]]></description>
<dc:subject>learning_theory individual_sequence_prediction ensemble_methods re:growing_ensemble_project have_read</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:fc1525f12ba1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ensemble_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:growing_ensemble_project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1327806">
    <title>IEEE Xplore - On the generalization ability of on-line learning algorithms</title>
    <dc:date>2010-07-01T14:15:30+00:00</dc:date>
    <link>http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1327806</link>
    <dc:creator>cshalizi</dc:creator><description><![CDATA["how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on [IID data]. ... a simple large deviation argument [proves] tight data-dependent bounds for the risk of this hypothesis in terms of an easily computable statistic Mn associated with the on-line performance of the ensemble. Via sharp pointwise bounds on Mn, we then obtain risk tail bounds for kernel perceptron algorithms in terms of the spectrum of the empirical kernel matrix. ... A distinctive feature of our approach is that the key tools for our analysis come from the model of prediction of individual sequences; i.e., a model making no probabilistic assumptions on the source generating the data. In fact, these tools turn out to be so powerful that we only need very elementary statistical facts to obtain our final risk bounds."  Bounced off this 2004; try again.
]]></description>
<dc:subject>learning_theory large_deviations online_learning individual_sequence_prediction via:djm1107 re:your_favorite_dsge_sucks re:XV_for_mixing ensemble_methods have_read low-regret_learning</dc:subject>
<dc:identifier>https://pinboard.in/u:cshalizi/b:45e79ffb4005/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:large_deviations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:individual_sequence_prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:via:djm1107"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:your_favorite_dsge_sucks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:re:XV_for_mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:ensemble_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:have_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:cshalizi/t:low-regret_learning"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>