<?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 (arthegall)</title>
    <link>https://pinboard.in/u:arthegall/public/</link>
    <description>recent bookmarks from arthegall</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://arxiv.org/abs/2603.21687"/>
	<rdf:li rdf:resource="https://arxiv.org/html/2511.15304v1"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1910.09707"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2501.06669"/>
	<rdf:li rdf:resource="https://castle.princeton.edu/Papers/languages.pdf"/>
	<rdf:li rdf:resource="http://shaftolab.com/assets/papers/yangFolkeShafto2023.pdf"/>
	<rdf:li rdf:resource="https://www.pnas.org/content/118/17/e2018995118"/>
	<rdf:li rdf:resource="https://crypto.stanford.edu/prio/paper.pdf"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2009.09440"/>
	<rdf:li rdf:resource="https://aaai.org/Library/BISFAI/1995/bisfai95-019.php"/>
	<rdf:li rdf:resource="https://ai.stanford.edu/~epacuit/classes/lori-spr09/cohenlevesque-intention-aij90.pdf"/>
	<rdf:li rdf:resource="http://www.dimap.ufrn.br/~richard/pubs/dim0436/papers/owicki_gries_1976.pdf"/>
	<rdf:li rdf:resource="https://www.semanticscholar.org/paper/Beyond-Born-versus-Made%3A-A-New-Look-at-Expertise-Hambrick-Macnamara/7a55de6cbae869dca6fae9f8637a77aa73f14479"/>
	<rdf:li rdf:resource="https://www.semanticscholar.org/paper/The-Relationship-Between-Deliberate-Practice-and-in-Macnamara-Moreau/633eb930435e8608bc38065961fb8eeb642d84aa?p2df"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1608.03960"/>
	<rdf:li rdf:resource="http://fmv.jku.at/papers/RitircBiereKauers-scsc18.pdf"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2003.00563"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1810.03664"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1607.04200"/>
	<rdf:li rdf:resource="https://dsf.berkeley.edu/jmh/papers/anna_ieee18.pdf"/>
	<rdf:li rdf:resource="https://petsymposium.org/2020/files/papers/issue3/popets-2020-0047.pdf"/>
	<rdf:li rdf:resource="https://www.pnas.org/content/105/52/20589"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1706.00754"/>
	<rdf:li rdf:resource="https://pdfs.semanticscholar.org/7b8b/40a4c485593a7f4fe6d9596f5ac2d0d1f681.pdf"/>
	<rdf:li rdf:resource="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.671.6242&amp;rep=rep1&amp;type=pdf"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1905.10615"/>
	<rdf:li rdf:resource="https://science.sciencemag.org/content/362/6415/690"/>
	<rdf:li rdf:resource="https://www.chaum.com/publications/Security_Wthout_Identification.html"/>
	<rdf:li rdf:resource="http://www.cs.umd.edu/users/samir/grant/cos-latin.pdf"/>
	<rdf:li rdf:resource="http://diytranscriptomics.com/Reading/files/Kallisto.pdf"/>
	<rdf:li rdf:resource="https://eprint.iacr.org/2020/193.pdf"/>
	<rdf:li rdf:resource="https://eprint.iacr.org/2013/515.pdf"/>
	<rdf:li rdf:resource="https://www.pnas.org/content/116/29/14516.short"/>
	<rdf:li rdf:resource="https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3444678"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1510.05569"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1601.01280"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1508.01991"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1910.10871"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1602.02201"/>
	<rdf:li rdf:resource="https://www.semanticscholar.org/paper/Using-Word-Vectors-to-Improve-Word-Alignments-for-Pourdamghani-Ghazvininejad/8f4bf65a6b62cecc6f7b0ab2489a831d9a44a86d"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1910.05992"/>
	<rdf:li rdf:resource="https://www.aclweb.org/anthology/D16-1126/"/>
	<rdf:li rdf:resource="https://www.aclweb.org/anthology/N15-1180/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1511.05219"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1910.04618"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1901.08113"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.11942v1"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.13649"/>
	<rdf:li rdf:resource="https://github.com/frankmcsherry/blog/blob/master/assets/Synth-SIGMOD.pdf"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1908.11358"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1905.13229"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.01917"/>
	<rdf:li rdf:resource="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.366.5957&amp;rep=rep1&amp;type=pdf"/>
	<rdf:li rdf:resource="https://web.cs.ucdavis.edu/~rogaway/papers/bmr90"/>
	<rdf:li rdf:resource="http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/GMW87/GMW87.pdf"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1706.04692"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1603.01508"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1809.09561"/>
	<rdf:li rdf:resource="https://papers.nips.cc/paper/5392-extremal-mechanisms-for-local-differential-privacy.pdf"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1904.03564"/>
	<rdf:li rdf:resource="https://arxiv.org/pdf/1407.1546.pdf"/>
	<rdf:li rdf:resource="http://proceedings.mlr.press/v37/kairouz15.pdf"/>
	<rdf:li rdf:resource="https://stanford.edu/~jduchi/projects/DuchiJoWa13_focs.pdf"/>
	<rdf:li rdf:resource="https://www.nature.com/articles/s41588-018-0178-9"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1902.10286"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1805.00155"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1902.04114"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1902.06720"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1902.04738"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1902.01023"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://arxiv.org/abs/2603.21687">
    <title>Asadi et al. &quot;MIRAGE: The Illusion of Visual Understanding&quot; (arXiv)</title>
    <dc:date>2026-03-31T12:19:42+00:00</dc:date>
    <link>https://arxiv.org/abs/2603.21687</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[Section 2.2 is weirdly funny -- the first sentence is wrong in a way that I think is tantamount to the authors themselves falling victim to a similar phenomenon that they show the models succumbing to.  

In general, I think you can sum up the paper as "you can't run models -- even frontier models, even in 'thinking' mode -- alone, and treat the results as completely trustworthy." 

