default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMattes Mollenhauer
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i8]Martin Genzel, Patrick Putzky, Pengfei Zhao, Sebastian Schulze, Mattes Mollenhauer, Robert Seidel, Stefan Dietzel, Thomas Wollmann:
Choose Your Model Size: Any Compression by a Single Gradient Descent. CoRR abs/2502.01717 (2025)- 2024
- [j3]Zhu Li, Dimitri Meunier, Mattes Mollenhauer, Arthur Gretton:
Towards Optimal Sobolev Norm Rates for the Vector-Valued Regularized Least-Squares Algorithm. J. Mach. Learn. Res. 25: 181:1-181:51 (2024) - [c3]Dimitri Meunier, Zikai Shen, Mattes Mollenhauer, Arthur Gretton, Zhu Li:
Optimal Rates for Vector-Valued Spectral Regularization Learning Algorithms. NeurIPS 2024 - [i7]Dimitri Meunier, Zikai Shen, Mattes Mollenhauer, Arthur Gretton, Zhu Li:
Optimal Rates for Vector-Valued Spectral Regularization Learning Algorithms. CoRR abs/2405.14778 (2024) - 2023
- [j2]Andreas Bittracher
, Mattes Mollenhauer, Péter Koltai, Christof Schütte:
Optimal Reaction Coordinates: Variational Characterization and Sparse Computation. Multiscale Model. Simul. 21(2): 449-488 (2023) - [i6]Zhu Li, Dimitri Meunier, Mattes Mollenhauer, Arthur Gretton:
Towards Optimal Sobolev Norm Rates for the Vector-Valued Regularized Least-Squares Algorithm. CoRR abs/2312.07186 (2023) - 2022
- [j1]Mattes Mollenhauer, Stefan Klus, Christof Schütte, Péter Koltai:
Kernel Autocovariance Operators of Stationary Processes: Estimation and Convergence. J. Mach. Learn. Res. 23: 327:1-327:34 (2022) - [c2]Zhu Li, Dimitri Meunier, Mattes Mollenhauer, Arthur Gretton:
Optimal Rates for Regularized Conditional Mean Embedding Learning. NeurIPS 2022 - [i5]Zhu Li, Dimitri Meunier, Mattes Mollenhauer, Arthur Gretton:
Optimal Rates for Regularized Conditional Mean Embedding Learning. CoRR abs/2208.01711 (2022) - 2020
- [c1]Ingmar Schuster, Mattes Mollenhauer, Stefan Klus, Krikamol Muandet:
Kernel Conditional Density Operators. AISTATS 2020: 993-1004 - [i4]Mattes Mollenhauer, Stefan Klus, Christof Schütte, Péter Koltai:
Kernel autocovariance operators of stationary processes: Estimation and convergence. CoRR abs/2004.00891 (2020) - [i3]Mattes Mollenhauer, Péter Koltai:
Nonparametric approximation of conditional expectation operators. CoRR abs/2012.12917 (2020)
2010 – 2019
- 2019
- [i2]Ingmar Schuster, Mattes Mollenhauer, Stefan Klus, Krikamol Muandet:
Kernel Conditional Density Operators. CoRR abs/1905.11255 (2019) - 2018
- [i1]Luzie Helfmann, Johannes von Lindheim, Mattes Mollenhauer, Ralf Banisch:
On Hyperparameter Search in Cluster Ensembles. CoRR abs/1803.11008 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-11 20:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
