Author of the publication

Strategien der Arbeitsbeschaffung in 3 Ländern: antizyklische, problemgruppen-orientierte u. experimentelle Arbeitsbeschaffungsmaßnahmen

. Discussion papers / Internationales Institut für Management und Verwaltung. Arbeitsmarktpolitik Wissenschaftszentrum, Berlin, (1983)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Workshop summary: On-line learning with limited feedback., , , , , and . ICML, volume 382 of ACM International Conference Proceeding Series, page 8. ACM, (2009)On-Line Learning of Rectangles in Noisy Environments.. COLT, page 253-261. ACM, (1993)Learning of Depth Two Neural Networks with Constant Fan-In at the Hidden Nodes (Extended Abstract)., , , and . COLT, page 333-343. ACM, (1996)Strategien der Arbeitsbeschaffung in 3 Ländern: antizyklische, problemgruppen-orientierte u. experimentelle Arbeitsbeschaffungsmaßnahmen. Discussion papers / Internationales Institut für Management und Verwaltung. Arbeitsmarktpolitik Wissenschaftszentrum, Berlin, (1983)Pareto Front Identification from Stochastic Bandit Feedback., , , and . AISTATS, volume 51 of JMLR Workshop and Conference Proceedings, page 939-947. JMLR.org, (2016)Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits., , , , and . ALT, volume 6925 of Lecture Notes in Computer Science, page 189-203. Springer, (2011)Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information., , , , , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 159-163. PMLR, (2019)The InfoSky visual explorer: exploiting hierarchical structure and document similarities., , , , , , , , and . Inf. Vis., 1 (3-4): 166-181 (2002)Approximating Hyper-Rectangles: Learning and Pseudorandom Sets., , and . J. Comput. Syst. Sci., 57 (3): 376-388 (1998)Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning., and . NIPS, page 49-56. MIT Press, (2006)