I sort of think most practitioners know this already, as people build pipelines or networks of interacting models.  For example, one model will extract or summarize conclusions or outcomes along with evidence, and the next will attempt to check the work of the first model.  Followed by other models that check the work of the earlier models -- and so on, turtles all the way down, until you inevitably (in the case of medical applications that *really don't want to miss something*) you have a human who's the expert-of-last-resort.  

The line in their discussion, "At the inference level, architectures that embed
counterfactual probing directly into their reasoning pipeline, for instance, by systematically comparing image-present and image-absent outputs before generating a final response, can provide runtime protection against mirage-affected reasoning," is sort of a big nod.  Yup, I think most people who are building these things know that.  (There are, [cough], still some C-suite types who could probably use to read a paper like this though, sadly.) 

Finally, I get why they focused on "benchmarks," and there are clearly a whole bunch of leaderboard-style effects going on with those dataset (see e.g. the way that some of the model-training companies have started to clearly optimize for Simon Willison's 'draw a pelican on a bicycle' informal test) 

But the bigger issue is that none of the benchmarks actually test the kinds of systems that are actually useful in the real world -- because the benchmarks want to test "just the model," and anyone who deploys *just the model*  is an idiot who is courting disaster.

[end rant] ]]></description>
<dc:subject>arxiv research-article llms via:cshalizi</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:86b19cc42bf5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:llms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:cshalizi"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/html/2511.15304v1">
    <title>Adversarial Poetry as a Universal Single-Turn Jailbreak Mechanism in Large Language Models</title>
    <dc:date>2026-02-23T14:39:22+00:00</dc:date>
    <link>https://arxiv.org/html/2511.15304v1</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[In the same vein of thinking about AI-as-the-next-incarnation-of-divination, I thought this paper was really funny (and kind of amazing). The oldest forms of poetry are indistinguishable from semi-religious beliefs about magic and the connection of prophecy with the divine, and even in living memory there are plenty of poets who see their poetic imagination as evidence of a connection to nature, God, or some kind of world-spirit.  

"Adversarial poetry" reads a little like GH Hardy, praising number theory for its "uselessness," mere decades before the export of embodied encryption algorithms was regulated as an armament. Maybe the poets thought that poetry was beautifully useless too. 

Everyone knows about "technology so advanced it's indistinguishable from magic," but in the age of AI you need to be more worried about magic so ancient it's indistinguishable from technology.  ]]></description>
<dc:subject>poetry magic prompt-injection research-article arxiv llms ai</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:49195495f70d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:poetry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:magic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:prompt-injection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:llms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:ai"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1910.09707">
    <title>[1910.09707] A Fresh Look at the &quot;Hot Hand&quot; Paradox</title>
    <dc:date>2026-02-23T12:41:37+00:00</dc:date>
    <link>https://arxiv.org/abs/1910.09707</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[I am genuinely interested whether some of the recurrences outlined here match up with the 'good suffix rule' used in Boyer-Moore and related string matching algorithms (see e.g. Ben Langmead's slides: https://www.cs.jhu.edu/~langmea/resources/lecture_notes/04_boyer_moore_v2.pdf), or with the Z-array or Z algorithm that can be used to compute them (https://cp-algorithms.com/string/z-function.html, but the real reference for me is Gusfield's book https://www.cambridge.org/core/books/algorithms-on-strings-trees-and-sequences/F0B095049C7E6EF5356F0A26686C20D3 which is not really possible to find online, afaict). ]]></description>
<dc:subject>via:vaguery via:cshalizi research-article sequence-analysis strings</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:7648649c36f4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:vaguery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:cshalizi"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sequence-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:strings"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2501.06669">
    <title>“ Challenging reaction prediction models to generalize to novel chemistry”</title>
    <dc:date>2025-01-25T20:23:43+00:00</dc:date>
    <link>https://arxiv.org/abs/2501.06669</link>
    <dc:creator>arthegall</dc:creator><dc:subject>arxiv research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:92658d150939/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://castle.princeton.edu/Papers/languages.pdf">
    <title>Powell, &quot;On Languages for Dynamic Scheduling Problems&quot;</title>
    <dc:date>2024-03-24T17:22:47+00:00</dc:date>
    <link>https://castle.princeton.edu/Papers/languages.pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>pdf research-article scheduling</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:07ce193f1426/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:scheduling"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://shaftolab.com/assets/papers/yangFolkeShafto2023.pdf">
    <title>The Inner Loop of Collective Human-machine Intelligence</title>
    <dc:date>2023-04-02T11:02:05+00:00</dc:date>
    <link>http://shaftolab.com/assets/papers/yangFolkeShafto2023.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[Any paper from Pat is worth reading, but this one looks particularly fun]]></description>
<dc:subject>research-article pat-shafto cognition artificial-intelligence</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:eb8d7c48cdd7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pat-shafto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:cognition"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:artificial-intelligence"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.pnas.org/content/118/17/e2018995118">
    <title>A guideline to limit indoor airborne transmission of COVID-19 | PNAS</title>
    <dc:date>2021-06-28T13:36:39+00:00</dc:date>
    <link>https://www.pnas.org/content/118/17/e2018995118</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[I don't know how much to believe, really quantitative models like this. ]]></description>
<dc:subject>covid pnas research-article air-quality masking</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:854723657ebf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:covid"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pnas"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:air-quality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:masking"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://crypto.stanford.edu/prio/paper.pdf">
    <title>Corrigan-Gibbs, Boneh, &quot;Prio: Private, Robust, and Scalable Computation of Aggregate Statistics&quot;</title>
    <dc:date>2021-05-06T07:54:31+00:00</dc:date>
    <link>https://crypto.stanford.edu/prio/paper.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[cf. https://github.com/abetterinternet/libprio-rs 

