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

Simon N. Segert

dblp:294/9519 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 3 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 2 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 · 75% Information theory · 25%
Artificial intelligence
1 paper
Learning theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › estimation theory
linear estimation
0.812024
Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem · ICLR 2024
Mathematical optimization › continuous optimization › convex optimization › norm optimization
nuclear norm minimization
0.812024
Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem · ICLR 2024
Mathematical optimization
regularization
0.812024
Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem · ICLR 2024
Mathematical optimization › regularization › convex regularization
ridge regression
0.812024
Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem · ICLR 2024
Machine learning › Learning theory
generalization error
0.212024
Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem · ICLR 2024
Machine learning › Learning theory
random matrix theory
0.212024
Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem · ICLR 2024

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

simulation · 1.5cross-validation · 1.5schatten norms · 0.8schatten norm · 0.8
YearPublicationVenuePosition
2024 Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem
abstract
We consider the problem of linear estimation, and establish an extension of the Gauss-Markov theorem, in which the bias operator is allowed to be non-zero but bounded with respect to a matrix norm of Schatten type. We derive simple and explicit formulas for the optimal estimator in the cases of Nuclear and Spectral norms (with the Frobenius case recovering ridge regression). Additionally, we analytically derive the generalization error in multiple random matrix ensembles, and compare with Ridge regression. Finally, we conduct an extensive simulation study, in which we show that the cross-validated Nuclear and Spectral regressors can outperform Ridge in several circumstances.
Simon N. Segert
ICLR1
2023 Beyond Transformers for Function Learning
Simon N. Segert, Jonathan D. Cohen 0003
CogSci1
2022 Maximum Entropy Function Learning
Simon N. Segert, Jonathan D. Cohen 0003
CogSci1
2019 A tradeoff between generalization and perceptual capacity in recurrent neural networks
Taylor W. Webb, Steven Frankland, Simon N. Segert, Alexander A. Petrov, Randall C. O'Reilly, Jonathan D. Cohen 0003
CogSci3