<?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 (shivak)</title>
    <link>https://pinboard.in/u:shivak/public/</link>
    <description>recent bookmarks from shivak</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://jmlr.csail.mit.edu/papers/v13/rubinstein12a.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1202.3323"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1202.4970v1"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1101.4446"/>
	<rdf:li rdf:resource="http://webee.technion.ac.il/people/shie/public/papers/J_XuCaramMannorSparse11.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1111.6026"/>
	<rdf:li rdf:resource="http://www-personal.umich.edu/~romanv/papers/pv-tessellations.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1111.2450"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1111.1546"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1110.2392"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1109.5647"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1109.4299"/>
	<rdf:li rdf:resource="http://ttic.uchicago.edu/~nati/Publications/HaKoSr11.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1108.4856"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1101.1057"/>
	<rdf:li rdf:resource="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5961831"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1107.4080"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1106.2429"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1104.5070"/>
	<rdf:li rdf:resource="http://www.cs.princeton.edu/~satyen/papers/var-journal.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1104.1672"/>
	<rdf:li rdf:resource="http://eccc.hpi-web.de/report/2011/063/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1002.4862"/>
	<rdf:li rdf:resource="http://www.acm.caltech.edu/~jtropp/conf/Tro10-Sparsity-Gap.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1012.5533"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0911.4108"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1012.0210"/>
	<rdf:li rdf:resource="http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/HLW06/hlw06.pdf"/>
	<rdf:li rdf:resource="http://eccc.hpi-web.de/report/2010/182/"/>
	<rdf:li rdf:resource="http://www.cs.berkeley.edu/~alekh/sparselb.pdf"/>
	<rdf:li rdf:resource="http://projecteuclid.org/euclid.bj/1290092911"/>
	<rdf:li rdf:resource="http://www-stat.wharton.upenn.edu/~rakhlin/papers/online_learning.pdf"/>
	<rdf:li rdf:resource="http://www-stat.wharton.upenn.edu/~rakhlin/papers/online_learning_beyond_regret.pdf"/>
	<rdf:li rdf:resource="http://www.cs.rpi.edu/~magdon/ps/conference/PermCompNIPS2010.pdf"/>
	<rdf:li rdf:resource="http://www.cs.huji.ac.il/~sivan_sabato/papers/SabatoSrebroTishby10b.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1010.5626"/>
	<rdf:li rdf:resource="http://www.stat.berkeley.edu/tech-reports/797.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1009.5839"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1009.3896"/>
	<rdf:li rdf:resource="http://www-personal.umich.edu/~romanv/papers/non-asymptotic-rmt-plain.pdf"/>
	<rdf:li rdf:resource="http://eccc.hpi-web.de/report/2010/128/"/>
	<rdf:li rdf:resource="http://projecteuclid.org/euclid.bj/1281099877"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1004.4389"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1005.2791"/>
	<rdf:li rdf:resource="http://eccc.hpi-web.de/report/2010/072/"/>
	<rdf:li rdf:resource="http://dx.doi.org/10.1016/j.spl.2010.02.022"/>
	<rdf:li rdf:resource="http://press.princeton.edu/titles/8655.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1002.3345"/>
	<rdf:li rdf:resource="http://www.dspguide.com/ch34/1.htm"/>
	<rdf:li rdf:resource="http://www.cs.mcgill.ca/~icml2009/abstracts.html"/>
	<rdf:li rdf:resource="http://dx.doi.org/10.3982/ECTA7163"/>
	<rdf:li rdf:resource="http://jmlr.csail.mit.edu/papers/volume10/jiang09a/jiang09a.pdf"/>
	<rdf:li rdf:resource="http://www.jmlr.org/papers/volume10/arlot09a/arlot09a.pdf"/>
	<rdf:li rdf:resource="http://www.math.lsa.umich.edu/~barvinok/total710.pdf"/>
	<rdf:li rdf:resource="http://www.cs.cmu.edu/~shanneke/docs/2007/hanneke-teaching-dimension.pdf"/>
	<rdf:li rdf:resource="http://www.cs.cmu.edu/~shanneke/docs/2008/agnostic-working-notes.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/math.PR/0609835"/>
	<rdf:li rdf:resource="http://www.sciencedirect.com/science/article/B6V8F-45F91H5-8K/2/999a99fceb0f9d9cf27ac213e9563f51"/>
	<rdf:li rdf:resource="http://www.princeton.edu/~harman/Papers/Book.pdf"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://jmlr.csail.mit.edu/papers/v13/rubinstein12a.html">
    <title>A Geometric Approach to Sample Compression</title>
    <dc:date>2012-05-03T18:03:48+00:00</dc:date>
    <link>http://jmlr.csail.mit.edu/papers/v13/rubinstein12a.html</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["Two promising ways forward are: embedding maximal classes into maximum classes with at most a polynomial increase to VC dimension, and compression via operating on geometric representations. This paper presents positive results on the latter approach and a first negative result on the former, through a systematic investigation of finite maximum classes."]]></description>