also see comments here: https://gist.github.com/degregat/75949dbf83db3a2c9dfca712cb23bac5]]></description>
<dc:subject>dan-boneh privacy statistics research-article differential-privacy machinelearning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:9d29f4dee7e6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:dan-boneh"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2009.09440">
    <title>[2009.09440] The Significance Filter, the Winner's Curse and the Need to Shrink</title>
    <dc:date>2021-05-06T07:46:50+00:00</dc:date>
    <link>https://arxiv.org/abs/2009.09440</link>
    <dc:creator>arthegall</dc:creator><dc:subject>research-article arxiv statistics bias</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:311e0b41d3c1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:bias"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://aaai.org/Library/BISFAI/1995/bisfai95-019.php">
    <title>Pereira, Singer, Tishby, &quot;Beyond Word N-Grams&quot;</title>
    <dc:date>2021-05-06T07:40:00+00:00</dc:date>
    <link>https://aaai.org/Library/BISFAI/1995/bisfai95-019.php</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[also: https://arxiv.org/pdf/cmp-lg/9607016.pdf]]></description>
<dc:subject>n-grams nlp machinelearning research-article fernando-pereira</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:57f6e387b8bf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:n-grams"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:nlp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:fernando-pereira"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://ai.stanford.edu/~epacuit/classes/lori-spr09/cohenlevesque-intention-aij90.pdf">
    <title>Cohen, Levesque, &quot;Intention is Choice with Commitment&quot;</title>
    <dc:date>2021-05-06T07:38:36+00:00</dc:date>
    <link>https://ai.stanford.edu/~epacuit/classes/lori-spr09/cohenlevesque-intention-aij90.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[I love the name of this (old) paper]]></description>
<dc:subject>intentionality research-article artificial-intelligence stanford</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:2c9a03ffbda6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:intentionality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:artificial-intelligence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:stanford"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.dimap.ufrn.br/~richard/pubs/dim0436/papers/owicki_gries_1976.pdf">
    <title>Owicki, Gries &quot;An Axiomatic Proof Technique for Parallel Programs I&quot;</title>
    <dc:date>2020-11-25T11:35:30+00:00</dc:date>
    <link>http://www.dimap.ufrn.br/~richard/pubs/dim0436/papers/owicki_gries_1976.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[Susan Owicki is an academic ... grandparent, of mine -- and then (Wikipedia bio says) she switched fields and went into counseling?  This sounds like a story I kind of wish I could hear.  ]]></description>
<dc:subject>susan-owicki personal research-article computerscience parallel-computing proofs</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:74f5dca61a7c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:susan-owicki"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:personal"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:computerscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:parallel-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:proofs"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.semanticscholar.org/paper/Beyond-Born-versus-Made%3A-A-New-Look-at-Expertise-Hambrick-Macnamara/7a55de6cbae869dca6fae9f8637a77aa73f14479">
    <title>[PDF] Beyond Born versus Made: A New Look at Expertise | Semantic Scholar</title>
    <dc:date>2020-11-25T09:56:32+00:00</dc:date>
    <link>https://www.semanticscholar.org/paper/Beyond-Born-versus-Made%3A-A-New-Look-at-Expertise-Hambrick-Macnamara/7a55de6cbae869dca6fae9f8637a77aa73f14479</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[My god, the _figures_ in this paper ]]></description>
<dc:subject>expertise research-article pyschology deliberate-practice</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:fc189cbcfcf6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:expertise"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pyschology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:deliberate-practice"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.semanticscholar.org/paper/The-Relationship-Between-Deliberate-Practice-and-in-Macnamara-Moreau/633eb930435e8608bc38065961fb8eeb642d84aa?p2df">
    <title>[PDF] The Relationship Between Deliberate Practice and Performance in Sports | Semantic Scholar</title>
    <dc:date>2020-11-25T09:52:53+00:00</dc:date>
    <link>https://www.semanticscholar.org/paper/The-Relationship-Between-Deliberate-Practice-and-in-Macnamara-Moreau/633eb930435e8608bc38065961fb8eeb642d84aa?p2df</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[I need an Ontology of Meta-Analyses (so that I might perform a meta-meta-analysis without all the boring data-entry) ]]></description>
