Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Kathlén Kohn"'
Publikováno v:
SIAM Journal on Applied Algebra and Geometry. 6:368-406
We study the family of functions that are represented by a linear convolutional neural network (LCN). These functions form a semi-algebraic subset of the set of linear maps from input space to output space. In contrast, the families of functions repr
Publikováno v:
Kathlén Kohn
We study Voronoi diagrams of manifolds and varieties with respect to polyhedral norms. We provide upper and lower bounds on the dimensions of Voronoi cells. For algebraic varieties, we count their full-dimensional Voronoi cells. As an application, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6b3c8698032e905873b56ece4f57a14
http://arxiv.org/abs/2209.11463
http://arxiv.org/abs/2209.11463
Publikováno v:
BASE-Bielefeld Academic Search Engine
We study multivariate Gaussian models that are described by linear conditions on the concentration matrix. We compute the maximum likelihood (ML) degrees of these models. That is, we count the critical points of the likelihood function over a linear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f5e7a19bc6bd30ef3b3d6238d22c2b6
https://ora.ox.ac.uk/objects/uuid:962eab86-6981-48ac-8be5-6f052b7c7696
https://ora.ox.ac.uk/objects/uuid:962eab86-6981-48ac-8be5-6f052b7c7696
Publikováno v:
SIAM Journal on Applied Algebra and Geometry
We uncover connections between maximum likelihood estimation in statistics and norm minimization over a group orbit in invariant theory. We focus on Gaussian transformation families, which include matrix normal models and Gaussian graphical models gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b06cb281aee6e2c1b1b55c0b78fba2d
https://ora.ox.ac.uk/objects/uuid:1a3ca0e9-4c89-4197-81cf-cd2e570c287b
https://ora.ox.ac.uk/objects/uuid:1a3ca0e9-4c89-4197-81cf-cd2e570c287b
We establish connections between invariant theory and maximum likelihood estimation for discrete statistical models. We show that norm minimization over a torus orbit is equivalent to maximum likelihood estimation in log-linear models. We use notions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa39437adbdf1246ab13f6c34c1ac49e
http://arxiv.org/abs/2012.07793
http://arxiv.org/abs/2012.07793
Publikováno v:
BASE-Bielefeld Academic Search Engine
We study the maximum likelihood degree of linear concentration models in algebraic statistics. We relate the geometry of the reciprocal variety to that of semidefinite programming. We show that the Zariski closure in the Grassmanian of the set of lin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4efb2b66ee6e57b48dd7584a7d2758e9
http://arxiv.org/abs/2012.00145
http://arxiv.org/abs/2012.00145
Publikováno v:
BASE-Bielefeld Academic Search Engine
We study the problem of maximum likelihood estimation for $3$-dimensional linear spaces of $3\times 3$ symmetric matrices from the point of view of algebraic statistics where we view these nets of conics as linear concentration or linear covariance m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e998a9fce8fcaa159f24abd99bdec7bd
Publikováno v:
Computer Vision – ECCV 2020 ISBN: 9783030585730
ECCV (26)
ECCV (26)
We present a complete classification of minimal problems for generic arrangements of points and lines in space observed partially by three calibrated perspective cameras when each line is incident to at most one point. This is a large class of intere
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::344eb798ac7c2934505f448488616ec8
Autor:
Johannes Blömer, Kathlén Kohn
Publikováno v:
SIAM Journal on Applied Algebra and Geometry. 2:314-338
Motivated by the deterministic single exponential time algorithm of Micciancio and Voulgaris for solving the shortest and closest vector problem for the Euclidean norm, we study the geometry and complexity of Voronoi cells of lattices with respect to
Publikováno v:
ICCV
We present a complete classification of all minimal problems for generic arrangements of points and lines completely observed by calibrated perspective cameras. We show that there are only 30 minimal problems in total, no problems exist for more than