<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://sublinear.info/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Jakub+T%C4%9Btek</id>
	<title>Open Problems in Sublinear Algorithms - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://sublinear.info/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Jakub+T%C4%9Btek"/>
	<link rel="alternate" type="text/html" href="https://sublinear.info/index.php?title=Special:Contributions/Jakub_T%C4%9Btek"/>
	<updated>2026-06-06T21:59:16Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.31.10</generator>
	<entry>
		<id>https://sublinear.info/index.php?title=Open_Problems_talk:85&amp;diff=1319</id>
		<title>Open Problems talk:85</title>
		<link rel="alternate" type="text/html" href="https://sublinear.info/index.php?title=Open_Problems_talk:85&amp;diff=1319"/>
		<updated>2021-04-12T08:55:18Z</updated>

		<summary type="html">&lt;p&gt;Jakub Tětek: adding a reference&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;There came out a paper [1] that considers a very similar question. It does not solve this question explicitly but it would be worth looking at whether their methods imply a solution to this problem. At the very least, it is very relevant.&lt;br /&gt;
&lt;br /&gt;
[1] Sample Amplification:Increasing Dataset Size even when Learning is Impossible; Brian Axelrod, Shivam Garg, Vatsal Sharan, Gregory Valiant; http://proceedings.mlr.press/v119/axelrod20a/axelrod20a.pdf&lt;/div&gt;</summary>
		<author><name>Jakub Tětek</name></author>
		
	</entry>
</feed>