Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Tomáš Dlask"'
Autor:
Tomas Werner, Tomáš Dlask
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 90:777-807
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cca91d609ef6a05bfe095c4b5a701003
https://doi.org/10.1007/s10472-021-09731-9
https://doi.org/10.1007/s10472-021-09731-9
Autor:
Tomáš Dlask
Publikováno v:
KES
In this paper, we theoretically analyze principal properties of coordinate-wise minimization and we answer a few open questions related to it. In particular, we show that for minimizing any differentiable convex function on a given convex polyhedron,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90204f1423749cc114593c58f34a6ee9
https://doi.org/10.1016/j.procs.2020.09.142
https://doi.org/10.1016/j.procs.2020.09.142
The notion of reparametrizations of Weighted CSPs (WCSPs) (also known as equivalence-preserving transformations of WCSPs) is well-known and finds its use in many algorithms to approximate or bound the optimal WCSP value. In contrast, the concept of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0966f9632de1b637ef7fcd8550477c0
Publikováno v:
CVPR
It is well-known that for general convex optimization problems, block-coordinate descent can get stuck in poor local optima. Despite that, versions of this method known as convergent message passing are very successful to approximately solve the dual
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a8583c0af3ceaf7b23f57b2c4429a35
https://doi.org/10.1109/cvpr42600.2020.00758
https://doi.org/10.1109/cvpr42600.2020.00758
Autor:
Tomáš Dlask, Tomáš Werner
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030535513
LION
LION
Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable and/or constrained) convex problems it may not find global minima. We present a class of linear programs that coordin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::534a5090cf72577fb5d705ad3dfa26e7
https://doi.org/10.1007/978-3-030-53552-0_8
https://doi.org/10.1007/978-3-030-53552-0_8
Autor:
Tomáš Werner, Tomáš Dlask
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030584740
CP
CP
Block-coordinate descent (BCD) is a popular method in large-scale optimization. Unfortunately, its fixed points are not global optima even for convex problems. A succinct characterization of convex problems optimally solvable by BCD is unknown. Focus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac728bc89993def9319e4359d40116d6
https://doi.org/10.1007/978-3-030-58475-7_12
https://doi.org/10.1007/978-3-030-58475-7_12
Autor:
Tomáš Dlask, Tomáš Werner
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030584740
CP
CP
The Virtual Arc Consistency (VAC) algorithm by Cooper et al. is a soft local consistency technique that computes, in linear space, a bound on the basic LP relaxation of the Weighted CSP (WCSP). We generalize this technique by replacing arc consistenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f020758ce7f956fd5a91bcfb01429bc
https://doi.org/10.1007/978-3-030-58475-7_11
https://doi.org/10.1007/978-3-030-58475-7_11
Autor:
Tomáš Dlask
Publikováno v:
Machine Learning, Optimization, and Data Science ISBN: 9783030645823
LOD (1)
LOD (1)
We present a novel theoretical result concerning the applicability of coordinate-wise minimization on the dual problem of linear programming (LP) relaxation of weighted partial Max-SAT that shows that every fixed point of this procedure defines a fea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a5336abb0fe6f4eeae052674ec09c81
https://doi.org/10.1007/978-3-030-64583-0_60
https://doi.org/10.1007/978-3-030-64583-0_60