Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Lukas Trottner

dblp:348/9511 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Learning theory · 33%
Theoretical computer science
1 paper
Mathematical optimization · 50% Information theory · 50%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
concentration inequalities
0.712023
Concentration analysis of multivariate elliptic diffusions · J. Mach. Learn. Res. 2023
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
langevin dynamics
0.712023
Concentration analysis of multivariate elliptic diffusions · J. Mach. Learn. Res. 2023
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo
0.712023
Concentration analysis of multivariate elliptic diffusions · J. Mach. Learn. Res. 2023
Mathematical optimization › statistical estimation › regression › sparse regression
lasso
0.212023
Concentration analysis of multivariate elliptic diffusions · J. Mach. Learn. Res. 2023
Information theory › signal processing › compressed sensing › sparse recovery
restricted eigenvalue condition
0.212023
Concentration analysis of multivariate elliptic diffusions · J. Mach. Learn. Res. 2023

Methods — techniques the papers use, named apart from their topics

poisson equation · 1.3concentration inequalities · 1.3PAC bounds · 1.3
YearPublicationVenuePosition
2023 Concentration analysis of multivariate elliptic diffusions
abstract
We prove concentration inequalities and associated PAC bounds for both continuous- and discrete-time additive functionals for possibly unbounded functions of multivariate, nonreversible diffusion processes. Our analysis relies on an approach via the Poisson equation allowing us to consider a very broad class of subexponentially ergodic, multivariate diffusion processes. These results add to existing concentration inequalities for additive functionals of diffusion processes which have so far been only available for either bounded functions or for unbounded functions of processes from a significantly smaller class. We demonstrate the power of these exponential inequalities by two examples of very different areas. Considering a possibly high-dimensional, parametric, nonlinear drift model under sparsity constraints we apply the continuous-time concentration results to validate the restricted eigenvalue condition for Lasso estimation, which is fundamental for the derivation of oracle inequalities. The results for discrete additive functionals are applied for an investigation of the unadjusted Langevin MCMC algorithm for sampling of moderately heavy tailed densities $\pi$. In particular, we provide PAC bounds for the sample Monte Carlo estimator of integrals $\pi(f)$ for polynomially growing functions $f$ that quantify sufficient sample and step sizes for approximation within a prescribed margin with high probability.
Lukas Trottner, Cathrine Aeckerle-Willems, Claudia Strauch
J. Mach. Learn. Res.1