---
_id: '6725'
abstract:
- lang: eng
text: "A Valued Constraint Satisfaction Problem (VCSP) provides a common framework
that can express a wide range of discrete optimization problems. A VCSP instance
is given by a finite set of variables, a finite domain of labels, and an objective
function to be minimized. This function is represented as a sum of terms where
each term depends on a subset of the variables. To obtain different classes of
optimization problems, one can restrict all terms to come from a fixed set Γ of
cost functions, called a language. \r\nRecent breakthrough results have established
a complete complexity classification of such classes with respect to language
Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances
can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately,
testing this condition for a given language Γ is known to be NP-hard. We thus
study exponential algorithms for this meta-problem. We show that the tractability
condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ)))
time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also
obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH).
More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm,
assuming that SETH holds."
alternative_title:
- LIPIcs
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th
International Colloquium on Automata, Languages and Programming. Vol 132.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77'
apa: 'Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In
46th International Colloquium on Automata, Languages and Programming (Vol.
132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ICALP.2019.77'
chicago: Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”
In 46th International Colloquium on Automata, Languages and Programming,
132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77.
ieee: V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th
International Colloquium on Automata, Languages and Programming, Patras, Greece,
2019, vol. 132, p. 77:1-77:12.
ista: 'Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th
International Colloquium on Automata, Languages and Programming. ICALP 2019: International
Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.'
mla: Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th
International Colloquium on Automata, Languages and Programming, vol. 132,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
short: V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages
and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.
conference:
end_date: 2019-07-12
location: Patras, Greece
name: 'ICALP 2019: International Colloquim on Automata, Languages and Programming'
start_date: 2019-07-08
date_created: 2019-07-29T12:23:29Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2021-01-12T08:08:40Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.4230/LIPICS.ICALP.2019.77
ec_funded: 1
external_id:
arxiv:
- '1803.02289'
file:
- access_level: open_access
checksum: f5ebee8eec6ae09e30365578ee63a492
content_type: application/pdf
creator: dernst
date_created: 2019-07-31T07:01:45Z
date_updated: 2020-07-14T12:47:38Z
file_id: '6738'
file_name: 2019_LIPICS_Kolmogorov.pdf
file_size: 575475
relation: main_file
file_date_updated: 2020-07-14T12:47:38Z
has_accepted_license: '1'
intvolume: ' 132'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: 77:1-77:12
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: 46th International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- 978-3-95977-109-2
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Testing the complexity of a valued CSP language
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
---
_id: '6596'
abstract:
- lang: eng
text: It is well known that many problems in image recovery, signal processing,
and machine learning can be modeled as finding zeros of the sum of maximal monotone
and Lipschitz continuous monotone operators. Many papers have studied forward-backward
splitting methods for finding zeros of the sum of two monotone operators in Hilbert
spaces. Most of the proposed splitting methods in the literature have been proposed
for the sum of maximal monotone and inverse-strongly monotone operators in Hilbert
spaces. In this paper, we consider splitting methods for finding zeros of the
sum of maximal monotone operators and Lipschitz continuous monotone operators
in Banach spaces. We obtain weak and strong convergence results for the zeros
of the sum of maximal monotone and Lipschitz continuous monotone operators in
Banach spaces. Many already studied problems in the literature can be considered
as special cases of this paper.
article_number: '138'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
citation:
ama: Shehu Y. Convergence results of forward-backward algorithms for sum of monotone
operators in Banach spaces. Results in Mathematics. 2019;74(4). doi:10.1007/s00025-019-1061-4
apa: Shehu, Y. (2019). Convergence results of forward-backward algorithms for sum
of monotone operators in Banach spaces. Results in Mathematics. Springer.
https://doi.org/10.1007/s00025-019-1061-4
chicago: Shehu, Yekini. “Convergence Results of Forward-Backward Algorithms for
Sum of Monotone Operators in Banach Spaces.” Results in Mathematics. Springer,
2019. https://doi.org/10.1007/s00025-019-1061-4.
ieee: Y. Shehu, “Convergence results of forward-backward algorithms for sum of monotone
operators in Banach spaces,” Results in Mathematics, vol. 74, no. 4. Springer,
2019.
ista: Shehu Y. 2019. Convergence results of forward-backward algorithms for sum
of monotone operators in Banach spaces. Results in Mathematics. 74(4), 138.
mla: Shehu, Yekini. “Convergence Results of Forward-Backward Algorithms for Sum
of Monotone Operators in Banach Spaces.” Results in Mathematics, vol. 74,
no. 4, 138, Springer, 2019, doi:10.1007/s00025-019-1061-4.
short: Y. Shehu, Results in Mathematics 74 (2019).
date_created: 2019-06-29T10:11:30Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2023-08-28T12:26:22Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1007/s00025-019-1061-4
ec_funded: 1
external_id:
arxiv:
- '2101.09068'
isi:
- '000473237500002'
file:
- access_level: open_access
checksum: c6d18cb1e16fc0c36a0e0f30b4ebbc2d
content_type: application/pdf
creator: kschuh
date_created: 2019-07-03T15:20:40Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6605'
file_name: Springer_2019_Shehu.pdf
file_size: 466942
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 74'
isi: 1
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Results in Mathematics
publication_identifier:
eissn:
- 1420-9012
issn:
- 1422-6383
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Convergence results of forward-backward algorithms for sum of monotone operators
in Banach spaces
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 74
year: '2019'
...
---
_id: '7000'
abstract:
- lang: eng
text: The main contributions of this paper are the proposition and the convergence
analysis of a class of inertial projection-type algorithm for solving variational
inequality problems in real Hilbert spaces where the underline operator is monotone
and uniformly continuous. We carry out a unified analysis of the proposed method
under very mild assumptions. In particular, weak convergence of the generated
sequence is established and nonasymptotic O(1 / n) rate of convergence is established,
where n denotes the iteration counter. We also present some experimental results
to illustrate the profits gained by introducing the inertial extrapolation steps.
article_number: '161'
article_processing_charge: No
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Olaniyi S.
full_name: Iyiola, Olaniyi S.
last_name: Iyiola
- first_name: Xiao-Huan
full_name: Li, Xiao-Huan
last_name: Li
- first_name: Qiao-Li
full_name: Dong, Qiao-Li
last_name: Dong
citation:
ama: Shehu Y, Iyiola OS, Li X-H, Dong Q-L. Convergence analysis of projection method
for variational inequalities. Computational and Applied Mathematics. 2019;38(4).
doi:10.1007/s40314-019-0955-9
apa: Shehu, Y., Iyiola, O. S., Li, X.-H., & Dong, Q.-L. (2019). Convergence
analysis of projection method for variational inequalities. Computational and
Applied Mathematics. Springer Nature. https://doi.org/10.1007/s40314-019-0955-9
chicago: Shehu, Yekini, Olaniyi S. Iyiola, Xiao-Huan Li, and Qiao-Li Dong. “Convergence
Analysis of Projection Method for Variational Inequalities.” Computational
and Applied Mathematics. Springer Nature, 2019. https://doi.org/10.1007/s40314-019-0955-9.
ieee: Y. Shehu, O. S. Iyiola, X.-H. Li, and Q.-L. Dong, “Convergence analysis of
projection method for variational inequalities,” Computational and Applied
Mathematics, vol. 38, no. 4. Springer Nature, 2019.
ista: Shehu Y, Iyiola OS, Li X-H, Dong Q-L. 2019. Convergence analysis of projection
method for variational inequalities. Computational and Applied Mathematics. 38(4),
161.
mla: Shehu, Yekini, et al. “Convergence Analysis of Projection Method for Variational
Inequalities.” Computational and Applied Mathematics, vol. 38, no. 4, 161,
Springer Nature, 2019, doi:10.1007/s40314-019-0955-9.
short: Y. Shehu, O.S. Iyiola, X.-H. Li, Q.-L. Dong, Computational and Applied Mathematics
38 (2019).
date_created: 2019-11-12T12:41:44Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2023-08-30T07:20:32Z
day: '01'
ddc:
- '510'
- '515'
- '518'
department:
- _id: VlKo
doi: 10.1007/s40314-019-0955-9
ec_funded: 1
external_id:
arxiv:
- '2101.09081'
isi:
- '000488973100005'
has_accepted_license: '1'
intvolume: ' 38'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s40314-019-0955-9
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Computational and Applied Mathematics
publication_identifier:
eissn:
- 1807-0302
issn:
- 2238-3603
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Convergence analysis of projection method for variational inequalities
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 38
year: '2019'
...
---
_id: '7412'
abstract:
- lang: eng
text: We develop a framework for the rigorous analysis of focused stochastic local
search algorithms. These algorithms search a state space by repeatedly selecting
some constraint that is violated in the current state and moving to a random nearby
state that addresses the violation, while (we hope) not introducing many new violations.
An important class of focused local search algorithms with provable performance
guarantees has recently arisen from algorithmizations of the Lovász local lemma
(LLL), a nonconstructive tool for proving the existence of satisfying states by
introducing a background measure on the state space. While powerful, the state
transitions of algorithms in this class must be, in a precise sense, perfectly
compatible with the background measure. In many applications this is a very restrictive
requirement, and one needs to step outside the class. Here we introduce the notion
of measure distortion and develop a framework for analyzing arbitrary focused
stochastic local search algorithms, recovering LLL algorithmizations as the special
case of no distortion. Our framework takes as input an arbitrary algorithm of
such type and an arbitrary probability measure and shows how to use the measure
as a yardstick of algorithmic progress, even for algorithms designed independently
of the measure.
article_processing_charge: No
article_type: original
author:
- first_name: Dimitris
full_name: Achlioptas, Dimitris
last_name: Achlioptas
- first_name: Fotis
full_name: Iliopoulos, Fotis
last_name: Iliopoulos
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Achlioptas D, Iliopoulos F, Kolmogorov V. A local lemma for focused stochastical
algorithms. SIAM Journal on Computing. 2019;48(5):1583-1602. doi:10.1137/16m109332x
apa: Achlioptas, D., Iliopoulos, F., & Kolmogorov, V. (2019). A local lemma
for focused stochastical algorithms. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16m109332x
chicago: Achlioptas, Dimitris, Fotis Iliopoulos, and Vladimir Kolmogorov. “A Local
Lemma for Focused Stochastical Algorithms.” SIAM Journal on Computing.
SIAM, 2019. https://doi.org/10.1137/16m109332x.
ieee: D. Achlioptas, F. Iliopoulos, and V. Kolmogorov, “A local lemma for focused
stochastical algorithms,” SIAM Journal on Computing, vol. 48, no. 5. SIAM,
pp. 1583–1602, 2019.
ista: Achlioptas D, Iliopoulos F, Kolmogorov V. 2019. A local lemma for focused
stochastical algorithms. SIAM Journal on Computing. 48(5), 1583–1602.
mla: Achlioptas, Dimitris, et al. “A Local Lemma for Focused Stochastical Algorithms.”
SIAM Journal on Computing, vol. 48, no. 5, SIAM, 2019, pp. 1583–602, doi:10.1137/16m109332x.
short: D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48
(2019) 1583–1602.
date_created: 2020-01-30T09:27:32Z
date_published: 2019-10-31T00:00:00Z
date_updated: 2023-09-06T15:25:29Z
day: '31'
department:
- _id: VlKo
doi: 10.1137/16m109332x
ec_funded: 1
external_id:
arxiv:
- '1809.01537'
isi:
- '000493900200005'
intvolume: ' 48'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.01537
month: '10'
oa: 1
oa_version: Preprint
page: 1583-1602
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: SIAM
quality_controlled: '1'
scopus_import: '1'
status: public
title: A local lemma for focused stochastical algorithms
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 48
year: '2019'
...
---
_id: '7468'
abstract:
- lang: eng
text: We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference
in structured energy minimization problems. The method optimizes a Lagrangean
relaxation of the original energy minimization problem using a multi plane block-coordinate
Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean
decomposition. We show empirically that our method outperforms state-of-the-art
Lagrangean decomposition based algorithms on some challenging Markov Random Field,
multi-label discrete tomography and graph matching problems.
article_number: 11138-11147
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm.
In: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition. Vol 2019-June. IEEE; 2019. doi:10.1109/CVPR.2019.01140'
apa: 'Swoboda, P., & Kolmogorov, V. (2019). Map inference via block-coordinate
Frank-Wolfe algorithm. In Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition (Vol. 2019–June). Long Beach, CA,
United States: IEEE. https://doi.org/10.1109/CVPR.2019.01140'
chicago: Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate
Frank-Wolfe Algorithm.” In Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, Vol. 2019–June. IEEE, 2019. https://doi.org/10.1109/CVPR.2019.01140.
ieee: P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe
algorithm,” in Proceedings of the IEEE Computer Society Conference on Computer
Vision and Pattern Recognition, Long Beach, CA, United States, 2019, vol.
2019–June.
ista: 'Swoboda P, Kolmogorov V. 2019. Map inference via block-coordinate Frank-Wolfe
algorithm. Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition
vol. 2019–June, 11138–11147.'
mla: Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate
Frank-Wolfe Algorithm.” Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, vol. 2019–June, 11138–11147, IEEE,
2019, doi:10.1109/CVPR.2019.01140.
short: P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition, IEEE, 2019.
conference:
end_date: 2019-06-20
location: Long Beach, CA, United States
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2019-06-15
date_created: 2020-02-09T23:00:52Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T14:54:24Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/CVPR.2019.01140
ec_funded: 1
external_id:
arxiv:
- '1806.05049'
isi:
- '000542649304076'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.05049
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition
publication_identifier:
isbn:
- '9781728132938'
issn:
- '10636919'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Map inference via block-coordinate Frank-Wolfe algorithm
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2019-June
year: '2019'
...
---
_id: '7639'
abstract:
- lang: eng
text: Deep neural networks (DNNs) have become increasingly important due to their
excellent empirical performance on a wide range of problems. However, regularization
is generally achieved by indirect means, largely due to the complex set of functions
defined by a network and the difficulty in measuring function complexity. There
exists no method in the literature for additive regularization based on a norm
of the function, as is classically considered in statistical learning theory.
In this work, we study the tractability of function norms for deep neural networks
with ReLU activations. We provide, to the best of our knowledge, the first proof
in the literature of the NP-hardness of computing function norms of DNNs of 3
or more layers. We also highlight a fundamental difference between shallow and
deep networks. In the light on these results, we propose a new regularization
strategy based on approximate function norms, and show its efficiency on a segmentation
task with a DNN.
article_number: 748-752
article_processing_charge: No
author:
- first_name: Amal
full_name: Rannen-Triki, Amal
last_name: Rannen-Triki
- first_name: Maxim
full_name: Berman, Maxim
last_name: Berman
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Matthew B.
full_name: Blaschko, Matthew B.
last_name: Blaschko
citation:
ama: 'Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural
networks. In: Proceedings of the 2019 International Conference on Computer
Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00097'
apa: 'Rannen-Triki, A., Berman, M., Kolmogorov, V., & Blaschko, M. B. (2019).
Function norms for neural networks. In Proceedings of the 2019 International
Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00097'
chicago: Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko.
“Function Norms for Neural Networks.” In Proceedings of the 2019 International
Conference on Computer Vision Workshop. IEEE, 2019. https://doi.org/10.1109/ICCVW.2019.00097.
ieee: A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms
for neural networks,” in Proceedings of the 2019 International Conference on
Computer Vision Workshop, Seoul, South Korea, 2019.
ista: 'Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms
for neural networks. Proceedings of the 2019 International Conference on Computer
Vision Workshop. ICCVW: International Conference on Computer Vision Workshop,
748–752.'
mla: Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” Proceedings
of the 2019 International Conference on Computer Vision Workshop, 748–752,
IEEE, 2019, doi:10.1109/ICCVW.2019.00097.
short: A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings
of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.
conference:
end_date: 2019-10-28
location: Seoul, South Korea
name: 'ICCVW: International Conference on Computer Vision Workshop'
start_date: 2019-10-27
date_created: 2020-04-05T22:00:50Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2023-09-08T11:19:12Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/ICCVW.2019.00097
external_id:
isi:
- '000554591600090'
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
publication: Proceedings of the 2019 International Conference on Computer Vision Workshop
publication_identifier:
isbn:
- '9781728150239'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Function norms for neural networks
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '703'
abstract:
- lang: eng
text: We consider the NP-hard problem of MAP-inference for undirected discrete graphical
models. We propose a polynomial time and practically efficient algorithm for finding
a part of its optimal solution. Specifically, our algorithm marks some labels
of the considered graphical model either as (i) optimal, meaning that they belong
to all optimal solutions of the inference problem; (ii) non-optimal if they provably
do not belong to any solution. With access to an exact solver of a linear programming
relaxation to the MAP-inference problem, our algorithm marks the maximal possible
(in a specified sense) number of labels. We also present a version of the algorithm,
which has access to a suboptimal dual solver only and still can ensure the (non-)optimality
for the marked labels, although the overall number of the marked labels may decrease.
We propose an efficient implementation, which runs in time comparable to a single
run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art
results on computational benchmarks from machine learning and computer vision.
author:
- first_name: Alexander
full_name: Shekhovtsov, Alexander
last_name: Shekhovtsov
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
apa: Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency
via iterative relaxed inference with graphical models. IEEE Transactions on
Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884
chicago: Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum
Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.
ieee: A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative
relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis
and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.
ista: Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 40(7), 1668–1682.
mla: Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference
with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
short: A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern
Analysis and Machine Intelligence 40 (2018) 1668–1682.
date_created: 2018-12-11T11:48:01Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:32Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2017.2730884
external_id:
arxiv:
- '1508.07902'
intvolume: ' 40'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.07902
month: '07'
oa: 1
oa_version: Preprint
page: 1668-1682
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
issn:
- '01628828'
publication_status: published
publisher: IEEE
publist_id: '6992'
quality_controlled: '1'
scopus_import: 1
status: public
title: Maximum persistency via iterative relaxed inference with graphical models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2018'
...
---
_id: '10864'
abstract:
- lang: eng
text: We prove that every congruence distributive variety has directed Jónsson terms,
and every congruence modular variety has directed Gumm terms. The directed terms
we construct witness every case of absorption witnessed by the original Jónsson
or Gumm terms. This result is equivalent to a pair of claims about absorption
for admissible preorders in congruence distributive and congruence modular varieties,
respectively. For finite algebras, these absorption theorems have already seen
significant applications, but until now, it was not clear if the theorems hold
for general algebras as well. Our method also yields a novel proof of a result
by P. Lipparini about the existence of a chain of terms (which we call Pixley
terms) in varieties that are at the same time congruence distributive and k-permutable
for some k.
acknowledgement: The second author was supported by National Science Center grant
DEC-2011-/01/B/ST6/01006.
article_processing_charge: No
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Marcin
full_name: Kozik, Marcin
last_name: Kozik
- first_name: Ralph
full_name: McKenzie, Ralph
last_name: McKenzie
- first_name: Matthew
full_name: Moore, Matthew
last_name: Moore
citation:
ama: 'Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms.
In: Czelakowski J, ed. Don Pigozzi on Abstract Algebraic Logic, Universal Algebra,
and Computer Science. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:10.1007/978-3-319-74772-9_7'
apa: 'Kazda, A., Kozik, M., McKenzie, R., & Moore, M. (2018). Absorption and
directed Jónsson terms. In J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic
Logic, Universal Algebra, and Computer Science (Vol. 16, pp. 203–220). Cham:
Springer Nature. https://doi.org/10.1007/978-3-319-74772-9_7'
chicago: 'Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption
and Directed Jónsson Terms.” In Don Pigozzi on Abstract Algebraic Logic, Universal
Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham:
Springer Nature, 2018. https://doi.org/10.1007/978-3-319-74772-9_7.'
ieee: 'A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson
terms,” in Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and
Computer Science, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018,
pp. 203–220.'
ista: 'Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson
terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science. vol. 16, 203–220.'
mla: Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” Don Pigozzi
on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited
by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:10.1007/978-3-319-74772-9_7.
short: A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don
Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science,
Springer Nature, Cham, 2018, pp. 203–220.
date_created: 2022-03-18T10:30:32Z
date_published: 2018-03-21T00:00:00Z
date_updated: 2023-09-05T15:37:18Z
day: '21'
department:
- _id: VlKo
doi: 10.1007/978-3-319-74772-9_7
editor:
- first_name: J
full_name: Czelakowski, J
last_name: Czelakowski
external_id:
arxiv:
- '1502.01072'
intvolume: ' 16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.01072
month: '03'
oa: 1
oa_version: Preprint
page: 203-220
place: Cham
publication: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science
publication_identifier:
eisbn:
- '9783319747729'
eissn:
- 2211-2766
isbn:
- '9783319747712'
issn:
- 2211-2758
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: OCTR
status: public
title: Absorption and directed Jónsson terms
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 16
year: '2018'
...
---
_id: '273'
abstract:
- lang: eng
text: The accuracy of information retrieval systems is often measured using complex
loss functions such as the average precision (AP) or the normalized discounted
cumulative gain (NDCG). Given a set of positive and negative samples, the parameters
of a retrieval system can be estimated by minimizing these loss functions. However,
the non-differentiability and non-decomposability of these loss functions does
not allow for simple gradient based optimization algorithms. This issue is generally
circumvented by either optimizing a structured hinge-loss upper bound to the loss
function or by using asymptotic methods like the direct-loss minimization framework.
Yet, the high computational complexity of loss-augmented inference, which is necessary
for both the frameworks, prohibits its use in large training data sets. To alleviate
this deficiency, we present a novel quicksort flavored algorithm for a large class
of non-decomposable loss functions. We provide a complete characterization of
the loss functions that are amenable to our algorithm, and show that it includes
both AP and NDCG based loss functions. Furthermore, we prove that no comparison
based algorithm can improve upon the computational complexity of our approach
asymptotically. We demonstrate the effectiveness of our approach in the context
of optimizing the structured hinge loss upper bound of AP and NDCG loss for learning
models for a variety of vision tasks. We show that our approach provides significantly
better results than simpler decomposable loss functions, while requiring a comparable
training time.
article_processing_charge: No
author:
- first_name: Pritish
full_name: Mohapatra, Pritish
last_name: Mohapatra
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
- first_name: C V
full_name: Jawahar, C V
last_name: Jawahar
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: M Pawan
full_name: Kumar, M Pawan
last_name: Kumar
citation:
ama: 'Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization
for rank-based loss functions. In: 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. IEEE; 2018:3693-3701. doi:10.1109/cvpr.2018.00389'
apa: 'Mohapatra, P., Rolinek, M., Jawahar, C. V., Kolmogorov, V., & Kumar, M.
P. (2018). Efficient optimization for rank-based loss functions. In 2018 IEEE/CVF
Conference on Computer Vision and Pattern Recognition (pp. 3693–3701). Salt
Lake City, UT, USA: IEEE. https://doi.org/10.1109/cvpr.2018.00389'
chicago: Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and
M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.” In 2018
IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701.
IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00389.
ieee: P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient
optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on
Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp.
3693–3701.
ista: 'Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. 2018. Efficient
optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer
Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern
Recognition, 3693–3701.'
mla: Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.”
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE,
2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
short: P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018
IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp.
3693–3701.
conference:
end_date: 2018-06-22
location: Salt Lake City, UT, USA
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2018-06-18
date_created: 2018-12-11T11:45:33Z
date_published: 2018-06-28T00:00:00Z
date_updated: 2023-09-11T13:24:43Z
day: '28'
department:
- _id: VlKo
doi: 10.1109/cvpr.2018.00389
ec_funded: 1
external_id:
arxiv:
- '1604.08269'
isi:
- '000457843603087'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.08269
month: '06'
oa: 1
oa_version: Preprint
page: 3693-3701
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
publication_identifier:
isbn:
- '9781538664209'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient optimization for rank-based loss functions
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '193'
abstract:
- lang: eng
text: 'We show attacks on five data-independent memory-hard functions (iMHF) that
were submitted to the password hashing competition (PHC). Informally, an MHF is
a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly
lower hardware and/or energy cost than evaluating a single instance on a standard
single-core architecture. Data-independent means the memory access pattern of
the function is independent of the input; this makes iMHFs harder to construct
than data-dependent ones, but the latter can be attacked by various side-channel
attacks. Following [Alwen-Blocki''16], we capture the evaluation of an iMHF as
a directed acyclic graph (DAG). The cumulative parallel pebbling complexity of
this DAG is a measure for the hardware cost of evaluating the iMHF on an ASIC.
Ideally, one would like the complexity of a DAG underlying an iMHF to be as close
to quadratic in the number of nodes of the graph as possible. Instead, we show
that (the DAGs underlying) the following iMHFs are far from this bound: Rig.v2,
TwoCats and Gambit each having an exponent no more than 1.75. Moreover, we show
that the complexity of the iMHF modes of the PHC finalists Pomelo and Lyra2 have
exponents at most 1.83 and 1.67 respectively. To show this we investigate a combinatorial
property of each underlying DAG (called its depth-robustness. By establishing
upper bounds on this property we are then able to apply the general technique
of [Alwen-Block''16] for analyzing the hardware costs of an iMHF.'
acknowledgement: Leonid Reyzin was supported in part by IST Austria and by US NSF
grants 1012910, 1012798, and 1422965; this research was performed while he was visiting
IST Austria.
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Peter
full_name: Gazi, Peter
last_name: Gazi
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Lenoid
full_name: Reyzin, Lenoid
last_name: Reyzin
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
citation:
ama: 'Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data
independent password hashing functions. In: Proceedings of the 2018 on Asia
Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534'
apa: 'Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak,
K. Z., … Rybar, M. (2018). On the memory hardness of data independent password
hashing functions. In Proceedings of the 2018 on Asia Conference on Computer
and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM. https://doi.org/10.1145/3196494.3196534'
chicago: Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F
Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar.
“On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings
of the 2018 on Asia Conference on Computer and Communication Security, 51–65.
ACM, 2018. https://doi.org/10.1145/3196494.3196534.
ieee: J. F. Alwen et al., “On the memory hardness of data independent password
hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer
and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.
ista: 'Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin
L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password
hashing functions. Proceedings of the 2018 on Asia Conference on Computer and
Communication Security. ASIACCS: Asia Conference on Computer and Communications
Security , 51–65.'
mla: Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password
Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer
and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
short: J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak,
L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference
on Computer and Communication Security, ACM, 2018, pp. 51–65.
conference:
end_date: 2018-06-08
location: Incheon, Republic of Korea
name: 'ASIACCS: Asia Conference on Computer and Communications Security '
start_date: 2018-06-04
date_created: 2018-12-11T11:45:07Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-13T09:13:12Z
day: '01'
department:
- _id: KrPi
- _id: HeEd
- _id: VlKo
doi: 10.1145/3196494.3196534
ec_funded: 1
external_id:
isi:
- '000516620100005'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/783
month: '06'
oa: 1
oa_version: Submitted Version
page: 51 - 65
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Proceedings of the 2018 on Asia Conference on Computer and Communication
Security
publication_status: published
publisher: ACM
publist_id: '7723'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the memory hardness of data independent password hashing functions
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5975'
abstract:
- lang: eng
text: We consider the recent formulation of the algorithmic Lov ́asz Local Lemma [N.
Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas
and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F.
Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms,
arXiv preprint, 2018] for finding objects that avoid“bad features,” or “flaws.” It extends the Moser–Tardos resampling algorithm [R. A. Moser andG.
Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces. At each step the
method picks aflaw present in the current state and goes to a new state according
to some prespecified probabilitydistribution (which depends on the current state
and the selected flaw). However, the recent formu-lation is less flexible than
the Moser–Tardos method since it requires a specific flaw selection rule,whereas
the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially
beimplemented more efficiently). We formulate a new “commutativity” condition
and prove that it issufficient for an arbitrary rule to work. It also enables
an efficient parallelization under an additionalassumption. We then show that
existing resampling oracles for perfect matchings and permutationsdo satisfy this
condition.
article_processing_charge: No
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM
Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306
apa: Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma.
SIAM Journal on Computing. Society for Industrial & Applied Mathematics
(SIAM). https://doi.org/10.1137/16m1093306
chicago: Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”
SIAM Journal on Computing. Society for Industrial & Applied Mathematics
(SIAM), 2018. https://doi.org/10.1137/16m1093306.
ieee: V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM
Journal on Computing, vol. 47, no. 6. Society for Industrial & Applied
Mathematics (SIAM), pp. 2029–2056, 2018.
ista: Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM
Journal on Computing. 47(6), 2029–2056.
mla: Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”
SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial &
Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
short: V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
date_created: 2019-02-13T12:59:33Z
date_published: 2018-11-08T00:00:00Z
date_updated: 2023-09-19T14:24:58Z
day: '08'
department:
- _id: VlKo
doi: 10.1137/16m1093306
ec_funded: 1
external_id:
arxiv:
- '1506.08547'
isi:
- '000453785100001'
intvolume: ' 47'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1506.08547
month: '11'
oa: 1
oa_version: Preprint
page: 2029-2056
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics (SIAM)
quality_controlled: '1'
related_material:
record:
- id: '1193'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Commutativity in the algorithmic Lovász local lemma
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 47
year: '2018'
...
---
_id: '5978'
abstract:
- lang: eng
text: 'We consider the MAP-inference problem for graphical models,which is a valued
constraint satisfaction problem defined onreal numbers with a natural summation
operation. We proposea family of relaxations (different from the famous Sherali-Adams
hierarchy), which naturally define lower bounds for itsoptimum. This family always
contains a tight relaxation andwe give an algorithm able to find it and therefore,
solve theinitial non-relaxed NP-hard problem.The relaxations we consider decompose
the original probleminto two non-overlapping parts: an easy LP-tight part and
adifficult one. For the latter part a combinatorial solver must beused. As we
show in our experiments, in a number of applica-tions the second, difficult part
constitutes only a small fractionof the whole problem. This property allows to
significantlyreduce the computational time of the combinatorial solver andtherefore
solve problems which were out of reach before.'
article_processing_charge: No
author:
- first_name: Stefan
full_name: Haller, Stefan
last_name: Haller
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: 'Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial
search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial
Intelligence. AAAI Press; 2018:6581-6588.'
apa: 'Haller, S., Swoboda, P., & Savchynskyy, B. (2018). Exact MAP-inference
by confining combinatorial search with LP relaxation. In Proceedings of the
32st AAAI Conference on Artificial Intelligence (pp. 6581–6588). New Orleans,
LU, United States: AAAI Press.'
chicago: Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference
by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the
32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.
ieee: S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining
combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference
on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.
ista: 'Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining
combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference
on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588.'
mla: Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search
with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial
Intelligence, AAAI Press, 2018, pp. 6581–88.
short: S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI
Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.
conference:
end_date: 2018-02-07
location: New Orleans, LU, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2018-02-02
date_created: 2019-02-13T13:32:48Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2023-09-19T14:26:52Z
day: '01'
department:
- _id: VlKo
external_id:
arxiv:
- '2004.06370'
isi:
- '000485488906082'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2004.06370
month: '02'
oa: 1
oa_version: Preprint
page: 6581-6588
publication: Proceedings of the 32st AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Exact MAP-inference by confining combinatorial search with LP relaxation
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '18'
abstract:
- lang: eng
text: An N-superconcentrator is a directed, acyclic graph with N input nodes and
N output nodes such that every subset of the inputs and every subset of the outputs
of same cardinality can be connected by node-disjoint paths. It is known that
linear-size and bounded-degree superconcentrators exist. We prove the existence
of such superconcentrators with asymptotic density 25.3 (where the density is
the number of edges divided by N). The previously best known densities were 28
[12] and 27.4136 [17].
article_processing_charge: No
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria.
2018;141(10):269-304.
apa: Kolmogorov, V., & Rolinek, M. (2018). Superconcentrators of density 25.3.
Ars Combinatoria. Charles Babbage Research Centre.
chicago: Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density
25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.
ieee: V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars
Combinatoria, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304,
2018.
ista: Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria.
141(10), 269–304.
mla: Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.”
Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018,
pp. 269–304.
short: V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
date_created: 2018-12-11T11:44:11Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2023-09-19T14:46:18Z
day: '01'
department:
- _id: VlKo
external_id:
arxiv:
- '1405.7828'
isi:
- '000446809500022'
intvolume: ' 141'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.7828
month: '10'
oa: 1
oa_version: Preprint
page: 269 - 304
publication: Ars Combinatoria
publication_identifier:
issn:
- 0381-7032
publication_status: published
publisher: Charles Babbage Research Centre
publist_id: '8037'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Superconcentrators of density 25.3
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 141
year: '2018'
...
---
_id: '6032'
abstract:
- lang: eng
text: The main result of this article is a generalization of the classical blossom
algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean
CSPs where each variable appears in exactly two constraints (we call it edge CSP)
and all constraints are even Δ-matroid relations (represented by lists of tuples).
As a consequence of this, we settle the complexity classification of planar Boolean
CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then
extend the tractability result to larger classes of Δ-matroids that we call efficiently
coverable. It properly includes classes that were known to be tractable before,
namely, co-independent, compact, local, linear, and binary, with the following
caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation
by matrices. Since an n ×n matrix can represent exponentially many tuples, our
tractability result is not strictly stronger than the known algorithm for linear
and binary Δ-matroids.
article_number: '22'
article_processing_charge: No
article_type: original
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of
planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649
apa: Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and
the complexity of planar boolean CSPs. ACM Transactions on Algorithms.
ACM. https://doi.org/10.1145/3230649
chicago: Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids
and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms.
ACM, 2018. https://doi.org/10.1145/3230649.
ieee: A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity
of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2.
ACM, 2018.
ista: Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity
of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.
mla: Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean
CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.
short: A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).
date_created: 2019-02-17T22:59:25Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-20T11:20:26Z
day: '01'
department:
- _id: VlKo
doi: 10.1145/3230649
ec_funded: 1
external_id:
arxiv:
- '1602.03124'
isi:
- '000468036500007'
intvolume: ' 15'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.03124
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: ACM Transactions on Algorithms
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '1192'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Even delta-matroids and the complexity of planar boolean CSPs
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 15
year: '2018'
...
---
_id: '641'
abstract:
- lang: eng
text: 'We introduce two novel methods for learning parameters of graphical models
for image labelling. The following two tasks underline both methods: (i) perturb
model parameters based on given features and ground truth labelings, so as to
exactly reproduce these labelings as optima of the local polytope relaxation of
the labelling problem; (ii) train a predictor for the perturbed model parameters
so that improved model parameters can be applied to the labelling of novel data.
Our first method implements task (i) by inverse linear programming and task (ii)
using a regressor e.g. a Gaussian process. Our second approach simultaneously
solves tasks (i) and (ii) in a joint manner, while being restricted to linearly
parameterised predictors. Experiments demonstrate the merits of both approaches.'
alternative_title:
- LNCS
author:
- first_name: Vera
full_name: Trajkovska, Vera
last_name: Trajkovska
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Freddie
full_name: Åström, Freddie
last_name: Åström
- first_name: Stefanie
full_name: Petra, Stefanie
last_name: Petra
citation:
ama: 'Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning
by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol
10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26'
apa: 'Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical
model parameter learning by inverse linear programming. In F. Lauze, Y. Dong,
& A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM:
Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer.
https://doi.org/10.1007/978-3-319-58771-4_26'
chicago: Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical
Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze,
Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26.
ieee: 'V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter
learning by inverse linear programming,” presented at the SSVM: Scale Space and
Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp.
323–334.'
ista: 'Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter
learning by inverse linear programming. SSVM: Scale Space and Variational Methods
in Computer Vision, LNCS, vol. 10302, 323–334.'
mla: Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear
Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017,
pp. 323–34, doi:10.1007/978-3-319-58771-4_26.
short: V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A.
Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.
conference:
end_date: 2017-06-08
location: Kolding, Denmark
name: 'SSVM: Scale Space and Variational Methods in Computer Vision'
start_date: 2017-06-04
date_created: 2018-12-11T11:47:39Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:23Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-319-58771-4_26
editor:
- first_name: François
full_name: Lauze, François
last_name: Lauze
- first_name: Yiqiu
full_name: Dong, Yiqiu
last_name: Dong
- first_name: Anders
full_name: Bjorholm Dahl, Anders
last_name: Bjorholm Dahl
intvolume: ' 10302'
language:
- iso: eng
month: '01'
oa_version: None
page: 323 - 334
publication_identifier:
isbn:
- 978-331958770-7
publication_status: published
publisher: Springer
publist_id: '7147'
quality_controlled: '1'
scopus_import: 1
status: public
title: Graphical model parameter learning by inverse linear programming
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10302
year: '2017'
...
---
_id: '644'
abstract:
- lang: eng
text: An instance of the valued constraint satisfaction problem (VCSP) is given
by a finite set of variables, a finite domain of labels, and a sum of functions,
each function depending on a subset of the variables. Each function can take finite
values specifying costs of assignments of labels to its variables or the infinite
value, which indicates an infeasible assignment. The goal is to find an assignment
of labels to the variables that minimizes the sum. We study, assuming that P 6=
NP, how the complexity of this very general problem depends on the set of functions
allowed in the instances, the so-called constraint language. The case when all
allowed functions take values in f0;1g corresponds to ordinary CSPs, where one
deals only with the feasibility issue, and there is no optimization. This case
is the subject of the algebraic CSP dichotomy conjecture predicting for which
constraint languages CSPs are tractable (i.e., solvable in polynomial time) and
for which they are NP-hard. The case when all allowed functions take only finite
values corresponds to a finitevalued CSP, where the feasibility aspect is trivial
and one deals only with the optimization issue. The complexity of finite-valued
CSPs was fully classified by Thapper and Živný. An algebraic necessary condition
for tractability of a general-valued CSP with a fixed constraint language was
recently given by Kozik and Ochremiak. As our main result, we prove that if a
constraint language satisfies this algebraic necessary condition, and the feasibility
CSP (i.e., the problem of deciding whether a given instance has a feasible solution)
corresponding to the VCSP with this language is tractable, then the VCSP is tractable.
The algorithm is a simple combination of the assumed algorithm for the feasibility
CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy
for ordinary CSPs would imply a dichotomy for general-valued CSPs.
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Andrei
full_name: Krokhin, Andrei
last_name: Krokhin
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs.
SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836
apa: Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued
CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836
chicago: Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity
of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836.
ieee: V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued
CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110,
2017.
ista: Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued
CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
mla: Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM
Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
short: V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017)
1087–1110.
date_created: 2018-12-11T11:47:40Z
date_published: 2017-06-29T00:00:00Z
date_updated: 2023-02-23T10:07:49Z
day: '29'
department:
- _id: VlKo
doi: 10.1137/16M1091836
ec_funded: 1
intvolume: ' 46'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.07327
month: '06'
oa: 1
oa_version: Preprint
page: 1087 - 1110
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Computing
publication_status: published
publisher: SIAM
publist_id: '7138'
quality_controlled: '1'
related_material:
record:
- id: '1637'
relation: other
status: public
scopus_import: 1
status: public
title: The complexity of general-valued CSPs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 46
year: '2017'
...
---
_id: '646'
abstract:
- lang: eng
text: We present a novel convex relaxation and a corresponding inference algorithm
for the non-binary discrete tomography problem, that is, reconstructing discrete-valued
images from few linear measurements. In contrast to state of the art approaches
that split the problem into a continuous reconstruction problem for the linear
measurement constraints and a discrete labeling problem to enforce discrete-valued
reconstructions, we propose a joint formulation that addresses both problems simultaneously,
resulting in a tighter convex relaxation. For this purpose a constrained graphical
model is set up and evaluated using a novel relaxation optimized by dual decomposition.
We evaluate our approach experimentally and show superior solutions both mathematically
(tighter relaxation) and experimentally in comparison to previously proposed relaxations.
alternative_title:
- LNCS
author:
- first_name: Jan
full_name: Kuske, Jan
last_name: Kuske
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Stefanie
full_name: Petra, Stefanie
last_name: Petra
citation:
ama: 'Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete
tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246.
doi:10.1007/978-3-319-58771-4_19'
apa: 'Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation
for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl
(Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational
Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19'
chicago: Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation
for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and
Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19.
ieee: 'J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary
discrete tomography,” presented at the SSVM: Scale Space and Variational Methods
in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.'
ista: 'Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary
discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision,
LNCS, vol. 10302, 235–246.'
mla: Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography.
Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.
short: J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl
(Eds.), Springer, 2017, pp. 235–246.
conference:
end_date: 2017-06-08
location: Kolding, Denmark
name: 'SSVM: Scale Space and Variational Methods in Computer Vision'
start_date: 2017-06-04
date_created: 2018-12-11T11:47:41Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:07:34Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-319-58771-4_19
ec_funded: 1
editor:
- first_name: François
full_name: Lauze, François
last_name: Lauze
- first_name: Yiqiu
full_name: Dong, Yiqiu
last_name: Dong
- first_name: Anders
full_name: Bjorholm Dahl, Anders
last_name: Bjorholm Dahl
intvolume: ' 10302'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.03769
month: '06'
oa: 1
oa_version: Submitted Version
page: 235 - 246
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-331958770-7
publication_status: published
publisher: Springer
publist_id: '7132'
quality_controlled: '1'
scopus_import: 1
status: public
title: A novel convex relaxation for non binary discrete tomography
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10302
year: '2017'
...
---
_id: '992'
abstract:
- lang: eng
text: "An instance of the Constraint Satisfaction Problem (CSP) is given by a finite
set of\r\nvariables, a finite domain of labels, and a set of constraints, each
constraint acting on\r\na subset of the variables. The goal is to find an assignment
of labels to its variables\r\nthat satisfies all constraints (or decide whether
one exists). If we allow more general\r\n“soft” constraints, which come with (possibly
infinite) costs of particular assignments,\r\nwe obtain instances from a richer
class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal
is to find an assignment with minimum total cost.\r\nIn this thesis, we focus
(assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity
of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent
of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage,
that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe
complexity classification modulo (missing pieces of) complexity classification
for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’
perfect\r\nmatching algorithm. This generalization contributes to complexity classfications
in two\r\nways. First, it gives a new (largest known) polynomial-time solvable
class of Boolean\r\nCSPs in which every variable may appear in at most two constraints
and second, it\r\nsettles full classification of Boolean CSPs with planar drawing
(again parametrized by a\r\nconstraint language)."
acknowledgement: FP7/2007-2013/ERC grant agreement no 616160
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815
apa: Rolinek, M. (2017). Complexity of constraint satisfaction. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815
chicago: Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of
Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
ieee: M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science
and Technology Austria, 2017.
ista: Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science
and Technology Austria.
mla: Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of
Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.
short: M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and
Technology Austria, 2017.
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2023-09-07T12:05:41Z
day: '01'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:th_815
ec_funded: 1
file:
- access_level: open_access
checksum: 81761fb939acb7585c36629f765b4373
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:55Z
date_updated: 2020-07-14T12:48:18Z
file_id: '4654'
file_name: IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf
file_size: 786145
relation: main_file
- access_level: closed
checksum: 2b2d7e1d6c1c79a9795a7aa0f860baf3
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:43:24Z
date_updated: 2020-07-14T12:48:18Z
file_id: '6208'
file_name: 2017_Thesis_Rolinek_source.zip
file_size: 5936337
relation: source_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '97'
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6407'
pubrep_id: '815'
status: public
supervisor:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
title: Complexity of constraint satisfaction
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '1192'
abstract:
- lang: eng
text: The main result of this paper is a generalization of the classical blossom
algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean
CSPs where each variable appears in exactly two constraints (we call it edge CSP)
and all constraints are even Δ-matroid relations (represented by lists of tuples).
As a consequence of this, we settle the complexity classification of planar Boolean
CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even
Δ-matroid constraints allows us to extend the tractability result to a larger
class of Δ-matroids that includes many classes that were known to be tractable
before, namely co-independent, compact, local and binary.
article_processing_charge: No
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: 'Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of
planar Boolean CSPs. In: SIAM; 2017:307-326. doi:10.1137/1.9781611974782.20'
apa: 'Kazda, A., Kolmogorov, V., & Rolinek, M. (2017). Even delta-matroids and
the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium
on Discrete Algorithms, Barcelona, Spain: SIAM. https://doi.org/10.1137/1.9781611974782.20'
chicago: Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids
and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. https://doi.org/10.1137/1.9781611974782.20.
ieee: 'A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity
of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms,
Barcelona, Spain, 2017, pp. 307–326.'
ista: 'Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity
of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.'
mla: Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar
Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
short: A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
conference:
end_date: 2017-01019
location: Barcelona, Spain
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2017-01-16
date_created: 2018-12-11T11:50:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-20T11:20:26Z
day: '01'
department:
- _id: VlKo
doi: 10.1137/1.9781611974782.20
ec_funded: 1
external_id:
isi:
- '000426965800020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.03124
month: '01'
oa: 1
oa_version: Submitted Version
page: 307 - 326
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-161197478-2
publication_status: published
publisher: SIAM
publist_id: '6159'
quality_controlled: '1'
related_material:
record:
- id: '6032'
relation: later_version
status: public
status: public
title: Even delta-matroids and the complexity of planar Boolean CSPs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '916'
abstract:
- lang: eng
text: We study the quadratic assignment problem, in computer vision also known as
graph matching. Two leading solvers for this problem optimize the Lagrange decomposition
duals with sub-gradient and dual ascent (also known as message passing) updates.
We explore this direction further and propose several additional Lagrangean relaxations
of the graph matching problem along with corresponding algorithms, which are all
based on a common dual ascent framework. Our extensive empirical evaluation gives
several theoretical insights and suggests a new state-of-the-art anytime solver
for the considered problem. Our improvement over state-of-the-art is particularly
visible on a new dataset with large-scale sparse problem instances containing
more than 500 graph nodes each.
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Carsten
full_name: Abu Alhaija, Carsten
last_name: Abu Alhaija
- first_name: Dagmar
full_name: Kainmueller, Dagmar
last_name: Kainmueller
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: 'Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study
of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol
2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747'
apa: 'Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., & Savchynskyy,
B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph
matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and
Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.747'
chicago: Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller,
and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent
Solvers for Graph Matching,” 2017:7062–71. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.747.
ieee: 'P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy,
“A study of lagrangean decompositions and dual ascent solvers for graph matching,”
presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA,
United States, 2017, vol. 2017, pp. 7062–7071.'
ista: 'Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A
study of lagrangean decompositions and dual ascent solvers for graph matching.
CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.'
mla: Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent
Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.
short: P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:,
IEEE, 2017, pp. 7062–7071.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:11Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-26T15:41:40Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/CVPR.2017.747
ec_funded: 1
external_id:
isi:
- '000418371407018'
file:
- access_level: open_access
checksum: e38a2740daad1ea178465843b5072906
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T12:49:38Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5848'
file_name: 2017_CVPR_Swoboda2.pdf
file_size: 944332
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 7062-7071
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6525'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A study of lagrangean decompositions and dual ascent solvers for graph matching
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...