| Publication | Date of Publication | Type |
|---|
| How to trap a gradient flow | 2024-07-17 | Paper |
| First-Order Bayesian Regret Analysis of Thompson Sampling | 2024-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147381 | 2024-01-15 | Paper |
| Parametrized Metrical Task Systems | 2023-10-31 | Paper |
| Kernel-based Methods for Bandit Convex Optimization | 2022-12-08 | Paper |
| The Randomized $k$-Server Conjecture is False! | 2022-11-10 | Paper |
| On the complexity of finding stationary points of smooth functions in one dimension | 2022-09-15 | Paper |
| Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing | 2021-06-22 | Paper |
| Chasing Nested Convex Bodies Nearly Optimally | 2021-02-02 | Paper |
| Metrical Service Systems with Transformations | 2020-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5219717 | 2020-03-12 | Paper |
| Optimal Algorithms for Non-Smooth Distributed Optimization in Networks | 2020-02-07 | Paper |
| Competitively chasing convex bodies | 2020-01-30 | Paper |
| A Nearly-Linear Bound for Chasing Nested Convex Bodies | 2019-10-15 | Paper |
| Metrical task systems on trees via mirror descent and unfair gluing | 2019-10-15 | Paper |
| k-server via multiscale entropic regularization | 2019-08-22 | Paper |
| An homotopy method for l p regression provably beyond self-concordance and in input-sparsity time | 2019-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5381115 | 2019-06-07 | Paper |
| Exploratory distributions for convex functions | 2019-04-24 | Paper |
| Entropic CLT and Phase Transition in High-dimensional Wishart Matrices | 2019-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617598 | 2019-02-06 | Paper |
| Near-optimal method for highly smooth convex optimization | 2018-12-19 | Paper |
| Sampling from a log-concave distribution with projected Langevin Monte Carlo | 2018-07-13 | Paper |
| Detecting Markov random fields hidden in white noise | 2018-05-18 | Paper |
| Basic models and questions in statistical network analysis | 2017-10-12 | Paper |
| From trees to seeds: on the inference of the seed from large trees in the uniform attachment model | 2017-09-21 | Paper |
| Local max-cut in smoothed polynomial time | 2017-08-17 | Paper |
| Kernel-based methods for bandit convex optimization | 2017-08-17 | Paper |
| Bandits With Heavy Tail | 2017-06-08 | Paper |
| Finding Adam in random growing trees | 2017-04-18 | Paper |
| Testing for high-dimensional geometry in random graphs | 2016-11-09 | Paper |
| Convex optimization: algorithms and complexity | 2016-05-30 | Paper |
| Exceptional rotations of random graphs: a VC theory | 2016-02-19 | Paper |
| On the Local Profiles of Trees | 2016-02-01 | Paper |
| On paths, stars and wyes in trees | 2016-01-08 | Paper |
| Asymptotic behavior of the Eden model with positively homogeneous edge weights | 2015-08-20 | Paper |
| Detecting positive correlations in a multivariate sample | 2015-05-19 | Paper |
| Regret in Online Combinatorial Optimization | 2014-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405258 | 2014-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396654 | 2014-02-03 | Paper |
| Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems | 2014-02-03 | Paper |
| On the influence of the seed graph in the preferential attachment model | 2014-01-20 | Paper |
| How the initialization affects the stability of the қ-means algorithm | 2013-05-14 | Paper |
| Detection of correlations | 2012-09-03 | Paper |
| Regret bounds and minimax policies under partial monitoring | 2012-07-13 | Paper |
| Nearest neighbor clustering: a baseline method for consistent clustering with arbitrary objective functions | 2012-04-17 | Paper |
| Lipschitz Bandits without the Lipschitz Constant | 2011-10-19 | Paper |
| Pure exploration in finitely-armed and continuous-armed bandits | 2011-04-14 | Paper |
| Pure Exploration in Multi-armed Bandits Problems | 2009-12-01 | Paper |
| Pure Exploration for Multi-Armed Bandit Problems | 2008-02-19 | Paper |
