<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://mw.hh.se/caisr/index.php?action=history&amp;feed=atom&amp;title=Hide-and-Seek_Privacy_Challenge_%28NeurIPS_2020%29</id>
	<title>Hide-and-Seek Privacy Challenge (NeurIPS 2020) - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mw.hh.se/caisr/index.php?action=history&amp;feed=atom&amp;title=Hide-and-Seek_Privacy_Challenge_%28NeurIPS_2020%29"/>
	<link rel="alternate" type="text/html" href="https://mw.hh.se/caisr/index.php?title=Hide-and-Seek_Privacy_Challenge_(NeurIPS_2020)&amp;action=history"/>
	<updated>2026-04-04T06:43:37Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.35.13</generator>
	<entry>
		<id>https://mw.hh.se/caisr/index.php?title=Hide-and-Seek_Privacy_Challenge_(NeurIPS_2020)&amp;diff=4714&amp;oldid=prev</id>
		<title>Onur at 10:31, 13 October 2020</title>
		<link rel="alternate" type="text/html" href="https://mw.hh.se/caisr/index.php?title=Hide-and-Seek_Privacy_Challenge_(NeurIPS_2020)&amp;diff=4714&amp;oldid=prev"/>
		<updated>2020-10-13T10:31:00Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 10:31, 13 October 2020&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l4&quot; &gt;Line 4:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 4:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;|References=https://www.vanderschaar-lab.com/privacy-challenge/&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;|References=https://www.vanderschaar-lab.com/privacy-challenge/&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;|Supervisor=Onur Dikmen&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;|Supervisor=Onur Dikmen&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;|Level=Master&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;|Status=Open&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;}}&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;}}&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;This project is about building competitive methods for NeurIPS 2020 Hide-and-Seek Privacy Challenge:&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;This project is about building competitive methods for NeurIPS 2020 Hide-and-Seek Privacy Challenge:&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Onur</name></author>
	</entry>
	<entry>
		<id>https://mw.hh.se/caisr/index.php?title=Hide-and-Seek_Privacy_Challenge_(NeurIPS_2020)&amp;diff=4712&amp;oldid=prev</id>
		<title>Onur: Created page with &quot;{{StudentProjectTemplate |Summary=Building novel methods for privacy-preserving data sharing and/or re-identification |Keywords=modelling, privacy preservation, classification...&quot;</title>
		<link rel="alternate" type="text/html" href="https://mw.hh.se/caisr/index.php?title=Hide-and-Seek_Privacy_Challenge_(NeurIPS_2020)&amp;diff=4712&amp;oldid=prev"/>
		<updated>2020-10-13T10:04:36Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;{{StudentProjectTemplate |Summary=Building novel methods for privacy-preserving data sharing and/or re-identification |Keywords=modelling, privacy preservation, classification...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{StudentProjectTemplate&lt;br /&gt;
|Summary=Building novel methods for privacy-preserving data sharing and/or re-identification&lt;br /&gt;
|Keywords=modelling, privacy preservation, classification, re-identification&lt;br /&gt;
|References=https://www.vanderschaar-lab.com/privacy-challenge/&lt;br /&gt;
|Supervisor=Onur Dikmen&lt;br /&gt;
}}&lt;br /&gt;
This project is about building competitive methods for NeurIPS 2020 Hide-and-Seek Privacy Challenge:&lt;br /&gt;
https://www.vanderschaar-lab.com/privacy-challenge/&lt;br /&gt;
&lt;br /&gt;
Competing in this challenge would also be a challenge since the deadline is quite soon (November 15th, 2020), however submitting a reasonable method to this challenge guarantees at least a grade 4 for the thesis.&lt;br /&gt;
&lt;br /&gt;
More realistically, the aim is to take up the same challenge and  tackle it throughout your thesis. It provides a great platform with freely accessible dataset and open-source contributions. An evaluation set will be available only to the contributors after the deadline, so it is advantageous to enter the competition officially.&lt;br /&gt;
&lt;br /&gt;
The tasks are:&lt;br /&gt;
- Hide: Generate synthetical data based on the original dataset so that it is similar to the real data but privacy-preserving (robust to re-identification)&lt;br /&gt;
- Seek: Classify (re-identify) people accurately from synthetical datasets&lt;br /&gt;
&lt;br /&gt;
The students who are interested in this thesis must have a strong theoretical background in statistics, probability and machine learning and high grades from corresponding courses.&lt;/div&gt;</summary>
		<author><name>Onur</name></author>
	</entry>
</feed>