<dc:subject>deliberate-practice sports meta-analysis research-article psychology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:ea3c303f5c78/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:deliberate-practice"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sports"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:meta-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:psychology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1608.03960">
    <title>[1608.03960] A Conflict-Free Replicated JSON Datatype</title>
    <dc:date>2020-11-25T09:47:31+00:00</dc:date>
    <link>https://arxiv.org/abs/1608.03960</link>
    <dc:creator>arthegall</dc:creator><dc:subject>martin-kleppman crdts arxiv research-article distributed-systems json</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:a7af982e5989/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:martin-kleppman"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:crdts"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:distributed-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:json"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://fmv.jku.at/papers/RitircBiereKauers-scsc18.pdf">
    <title>Ritirc et al. &quot;A Practical Polynomial Calculus for Arithmetic Circuit Verification&quot;</title>
    <dc:date>2020-10-29T13:51:46+00:00</dc:date>
    <link>http://fmv.jku.at/papers/RitircBiereKauers-scsc18.pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>research-article polynomials algebraic-geometry grobner-bases mathematics proof arithmetic-circuits</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:b24777e2e02d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:polynomials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:algebraic-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:grobner-bases"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:proof"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arithmetic-circuits"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2003.00563">
    <title>[2003.00563] An Equivalence Between Private Classification and Online Prediction</title>
    <dc:date>2020-10-16T10:09:22+00:00</dc:date>
    <link>https://arxiv.org/abs/2003.00563</link>
    <dc:creator>arthegall</dc:creator><dc:subject>differential-privacy arxiv research-article online-algorithms prediction</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:3f5cdceb54a0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:online-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:prediction"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1810.03664">
    <title>[1810.03664] Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time</title>
    <dc:date>2020-10-16T10:07:34+00:00</dc:date>
    <link>https://arxiv.org/abs/1810.03664</link>
    <dc:creator>arthegall</dc:creator><dc:subject>edit-distance arxiv research-article computerscience approximation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:5e55323d4a33/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:edit-distance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:computerscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:approximation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1607.04200">
    <title>[1607.04200] Edit Distance: Sketching, Streaming and Document Exchange</title>
    <dc:date>2020-10-16T10:05:18+00:00</dc:date>
    <link>https://arxiv.org/abs/1607.04200</link>
    <dc:creator>arthegall</dc:creator><dc:subject>arxiv edit-distance research-article sketches probabilistic-methods approximation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:150ce2d0eb4b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:edit-distance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sketches"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:probabilistic-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:approximation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://dsf.berkeley.edu/jmh/papers/anna_ieee18.pdf">
    <title>Anna: a KVS for Any Scale</title>
    <dc:date>2020-09-28T14:50:55+00:00</dc:date>
    <link>https://dsf.berkeley.edu/jmh/papers/anna_ieee18.pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>database key-value-store research-article computerscience</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:a0a9eb5b3f6f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:database"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:key-value-store"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:computerscience"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://petsymposium.org/2020/files/papers/issue3/popets-2020-0047.pdf">
    <title>Choi et al. &quot;Differentially-Private Multi-Party Sketching for Large-Scale Statistics&quot;</title>
    <dc:date>2020-08-01T09:41:55+00:00</dc:date>
    <link>https://petsymposium.org/2020/files/papers/issue3/popets-2020-0047.pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>sketches probabilistic-methods differential-privacy research-article multiparty-computation statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:1a883a1c2d1b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sketches"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:probabilistic-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:multiparty-computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.pnas.org/content/105/52/20589">
    <title>Topological structures in the equities market network | PNAS</title>
    <dc:date>2020-07-14T14:40:14+00:00</dc:date>
    <link>https://www.pnas.org/content/105/52/20589</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[Greg Leibon

