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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ulrike Schneider 0001

dblp:145/1333 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-3759-0011ORCID · verified

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.

Theoretical computer science
1 paper
Mathematical optimization · 60% Algorithms and data structures · 40%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
clustering
0.612022
The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022
Algorithms and data structures › clustering
convex clustering
0.612022
The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022
Mathematical optimization › regularization
regularized estimation
0.612022
The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022
Mathematical optimization › regularization › structured sparsity
SLOPE
0.612022
The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022
Mathematical optimization › statistical estimation › high-dimensional estimation
sparse estimation
0.612022
The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022

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

polytope · 0.6geometric characterization · 0.6dual norm unit ball · 0.6
YearPublicationVenuePosition
2022 The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation
abstract
We provide a necessary and sufficient condition for the uniqueness of penalized least-squares estimators whose penalty term is given by a norm with a polytope unit ball, covering a wide range of methods including SLOPE, PACS, fused, clustered and classical LASSO as well as the related method of basis pursuit. We consider a strong type of uniqueness that is relevant for statistical problems. The uniqueness condition is geometric and involves how the row span of the design matrix intersects the faces of the dual norm unit ball, which for SLOPE is given by the signed permutahedron. Further considerations based this condition also allow to derive results on sparsity and clustering features. In particular, we define the notion of a SLOPE pattern to describe both sparsity and clustering properties of this method and also provide a geometric characterization of accessible SLOPE patterns.
Ulrike Schneider 0001, Patrick Tardivel
J. Mach. Learn. Res.1