<dc:subject>learning_theory geometry papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:7988137056aa/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1202.3323">
    <title>A new look at shifting regret</title>
    <dc:date>2012-02-26T06:05:07+00:00</dc:date>
    <link>http://arxiv.org/abs/1202.3323</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["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 papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:904375c5fb1d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1202.4970v1">
    <title>A PTAS for Computing the Supremum of Gaussian Processes</title>
    <dc:date>2012-02-26T05:41:21+00:00</dc:date>
    <link>http://arxiv.org/abs/1202.4970v1</link>
    <dc:creator>shivak</dc:creator><dc:subject>approximation_algorithms stochastic_process_suprema papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:bdaa6fcc0201/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:approximation_algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:stochastic_process_suprema"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1101.4446">
    <title>High-Confidence Predictions under Adversarial Uncertainty</title>
    <dc:date>2012-01-10T17:26:12+00:00</dc:date>
    <link>http://arxiv.org/abs/1101.4446</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[ITCS 2011 best paper]]></description>
<dc:subject>online_learning papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:abe3a933f49d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://webee.technion.ac.il/people/shie/public/papers/J_XuCaramMannorSparse11.pdf">
    <title>Sparse Algorithms are not Stable: A No-free-lunch Theorem</title>
    <dc:date>2012-01-10T17:00:02+00:00</dc:date>
    <link>http://webee.technion.ac.il/people/shie/public/papers/J_XuCaramMannorSparse11.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We show that these two properties are fundamentally at odds with each other: a sparse algorithm cannot be stable and vice versa."]]></description>
<dc:subject>sparsity sensitivity papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:460bae0b27f2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sparsity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sensitivity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1111.6026">
    <title>Computing without memory</title>
    <dc:date>2011-11-28T06:33:10+00:00</dc:date>
    <link>http://arxiv.org/abs/1111.6026</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Cute! "In this paper, we generalise the famous algorithm for swapping the contents of two variables without using a buffer. We introduce a novel combinatorial framework for procedural programming languages, where programs are only allowed to update one variable at a time. We first consider programs which do not have any additional memory. We prove that any function of all the variables can be computed this way in a number of updates which grows linearly with the number of variables. Similarly, any linear function can be computed using a linear number of linear instructions. We then derive the exact number of instructions required to compute any manipulation of variables. Second, we show that allowing programs to use additional memory is also incorporated in our framework. We quantify the gains obtained by using additional memory. This leads to shorter programs and allows to use only binary instructions, which is not sufficient in general when no memory is used."]]></description>
<dc:subject>memory papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:ebef14536d31/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:memory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www-personal.umich.edu/~romanv/papers/pv-tessellations.pdf">
    <title>Dimension reduction by random hyperplane tesselations</title>
    <dc:date>2011-11-19T02:50:10+00:00</dc:date>
    <link>http://www-personal.umich.edu/~romanv/papers/pv-tessellations.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["Given a subset K of the unit Euclidean sphere, we estimate the minimal number m = m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x,y in K is nearly proportional to the Euclidean distance between x and y. Random hyperplanes prove to be almost ideal for this problem; they achieve the almost optimal bound m = O(w(K)^2) where w(K) is the Gaussian mean width of K."]]></description>
<dc:subject>tesselations dimension_reduction embeddings papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:0e734c239fe6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:tesselations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:dimension_reduction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:embeddings"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1111.2450">
    <title>The Bernstein-Orlicz norm and deviation inequalities</title>
    <dc:date>2011-11-11T05:03:35+00:00</dc:date>
    <link>http://arxiv.org/abs/1111.2450</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We introduce two new concepts designed for the study of empirical processes. First, we introduce a new Orlicz norm which we call the Bernstein-Orlicz norm. This new norm interpolates sub-Gaussian and sub-exponential tail behavior. In particular, we show how this norm can be used to simplify the derivation of deviation inequalities for suprema of collections of random variables. Secondly, we introduce chaining and generic chaining along a tree. These simplify the well-known concepts of chaining and generic chaining. The supremum of the empirical process is then studied as a special case. We show that chaining along a tree can be done using entropy with bracketing. Finally, we establish a deviation inequality for the empirical process for the unbounded case."]]></description>
<dc:subject>concentration_of_measure deviation_inequalities empirical_processes generic_chaining functional_analysis papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:74348d02413e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:deviation_inequalities"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:generic_chaining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:functional_analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1111.1546">
    <title>Improved Smoothed Analysis of Multiobjective Optimization</title>
    <dc:date>2011-11-09T18:22:22+00:00</dc:date>
    <link>http://arxiv.org/abs/1111.1546</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Slightly tighter analysis of Moitra & O'Donnell. More importantly: bounds higher moments.]]></description>