(https://press.princeton.edu/books/paperback/9780691139180/data-analysis-for-complex-systems) ]]></description>
<dc:subject>greg-leibon pnas research-article topology data-analysis</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:15d8aa98cdbf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:greg-leibon"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pnas"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:topology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:data-analysis"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1706.00754">
    <title>[1706.00754] Computationally and statistically efficient learning of causal Bayes nets using path queries</title>
    <dc:date>2020-07-07T11:04:44+00:00</dc:date>
    <link>https://arxiv.org/abs/1706.00754</link>
    <dc:creator>arthegall</dc:creator><dc:subject>bayesian-networks arxiv research-article machinelearning causal-networks</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:5d7a93ffd1a7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:bayesian-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:causal-networks"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://pdfs.semanticscholar.org/7b8b/40a4c485593a7f4fe6d9596f5ac2d0d1f681.pdf">
    <title>Pedro Domingos et al. &quot;Version Space Algebra and its Application to Programming by Demonstration&quot;</title>
    <dc:date>2020-06-11T18:55:18+00:00</dc:date>
    <link>https://pdfs.semanticscholar.org/7b8b/40a4c485593a7f4fe6d9596f5ac2d0d1f681.pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>pdf research-article machinelearning classification pedro-domingos</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:de7756c22a7f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pedro-domingos"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.671.6242&amp;rep=rep1&amp;type=pdf">
    <title>Optimal Dynamic Treatments in Resource-Limited Settings (PDF)</title>
    <dc:date>2020-06-11T10:58:03+00:00</dc:date>
    <link>http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.671.6242&amp;rep=rep1&amp;type=pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>research-article working-paper biostatistics berkeley pdf</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:65d09e441322/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:working-paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:biostatistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:berkeley"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pdf"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1905.10615">
    <title>[1905.10615] Adversarial Policies: Attacking Deep Reinforcement Learning</title>
    <dc:date>2020-04-20T15:17:14+00:00</dc:date>
    <link>https://arxiv.org/abs/1905.10615</link>
    <dc:creator>arthegall</dc:creator><dc:subject>stuart-russell machinelearning deep-learning adversarial-examples arxiv research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:fb5710e340e1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:stuart-russell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:adversarial-examples"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://science.sciencemag.org/content/362/6415/690">
    <title>Identity inference of genomic data using long-range familial searches | Science</title>
    <dc:date>2020-02-28T17:20:50+00:00</dc:date>
    <link>https://science.sciencemag.org/content/362/6415/690</link>
    <dc:creator>arthegall</dc:creator><dc:subject>yaniv-erlich genomics privacy research-article familial-searches</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:5f802aad8c50/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:yaniv-erlich"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:genomics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:familial-searches"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.chaum.com/publications/Security_Wthout_Identification.html">
    <title>David Chaum, &quot;Security without Identification&quot;</title>
    <dc:date>2020-02-27T18:44:09+00:00</dc:date>
    <link>https://www.chaum.com/publications/Security_Wthout_Identification.html</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[Classic paper, notable even just for the diagrammatic style.]]></description>
<dc:subject>encryption security privacy digital-signatures research-article david-chaum</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:58f8f9a880c2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:encryption"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:digital-signatures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:david-chaum"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.umd.edu/users/samir/grant/cos-latin.pdf">
    <title>Khuller et al. &quot;Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time &quot;</title>
    <dc:date>2020-02-20T11:37:11+00:00</dc:date>
    <link>http://www.cs.umd.edu/users/samir/grant/cos-latin.pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>scheduling research-article dataflow spark pascal-sturmfels online-algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:9d9ab1cdb771/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:scheduling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:dataflow"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:spark"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pascal-sturmfels"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:online-algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://diytranscriptomics.com/Reading/files/Kallisto.pdf">
    <title>Bray, Pimentel, Melsted, Pachter, &quot;Near-optimal probabilistic RNA-seq quantification&quot;</title>
    <dc:date>2020-02-20T09:54:51+00:00</dc:date>
    <link>http://diytranscriptomics.com/Reading/files/Kallisto.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[This is the kallisto paper from a few years ago.  What I'm thinking about is the combination of this with the ECCs of the PaXoS paper (below) ]]></description>
<dc:subject>genomics probabilistic-genomics research-article lior-pachter</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:b38555c681d9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:genomics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:probabilistic-genomics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:lior-pachter"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://eprint.iacr.org/2020/193.pdf">
    <title>Pinkas et al. &quot;PSI from PaXoS: Fast, Malicious Private Set Intersection&quot;</title>
    <dc:date>2020-02-20T09:42:32+00:00</dc:date>
    <link>https://eprint.iacr.org/2020/193.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[Linear error-correcting codes and cuckoo hashing for private set intersection]]></description>
<dc:subject>set-intersection bloom-filters hashing research-article security privacy codes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:a26b03a13c17/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:set-intersection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:bloom-filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:hashing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:codes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://eprint.iacr.org/2013/515.pdf">
    <title>Dong et al. &quot;When Private Set Intersection Meets Big Data: An Efficient and Scalable Protocol&quot;</title>
    <dc:date>2020-02-20T09:41:18+00:00</dc:date>
    <link>https://eprint.iacr.org/2013/515.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[Introduces "garbled Bloom filters" ]]></description>
<dc:subject>bloom-filters set-intersection security privacy algorithm research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:e8654d527e4e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:bloom-filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:set-intersection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.pnas.org/content/116/29/14516.short">
    <title>A modern maximum-likelihood theory for high-dimensional logistic regression | PNAS</title>
    <dc:date>2020-01-23T18:57:57+00:00</dc:date>
    <link>https://www.pnas.org/content/116/29/14516.short</link>
    <dc:creator>arthegall</dc:creator><dc:subject>machinelearning emmanuel-candes logistic-regression pnas research-article regression</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:ffa04a104a1d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:emmanuel-candes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:logistic-regression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:pnas"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:regression"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3444678">
    <title>The Effects of Confounding When Making Automatic Intervention Decisions Using Machine Learning by Carlos Fernández, Foster Provost :: SSRN</title>
    <dc:date>2019-12-13T10:59:45+00:00</dc:date>
    <link>https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3444678</link>
    <dc:creator>arthegall</dc:creator><dc:subject>via:arsyed confounding statistics machinelearning causality research-article ssrn sigma</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:5a9da47dd49d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:arsyed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:confounding"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:causality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:ssrn"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sigma"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1510.05569">
    <title>[1510.05569] Estimating the Causal Impact of Recommendation Systems from Observational Data</title>
    <dc:date>2019-12-10T14:43:49+00:00</dc:date>
    <link>https://arxiv.org/abs/1510.05569</link>
    <dc:creator>arthegall</dc:creator><dc:subject>recommendations arxiv research-article statistics iv-methods causality sigma duncan-watts</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:5ae96eb42056/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:recommendations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:iv-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:causality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sigma"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:duncan-watts"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1601.01280">
    <title>[1601.01280] Language to Logical Form with Neural Attention</title>
    <dc:date>2019-12-10T13:12:39+00:00</dc:date>
    <link>https://arxiv.org/abs/1601.01280</link>
    <dc:creator>arthegall</dc:creator><dc:subject>neural-networks sigma machinelearning research-article arxiv</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:4639d787cca2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sigma"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1508.01991">
    <title>[1508.01991] Bidirectional LSTM-CRF Models for Sequence Tagging</title>
    <dc:date>2019-12-10T13:12:11+00:00</dc:date>
    <link>https://arxiv.org/abs/1508.01991</link>
    <dc:creator>arthegall</dc:creator><dc:subject>sequence-analysis lstm neural-networks machinelearning arxiv sigma tagging research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:d27ddbfe59ab/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sequence-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:lstm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sigma"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:tagging"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1910.10871">
    <title>[1910.10871] Preventing Adversarial Use of Datasets through Fair Core-Set Construction</title>
    <dc:date>2019-10-26T15:56:43+00:00</dc:date>
    <link>https://arxiv.org/abs/1910.10871</link>
    <dc:creator>arthegall</dc:creator><dc:subject>via:cshalizi adversarial-methods machinelearning arxiv research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:d0ca37d3b3bd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:cshalizi"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:adversarial-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1602.02201">
    <title>[1602.02201] The Rate-Distortion Risk in Estimation from Compressed Data</title>
    <dc:date>2019-10-26T15:56:15+00:00</dc:date>
    <link>https://arxiv.org/abs/1602.02201</link>
    <dc:creator>arthegall</dc:creator><dc:subject>via:? compression machinelearning research-article arxiv</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:b62f3c34e055/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:?"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:compression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.semanticscholar.org/paper/Using-Word-Vectors-to-Improve-Word-Alignments-for-Pourdamghani-Ghazvininejad/8f4bf65a6b62cecc6f7b0ab2489a831d9a44a86d">
    <title>[PDF] Using Word Vectors to Improve Word Alignments for Low Resource Machine Translation - Semantic Scholar</title>
    <dc:date>2019-10-26T05:47:48+00:00</dc:date>
    <link>https://www.semanticscholar.org/paper/Using-Word-Vectors-to-Improve-Word-Alignments-for-Pourdamghani-Ghazvininejad/8f4bf65a6b62cecc6f7b0ab2489a831d9a44a86d</link>
    <dc:creator>arthegall</dc:creator><dc:subject>translation nlp word-embeddings machinelearning research-article computational-linguistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:c926c327e04a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:translation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:nlp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:word-embeddings"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:computational-linguistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1910.05992">
    <title>[1910.05992] Pathological spectra of the Fisher information metric and its variants in deep neural networks</title>
    <dc:date>2019-10-26T05:47:07+00:00</dc:date>
    <link>https://arxiv.org/abs/1910.05992</link>
    <dc:creator>arthegall</dc:creator><dc:subject>shun-ichi-amari arxiv research-article machinelearning deep-learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:67598683e6c7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:shun-ichi-amari"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:deep-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.aclweb.org/anthology/D16-1126/">
    <title>Generating Topical Poetry - ACL Anthology</title>
    <dc:date>2019-10-26T05:45:00+00:00</dc:date>
    <link>https://www.aclweb.org/anthology/D16-1126/</link>
    <dc:creator>arthegall</dc:creator><dc:subject>poetry language nlp research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:df2bb42e8863/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:poetry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:nlp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.aclweb.org/anthology/N15-1180/">
    <title>How to Memorize a Random 60-Bit String - ACL Anthology</title>
    <dc:date>2019-10-26T05:43:41+00:00</dc:date>
    <link>https://www.aclweb.org/anthology/N15-1180/</link>
    <dc:creator>arthegall</dc:creator><dc:subject>memory memorization research-article language</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:708e30ba2c68/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:memory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:memorization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:language"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1511.05219">
    <title>[1511.05219] How much does your data exploration overfit? Controlling bias via information usage</title>
    <dc:date>2019-10-12T09:41:21+00:00</dc:date>
    <link>https://arxiv.org/abs/1511.05219</link>
    <dc:creator>arthegall</dc:creator><dc:subject>statistics machinelearning via:cshalizi overfitting bias arxiv research-article garden-of-forking-paths</dc:subject>
<dc:identifier>https://pinboard.in/u:arthegall/b:2db3b94391b1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:cshalizi"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:overfitting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:bias"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:garden-of-forking-paths"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1910.04618">
    <title>[1910.04618] Universal Adversarial Perturbation for Text Classification</title>
    <dc:date>2019-10-12T09:40:24+00:00</dc:date>
    <link>https://arxiv.org/abs/1910.04618</link>
    <dc:creator>arthegall</dc:creator><dc:subject>machinelearning via:cshalizi deep-networks classification nlp text arxiv research-article perturbations</dc:subject>
<dc:identifier>https://pinboard.in/u:arthegall/b:0da5fbb4d951/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:cshalizi"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:deep-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:nlp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:text"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:perturbations"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1901.08113">
    <title>[1901.08113] Unveiling the potential of Graph Neural Networks for network modeling and optimization in SDN</title>
    <dc:date>2019-10-09T13:13:32+00:00</dc:date>
    <link>https://arxiv.org/abs/1901.08113</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["In this paper we propose a novel Graph Neural Network (GNN) model able to understand the complex relationship between topology, routing and input traffic to produce accurate estimates of the per-source/destination pair mean delay and jitter. GNN are tailored to learn and model information structured as graphs and as a result, our model is able to generalize over arbitrary topologies, routing schemes and variable traffic intensity." 

to read]]></description>
<dc:subject>to-read arxiv research-article machinelearning deep-learning graphs networks</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:248dd068ef2c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:graphs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:networks"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.11942v1">
    <title>[1909.11942v1] ALBERT: A Lite BERT for Self-supervised Learning of Language Representations</title>
    <dc:date>2019-10-09T13:12:37+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.11942v1</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["ALBERT is a lite BERT" deep networks are reaching the out-of-control-acronym phase of their hype cycle]]></description>
