Jan Arpe

According to our database, Jan Arpe authored at least 12 papers between 2003 and 2010.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2010

Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles.

Jan Arpe, Elchanan Mossel

Comb. Probab. Comput., 2010

2008

Agnostically Learning Juntas from Random Walks

Jan Arpe, Elchanan Mossel

CoRR, 2008

Multiple Random Oracles Are Better Than One

Jan Arpe, Elchanan Mossel

CoRR, 2008

2007

When Does Greedy Learning of Relevant Attributes Succeed?

Jan Arpe, Rüdiger Reischuk

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Learning concepts with few unknown relevant attributes from noisy data.

Jan Arpe

PhD thesis, 2006

When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---.

Jan Arpe, Rüdiger Reischuk

Electron. Colloquium Comput. Complex., 2006

Learning Juntas in the Presence of Noise.

Jan Arpe, Rüdiger Reischuk

Proceedings of the Theory and Applications of Models of Computation, 2006

On the Complexity of Optimal Grammar-Based Compression.

Jan Arpe, Rüdiger Reischuk

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

Approximability of Minimum AND-Circuits.

Jan Arpe, Bodo Manthey

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005

Learning Juntas in the Presence of Noise

Jan Arpe

Electron. Colloquium Comput. Complex., 2005

2003

One-Way Communication Complexity of Symmetric Boolean Functions.

Jan Arpe, Andreas Jakoby, Maciej Liskiewicz

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Robust Inference of Relevant Attributes.

Jan Arpe, Rüdiger Reischuk

Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003