<dc:subject>combinatorial_optimization smoothed_analysis papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:33a56276e479/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorial_optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:smoothed_analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1110.2392">
    <title>A Variant of Azuma's Inequality for Martingales with Subgaussian Tail</title>
    <dc:date>2011-10-12T06:38:17+00:00</dc:date>
    <link>http://arxiv.org/abs/1110.2392</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We present a variant of Azuma's concentration inequality for martingales, in which the standard boundedness requirement is replaced by the milder requirement of a subgaussian tail."]]></description>
<dc:subject>concentration_of_measure martingales papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:dc948cbfb54c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:martingales"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1109.5647">
    <title>Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization</title>
    <dc:date>2011-10-10T20:41:05+00:00</dc:date>
    <link>http://arxiv.org/abs/1109.5647</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[To attain O(1/T) convergence for non-smooth problems, SGD just needs a little tweak: an averaging window.]]></description>
<dc:subject>optimization convexity papers to_read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:7a1b6251e15e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:convexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1109.4299">
    <title>One-bit compressed sensing by linear programming</title>
    <dc:date>2011-09-25T22:26:41+00:00</dc:date>
    <link>http://arxiv.org/abs/1109.4299</link>
    <dc:creator>shivak</dc:creator><dc:subject>sparse_recovery classification papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:3b897c2a8673/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sparse_recovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ttic.uchicago.edu/~nati/Publications/HaKoSr11.pdf">
    <title>Beating SGD: Learning SVMs in Sublinear Time</title>
    <dc:date>2011-09-25T22:01:59+00:00</dc:date>
    <link>http://ttic.uchicago.edu/~nati/Publications/HaKoSr11.pdf</link>
    <dc:creator>shivak</dc:creator><dc:subject>optimization papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:b172ce839f6c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1108.4856">
    <title>Inner Regularization of Log-Concave Measures and Small-Ball Estimates</title>
    <dc:date>2011-08-29T20:00:44+00:00</dc:date>
    <link>http://arxiv.org/abs/1108.4856</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[To deduce anticoncentration properties about X, use their "inner thickening" algorithm to produce Y, and deduce anticoncentration properties about that instead.
]]></description>
<dc:subject>concentration_of_measure anticoncentration convexity papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:8d051c22c289/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:anticoncentration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:convexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1101.1057">
    <title>Sparsity regret bounds for individual sequences in online linear regression</title>
    <dc:date>2011-07-27T00:37:05+00:00</dc:date>
    <link>http://arxiv.org/abs/1101.1057</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Online equivalent to sparsity oracle inequalities.
]]></description>
<dc:subject>sparsity online_learning papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:2f1b97ffb427/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sparsity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5961831">
    <title>The Entropy Per Coordinate of a Random Vector is Highly Constrained Under Convexity Conditions</title>
    <dc:date>2011-07-26T01:35:52+00:00</dc:date>
    <link>http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5961831</link>
    <dc:creator>shivak</dc:creator><dc:subject>concentration_of_measure information_theory papers to_read via:ded_maxim</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:4b1faace6501/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:information_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:via:ded_maxim"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1107.4080">
    <title>On the Universality of Online Mirror Descent</title>
    <dc:date>2011-07-21T01:32:16+00:00</dc:date>
    <link>http://arxiv.org/abs/1107.4080</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Lots of typos right now.
]]></description>
<dc:subject>optimization online_learning learning_theory to_read papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:6eec9459636a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1106.2429">
    <title>Efficient Online Learning via Randomized Rounding</title>
    <dc:date>2011-06-23T19:27:10+00:00</dc:date>
    <link>http://arxiv.org/abs/1106.2429</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["Most online algorithms used in machine learning today are based on variants of mirror descent or follow-the-leader. In this paper, we present an online algorithm based on a completely different approach, which combines "random playout" and randomized rounding of loss subgradients. As an application of our approach, we provide the first computationally efficient online algorithm for collaborative filtering with norm-constrained matrices. As a second application, we solve an open question linking batch learning and transductive online learning."
]]></description>
<dc:subject>online_learning rounding papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:5dd841a496e2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:rounding"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1104.5070">
    <title>Online Learning: Stochastic and Constrained Adversaries</title>
    <dc:date>2011-04-28T00:53:39+00:00</dc:date>
    <link>http://arxiv.org/abs/1104.5070</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Finally!
]]></description>
<dc:subject>online_learning learning_theory papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:f18ab7d9966e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.princeton.edu/~satyen/papers/var-journal.pdf">
    <title>Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs</title>
    <dc:date>2011-04-22T02:21:18+00:00</dc:date>
    <link>http://www.cs.princeton.edu/~satyen/papers/var-journal.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Variational regret bounds.
]]></description>
<dc:subject>online_learning learning_theory papers to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:31c23e9e2306/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1104.1672">
    <title>Dimension-free tail inequalities for sums of random matrices</title>
    <dc:date>2011-04-20T16:48:16+00:00</dc:date>
    <link>http://arxiv.org/abs/1104.1672</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We derive exponential tail inequalities for sums of random matrices with no dependence on the explicit matrix dimensions. These are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit matrix dimensions replaced by a trace quantity that can be small even when the dimension is large or infinite. Some applications to principal component analysis and approximate matrix multiplication are given to illustrate the utility of the new bounds. "
]]></description>
<dc:subject>concentration_of_measure random_structures papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:74a683c3ccf5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:random_structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eccc.hpi-web.de/report/2011/063/">
    <title>The Communication Complexity of Gap Hamming Distance</title>
    <dc:date>2011-04-20T16:46:21+00:00</dc:date>
    <link>http://eccc.hpi-web.de/report/2011/063/</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Much shorter proof based on interplay between concentration and anticoncentration.
]]></description>
<dc:subject>communication_complexity lower_bounds to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:8d0711cb6ddf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:communication_complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:lower_bounds"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1002.4862">
    <title>Less Regret via Online Conditioning</title>
    <dc:date>2011-01-26T22:23:32+00:00</dc:date>
    <link>http://arxiv.org/abs/1002.4862</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We analyze and evaluate an online gradient descent algorithm with adaptive per-coordinate adjustment of learning rates. Our algorithm can be thought of as an online version of batch gradient descent with a diagonal preconditioner. This approach leads to regret bounds that are stronger than those of standard online gradient descent for general online convex optimization problems."
]]></description>
<dc:subject>online_learning preconditioners papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:ba11013c00f4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:preconditioners"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.acm.caltech.edu/~jtropp/conf/Tro10-Sparsity-Gap.pdf">
    <title>The Sparsity Gap: Uncertainty Principles Proportional to Dimension</title>
    <dc:date>2011-01-10T07:44:43+00:00</dc:date>
    <link>http://www.acm.caltech.edu/~jtropp/conf/Tro10-Sparsity-Gap.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["In an incoherent dictionary, most signals that admit a sparse representation admit a unique sparse representation. In other words, there is no way to express the signal without using strictly more atoms. This work demonstrates that sparse signals typically enjoy a higher privilege: each nonoptimal representation of the signal requires far more atoms than the sparsest representation—unless it contains many of the same atoms as the sparsest representation."
]]></description>
<dc:subject>sparsity papers to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:dbf8192dedc7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sparsity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1012.5533">
    <title>A local maximal inequality under uniform entropy</title>
    <dc:date>2010-12-31T18:21:49+00:00</dc:date>
    <link>http://arxiv.org/abs/1012.5533</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We derive an upper bound for the mean of the supremum of the empirical process indexed by a class of functions that are known to have variance bounded by a small constant $\delta$. The bound is expressed in the uniform entropy integral of the class at $\delta$."
]]></description>
<dc:subject>stochastic_process_suprema papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:a0cdcdb54a81/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:stochastic_process_suprema"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0911.4108">
    <title>Error Bounds for Random Matrix Approximation Schemes</title>
    <dc:date>2010-12-14T08:46:39+00:00</dc:date>
    <link>http://arxiv.org/abs/0911.4108</link>
    <dc:creator>shivak</dc:creator><dc:subject>sparsity concentration_of_measure random_structures papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:9bb736f3a420/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sparsity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:random_structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1012.0210">
    <title>Bounds on the suprema of Gaussian processes, and omega results for the sum of a random multiplicative function</title>
    <dc:date>2010-12-03T04:37:27+00:00</dc:date>
    <link>http://arxiv.org/abs/1012.0210</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["In this paper we develop an alternative approach to lower bounding the upper tail probability [P(supt∈T Z(t) > u)]. The ingredients are an initial conditioning step, followed by a comparison (in the sense of the method of comparison) with a “model” Gaussian process that can be explicitly analysed. The resulting bounds are clean and can be non-trivial for moderately sized u, which is very important in our two applications."
]]></description>
<dc:subject>stochastic_process_suprema lower_bounds papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:f6c3b325da29/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:stochastic_process_suprema"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:lower_bounds"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/HLW06/hlw06.pdf">
    <title>Expander Graphs and Their Applications</title>
    <dc:date>2010-12-02T19:22:58+00:00</dc:date>
    <link>http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/HLW06/hlw06.pdf</link>
    <dc:creator>shivak</dc:creator><dc:subject>graph_theory spectral_methods coding_theory embeddings surveys to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:ead5c557e9f9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:graph_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:spectral_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:coding_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:embeddings"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:surveys"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eccc.hpi-web.de/report/2010/182/">
    <title>An elementary proof of anti-concentration of polynomials in Gaussian variables</title>
    <dc:date>2010-11-27T20:06:32+00:00</dc:date>
    <link>http://eccc.hpi-web.de/report/2010/182/</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["The important work in this area is by Carbery and Wright, who gave a tight bound for anti-concentration of polynomials in normal variables. However, the proof of their result is quite complex. We give a weaker anti-concentration result which has an elementary proof, based on some convexity arguments, simple analysis and induction on the degree. Moreover, our proof technique is robust and extends to other distributions."
]]></description>
<dc:subject>anticoncentration papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:e8cba352ef7d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:anticoncentration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.berkeley.edu/~alekh/sparselb.pdf">
    <title>Information-theoretic lower bounds on the oracle complexity of sparse convex optimization</title>
    <dc:date>2010-11-22T14:46:00+00:00</dc:date>
    <link>http://www.cs.berkeley.edu/~alekh/sparselb.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Workshop paper.
]]></description>
<dc:subject>optimization lower_bounds convexity sparsity to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:63b4b956647c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:lower_bounds"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:convexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sparsity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/euclid.bj/1290092911">
    <title>Concentration of empirical distribution functions with applications to non-i.i.d. models</title>
    <dc:date>2010-11-18T18:10:04+00:00</dc:date>
    <link>http://projecteuclid.org/euclid.bj/1290092911</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["The concentration of empirical measures is studied for dependent data, whose joint distribution satisfies Poincaré-type or logarithmic Sobolev inequalities. The general concentration results are then applied to spectral empirical distribution functions associated with high-dimensional random matrices."
]]></description>
<dc:subject>concentration_of_measure dependent_data logarithmic_sobolev_inequalities poincare_inequalities random_structures papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:8f7b819ca361/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:dependent_data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:logarithmic_sobolev_inequalities"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:poincare_inequalities"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:random_structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www-stat.wharton.upenn.edu/~rakhlin/papers/online_learning.pdf">
    <title>Lecture Notes on Online Learning</title>
    <dc:date>2010-11-15T21:47:48+00:00</dc:date>
    <link>http://www-stat.wharton.upenn.edu/~rakhlin/papers/online_learning.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[By Berkeley/TTIC/Penn.
]]></description>
<dc:subject>online_learning optimization learning_theory surveys to_read updated_content filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:80f33995940f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:surveys"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:updated_content"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www-stat.wharton.upenn.edu/~rakhlin/papers/online_learning_beyond_regret.pdf">
    <title>Online Learning: Beyond Regret</title>
    <dc:date>2010-11-15T21:46:39+00:00</dc:date>
    <link>http://www-stat.wharton.upenn.edu/~rakhlin/papers/online_learning_beyond_regret.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Followup to the  "online learnability" paper.
]]></description>
<dc:subject>online_learning learning_theory papers to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:cec1dd7c16a0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:online_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.rpi.edu/~magdon/ps/conference/PermCompNIPS2010.pdf">
    <title>Permutation Complexity Bound on Out-Sample Error</title>
    <dc:date>2010-11-01T15:00:30+00:00</dc:date>
    <link>http://www.cs.rpi.edu/~magdon/ps/conference/PermCompNIPS2010.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We define a data dependent permutation complexity for a hypothesis set H, which is similar to a Rademacher complexity or maximum discrepancy. The crucial difference is that it is based on permutation (dependent) sampling. We prove a uniform bound on the generalization error, as well as a concentration result which means that the permutation estimate can be efficiently estimated."
]]></description>
<dc:subject>capacity_control learning_theory concentration_of_measure papers to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:583647af89d9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:capacity_control"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.huji.ac.il/~sivan_sabato/papers/SabatoSrebroTishby10b.pdf">
    <title>Tight Sample Complexity of Large-Margin Learning</title>
    <dc:date>2010-11-01T14:56:20+00:00</dc:date>
    <link>http://www.cs.huji.ac.il/~sivan_sabato/papers/SabatoSrebroTishby10b.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the $\gamma$-adapted-dimension, which is a simple function of the spectrum of a distribution’s covariance matrix, and show distribution-specific upper and lower bounds on the sample complexity, both governed by the $\gamma$-adapted-dimension of the source distribution. We conclude that this new quantity tightly characterizes the true sample complexity of large-margin classification. The bounds hold for a rich family of sub-Gaussian distributions."
]]></description>
<dc:subject>learning_theory noise_conditions margins papers to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:d3e895bc8326/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:noise_conditions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:margins"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1010.5626">
    <title>Bounds for Rademacher Processes via Chaining</title>
    <dc:date>2010-10-28T05:39:10+00:00</dc:date>
    <link>http://arxiv.org/abs/1010.5626</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[How are these better/different from the "Bernoulli conjecture" chapter in _The Generic Chaining_?
]]></description>
<dc:subject>stochastic_process_suprema generic_chaining papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:1162093a0b5b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:stochastic_process_suprema"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:generic_chaining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.stat.berkeley.edu/tech-reports/797.pdf">
    <title>A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers</title>
    <dc:date>2010-10-18T14:40:41+00:00</dc:date>
    <link>http://www.stat.berkeley.edu/tech-reports/797.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["...we isolate and highlight two key properties of a regularized M-estimator—namely, a decomposability property for the regularizer, and a notion of restricted strong convexity that depends on the interaction between the regularizer and the loss function."
]]></description>
<dc:subject>regularization loss_functions convexity learning_theory papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:66597f58ddab/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:regularization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:loss_functions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:convexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1009.5839">
    <title>Optimal learning rates for Kernel Conjugate Gradient regression</title>
    <dc:date>2010-09-30T18:04:34+00:00</dc:date>
    <link>http://arxiv.org/abs/1009.5839</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We prove rates of convergence in the statistical sense for kernel-based least squares regression using a conjugate gradient algorithm, where regularization against overfitting is obtained by early stopping. This method is directly related to Kernel Partial Least Squares, a regression method that combines supervised dimensionality reduction with least squares projection. The rates depend on two key quantities: first, on the regularity of the target regression function and second, on the intrinsic dimensionality of the data mapped into the kernel space."
]]></description>
<dc:subject>kernel_methods regression to_read papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:9def2219bf9b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:kernel_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:regression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1009.3896">
    <title>Smoothness, Low-Noise and Fast Rates</title>
    <dc:date>2010-09-22T19:00:09+00:00</dc:date>
    <link>http://arxiv.org/abs/1009.3896</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We establish am excess risk bound of order $H \Rad_n^2 + \sqrt{H L^*}\Rad_n$ for ERM with an H-smooth loss function and a hypothesis class with Rademacher complexity $\Rad_n$, where $L^*$ is the best risk achievable by the hypothesis class. For typical hypothesis classes where $\Rad_n = \sqrt{R/n}$, this translates to a learning rate of order $RH/n$ in the separable ($L^*=0$) case and $RH/n + \sqrt{L^* RH/n}$ more generally. We also provide similar guarantees for online and stochastic convex optimization of a smooth non-negative objective."
]]></description>
<dc:subject>learning_theory to_read papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:fc606cbb8933/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www-personal.umich.edu/~romanv/papers/non-asymptotic-rmt-plain.pdf">
    <title>Introduction to the non-asymptotic analysis of random matrices</title>
    <dc:date>2010-08-16T07:47:00+00:00</dc:date>
    <link>http://www-personal.umich.edu/~romanv/papers/non-asymptotic-rmt-plain.pdf</link>
    <dc:creator>shivak</dc:creator><dc:subject>forgotten surveys random_structures to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:303b12dd8793/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:forgotten"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:surveys"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:random_structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eccc.hpi-web.de/report/2010/128/">
    <title>The Equivalence of Sampling and Searching</title>
    <dc:date>2010-08-16T06:42:47+00:00</dc:date>
    <link>http://eccc.hpi-web.de/report/2010/128/</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["... for any sampling problem S, there exists a search problem R such that, if C is any "reasonable" complexity class, then R is in the search version of C if and only if S is in the sampling version."
]]></description>
<dc:subject>sampling theoretical_computer_science algorithmic_information_theory papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:5e3ab80327c6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sampling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:theoretical_computer_science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:algorithmic_information_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/euclid.bj/1281099877">
    <title>Sharper lower bounds on the performance of the empirical risk minimization algorithm</title>
    <dc:date>2010-08-08T03:01:28+00:00</dc:date>
    <link>http://projecteuclid.org/euclid.bj/1281099877</link>
    <dc:creator>shivak</dc:creator><dc:subject>learning_theory central_limit_theorems empirical_processes to_read papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:a94e310406f0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:central_limit_theorems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:empirical_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1004.4389">
    <title>User-friendly tail bounds for matrix martingales</title>
    <dc:date>2010-07-16T06:33:37+00:00</dc:date>
    <link>http://arxiv.org/abs/1004.4389</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["This paper provides noncommutative generalizations of the classical bounds associated with the names Azuma, Bennett, Bernstein, Chernoff, Freedman, Hoeffding, and McDiarmid. The matrix inequalities promise the same diversity of application, ease of use, and strength of conclusion that have made the scalar inequalities so valuable."
]]></description>
<dc:subject>deviation_inequalities random_structures to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:101c6288eb77/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:deviation_inequalities"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:random_structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1005.2791">
    <title>A note on concentration of submodular functions</title>
    <dc:date>2010-05-20T14:39:16+00:00</dc:date>
    <link>http://arxiv.org/abs/1005.2791</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding functions. The power of these concentration bounds is that they are dimension-free, in particular implying standard deviation O(\sqrt{\E[f]}) rather than O(\sqrt{n}) which can be obtained for any 1-Lipschitz function of n variables."
]]></description>
<dc:subject>concentration_of_measure submodularity papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:270ba7097af9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:submodularity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eccc.hpi-web.de/report/2010/072/">
    <title>Constructive Proofs of Concentration Bounds</title>
    <dc:date>2010-04-19T21:10:00+00:00</dc:date>
    <link>http://eccc.hpi-web.de/report/2010/072/</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Of the Hoeffding/Chernoff variety. Constructive in the sense that "if the sum of the given random variables is not concentrated around the expectation, then we can efficiently find (with high probability) a subset of the random variables that are statistically dependent."
]]></description>
<dc:subject>concentration_of_measure direct_products constructive_proofs papers to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:92a14c841a05/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:direct_products"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:constructive_proofs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://dx.doi.org/10.1016/j.spl.2010.02.022">
    <title>Chebyshev’s inequality for Hilbert-space valued random elements</title>
    <dc:date>2010-03-13T21:10:14+00:00</dc:date>
    <link>http://dx.doi.org/10.1016/j.spl.2010.02.022</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Check if this is actually new.
]]></description>
<dc:subject>concentration_of_measure to_read papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:321d1ad5b006/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://press.princeton.edu/titles/8655.html">
    <title>Information and Learning in Markets: The Impact of Market Microstructure</title>
    <dc:date>2010-02-24T19:00:29+00:00</dc:date>
    <link>http://press.princeton.edu/titles/8655.html</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["Provides the most complete analysis of the ways markets aggregate information [and] bridges the gap between the rational expectations and herding literatures."
]]></description>
<dc:subject>markets game_theory to_read papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:c47819a8e309/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:markets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:game_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1002.3345">
    <title>Interactive Submodular Set Cover</title>
    <dc:date>2010-02-18T02:08:40+00:00</dc:date>
    <link>http://arxiv.org/abs/1002.3345</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[A decent looking greedy criterion.
]]></description>
<dc:subject>active_learning sequential_decisions submodularity to_read papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:9f65fbbc28a8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:active_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sequential_decisions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:submodularity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.dspguide.com/ch34/1.htm">
    <title>Debunking Benford's law</title>
    <dc:date>2010-01-27T00:49:39+00:00</dc:date>
    <link>http://www.dspguide.com/ch34/1.htm</link>
    <dc:creator>shivak</dc:creator><dc:subject>benford's_law debunking to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:8bd3e4a0c284/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:benford's_law"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:debunking"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.mcgill.ca/~icml2009/abstracts.html">
    <title>ICML 2009 accepted papers</title>
    <dc:date>2009-05-27T20:55:14+00:00</dc:date>
    <link>http://www.cs.mcgill.ca/~icml2009/abstracts.html</link>
    <dc:creator>shivak</dc:creator><dc:subject>machine_learning learning_theory to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:d2d63dad9db0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://dx.doi.org/10.3982/ECTA7163">
    <title>The Complexity of Forecast Testing</title>
    <dc:date>2009-05-05T19:01:49+00:00</dc:date>
    <link>http://dx.doi.org/10.3982/ECTA7163</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[The adversarial strategies used by forecasters to manipulate tests are computationally intractable.
]]></description>
<dc:subject>to_read prediction prequentialism bounded_rationality fortnow lance vohra rakesh</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:113aea386cba/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:prequentialism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:bounded_rationality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:fortnow"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:lance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:vohra"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:rakesh"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jmlr.csail.mit.edu/papers/volume10/jiang09a/jiang09a.pdf">
    <title>On Uniform Deviations of General Empirical Risks with Unboundedness, Dependence, and High Dimensionality</title>
    <dc:date>2009-05-03T06:43:25+00:00</dc:date>
    <link>http://jmlr.csail.mit.edu/papers/volume10/jiang09a/jiang09a.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Bound the risk of your hypothesis without strong mixing, β-mixing, or iid requirements.
]]></description>
<dc:subject>learning_theory concentration_of_measure dependent_data regression to_read jiang wenxin filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:ead15f36ef35/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:dependent_data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:regression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:jiang"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:wenxin"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.jmlr.org/papers/volume10/arlot09a/arlot09a.pdf">
    <title>Data-driven Calibration of Penalties for Least-Squares Regression</title>
    <dc:date>2009-02-28T03:27:24+00:00</dc:date>
    <link>http://www.jmlr.org/papers/volume10/arlot09a/arlot09a.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["Penalization procedures often suffer from their dependence on multiplying factors, whose optimal values are either unknown or hard to estimate from data. We propose a completely data-driven calibration algorithm for these parameters in the least-squares regression framework, without assuming a particular shape for the penalty. Our algorithm relies on the concept of minimal penalty, recently introduced by Birge and Massart (2007) in the context of penalized least squares for Gaussian homoscedastic regression. On the positive side, the minimal penalty can be evaluated from the data themselves, leading to a data-driven estimation of an optimal penalty which can be used in practice;