<dc:subject>deep-learning arxiv research-article nlp bert embeddings</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:604981a738cf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:nlp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:bert"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:embeddings"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.13649">
    <title>[1909.13649] PlanAlyzer: Assessing Threats to the Validity of Online Experiments</title>
    <dc:date>2019-10-09T12:13:30+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.13649</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["We present the first approach for statically checking the internal validity of online experiments. Our checks are based on well-known problems that arise in experimental design and causal inference. Our analyses target PlanOut, a widely deployed, open-source experimentation framework that uses a domain-specific language to specify and run complex experiments. We have built a tool, PlanAlyzer, that checks PlanOut programs for a variety of threats to internal validity, including failures of randomization, treatment assignment, and causal sufficiency. PlanAlyzer uses its analyses to automatically generate *contrasts*, a key type of information required to perform valid statistical analyses over experimental results."

-- of interest for reasons of "static analysis," and experimental design]]></description>
<dc:subject>static-analysis arxiv social-science via:dean-eckles research-article internal-validity statistics experimental-design</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:208c06260304/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:static-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:social-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:dean-eckles"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:internal-validity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:experimental-design"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://github.com/frankmcsherry/blog/blob/master/assets/Synth-SIGMOD.pdf">
    <title>Frank McSherry, &quot;Synthetic Data via Differential Privacy&quot;</title>
    <dc:date>2019-09-07T10:18:40+00:00</dc:date>
    <link>https://github.com/frankmcsherry/blog/blob/master/assets/Synth-SIGMOD.pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>frank-mcsherry differential-privacy data research-article privacy testing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:bb91cd3f49a4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:frank-mcsherry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:testing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1908.11358">
    <title>[1908.11358] Private Heavy Hitters and Range Queries in the Shuffled Model</title>
    <dc:date>2019-09-06T09:25:14+00:00</dc:date>
    <link>https://arxiv.org/abs/1908.11358</link>
    <dc:creator>arthegall</dc:creator><dc:subject>differential-privacy privacy arxiv research-article data-analytics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:6ada30089acc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:data-analytics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1905.13229">
    <title>[1905.13229] Private Hypothesis Selection</title>
    <dc:date>2019-09-06T09:24:46+00:00</dc:date>
    <link>https://arxiv.org/abs/1905.13229</link>
    <dc:creator>arthegall</dc:creator><dc:subject>differential-privacy statistics inference research-article arxiv</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:95bd347048fc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:inference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.01917">
    <title>[1909.01917] Differentially Private SQL with Bounded User Contribution</title>
    <dc:date>2019-09-06T09:21:18+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.01917</link>
    <dc:creator>arthegall</dc:creator><dc:subject>differential-privacy sql databases arxiv research-article google</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:b4f0063fd1f2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sql"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:databases"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:google"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.366.5957&amp;rep=rep1&amp;type=pdf">
    <title>Ilya Mironov, &quot;On Significance of the Least Significant Bits for Differential Privacy&quot;</title>
    <dc:date>2019-09-06T09:21:01+00:00</dc:date>
    <link>http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.366.5957&amp;rep=rep1&amp;type=pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["We describe a new type of vulnerability present in many implementations of differentially private mechanisms. In particular, all four publicly available general purpose systems for differentially private computations are susceptible to our attack.

The vulnerability is based on irregularities of floating-point implementations of the privacy-preserving Laplacian mechanism. Unlike its mathematical abstraction, the textbook sampling procedure results in a porous distribution over double-precision numbers that allows one to breach differential privacy with just a few queries into the mechanism" + mitigation strategy ]]></description>
<dc:subject>differential-privacy privacy research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:6b68e69a4a8b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://web.cs.ucdavis.edu/~rogaway/papers/bmr90">
    <title>Beaver, Micali, Rogaway, &quot;The Round Complexity of Secure Protocols&quot;</title>
    <dc:date>2019-09-06T09:15:26+00:00</dc:date>
    <link>https://web.cs.ucdavis.edu/~rogaway/papers/bmr90</link>
    <dc:creator>arthegall</dc:creator><dc:subject>smc research-article computerscience security privacy</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:6e9d59768e7e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:smc"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:computerscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/GMW87/GMW87.pdf">
    <title>Goldreich, Micali, Wigderson, &quot;How to Play Any Mental Game&quot;</title>
    <dc:date>2019-09-06T09:14:48+00:00</dc:date>
    <link>http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/GMW87/GMW87.pdf</link>
    <dc:creator>arthegall</dc:creator><dc:subject>smc computerscience privacy security research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:c09775b112f9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:smc"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:computerscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1706.04692">
    <title>[1706.04692] Bias and high-dimensional adjustment in observational studies of peer effects</title>
    <dc:date>2019-07-31T02:44:09+00:00</dc:date>
    <link>https://arxiv.org/abs/1706.04692</link>
    <dc:creator>arthegall</dc:creator><dc:subject>dean-eckles machinelearning observational-studies via:twitter statistics arxiv research-article privacy</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:6a1f2d44e112/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:dean-eckles"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:observational-studies"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:twitter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1603.01508">
    <title>[1603.01508] Inferential Privacy Guarantees for Differentially Private Mechanisms</title>
    <dc:date>2019-07-31T02:42:01+00:00</dc:date>
    <link>https://arxiv.org/abs/1603.01508</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[via Aaron Roth's twitter feed.  ]]></description>
<dc:subject>robert-kleinberg differential-privacy inferential-privacy privacy arxiv research-article</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:1bd530b2335a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:robert-kleinberg"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:inferential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1809.09561">
    <title>[1809.09561] Evaluating stochastic seeding strategies in networks</title>
    <dc:date>2019-04-13T10:39:48+00:00</dc:date>
    <link>https://arxiv.org/abs/1809.09561</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[[spooky sound] daaaannnnnngerous research!

Slightly more seriously: I've had this idea for a while, that you could use social networks to scale up re-identifying attacks a la Erlich's 2013 surnames-from-anonymous-genomes paper.  Basically, you're more likely to be connected to people in a social network (of almost any kind) if you're related to them, than if they're some rando off the street.  Ergo, you should be able to compute approximate distances in social networks via genetic measures (% IBD? longest IBD region? etc.) and work backwards through the network to resolve an anonymous sequence into a network node.  I think the process must look something like what's described here.  

I probably should think this through in more detail.  

(I remain pretty confident that people like Y.E. have been talking about this with TLAs for a number of years, so this isn't really 'cutting edge' anymore. <sigh>) ]]></description>
<dc:subject>dean-eckles social-networks research-article arxiv</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:9b1fe60c7187/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:dean-eckles"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:social-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://papers.nips.cc/paper/5392-extremal-mechanisms-for-local-differential-privacy.pdf">
    <title>Kairouz, Oh, Viswanath, &quot;Extremal Mechanisms for Local Differential Privacy&quot;</title>
    <dc:date>2019-04-13T10:33:23+00:00</dc:date>
    <link>https://papers.nips.cc/paper/5392-extremal-mechanisms-for-local-differential-privacy.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["We introduce a family of extremal privatization mechanisms, which we call staircase mechanisms, and prove that it contains the optimal privatization mechanism that maximizes utility. We further show that for all information theoretic utility functions studied in this paper, maximizing utility is equivalent to solving a linear program, the outcome of which is the optimal staircase mechanism."]]></description>
<dc:subject>local-differential-privacy differential-privacy research-article linear-programming randomization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:f22671196c26/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:local-differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:linear-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:randomization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1904.03564">
    <title>Joseph, Mao, Neel, Roth, &quot;The Role of Interactivity in Local Differential Privacy&quot; (arXiv)</title>
    <dc:date>2019-04-13T10:26:18+00:00</dc:date>
    <link>https://arxiv.org/abs/1904.03564</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["First, we classify locally private protocols by their compositionality, the multiplicative factor k≥1 by which the sum of a protocol's single-round privacy parameters exceeds its overall privacy guarantee. We then show how to efficiently transform any fully interactive k-compositional protocol into an equivalent sequentially interactive protocol with an O(k) blowup in sample complexity."]]></description>
<dc:subject>differential-privacy interactivity algorithms research-article arxiv local-differential-privacy</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:f48b4834a714/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:interactivity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:local-differential-privacy"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/pdf/1407.1546.pdf">
    <title>Kairouz, Oh, Viswanath, &quot;Differentially Private Multi-party Computation: Optimality of Non-Interactive Randomized Response&quot;</title>
    <dc:date>2019-04-13T10:25:01+00:00</dc:date>
    <link>https://arxiv.org/pdf/1407.1546.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["We study the problem of interactive function computation by multiple parties possessing a single bit each in a differential privacy setting... Our main result is the exact optimality of a simple non-interactive protocol: each party randomizes (sufficiently) and publishes its own bit. In other words, non-interactive randomized response is exactly optimal."]]></description>
<dc:subject>differential-privacy research-article randomization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:718586693f95/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:randomization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://proceedings.mlr.press/v37/kairouz15.pdf">
    <title>Kairouz, Oh, Viswanath, &quot;The Composition Theorem for Differential Privacy&quot;</title>
    <dc:date>2019-04-13T10:22:57+00:00</dc:date>
    <link>http://proceedings.mlr.press/v37/kairouz15.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["Sequential querying of differentially private mechanisms degrades the overall privacy level. In this paper, we answer the fundamental question of characterizing the level of overall privacy degradation as a function of the number of queries and the privacy levels maintained by each privatization mechanism."]]></description>
<dc:subject>differential-privacy research-article privacy</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:e898eba435e4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://stanford.edu/~jduchi/projects/DuchiJoWa13_focs.pdf">
    <title>Duchi, Jordan, Wainwright, &quot;Local Privacy and Statistical Minimax Rates&quot;</title>
    <dc:date>2019-04-13T10:21:08+00:00</dc:date>
    <link>https://stanford.edu/~jduchi/projects/DuchiJoWa13_focs.pdf</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[Introduces "local differential privacy," where data remains private even from the learner or data analyst.]]></description>
<dc:subject>local-differential-privacy differential-privacy research-article michael-jordan privacy</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:3503f9041d42/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:local-differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:differential-privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:michael-jordan"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:privacy"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.nature.com/articles/s41588-018-0178-9">
    <title>Relatedness disequilibrium regression estimates heritability without environmental bias | Nature Genetics</title>
    <dc:date>2019-03-17T13:24:31+00:00</dc:date>
    <link>https://www.nature.com/articles/s41588-018-0178-9</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[This paper functions well as a tutorial, on different methods for estimating "fraction of heritability explained" through different genetic methods, and how they might (or might not) be biased estimates in the presence of 'environmental' effects.]]></description>
<dc:subject>heritability genetics research-article kari-stefansson</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:6685725e96c2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:heritability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:genetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:kari-stefansson"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1902.10286">
    <title>[1902.10286] On Multi-Cause Causal Inference with Unobserved Confounding: Counterexamples, Impossibility, and Alternatives</title>
    <dc:date>2019-03-12T06:54:58+00:00</dc:date>
    <link>https://arxiv.org/abs/1902.10286</link>
    <dc:creator>arthegall</dc:creator><dc:subject>via:nikete causality arxiv research-article statistics inference</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:09c9259c749b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:nikete"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:causality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:inference"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1805.00155">
    <title>[1805.00155] Live Functional Programming with Typed Holes</title>
    <dc:date>2019-02-20T11:29:16+00:00</dc:date>
    <link>https://arxiv.org/abs/1805.00155</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[This looks exceptionally cool, and relevant to the general task of "DX" ]]></description>
<dc:subject>developer-experience programminglanguage arxiv preprint research-article computerscience type-systems functionalprogramming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:f90e5380f427/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:developer-experience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:programminglanguage"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:preprint"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:computerscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:type-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:functionalprogramming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1902.04114">
    <title>[1902.04114] Using Embeddings to Correct for Unobserved Confounding</title>
    <dc:date>2019-02-20T11:12:28+00:00</dc:date>
    <link>https://arxiv.org/abs/1902.04114</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA["We consider causal inference in the presence of unobserved confounding. In particular, we study the case where a proxy is available for the confounder but the proxy has non-iid structure. As one example, the link structure of a social network carries information about its members."]]></description>
<dc:subject>victor-veitch arxiv research-article machinelearning confounding causal-learning causality</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:9ba4c0c69695/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:victor-veitch"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:confounding"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:causal-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:causality"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1902.06720">
    <title>[1902.06720] Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descent</title>
    <dc:date>2019-02-20T11:07:36+00:00</dc:date>
    <link>https://arxiv.org/abs/1902.06720</link>
    <dc:creator>arthegall</dc:creator><dc:subject>via:cshalizi neural-networks deep-learning arxiv research-article machinelearning gradient-descent</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:3311b38c89da/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:cshalizi"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:gradient-descent"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1902.04738">
    <title>[1902.04738] Mesh: Compacting Memory Management for C/C++ Applications</title>
    <dc:date>2019-02-19T11:16:37+00:00</dc:date>
    <link>https://arxiv.org/abs/1902.04738</link>
    <dc:creator>arthegall</dc:creator><description><![CDATA[To read (after I've read the original Robson paper, for context) ]]></description>
<dc:subject>memory memory-allocation programming arxiv research-article computerscience</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:f21597a44ef4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:memory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:memory-allocation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:computerscience"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1902.01023">
    <title>[1902.01023] Enhanced Hierarchical Music Structure Annotations via Feature Level Similarity Fusion</title>
    <dc:date>2019-02-14T09:55:50+00:00</dc:date>
    <link>https://arxiv.org/abs/1902.01023</link>
    <dc:creator>arthegall</dc:creator><dc:subject>sigma via:Vaguery arxiv preprint research-article music annotation spectral-clustering</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:arthegall/b:e0e4c58eac09/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:sigma"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:via:Vaguery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:arxiv"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:preprint"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:research-article"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:music"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:annotation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:arthegall/t:spectral-clustering"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>