on the negative side, their approach heavily relies on the homoscedastic Gaussian nature of their stochastic framework."
]]></description>
<dc:subject>data_dependent_methods regularization model_selection learning_theory statistics arlot sylvain massart pascal to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:d48b064f033a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:data_dependent_methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:regularization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:model_selection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:arlot"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sylvain"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:massart"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:pascal"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.math.lsa.umich.edu/~barvinok/total710.pdf">
    <title>Measure Concentration (Math 710 at UMich)</title>
    <dc:date>2009-02-18T09:16:33+00:00</dc:date>
    <link>http://www.math.lsa.umich.edu/~barvinok/total710.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Topics include: flattening lemma, isoperimetric inequalities, the martingale method, large deviations, Lipschitz functions...
]]></description>
<dc:subject>concentration_of_measure geometry isoperimetry stochastic_processes large_deviations to_read barvinok alexander filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:96cfdcb471c9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:isoperimetry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:large_deviations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:barvinok"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:alexander"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cmu.edu/~shanneke/docs/2007/hanneke-teaching-dimension.pdf">
    <title>Teaching dimension and the complexity of active learning</title>
    <dc:date>2009-02-12T06:51:58+00:00</dc:date>
    <link>http://www.cs.cmu.edu/~shanneke/docs/2007/hanneke-teaching-dimension.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We study the label complexity of pool-based active learning in the PAC model with noise. Taking inspiration from extant literature on Exact learning with membership queries, we derive upper and lower bounds on the label complexity in terms of generalizations of extended teaching dimension. Among the contributions of this work is the first nontrivial general upper bound on label complexity in the presence of persistent classification noise."
]]></description>
<dc:subject>active_learning learning_theory hanneke steve to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:ef0f3f909af1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:active_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:hanneke"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:steve"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cmu.edu/~shanneke/docs/2008/agnostic-working-notes.pdf">
    <title>Rates of convergence in active learning</title>
    <dc:date>2009-02-12T06:50:11+00:00</dc:date>
    <link>http://www.cs.cmu.edu/~shanneke/docs/2008/agnostic-working-notes.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We study the rates of convergence in generalization error achievable by active learning under various types of label noise. Additionally, we study the more general problem of active learning with a nested hierarchy of hypothesis classes, and propose an algorithm whose error rate provably converges to the best achievable error among classifiers in the hierarchy at a rate adaptive to both the complexity of the optimal classifier and the noise conditions. In particular, we state sufficient conditions for these rates to be dramatically faster than those achievable by passive learning."
]]></description>
<dc:subject>active_learning learning_theory hanneke steve to_read updated_content filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:7379a111d04f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:active_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:hanneke"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:steve"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:updated_content"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/math.PR/0609835">
    <title>Concentration inequalities for dependent random variables via the martingale method</title>
    <dc:date>2009-02-08T01:01:42+00:00</dc:date>
    <link>http://arxiv.org/abs/math.PR/0609835</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Like McDiarmid's inequality? Then you'll love Kontorovich & Ramanan.
]]></description>
<dc:subject>concentration_of_measure learning_theory martingales sensitivity stochastic_processes kontorovich leonid ramanan kavita to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:10d329267836/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:concentration_of_measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:martingales"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sensitivity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:stochastic_processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:kontorovich"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:leonid"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:ramanan"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:kavita"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.sciencedirect.com/science/article/B6V8F-45F91H5-8K/2/999a99fceb0f9d9cf27ac213e9563f51">
    <title>Hyman Minsky - stabilizing an unstable economy</title>
    <dc:date>2009-01-05T14:47:39+00:00</dc:date>
    <link>http://www.sciencedirect.com/science/article/B6V8F-45F91H5-8K/2/999a99fceb0f9d9cf27ac213e9563f51</link>
    <dc:creator>shivak</dc:creator><dc:subject>economics credit_collapse to_read</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:cfcdf6eecbcc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:economics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:credit_collapse"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.princeton.edu/~harman/Papers/Book.pdf">
    <title>Reliable reasoning: induction and statistical learning theory</title>
    <dc:date>2008-11-27T15:35:13+00:00</dc:date>
    <link>http://www.princeton.edu/~harman/Papers/Book.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Philosophical portions apparently disliked by CRS and Kevin Kelly.
]]></description>
<dc:subject>harman gilbert kulkarni sanjeev induction complexity transduction philosophy_of_science machine_learning statistical_learning_theory books to_read filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:b66b4ccb1f24/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:harman"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:gilbert"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:kulkarni"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sanjeev"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:induction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:transduction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:philosophy_of_science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:machine_learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:statistical_learning_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>