---
_id: '10404'
abstract:
- lang: eng
text: While convolutional neural networks (CNNs) have found wide adoption as state-of-the-art
models for image-related tasks, their predictions are often highly sensitive to
small input perturbations, which the human vision is robust against. This paper
presents Perturber, a web-based application that allows users to instantaneously
explore how CNN activations and predictions evolve when a 3D input scene is interactively
perturbed. Perturber offers a large variety of scene modifications, such as camera
controls, lighting and shading effects, background modifications, object morphing,
as well as adversarial attacks, to facilitate the discovery of potential vulnerabilities.
Fine-tuned model versions can be directly compared for qualitative evaluation
of their robustness. Case studies with machine learning experts have shown that
Perturber helps users to quickly generate hypotheses about model vulnerabilities
and to qualitatively compare model behavior. Using quantitative analyses, we could
replicate users’ insights with other CNN architectures and input images, yielding
new insights about the vulnerability of adversarially trained models.
acknowledgement: "We thank Robert Geirhos and Roland Zimmermann for their participation
in the case study and valuable feedback, Chris Olah and Nick Cammarata for valuable
discussions in the early phase of the project, as well as the Distill Slack workspace
as a platform for discussions. M.L. is supported in part by the Austrian Science
Fund (FWF) under grant Z211-N23 (Wittgenstein Award). J.B. is supported by the German
Federal Ministry of Education and Research\r\n(BMBF) through the Competence Center
for Machine Learning (TUE.AI, FKZ 01IS18039A) and the International Max Planck Research
School for Intelligent Systems (IMPRS-IS). R.H. is partially supported by Boeing
and Horizon-2020 ECSEL (grant 783163, iDev40).\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Stefan
full_name: Sietzen, Stefan
last_name: Sietzen
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Judy
full_name: Borowski, Judy
last_name: Borowski
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Manuela
full_name: Waldner, Manuela
last_name: Waldner
citation:
ama: Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. Interactive analysis
of CNN robustness. Computer Graphics Forum. 2021;40(7):253-264. doi:10.1111/cgf.14418
apa: Sietzen, S., Lechner, M., Borowski, J., Hasani, R., & Waldner, M. (2021).
Interactive analysis of CNN robustness. Computer Graphics Forum. Wiley.
https://doi.org/10.1111/cgf.14418
chicago: Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela
Waldner. “Interactive Analysis of CNN Robustness.” Computer Graphics Forum.
Wiley, 2021. https://doi.org/10.1111/cgf.14418.
ieee: S. Sietzen, M. Lechner, J. Borowski, R. Hasani, and M. Waldner, “Interactive
analysis of CNN robustness,” Computer Graphics Forum, vol. 40, no. 7. Wiley,
pp. 253–264, 2021.
ista: Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. 2021. Interactive analysis
of CNN robustness. Computer Graphics Forum. 40(7), 253–264.
mla: Sietzen, Stefan, et al. “Interactive Analysis of CNN Robustness.” Computer
Graphics Forum, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:10.1111/cgf.14418.
short: S. Sietzen, M. Lechner, J. Borowski, R. Hasani, M. Waldner, Computer Graphics
Forum 40 (2021) 253–264.
date_created: 2021-12-05T23:01:40Z
date_published: 2021-11-27T00:00:00Z
date_updated: 2023-08-14T13:11:42Z
day: '27'
department:
- _id: ToHe
doi: 10.1111/cgf.14418
external_id:
arxiv:
- '2110.07667'
isi:
- '000722952000024'
intvolume: ' 40'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2110.07667
month: '11'
oa: 1
oa_version: Preprint
page: 253-264
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interactive analysis of CNN robustness
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 40
year: '2021'
...
---
_id: '10406'
abstract:
- lang: eng
text: Multicellular organisms develop complex shapes from much simpler, single-celled
zygotes through a process commonly called morphogenesis. Morphogenesis involves
an interplay between several factors, ranging from the gene regulatory networks
determining cell fate and differentiation to the mechanical processes underlying
cell and tissue shape changes. Thus, the study of morphogenesis has historically
been based on multidisciplinary approaches at the interface of biology with physics
and mathematics. Recent technological advances have further improved our ability
to study morphogenesis by bridging the gap between the genetic and biophysical
factors through the development of new tools for visualizing, analyzing, and perturbing
these factors and their biochemical intermediaries. Here, we review how a combination
of genetic, microscopic, biophysical, and biochemical approaches has aided our
attempts to understand morphogenesis and discuss potential approaches that may
be beneficial to such an inquiry in the future.
acknowledgement: The authors would like to thank Feyza Nur Arslan, Suyash Naik, Diana
Pinheiro, Alexandra Schauer, and Shayan Shamipour for their comments on the draft.
N.M. is supported by an ISTplus postdoctoral fellowship (H2020 Marie-Sklodowska-Curie
COFUND Action).
article_processing_charge: No
article_type: original
author:
- first_name: Nikhil
full_name: Mishra, Nikhil
id: C4D70E82-1081-11EA-B3ED-9A4C3DDC885E
last_name: Mishra
orcid: 0000-0002-6425-5788
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Mishra N, Heisenberg C-PJ. Dissecting organismal morphogenesis by bridging
genetics and biophysics. Annual Review of Genetics. 2021;55:209-233. doi:10.1146/annurev-genet-071819-103748
apa: Mishra, N., & Heisenberg, C.-P. J. (2021). Dissecting organismal morphogenesis
by bridging genetics and biophysics. Annual Review of Genetics. Annual
Reviews. https://doi.org/10.1146/annurev-genet-071819-103748
chicago: Mishra, Nikhil, and Carl-Philipp J Heisenberg. “Dissecting Organismal Morphogenesis
by Bridging Genetics and Biophysics.” Annual Review of Genetics. Annual
Reviews, 2021. https://doi.org/10.1146/annurev-genet-071819-103748.
ieee: N. Mishra and C.-P. J. Heisenberg, “Dissecting organismal morphogenesis by
bridging genetics and biophysics,” Annual Review of Genetics, vol. 55.
Annual Reviews, pp. 209–233, 2021.
ista: Mishra N, Heisenberg C-PJ. 2021. Dissecting organismal morphogenesis by bridging
genetics and biophysics. Annual Review of Genetics. 55, 209–233.
mla: Mishra, Nikhil, and Carl-Philipp J. Heisenberg. “Dissecting Organismal Morphogenesis
by Bridging Genetics and Biophysics.” Annual Review of Genetics, vol. 55,
Annual Reviews, 2021, pp. 209–33, doi:10.1146/annurev-genet-071819-103748.
short: N. Mishra, C.-P.J. Heisenberg, Annual Review of Genetics 55 (2021) 209–233.
date_created: 2021-12-05T23:01:41Z
date_published: 2021-08-30T00:00:00Z
date_updated: 2023-08-14T13:05:13Z
day: '30'
department:
- _id: CaHe
doi: 10.1146/annurev-genet-071819-103748
ec_funded: 1
external_id:
isi:
- '000747220900010'
pmid:
- '34460295'
intvolume: ' 55'
isi: 1
keyword:
- morphogenesis
- forward genetics
- high-resolution microscopy
- biophysics
- biochemistry
- patterning
language:
- iso: eng
month: '08'
oa_version: None
page: 209-233
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Annual Review of Genetics
publication_identifier:
eissn:
- 1545-2948
issn:
- 0066-4197
publication_status: published
publisher: Annual Reviews
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dissecting organismal morphogenesis by bridging genetics and biophysics
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 55
year: '2021'
...
---
_id: '10407'
abstract:
- lang: eng
text: Digital hardware Trojans are integrated circuits whose implementation differ
from the specification in an arbitrary and malicious way. For example, the circuit
can differ from its specified input/output behavior after some fixed number of
queries (known as “time bombs”) or on some particular input (known as “cheat codes”).
To detect such Trojans, countermeasures using multiparty computation (MPC) or
verifiable computation (VC) have been proposed. On a high level, to realize a
circuit with specification F one has more sophisticated circuits F⋄ manufactured
(where F⋄ specifies a MPC or VC of F ), and then embeds these F⋄ ’s into
a master circuit which must be trusted but is relatively simple compared to F
. Those solutions impose a significant overhead as F⋄ is much more complex
than F , also the master circuits are not exactly trivial. In this work, we
show that in restricted settings, where F has no evolving state and is queried
on independent inputs, we can achieve a relaxed security notion using very simple
constructions. In particular, we do not change the specification of the circuit
at all (i.e., F=F⋄ ). Moreover the master circuit basically just queries a subset
of its manufactured circuits and checks if they’re all the same. The security
we achieve guarantees that, if the manufactured circuits are initially tested
on up to T inputs, the master circuit will catch Trojans that try to deviate on
significantly more than a 1/T fraction of the inputs. This bound is optimal for
the type of construction considered, and we provably achieve it using a construction
where 12 instantiations of F need to be embedded into the master. We also discuss
an extremely simple construction with just 2 instantiations for which we conjecture
that it already achieves the optimal bound.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Suvradip
full_name: Chakraborty, Suvradip
id: B9CD0494-D033-11E9-B219-A439E6697425
last_name: Chakraborty
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Małgorzata
full_name: Gałązka, Małgorzata
last_name: Gałązka
- first_name: Tomasz
full_name: Lizurej, Tomasz
last_name: Lizurej
- 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: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
citation:
ama: 'Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX. Trojan-resilience
without cryptography. In: Vol 13043. Springer Nature; 2021:397-428. doi:10.1007/978-3-030-90453-1_14'
apa: 'Chakraborty, S., Dziembowski, S., Gałązka, M., Lizurej, T., Pietrzak, K. Z.,
& Yeo, M. X. (2021). Trojan-resilience without cryptography (Vol. 13043, pp.
397–428). Presented at the TCC: Theory of Cryptography Conference, Raleigh, NC,
United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_14'
chicago: Chakraborty, Suvradip, Stefan Dziembowski, Małgorzata Gałązka, Tomasz Lizurej,
Krzysztof Z Pietrzak, and Michelle X Yeo. “Trojan-Resilience without Cryptography,”
13043:397–428. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_14.
ieee: 'S. Chakraborty, S. Dziembowski, M. Gałązka, T. Lizurej, K. Z. Pietrzak, and
M. X. Yeo, “Trojan-resilience without cryptography,” presented at the TCC: Theory
of Cryptography Conference, Raleigh, NC, United States, 2021, vol. 13043, pp.
397–428.'
ista: 'Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX.
2021. Trojan-resilience without cryptography. TCC: Theory of Cryptography Conference,
LNCS, vol. 13043, 397–428.'
mla: Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography.
Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.
short: S. Chakraborty, S. Dziembowski, M. Gałązka, T. Lizurej, K.Z. Pietrzak, M.X.
Yeo, in:, Springer Nature, 2021, pp. 397–428.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography Conference'
start_date: 2021-11-08
date_created: 2021-12-05T23:01:42Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-08-14T13:07:46Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-030-90453-1_14
ec_funded: 1
external_id:
isi:
- '000728364000014'
intvolume: ' 13043'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1224
month: '11'
oa: 1
oa_version: Preprint
page: 397-428
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
eissn:
- 1611-3349
isbn:
- 9-783-0309-0452-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Trojan-resilience without cryptography
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13043
year: '2021'
...
---
_id: '10408'
abstract:
- lang: eng
text: 'Key trees are often the best solution in terms of transmission cost and storage
requirements for managing keys in a setting where a group needs to share a secret
key, while being able to efficiently rotate the key material of users (in order
to recover from a potential compromise, or to add or remove users). Applications
include multicast encryption protocols like LKH (Logical Key Hierarchies) or group
messaging like the current IETF proposal TreeKEM. A key tree is a (typically balanced)
binary tree, where each node is identified with a key: leaf nodes hold users’
secret keys while the root is the shared group key. For a group of size N, each
user just holds log(N) keys (the keys on the path from its leaf to the root)
and its entire key material can be rotated by broadcasting 2log(N) ciphertexts
(encrypting each fresh key on the path under the keys of its parents). In this
work we consider the natural setting where we have many groups with partially
overlapping sets of users, and ask if we can find solutions where the cost of
rotating a key is better than in the trivial one where we have a separate key
tree for each group. We show that in an asymptotic setting (where the number m
of groups is fixed while the number N of users grows) there exist more general
key graphs whose cost converges to the cost of a single group, thus saving a factor
linear in the number of groups over the trivial solution. As our asymptotic “solution”
converges very slowly and performs poorly on concrete examples, we propose an
algorithm that uses a natural heuristic to compute a key graph for any given group
structure. Our algorithm combines two greedy algorithms, and is thus very efficient:
it first converts the group structure into a “lattice graph”, which is then turned
into a key graph by repeatedly applying the algorithm for constructing a Huffman
code. To better understand how far our proposal is from an optimal solution, we
prove lower bounds on the update cost of continuous group-key agreement and multicast
encryption in a symbolic model admitting (asymmetric) encryption, pseudorandom
generators, and secret sharing as building blocks.'
acknowledgement: B. Auerbach, M.A. Baig and K. Pietrzak—received funding from the
European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (682815 - TOCNeT); Karen Klein was supported in part by
ERC CoG grant 724307 and conducted part of this work at IST Austria, funded by the
ERC under the European Union’s Horizon 2020 research and innovation programme (682815
- TOCNeT); Guillermo Pascual-Perez was funded by the European Union’s Horizon 2020
research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385; Michael Walter conducted part of this work at IST Austria, funded by
the ERC under the European Union’s Horizon 2020 research and innovation programme
(682815 - TOCNeT).
alternative_title:
- LNCS
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: Benedikt
full_name: Auerbach, Benedikt
id: D33D2B18-E445-11E9-ABB7-15F4E5697425
last_name: Auerbach
orcid: 0000-0002-7553-6606
- first_name: Mirza Ahad
full_name: Baig, Mirza Ahad
id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
last_name: Baig
- first_name: Miguel
full_name: Cueto Noval, Miguel
id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
last_name: Cueto Noval
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Guillermo
full_name: Pascual Perez, Guillermo
id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
last_name: Pascual Perez
orcid: 0000-0001-8630-415X
- 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: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Alwen JF, Auerbach B, Baig MA, et al. Grafting key trees: Efficient key management
for overlapping groups. In: 19th International Conference. Vol 13044. Springer
Nature; 2021:222-253. doi:10.1007/978-3-030-90456-2_8'
apa: 'Alwen, J. F., Auerbach, B., Baig, M. A., Cueto Noval, M., Klein, K., Pascual
Perez, G., … Walter, M. (2021). Grafting key trees: Efficient key management for
overlapping groups. In 19th International Conference (Vol. 13044, pp. 222–253).
Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90456-2_8'
chicago: 'Alwen, Joel F, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval,
Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter.
“Grafting Key Trees: Efficient Key Management for Overlapping Groups.” In 19th
International Conference, 13044:222–53. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90456-2_8.'
ieee: 'J. F. Alwen et al., “Grafting key trees: Efficient key management
for overlapping groups,” in 19th International Conference, Raleigh, NC,
United States, 2021, vol. 13044, pp. 222–253.'
ista: 'Alwen JF, Auerbach B, Baig MA, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak
KZ, Walter M. 2021. Grafting key trees: Efficient key management for overlapping
groups. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol.
13044, 222–253.'
mla: 'Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping
Groups.” 19th International Conference, vol. 13044, Springer Nature, 2021,
pp. 222–53, doi:10.1007/978-3-030-90456-2_8.'
short: J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual
Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer
Nature, 2021, pp. 222–253.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography'
start_date: 2021-11-08
date_created: 2021-12-05T23:01:42Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-08-14T13:19:39Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-030-90456-2_8
ec_funded: 1
external_id:
isi:
- '000728363700008'
intvolume: ' 13044'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1158
month: '11'
oa: 1
oa_version: Preprint
page: 222-253
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 19th International Conference
publication_identifier:
eisbn:
- 978-3-030-90456-2
eissn:
- 1611-3349
isbn:
- 9-783-0309-0455-5
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Grafting key trees: Efficient key management for overlapping groups'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13044
year: '2021'
...
---
_id: '10409'
abstract:
- lang: eng
text: We show that Yao’s garbling scheme is adaptively indistinguishable for the
class of Boolean circuits of size S and treewidth w with only a SO(w) loss
in security. For instance, circuits with constant treewidth are as a result adaptively
indistinguishable with only a polynomial loss. This (partially) complements a
negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way
functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main
technical contributions, we introduce a new pebble game that abstracts out our
security reduction and then present a pebbling strategy for this game where the
number of pebbles used is roughly O(δwlog(S)) , δ being the fan-out of the
circuit. The design of the strategy relies on separators, a graph-theoretic notion
with connections to circuit complexity. with only a SO(w) loss in security.
For instance, circuits with constant treewidth are as a result adaptively indistinguishable
with only a polynomial loss. This (partially) complements a negative result of
Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that
Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions,
we introduce a new pebble game that abstracts out our security reduction and then
present a pebbling strategy for this game where the number of pebbles used is
roughly O(δwlog(S)) , δ being the fan-out of the circuit. The design of the
strategy relies on separators, a graph-theoretic notion with connections to circuit
complexity.
acknowledgement: We are grateful to Daniel Wichs for helpful discussions on the landscape
of adaptive security of Yao’s garbling. We would also like to thank Crypto 2021
and TCC 2021 reviewers for their detailed review and suggestions, which helped improve
presentation considerably.
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s
garbling. In: 19th International Conference. Vol 13043. Springer Nature;
2021:486-517. doi:10.1007/978-3-030-90453-1_17'
apa: 'Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth,
separators and Yao’s garbling. In 19th International Conference (Vol. 13043,
pp. 486–517). Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_17'
chicago: Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth,
Separators and Yao’s Garbling.” In 19th International Conference, 13043:486–517.
Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_17.
ieee: C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators
and Yao’s garbling,” in 19th International Conference, Raleigh, NC, United
States, 2021, vol. 13043, pp. 486–517.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and
Yao’s garbling. 19th International Conference. TCC: Theory of Cryptography, LNCS,
vol. 13043, 486–517.'
mla: Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.”
19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517,
doi:10.1007/978-3-030-90453-1_17.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th International Conference,
Springer Nature, 2021, pp. 486–517.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography'
start_date: 2021-11-08
date_created: 2021-12-05T23:01:43Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-08-17T06:21:38Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-030-90453-1_17
ec_funded: 1
external_id:
isi:
- '000728364000017'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/926
month: '11'
oa: 1
oa_version: Preprint
page: 486-517
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 19th International Conference
publication_identifier:
eissn:
- 1611-3349
isbn:
- 9-783-0309-0452-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10044'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: On treewidth, separators and Yao’s garbling
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: '13043 '
year: '2021'
...
---
_id: '10410'
abstract:
- lang: eng
text: The security of cryptographic primitives and protocols against adversaries
that are allowed to make adaptive choices (e.g., which parties to corrupt or which
queries to make) is notoriously difficult to establish. A broad theoretical framework
was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper
we initiate the study of lower bounds on loss in adaptive security for certain
cryptographic protocols considered in the framework. We prove lower bounds that
almost match the upper bounds (proven using the framework) for proxy re-encryption,
prefix-constrained PRFs and generalized selective decryption, a security game
that captures the security of certain group messaging and broadcast encryption
schemes. Those primitives have in common that their security game involves an
underlying graph that can be adaptively built by the adversary. Some of our lower
bounds only apply to a restricted class of black-box reductions which we term
“oblivious” (the existing upper bounds are of this restricted type), some apply
to the broader but still restricted class of non-rewinding reductions, while our
lower bound for proxy re-encryption applies to all black-box reductions. The fact
that some of our lower bounds seem to crucially rely on obliviousness or at least
a non-rewinding reduction hints to the exciting possibility that the existing
upper bounds can be improved by using more sophisticated reductions. Our main
conceptual contribution is a two-player multi-stage game called the Builder-Pebbler
Game. We can translate bounds on the winning probabilities for various instantiations
of this game into cryptographic lower bounds for the above-mentioned primitives
using oracle separation techniques.
acknowledgement: C. Kamath—Supported by Azrieli International Postdoctoral Fellowship.
Most of the work was done while the author was at Northeastern University and Charles
University, funded by the IARPA grant IARPA/2019-19-020700009 and project PRIMUS/17/SCI/9,
respectively. K. Klein—Supported in part by ERC CoG grant 724307. Most of the work
was done while the author was at IST Austria funded by the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(682815 - TOCNeT). K. Pietrzak—Funded by the European Research Council (ERC) under
the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in
security games on graphs. In: 19th International Conference. Vol 13043.
Springer Nature; 2021:550-581. doi:10.1007/978-3-030-90453-1_19'
apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2021). The
cost of adaptivity in security games on graphs. In 19th International Conference
(Vol. 13043, pp. 550–581). Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_19'
chicago: Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael
Walter. “The Cost of Adaptivity in Security Games on Graphs.” In 19th International
Conference, 13043:550–81. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_19.
ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity
in security games on graphs,” in 19th International Conference, Raleigh,
NC, United States, 2021, vol. 13043, pp. 550–581.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity
in security games on graphs. 19th International Conference. TCC: Theory of Cryptography,
LNCS, vol. 13043, 550–581.'
mla: Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on
Graphs.” 19th International Conference, vol. 13043, Springer Nature, 2021,
pp. 550–81, doi:10.1007/978-3-030-90453-1_19.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th International
Conference, Springer Nature, 2021, pp. 550–581.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography'
start_date: 2021-11-08
date_created: 2021-12-05T23:01:43Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-10-17T09:24:07Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-030-90453-1_19
ec_funded: 1
external_id:
isi:
- '000728364000019'
intvolume: ' 13043'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ia.cr/2021/059
month: '11'
oa: 1
oa_version: Preprint
page: 550-581
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 19th International Conference
publication_identifier:
eissn:
- 1611-3349
isbn:
- 9-783-0309-0452-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10048'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: The cost of adaptivity in security games on graphs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13043
year: '2021'
...
---
_id: '10414'
abstract:
- lang: eng
text: 'We consider the almost-sure (a.s.) termination problem for probabilistic
programs, which are a stochastic extension of classical imperative programs. Lexicographic
ranking functions provide a sound and practical approach for termination of non-probabilistic
programs, and their extension to probabilistic programs is achieved via lexicographic
ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous
work have a limitation that impedes their automation: all of their components
have to be non-negative in all reachable states. This might result in LexRSM not
existing even for simple terminating programs. Our contributions are twofold:
First, we introduce a generalization of LexRSMs which allows for some components
to be negative. This standard feature of non-probabilistic termination proofs
was hitherto not known to be sound in the probabilistic setting, as the soundness
proof requires a careful analysis of the underlying stochastic process. Second,
we present polynomial-time algorithms using our generalized LexRSMs for proving
a.s. termination in broad classes of linear-arithmetic programs.'
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt),
the Czech Science Foundation grant No. GJ19-15134Y, and the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Jiří
full_name: Zárevúcky, Jiří
last_name: Zárevúcky
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. On lexicographic
proof rules for probabilistic termination. In: 24th International Symposium
on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi:10.1007/978-3-030-90870-6_33'
apa: 'Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic,
D. (2021). On lexicographic proof rules for probabilistic termination. In 24th
International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual:
Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33'
chicago: Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky,
and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.”
In 24th International Symposium on Formal Methods, 13047:619–39. Springer
Nature, 2021. https://doi.org/10.1007/978-3-030-90870-6_33.
ieee: K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic,
“On lexicographic proof rules for probabilistic termination,” in 24th International
Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
ista: 'Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. 2021. On
lexicographic proof rules for probabilistic termination. 24th International Symposium
on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.'
mla: Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic
Termination.” 24th International Symposium on Formal Methods, vol. 13047,
Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.
short: K. Chatterjee, E.K. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:,
24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.
conference:
end_date: 2021-11-26
location: Virtual
name: 'FM: Formal Methods'
start_date: 2021-11-20
date_created: 2021-12-05T23:01:45Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2025-07-14T09:10:11Z
day: '10'
department:
- _id: KrCh
doi: 10.1007/978-3-030-90870-6_33
ec_funded: 1
external_id:
arxiv:
- '2108.02188'
isi:
- '000758218600033'
intvolume: ' 13047'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2108.02188
month: '11'
oa: 1
oa_version: Preprint
page: 619-639
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 24th International Symposium on Formal Methods
publication_identifier:
eisbn:
- 978-3-030-90870-6
eissn:
- 1611-3349
isbn:
- 9-783-0309-0869-0
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
- id: '14778'
relation: later_version
status: public
scopus_import: '1'
status: public
title: On lexicographic proof rules for probabilistic termination
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13047
year: '2021'
...
---
_id: '10415'
abstract:
- lang: eng
text: The Hardy–Littlewood circle method was invented over a century ago to study
integer solutions to special Diophantine equations, but it has since proven to
be one of the most successful all-purpose tools available to number theorists.
Not only is it capable of handling remarkably general systems of polynomial equations
defined over arbitrary global fields, but it can also shed light on the space
of rational curves that lie on algebraic varieties. This book, in which the arithmetic
of cubic polynomials takes centre stage, is aimed at bringing beginning graduate
students into contact with some of the many facets of the circle method, both
classical and modern. This monograph is the winner of the 2021 Ferran Sunyer i
Balaguer Prize, a prestigious award for books of expository nature presenting
the latest developments in an active area of research in mathematics.
alternative_title:
- Progress in Mathematics
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: 'Browning TD. Cubic Forms and the Circle Method. Vol 343. Cham: Springer
Nature; 2021. doi:10.1007/978-3-030-86872-7'
apa: 'Browning, T. D. (2021). Cubic Forms and the Circle Method (Vol. 343).
Cham: Springer Nature. https://doi.org/10.1007/978-3-030-86872-7'
chicago: 'Browning, Timothy D. Cubic Forms and the Circle Method. Vol. 343.
Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-86872-7.'
ieee: 'T. D. Browning, Cubic Forms and the Circle Method, vol. 343. Cham:
Springer Nature, 2021.'
ista: 'Browning TD. 2021. Cubic Forms and the Circle Method, Cham: Springer Nature,
XIV, 166p.'
mla: Browning, Timothy D. Cubic Forms and the Circle Method. Vol. 343, Springer
Nature, 2021, doi:10.1007/978-3-030-86872-7.
short: T.D. Browning, Cubic Forms and the Circle Method, Springer Nature, Cham,
2021.
date_created: 2021-12-05T23:01:46Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2022-06-03T07:38:33Z
day: '01'
department:
- _id: TiBr
doi: 10.1007/978-3-030-86872-7
intvolume: ' 343'
language:
- iso: eng
month: '12'
oa_version: None
page: XIV, 166
place: Cham
publication_identifier:
eisbn:
- 978-3-030-86872-7
eissn:
- 2296-505X
isbn:
- 978-3-030-86871-0
issn:
- 0743-1643
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cubic Forms and the Circle Method
type: book
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 343
year: '2021'
...
---
_id: '10422'
abstract:
- lang: eng
text: Those who aim to devise new materials with desirable properties usually examine
present methods first. However, they will find out that some approaches can exist
only conceptually without high chances to become practically useful. It seems
that a numerical technique called automatic differentiation together with increasing
supply of computational accelerators will soon shift many methods of the material
design from the category ”unimaginable” to the category ”expensive but possible”.
Approach we suggest is not an exception. Our overall goal is to have an efficient
and generalizable approach allowing to solve inverse design problems. In this
thesis we scratch its surface. We consider jammed systems of identical particles.
And ask ourselves how the shape of those particles (or the parameters codifying
it) may affect mechanical properties of the system. An indispensable part of reaching
the answer is an appropriate particle parametrization. We come up with a simple,
yet generalizable and purposeful scheme for it. Using our generalizable shape
parameterization, we simulate the formation of a solid composed of pentagonal-like
particles and measure anisotropy in the resulting elastic response. Through automatic
differentiation techniques, we directly connect the shape parameters with the
elastic response. Interestingly, for our system we find that less isotropic particles
lead to a more isotropic elastic response. Together with other results known about
our method it seems that it can be successfully generalized for different inverse
design problems.
alternative_title:
- ISTA Master's Thesis
article_processing_charge: No
author:
- first_name: Anton
full_name: Piankov, Anton
id: 865E3C26-AA8C-11E9-A409-C4C4E5697425
last_name: Piankov
citation:
ama: Piankov A. Towards designer materials using customizable particle shape. 2021.
doi:10.15479/at:ista:10422
apa: Piankov, A. (2021). Towards designer materials using customizable particle
shape. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10422
chicago: Piankov, Anton. “Towards Designer Materials Using Customizable Particle
Shape.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10422.
ieee: A. Piankov, “Towards designer materials using customizable particle shape,”
Institute of Science and Technology Austria, 2021.
ista: Piankov A. 2021. Towards designer materials using customizable particle shape.
Institute of Science and Technology Austria.
mla: Piankov, Anton. Towards Designer Materials Using Customizable Particle Shape.
Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10422.
short: A. Piankov, Towards Designer Materials Using Customizable Particle Shape,
Institute of Science and Technology Austria, 2021.
date_created: 2021-12-07T10:48:06Z
date_published: 2021-12-07T00:00:00Z
date_updated: 2023-09-07T13:34:12Z
day: '07'
ddc:
- '530'
degree_awarded: MS
department:
- _id: GradSch
- _id: CaGo
doi: 10.15479/at:ista:10422
file:
- access_level: closed
checksum: 114e8f4b2c002c6c352416c12de2c695
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-12-07T11:13:52Z
date_updated: 2022-03-10T12:10:25Z
file_id: '10424'
file_name: Thesis.zip
file_size: 394018
relation: source_file
- access_level: closed
checksum: cd15ae991ced352a9959815f794e657c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cchlebak
date_created: 2021-12-07T11:14:01Z
date_updated: 2022-03-10T12:10:25Z
file_id: '10425'
file_name: Preliminary_pages_Piankov.docx
file_size: 47638
relation: source_file
- access_level: open_access
checksum: e6899c798b75ba42fab9822bce309050
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-07T11:20:35Z
date_updated: 2021-12-07T11:20:35Z
file_id: '10426'
file_name: 2021_Piankov_combined.pdf
file_size: 484965
relation: main_file
success: 1
file_date_updated: 2022-03-10T12:10:25Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication_identifier:
issn:
- 2791-4585
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
title: Towards designer materials using customizable particle shape
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10429'
abstract:
- lang: eng
text: "The scalability of concurrent data structures and distributed algorithms
strongly depends on\r\nreducing the contention for shared resources and the costs
of synchronization and communication. We show how such cost reductions can be
attained by relaxing the strict consistency conditions required by sequential
implementations. In the first part of the thesis, we consider relaxation in the
context of concurrent data structures. Specifically, in data structures \r\nsuch
as priority queues, imposing strong semantics renders scalability impossible,
since a correct implementation of the remove operation should return only the
element with highest priority. Intuitively, attempting to invoke remove operations
concurrently creates a race condition. This bottleneck can be circumvented by
relaxing semantics of the affected data structure, thus allowing removal of the
elements which are no longer required to have the highest priority. We prove that
the randomized implementations of relaxed data structures provide provable guarantees
on the priority of the removed elements even under concurrency. Additionally,
we show that in some cases the relaxed data structures can be used to scale the
classical algorithms which are usually implemented with the exact ones. In the
second part, we study parallel variants of the stochastic gradient descent (SGD)
algorithm, which distribute computation among the multiple processors, thus reducing
the running time. Unfortunately, in order for standard parallel SGD to succeed,
each processor has to maintain a local copy of the necessary model parameter,
which is identical to the local copies of other processors; the overheads from
this perfect consistency in terms of communication and synchronization can negate
the speedup gained by distributing the computation. We show that the consistency
conditions required by SGD can be relaxed, allowing the algorithm to be more
flexible in terms of tolerating quantized communication, asynchrony, or even crash
faults, while its convergence remains asymptotically the same."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
citation:
ama: Nadiradze G. On achieving scalability through relaxation. 2021. doi:10.15479/at:ista:10429
apa: Nadiradze, G. (2021). On achieving scalability through relaxation. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:10429
chicago: Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute
of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10429.
ieee: G. Nadiradze, “On achieving scalability through relaxation,” Institute of
Science and Technology Austria, 2021.
ista: Nadiradze G. 2021. On achieving scalability through relaxation. Institute
of Science and Technology Austria.
mla: Nadiradze, Giorgi. On Achieving Scalability through Relaxation. Institute
of Science and Technology Austria, 2021, doi:10.15479/at:ista:10429.
short: G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science
and Technology Austria, 2021.
date_created: 2021-12-08T21:52:28Z
date_published: 2021-12-09T00:00:00Z
date_updated: 2023-10-17T11:48:55Z
day: '09'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: DaAl
doi: 10.15479/at:ista:10429
ec_funded: 1
file:
- access_level: open_access
checksum: 6bf14e9a523387328f016c0689f5e10e
content_type: application/pdf
creator: gnadirad
date_created: 2021-12-09T17:47:49Z
date_updated: 2021-12-09T17:47:49Z
file_id: '10436'
file_name: Thesis_Final_09_12_2021.pdf
file_size: 2370859
relation: main_file
success: 1
- access_level: closed
checksum: 914d6c5ca86bd0add471971a8f4c4341
content_type: application/zip
creator: gnadirad
date_created: 2021-12-09T17:47:49Z
date_updated: 2022-03-28T12:55:12Z
file_id: '10437'
file_name: Thesis_Final_09_12_2021.zip
file_size: 2596924
relation: source_file
file_date_updated: 2022-03-28T12:55:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '132'
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10432'
relation: part_of_dissertation
status: public
- id: '6673'
relation: part_of_dissertation
status: public
- id: '5965'
relation: part_of_dissertation
status: public
- id: '10435'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
title: On achieving scalability through relaxation
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10432'
abstract:
- lang: eng
text: One key element behind the recent progress of machine learning has been the
ability to train machine learning models in large-scale distributed shared-memory
and message-passing environments. Most of these models are trained employing variants
of stochastic gradient descent (SGD) based optimization, but most methods involve
some type of consistency relaxation relative to sequential SGD, to mitigate its
large communication or synchronization costs at scale. In this paper, we introduce
a general consistency condition covering communication-reduced and asynchronous
distributed SGD implementations. Our framework, called elastic consistency, decouples
the system-specific aspects of the implementation from the SGD convergence requirements,
giving a general way to obtain convergence bounds for a wide variety of distributed
SGD methods used in practice. Elastic consistency can be used to re-derive or
improve several previous convergence bounds in message-passing and shared-memory
settings, but also to analyze new models and distribution schemes. As a direct
application, we propose and analyze a new synchronization-avoiding scheduling
scheme for distributed SGD, and show that it can be used to efficiently train
deep convolutional models for image classification.
acknowledgement: "We would like to thank Christopher De Sa for his feedback on an
earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful
comments. This project has received\r\nfunding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European
Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie
grant agreement No. 754411 (ISTPlus)."
article_processing_charge: No
arxiv: 1
author:
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: 'Vyacheslav '
full_name: 'Kungurtsev, Vyacheslav '
last_name: Kungurtsev
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency:
A practical consistency model for distributed stochastic gradient descent. In:
Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35.
; 2021:9037-9045.'
apa: 'Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh,
D.-A. (2021). Elastic consistency: A practical consistency model for distributed
stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 9037–9045). Virtual.'
chicago: 'Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev,
and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for
Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference
on Artificial Intelligence, 35:9037–45, 2021.'
ieee: 'G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh,
“Elastic consistency: A practical consistency model for distributed stochastic
gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.'
ista: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic
consistency: A practical consistency model for distributed stochastic gradient
descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI:
Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.'
mla: 'Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model
for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference
on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.'
short: G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:,
Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
date_created: 2021-12-09T09:21:35Z
date_published: 2021-05-18T00:00:00Z
date_updated: 2023-09-07T13:31:39Z
day: '18'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2001.05918'
intvolume: ' 35'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/17092
month: '05'
oa: 1
oa_version: Published Version
page: 9037-9045
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
status: public
title: 'Elastic consistency: A practical consistency model for distributed stochastic
gradient descent'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 35
year: '2021'
...
---
_id: '10435'
abstract:
- lang: eng
text: Decentralized optimization is emerging as a viable alternative for scalable
distributed machine learning, but also introduces new challenges in terms of synchronization
costs. To this end, several communication-reduction techniques, such as non-blocking
communication, quantization, and local steps, have been explored in the decentralized
setting. Due to the complexity of analyzing optimization in such a relaxed setting,
this line of work often assumes \emph{global} communication rounds, which require
additional synchronization. In this paper, we consider decentralized optimization
in the simpler, but harder to analyze, \emph{asynchronous gossip} model, in which
communication occurs in discrete, randomly chosen pairings among nodes. Perhaps
surprisingly, we show that a variant of SGD called \emph{SwarmSGD} still converges
in this setting, even if \emph{non-blocking communication}, \emph{quantization},
and \emph{local steps} are all applied \emph{in conjunction}, and even if the
node data distributions and underlying graph topology are both \emph{heterogenous}.
Our analysis is based on a new connection with multi-dimensional load-balancing
processes. We implement this algorithm and deploy it in a super-computing environment,
showing that it can outperform previous decentralized methods in terms of end-to-end
training time, and that it can even rival carefully-tuned large-batch SGD for
certain tasks.
acknowledgement: "We gratefully acknowledge funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). PD partly conducted this work while at IST
Austria and was supported by the European Union’s Horizon 2020 programme under the
Marie Skłodowska-Curie grant agreement No. 754411. SL was funded in part by European
Research Council (ERC) under the European Union’s Horizon 2020 programme (grant
agreement DAPP, No. 678880, and EPiGRAM-HS, No. 801039).\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Amirmojtaba
full_name: Sabour, Amirmojtaba
id: bcc145fd-e77f-11ea-ae8b-80d661dbff67
last_name: Sabour
- first_name: Peter
full_name: Davies, Peter
id: 11396234-BB50-11E9-B24C-90FCE5697425
last_name: Davies
orcid: 0000-0002-5646-9524
- first_name: Shigang
full_name: Li, Shigang
last_name: Li
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. Asynchronous decentralized
SGD with quantized and local updates. In: 35th Conference on Neural Information
Processing Systems. Neural Information Processing Systems Foundation; 2021.'
apa: 'Nadiradze, G., Sabour, A., Davies, P., Li, S., & Alistarh, D.-A. (2021).
Asynchronous decentralized SGD with quantized and local updates. In 35th Conference
on Neural Information Processing Systems. Sydney, Australia: Neural Information
Processing Systems Foundation.'
chicago: Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian
Alistarh. “Asynchronous Decentralized SGD with Quantized and Local Updates.” In
35th Conference on Neural Information Processing Systems. Neural Information
Processing Systems Foundation, 2021.
ieee: G. Nadiradze, A. Sabour, P. Davies, S. Li, and D.-A. Alistarh, “Asynchronous
decentralized SGD with quantized and local updates,” in 35th Conference on
Neural Information Processing Systems, Sydney, Australia, 2021.
ista: 'Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. 2021. Asynchronous decentralized
SGD with quantized and local updates. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems.'
mla: Nadiradze, Giorgi, et al. “Asynchronous Decentralized SGD with Quantized and
Local Updates.” 35th Conference on Neural Information Processing Systems,
Neural Information Processing Systems Foundation, 2021.
short: G. Nadiradze, A. Sabour, P. Davies, S. Li, D.-A. Alistarh, in:, 35th Conference
on Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2021.
conference:
end_date: 2021-12-14
location: Sydney, Australia
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
date_created: 2021-12-09T10:59:12Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2023-10-17T11:48:56Z
day: '01'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '1910.12308'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.nips.cc/paper/2021/hash/362c99307cdc3f2d8b410652386a9dd1-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th Conference on Neural Information Processing Systems
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
status: public
title: Asynchronous decentralized SGD with quantized and local updates
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10527'
abstract:
- lang: eng
text: We show that in a two-dimensional electron gas with an annular Fermi surface,
long-range Coulomb interactions can lead to unconventional superconductivity by
the Kohn-Luttinger mechanism. Superconductivity is strongly enhanced when the
inner and outer Fermi surfaces are close to each other. The most prevalent state
has chiral p-wave symmetry, but d-wave and extended s-wave pairing are also possible.
We discuss these results in the context of rhombohedral trilayer graphene, where
superconductivity was recently discovered in regimes where the normal state has
an annular Fermi surface. Using realistic parameters, our mechanism can account
for the order of magnitude of Tc, as well as its trends as a function of electron
density and perpendicular displacement field. Moreover, it naturally explains
some of the outstanding puzzles in this material, that include the weak temperature
dependence of the resistivity above Tc, and the proximity of spin singlet superconductivity
to the ferromagnetic phase.
acknowledgement: We thank Yang-Zhi Chou, Andrey Chubukov, Johannes Hofmann, Steve
Kivelson, Sri Raghu, and Sankar das Sarma, Jay Sau, Fengcheng Wu, and Andrea Young
for many stimulating discussions and for their comments on the manuscript. E.B.
thanks S. Chatterjee, T. Wang, and M. Zaletel for a collaboration on a related topic.
A.G. acknowledges support by the European Unions Horizon 2020 research and innovation
program under the Marie Sklodowska-Curie Grant Agreement No. 754411. E.B. and T.H.
were supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement
No. 817799), by the Israel-USA Binational Science Foundation (BSF), and by a Research
grant from Irving and Cherna Moskowitz.
article_number: '247001'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Tobias
full_name: Holder, Tobias
last_name: Holder
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Erez
full_name: Berg, Erez
last_name: Berg
citation:
ama: 'Ghazaryan A, Holder T, Serbyn M, Berg E. Unconventional superconductivity
in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene.
Physical Review Letters. 2021;127(24). doi:10.1103/physrevlett.127.247001'
apa: 'Ghazaryan, A., Holder, T., Serbyn, M., & Berg, E. (2021). Unconventional
superconductivity in systems with annular Fermi surfaces: Application to rhombohedral
trilayer graphene. Physical Review Letters. American Physical Society.
https://doi.org/10.1103/physrevlett.127.247001'
chicago: 'Ghazaryan, Areg, Tobias Holder, Maksym Serbyn, and Erez Berg. “Unconventional
Superconductivity in Systems with Annular Fermi Surfaces: Application to Rhombohedral
Trilayer Graphene.” Physical Review Letters. American Physical Society,
2021. https://doi.org/10.1103/physrevlett.127.247001.'
ieee: 'A. Ghazaryan, T. Holder, M. Serbyn, and E. Berg, “Unconventional superconductivity
in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene,”
Physical Review Letters, vol. 127, no. 24. American Physical Society, 2021.'
ista: 'Ghazaryan A, Holder T, Serbyn M, Berg E. 2021. Unconventional superconductivity
in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene.
Physical Review Letters. 127(24), 247001.'
mla: 'Ghazaryan, Areg, et al. “Unconventional Superconductivity in Systems with
Annular Fermi Surfaces: Application to Rhombohedral Trilayer Graphene.” Physical
Review Letters, vol. 127, no. 24, 247001, American Physical Society, 2021,
doi:10.1103/physrevlett.127.247001.'
short: A. Ghazaryan, T. Holder, M. Serbyn, E. Berg, Physical Review Letters 127
(2021).
date_created: 2021-12-10T07:51:33Z
date_published: 2021-12-09T00:00:00Z
date_updated: 2023-08-14T13:19:13Z
day: '09'
department:
- _id: MaSe
doi: 10.1103/physrevlett.127.247001
ec_funded: 1
external_id:
arxiv:
- '2109.00011'
isi:
- '000923819400004'
intvolume: ' 127'
isi: 1
issue: '24'
keyword:
- general physics and astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2109.00011
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
link:
- description: News on IST Webpage
relation: press_release
url: https://ist.ac.at/en/news/resolving-the-puzzles-of-graphene-superconductivity/
scopus_import: '1'
status: public
title: 'Unconventional superconductivity in systems with annular Fermi surfaces: Application
to rhombohedral trilayer graphene'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 127
year: '2021'
...
---
_id: '10533'
abstract:
- lang: eng
text: Flowering plants utilize small RNA molecules to guide DNA methyltransferases
to genomic sequences. This RNA-directed DNA methylation (RdDM) pathway preferentially
targets euchromatic transposable elements. However, RdDM is thought to be recruited
by methylation of histone H3 at lysine 9 (H3K9me), a hallmark of heterochromatin.
How RdDM is targeted to euchromatin despite an affinity for H3K9me is unclear.
Here we show that loss of histone H1 enhances heterochromatic RdDM, preferentially
at nucleosome linker DNA. Surprisingly, this does not require SHH1, the RdDM component
that binds H3K9me. Furthermore, H3K9me is dispensable for RdDM, as is CG DNA methylation.
Instead, we find that non-CG methylation is specifically associated with small
RNA biogenesis, and without H1 small RNA production quantitatively expands to
non-CG methylated loci. Our results demonstrate that H1 enforces the separation
of euchromatic and heterochromatic DNA methylation pathways by excluding the small
RNA-generating branch of RdDM from non-CG methylated heterochromatin.
acknowledgement: We thank X Feng for helpful comments on the manuscript. This work
was supported by a European Research Council grant MaintainMeth (725746) to DZ.
article_number: e72676
article_processing_charge: No
article_type: original
author:
- first_name: Jaemyung
full_name: Choi, Jaemyung
last_name: Choi
- first_name: David B
full_name: Lyons, David B
last_name: Lyons
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Choi J, Lyons DB, Zilberman D. Histone H1 prevents non-CG methylation-mediated
small RNA biogenesis in Arabidopsis heterochromatin. eLife. 2021;10. doi:10.7554/elife.72676
apa: Choi, J., Lyons, D. B., & Zilberman, D. (2021). Histone H1 prevents non-CG
methylation-mediated small RNA biogenesis in Arabidopsis heterochromatin. ELife.
eLife Sciences Publications. https://doi.org/10.7554/elife.72676
chicago: Choi, Jaemyung, David B Lyons, and Daniel Zilberman. “Histone H1 Prevents
Non-CG Methylation-Mediated Small RNA Biogenesis in Arabidopsis Heterochromatin.”
ELife. eLife Sciences Publications, 2021. https://doi.org/10.7554/elife.72676.
ieee: J. Choi, D. B. Lyons, and D. Zilberman, “Histone H1 prevents non-CG methylation-mediated
small RNA biogenesis in Arabidopsis heterochromatin,” eLife, vol. 10. eLife
Sciences Publications, 2021.
ista: Choi J, Lyons DB, Zilberman D. 2021. Histone H1 prevents non-CG methylation-mediated
small RNA biogenesis in Arabidopsis heterochromatin. eLife. 10, e72676.
mla: Choi, Jaemyung, et al. “Histone H1 Prevents Non-CG Methylation-Mediated Small
RNA Biogenesis in Arabidopsis Heterochromatin.” ELife, vol. 10, e72676,
eLife Sciences Publications, 2021, doi:10.7554/elife.72676.
short: J. Choi, D.B. Lyons, D. Zilberman, ELife 10 (2021).
date_created: 2021-12-10T13:12:08Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2023-08-17T06:21:08Z
day: '01'
ddc:
- '570'
department:
- _id: DaZi
doi: 10.7554/elife.72676
ec_funded: 1
external_id:
isi:
- '000754832000001'
pmid:
- '34850679'
file:
- access_level: open_access
checksum: 22ed4c55fb550f6da02ae55c359be651
content_type: application/pdf
creator: dernst
date_created: 2022-05-16T10:42:22Z
date_updated: 2022-05-16T10:42:22Z
file_id: '11384'
file_name: 2021_eLife_Choi.pdf
file_size: 2715200
relation: main_file
success: 1
file_date_updated: 2022-05-16T10:42:22Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
keyword:
- genetics and molecular biology
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 62935a00-2b32-11ec-9570-eff30fa39068
call_identifier: H2020
grant_number: '725746'
name: Quantitative analysis of DNA methylation maintenance with chromatin
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Histone H1 prevents non-CG methylation-mediated small RNA biogenesis in Arabidopsis
heterochromatin
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: 10
year: '2021'
...
---
_id: '10534'
abstract:
- lang: eng
text: For many years, fullerene derivatives have been the main n-type material of
organic electronics and optoelectronics. Recently, fullerene derivatives functionalized
with ethylene glycol (EG) side chains have been showing important properties such
as enhanced dielectric constants, facile doping and enhanced self-assembly capabilities.
Here, we have prepared field-effect transistors using a series of these fullerene
derivatives equipped with EG side chains of different lengths. Transport data
show the beneficial effect of increasing the EG side chain. In order to understand
the material properties, full structural determination of these fullerene derivatives
has been achieved by coupling the X-ray data with molecular dynamics (MD) simulations.
The increase in transport properties is paired with the formation of extended
layered structures, efficient molecular packing and an increase in the crystallite
alignment. The layer-like structure is composed of conducting layers, containing
of closely packed C60 balls approaching the inter-distance of 1 nm, that are separated
by well-defined EG layers, where the EG chains are rather splayed with the chain
direction almost perpendicular to the layer normal. Such a layered structure appears
highly ordered and highly aligned with the C60 planes oriented parallel to the
substrate in the thin film configuration. The order inside the thin film increases
with the EG chain length, allowing the systems to achieve mobilities as high as
0.053 cm2 V−1 s−1. Our work elucidates the structure of these interesting semiconducting
organic molecules and shows that the synergistic use of X-ray structural analysis
and MD simulations is a powerful tool to identify the structure of thin organic
films for optoelectronic applications.
acknowledgement: J. D. gratefully acknowledges the China Scholarship Council (CSC
No. 201606340158) for supporting his PhD studies. S. S. thanks J. Antoja-Lleonart
for insightful discussions on simulating the X-ray diffraction patterns. Part of
the work was sponsored by NWO Exact and Natural Sciences for the use of supercomputer
facilities (Contract no. 17197 7095). Regarding S. S., R. A., R. W. A. H., J. C.
H., and M. A. L., this is a publication by the FOM Focus Group “Next Generation
Organic Photovoltaics”, participating in the Dutch Institute for Fundamental Energy
Research (DIFFER). The ESRF is acknowledged for providing the beamtime. J. D. and
G. P. are grateful to the BM26B staff for their great support during the beamtime.
M. A. L., D. M. B. are grateful for the financial support of the European Research
Council via a Starting Grant (HySPOD, No. 306983).
article_processing_charge: No
article_type: original
author:
- first_name: Jingjin
full_name: Dong, Jingjin
last_name: Dong
- first_name: Selim
full_name: Sami, Selim
last_name: Sami
- first_name: Daniel
full_name: Balazs, Daniel
id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E
last_name: Balazs
orcid: 0000-0001-7597-043X
- first_name: Riccardo
full_name: Alessandri, Riccardo
last_name: Alessandri
- first_name: Fatimeh
full_name: Jahani, Fatimeh
last_name: Jahani
- first_name: Li
full_name: Qiu, Li
last_name: Qiu
- first_name: Siewert J.
full_name: Marrink, Siewert J.
last_name: Marrink
- first_name: Remco W.A.
full_name: Havenith, Remco W.A.
last_name: Havenith
- first_name: Jan C.
full_name: Hummelen, Jan C.
last_name: Hummelen
- first_name: Maria A.
full_name: Loi, Maria A.
last_name: Loi
- first_name: Giuseppe
full_name: Portale, Giuseppe
last_name: Portale
citation:
ama: 'Dong J, Sami S, Balazs D, et al. Fullerene derivatives with oligoethylene-glycol
side chains: An investigation on the origin of their outstanding transport properties.
Journal of Materials Chemistry C. 2021;9(45):16217-16225. doi:10.1039/d1tc02753k'
apa: 'Dong, J., Sami, S., Balazs, D., Alessandri, R., Jahani, F., Qiu, L., … Portale,
G. (2021). Fullerene derivatives with oligoethylene-glycol side chains: An investigation
on the origin of their outstanding transport properties. Journal of Materials
Chemistry C. Royal Society of Chemistry. https://doi.org/10.1039/d1tc02753k'
chicago: 'Dong, Jingjin, Selim Sami, Daniel Balazs, Riccardo Alessandri, Fatimeh
Jahani, Li Qiu, Siewert J. Marrink, et al. “Fullerene Derivatives with Oligoethylene-Glycol
Side Chains: An Investigation on the Origin of Their Outstanding Transport Properties.”
Journal of Materials Chemistry C. Royal Society of Chemistry, 2021. https://doi.org/10.1039/d1tc02753k.'
ieee: 'J. Dong et al., “Fullerene derivatives with oligoethylene-glycol side
chains: An investigation on the origin of their outstanding transport properties,”
Journal of Materials Chemistry C, vol. 9, no. 45. Royal Society of Chemistry,
pp. 16217–16225, 2021.'
ista: 'Dong J, Sami S, Balazs D, Alessandri R, Jahani F, Qiu L, Marrink SJ, Havenith
RWA, Hummelen JC, Loi MA, Portale G. 2021. Fullerene derivatives with oligoethylene-glycol
side chains: An investigation on the origin of their outstanding transport properties.
Journal of Materials Chemistry C. 9(45), 16217–16225.'
mla: 'Dong, Jingjin, et al. “Fullerene Derivatives with Oligoethylene-Glycol Side
Chains: An Investigation on the Origin of Their Outstanding Transport Properties.”
Journal of Materials Chemistry C, vol. 9, no. 45, Royal Society of Chemistry,
2021, pp. 16217–25, doi:10.1039/d1tc02753k.'
short: J. Dong, S. Sami, D. Balazs, R. Alessandri, F. Jahani, L. Qiu, S.J. Marrink,
R.W.A. Havenith, J.C. Hummelen, M.A. Loi, G. Portale, Journal of Materials Chemistry
C 9 (2021) 16217–16225.
date_created: 2021-12-12T23:01:27Z
date_published: 2021-12-07T00:00:00Z
date_updated: 2023-08-17T06:18:44Z
day: '07'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1039/d1tc02753k
external_id:
isi:
- '000688135700001'
file:
- access_level: open_access
checksum: 6b73c214ce54a6894a5854b4364413d7
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-13T09:24:42Z
date_updated: 2021-12-13T09:24:42Z
file_id: '10538'
file_name: 2021_JMaterChemC_Dong.pdf
file_size: 4979390
relation: main_file
success: 1
file_date_updated: 2021-12-13T09:24:42Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '45'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 16217-16225
publication: Journal of Materials Chemistry C
publication_identifier:
eissn:
- 2050-7526
issn:
- 2050-7534
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Fullerene derivatives with oligoethylene-glycol side chains: An investigation
on the origin of their outstanding transport properties'
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: 9
year: '2021'
...
---
_id: '10535'
abstract:
- lang: eng
text: Realistic models of biological processes typically involve interacting components
on multiple scales, driven by changing environment and inherent stochasticity.
Such models are often analytically and numerically intractable. We revisit a dynamic
maximum entropy method that combines a static maximum entropy with a quasi-stationary
approximation. This allows us to reduce stochastic non-equilibrium dynamics expressed
by the Fokker-Planck equation to a simpler low-dimensional deterministic dynamics,
without the need to track microscopic details. Although the method has been previously
applied to a few (rather complicated) applications in population genetics, our
main goal here is to explain and to better understand how the method works. We
demonstrate the usefulness of the method for two widely studied stochastic problems,
highlighting its accuracy in capturing important macroscopic quantities even in
rapidly changing non-stationary conditions. For the Ornstein-Uhlenbeck process,
the method recovers the exact dynamics whilst for a stochastic island model with
migration from other habitats, the approximation retains high macroscopic accuracy
under a wide range of scenarios in a dynamic environment.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "Computational resources for the study were provided by the Institute
of Science and Technology, Austria.\r\nKB received funding from the Scientific Grant
Agency of the Slovak Republic under the Grants Nos. 1/0755/19 and 1/0521/20."
article_number: e1009661
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Katarína
full_name: Bod'ová, Katarína
id: 2BA24EA0-F248-11E8-B48F-1D18A9856A87
last_name: Bod'ová
orcid: 0000-0002-7214-0171
- first_name: Eniko
full_name: Szep, Eniko
id: 485BB5A4-F248-11E8-B48F-1D18A9856A87
last_name: Szep
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Bodova K, Szep E, Barton NH. Dynamic maximum entropy provides accurate approximation
of structured population dynamics. PLoS Computational Biology. 2021;17(12).
doi:10.1371/journal.pcbi.1009661
apa: Bodova, K., Szep, E., & Barton, N. H. (2021). Dynamic maximum entropy provides
accurate approximation of structured population dynamics. PLoS Computational
Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1009661
chicago: Bodova, Katarina, Eniko Szep, and Nicholas H Barton. “Dynamic Maximum Entropy
Provides Accurate Approximation of Structured Population Dynamics.” PLoS Computational
Biology. Public Library of Science, 2021. https://doi.org/10.1371/journal.pcbi.1009661.
ieee: K. Bodova, E. Szep, and N. H. Barton, “Dynamic maximum entropy provides accurate
approximation of structured population dynamics,” PLoS Computational Biology,
vol. 17, no. 12. Public Library of Science, 2021.
ista: Bodova K, Szep E, Barton NH. 2021. Dynamic maximum entropy provides accurate
approximation of structured population dynamics. PLoS Computational Biology. 17(12),
e1009661.
mla: Bodova, Katarina, et al. “Dynamic Maximum Entropy Provides Accurate Approximation
of Structured Population Dynamics.” PLoS Computational Biology, vol. 17,
no. 12, e1009661, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1009661.
short: K. Bodova, E. Szep, N.H. Barton, PLoS Computational Biology 17 (2021).
date_created: 2021-12-12T23:01:27Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2022-08-01T10:48:04Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
- _id: GaTk
doi: 10.1371/journal.pcbi.1009661
external_id:
arxiv:
- '2102.03669'
pmid:
- '34851948'
file:
- access_level: open_access
checksum: dcd185d4f7e0acee25edf1d6537f447e
content_type: application/pdf
creator: dernst
date_created: 2022-05-16T08:53:11Z
date_updated: 2022-05-16T08:53:11Z
file_id: '11383'
file_name: 2021_PLOsComBio_Bodova.pdf
file_size: 2299486
relation: main_file
success: 1
file_date_updated: 2022-05-16T08:53:11Z
has_accepted_license: '1'
intvolume: ' 17'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS Computational Biology
publication_identifier:
eissn:
- 1553-7358
issn:
- 1553-734X
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic maximum entropy provides accurate approximation of structured population
dynamics
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2021'
...
---
_id: '10536'
abstract:
- lang: eng
text: TGFβ overexpression is commonly detected in cancer patients and correlates
with poor prognosis and metastasis. Cancer progression is often associated with
an enhanced recruitment of myeloid-derived cells to the tumor microenvironment.
Here we show that functional TGFβ-signaling in myeloid cells is required for metastasis
to the lungs and the liver. Myeloid-specific deletion of Tgfbr2 resulted in reduced
spontaneous lung metastasis, which was associated with a reduction of proinflammatory
cytokines in the metastatic microenvironment. Notably, CD8+ T cell depletion in
myeloid-specific Tgfbr2-deficient mice rescued lung metastasis. Myeloid-specific
Tgfbr2-deficiency resulted in reduced liver metastasis with an almost complete
absence of myeloid cells within metastatic foci. On contrary, an accumulation
of Tgfβ-responsive myeloid cells was associated with an increased recruitment
of monocytes and granulocytes and higher proinflammatory cytokine levels in control
mice. Monocytic cells isolated from metastatic livers of Tgfbr2-deficient mice
showed increased polarization towards the M1 phenotype, Tnfα and Il-1β expression,
reduced levels of M2 markers and reduced production of chemokines responsible
for myeloid-cell recruitment. No significant differences in Tgfβ levels were observed
at metastatic sites of any model. These data demonstrate that Tgfβ signaling in
monocytic myeloid cells suppresses CD8+ T cell activity during lung metastasis,
while these cells actively contribute to tumor growth during liver metastasis.
Thus, myeloid cells modulate metastasis through different mechanisms in a tissue-specific
manner.
acknowledgement: The authors acknowledge the assistance of the Laboratory Animal Services
Center (LASC) – UZH, Center for Microscopy and Image Analysis, and the Flow Cytometry
Center of the University of Zurich.
article_number: '765151'
article_processing_charge: No
article_type: original
author:
- first_name: Cristina
full_name: Stefanescu, Cristina
last_name: Stefanescu
- first_name: Merel
full_name: Van Gogh, Merel
last_name: Van Gogh
- first_name: Marko
full_name: Roblek, Marko
id: 3047D808-F248-11E8-B48F-1D18A9856A87
last_name: Roblek
orcid: 0000-0001-9588-1389
- first_name: Mathias
full_name: Heikenwalder, Mathias
last_name: Heikenwalder
- first_name: Lubor
full_name: Borsig, Lubor
last_name: Borsig
citation:
ama: Stefanescu C, Van Gogh M, Roblek M, Heikenwalder M, Borsig L. TGFβ signaling
in myeloid cells promotes lung and liver metastasis through different mechanisms.
Frontiers in Oncology. 2021;11. doi:10.3389/fonc.2021.765151
apa: Stefanescu, C., Van Gogh, M., Roblek, M., Heikenwalder, M., & Borsig, L.
(2021). TGFβ signaling in myeloid cells promotes lung and liver metastasis through
different mechanisms. Frontiers in Oncology. Frontiers. https://doi.org/10.3389/fonc.2021.765151
chicago: Stefanescu, Cristina, Merel Van Gogh, Marko Roblek, Mathias Heikenwalder,
and Lubor Borsig. “TGFβ Signaling in Myeloid Cells Promotes Lung and Liver Metastasis
through Different Mechanisms.” Frontiers in Oncology. Frontiers, 2021.
https://doi.org/10.3389/fonc.2021.765151.
ieee: C. Stefanescu, M. Van Gogh, M. Roblek, M. Heikenwalder, and L. Borsig, “TGFβ
signaling in myeloid cells promotes lung and liver metastasis through different
mechanisms,” Frontiers in Oncology, vol. 11. Frontiers, 2021.
ista: Stefanescu C, Van Gogh M, Roblek M, Heikenwalder M, Borsig L. 2021. TGFβ signaling
in myeloid cells promotes lung and liver metastasis through different mechanisms.
Frontiers in Oncology. 11, 765151.
mla: Stefanescu, Cristina, et al. “TGFβ Signaling in Myeloid Cells Promotes Lung
and Liver Metastasis through Different Mechanisms.” Frontiers in Oncology,
vol. 11, 765151, Frontiers, 2021, doi:10.3389/fonc.2021.765151.
short: C. Stefanescu, M. Van Gogh, M. Roblek, M. Heikenwalder, L. Borsig, Frontiers
in Oncology 11 (2021).
date_created: 2021-12-12T23:01:27Z
date_published: 2021-11-18T00:00:00Z
date_updated: 2023-08-17T06:20:32Z
day: '18'
ddc:
- '610'
department:
- _id: DaSi
doi: 10.3389/fonc.2021.765151
external_id:
isi:
- '000726603400001'
pmid:
- '34868988'
file:
- access_level: open_access
checksum: 56cbac80e6891ce750511a30161b7792
content_type: application/pdf
creator: alisjak
date_created: 2021-12-13T13:32:37Z
date_updated: 2021-12-13T13:32:37Z
file_id: '10539'
file_name: 2021_Frontiers_Stefanescu.pdf
file_size: 9245199
relation: main_file
success: 1
file_date_updated: 2021-12-13T13:32:37Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Frontiers in Oncology
publication_identifier:
eissn:
- 2234-943X
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: TGFβ signaling in myeloid cells promotes lung and liver metastasis through
different mechanisms
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: 11
year: '2021'
...
---
_id: '10537'
abstract:
- lang: eng
text: We consider the quantum many-body evolution of a homogeneous Fermi gas in
three dimensions in the coupled semiclassical and mean-field scaling regime. We
study a class of initial data describing collective particle–hole pair excitations
on the Fermi ball. Using a rigorous version of approximate bosonization, we prove
that the many-body evolution can be approximated in Fock space norm by a quasi-free
bosonic evolution of the collective particle–hole excitations.
acknowledgement: NB was supported by Gruppo Nazionale per la Fisica Matematica (GNFM).
RS was supported by the European Research Council (ERC) under the European Union’s
Horizon 2020 research and innovation program (Grant Agreement No. 694227). PTN was
supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)
under Germany’s Excellence Strategy (EXC-2111-390814868). MP was supported by the
European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation program (ERC StG MaMBoQ, Grant Agreement No. 802901). BS was supported
by the NCCR SwissMAP, the Swiss National Science Foundation through the Grant “Dynamical
and energetic properties of Bose-Einstein condensates,” and the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation program
through the ERC-AdG CLaQS (Grant Agreement No. 834782).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
- first_name: Phan Thành
full_name: Nam, Phan Thành
last_name: Nam
- first_name: Marcello
full_name: Porta, Marcello
last_name: Porta
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Bosonization of fermionic
many-body dynamics. Annales Henri Poincaré. 2021. doi:10.1007/s00023-021-01136-y
apa: Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R.
(2021). Bosonization of fermionic many-body dynamics. Annales Henri Poincaré.
Springer Nature. https://doi.org/10.1007/s00023-021-01136-y
chicago: Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein,
and Robert Seiringer. “Bosonization of Fermionic Many-Body Dynamics.” Annales
Henri Poincaré. Springer Nature, 2021. https://doi.org/10.1007/s00023-021-01136-y.
ieee: N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Bosonization
of fermionic many-body dynamics,” Annales Henri Poincaré. Springer Nature,
2021.
ista: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2021. Bosonization
of fermionic many-body dynamics. Annales Henri Poincaré.
mla: Benedikter, Niels P., et al. “Bosonization of Fermionic Many-Body Dynamics.”
Annales Henri Poincaré, Springer Nature, 2021, doi:10.1007/s00023-021-01136-y.
short: N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Annales Henri
Poincaré (2021).
date_created: 2021-12-12T23:01:28Z
date_published: 2021-12-02T00:00:00Z
date_updated: 2023-08-17T06:19:14Z
day: '02'
department:
- _id: RoSe
doi: 10.1007/s00023-021-01136-y
ec_funded: 1
external_id:
arxiv:
- '2103.08224'
isi:
- '000725405700001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2103.08224
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Annales Henri Poincaré
publication_identifier:
issn:
- 1424-0637
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bosonization of fermionic many-body dynamics
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10545'
abstract:
- lang: eng
text: Classical models with complex energy landscapes represent a perspective avenue
for the near-term application of quantum simulators. Until now, many theoretical
works studied the performance of quantum algorithms for models with a unique ground
state. However, when the classical problem is in a so-called clustering phase,
the ground state manifold is highly degenerate. As an example, we consider a 3-XORSAT
model defined on simple hypergraphs. The degeneracy of classical ground state
manifold translates into the emergence of an extensive number of Z2 symmetries,
which remain intact even in the presence of a quantum transverse magnetic field.
We establish a general duality approach that restricts the quantum problem to
a given sector of conserved Z2 charges and use it to study how the outcome of
the quantum adiabatic algorithm depends on the hypergraph geometry. We show that
the tree hypergraph which corresponds to a classically solvable instance of the
3-XORSAT problem features a constant gap, whereas the closed hypergraph encounters
a second-order phase transition with a gap vanishing as a power-law in the problem
size. The duality developed in this work provides a practical tool for studies
of quantum models with classically degenerate energy manifold and reveals potential
connections between glasses and gauge theories.
acknowledgement: We would like to thank S. De Nicola, A. Michaidilis, T. Gulden, Y.
Nez-Fernndez, P. Brighi, and S. Sack for fruitful discussions and valuable feedback
on the manuscript. M.S. acknowledges useful discussions with E. Altman, L. Cugliandolo,
and C. Laumann. We acknowledge support from the European Research Council (ERC)
under the European Union's Horizon 2020 Research and Innovation Programme Grant
Agreement No. 850899.
article_number: '062423'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Raimel A
full_name: Medina Ramos, Raimel A
id: CE680B90-D85A-11E9-B684-C920E6697425
last_name: Medina Ramos
orcid: 0000-0002-5383-2869
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Medina Ramos RA, Serbyn M. Duality approach to quantum annealing of the 3-variable
exclusive-or satisfiability problem (3-XORSAT). Physical Review A. 2021;104(6).
doi:10.1103/physreva.104.062423
apa: Medina Ramos, R. A., & Serbyn, M. (2021). Duality approach to quantum annealing
of the 3-variable exclusive-or satisfiability problem (3-XORSAT). Physical
Review A. American Physical Society. https://doi.org/10.1103/physreva.104.062423
chicago: Medina Ramos, Raimel A, and Maksym Serbyn. “Duality Approach to Quantum
Annealing of the 3-Variable Exclusive-or Satisfiability Problem (3-XORSAT).” Physical
Review A. American Physical Society, 2021. https://doi.org/10.1103/physreva.104.062423.
ieee: R. A. Medina Ramos and M. Serbyn, “Duality approach to quantum annealing of
the 3-variable exclusive-or satisfiability problem (3-XORSAT),” Physical Review
A, vol. 104, no. 6. American Physical Society, 2021.
ista: Medina Ramos RA, Serbyn M. 2021. Duality approach to quantum annealing of
the 3-variable exclusive-or satisfiability problem (3-XORSAT). Physical Review
A. 104(6), 062423.
mla: Medina Ramos, Raimel A., and Maksym Serbyn. “Duality Approach to Quantum Annealing
of the 3-Variable Exclusive-or Satisfiability Problem (3-XORSAT).” Physical
Review A, vol. 104, no. 6, 062423, American Physical Society, 2021, doi:10.1103/physreva.104.062423.
short: R.A. Medina Ramos, M. Serbyn, Physical Review A 104 (2021).
date_created: 2021-12-14T20:46:07Z
date_published: 2021-12-14T00:00:00Z
date_updated: 2023-08-17T06:22:49Z
day: '14'
department:
- _id: MaSe
doi: 10.1103/physreva.104.062423
ec_funded: 1
external_id:
arxiv:
- '2106.06344'
isi:
- '000753659200004'
intvolume: ' 104'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2106.06344
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability
problem (3-XORSAT)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 104
year: '2021'
...
---
_id: '10549'
abstract:
- lang: eng
text: We derive optimal-order homogenization rates for random nonlinear elliptic
PDEs with monotone nonlinearity in the uniformly elliptic case. More precisely,
for a random monotone operator on \mathbb {R}^d with stationary law (that is spatially
homogeneous statistics) and fast decay of correlations on scales larger than the
microscale \varepsilon >0, we establish homogenization error estimates of the
order \varepsilon in case d\geqq 3, and of the order \varepsilon |\log \varepsilon
|^{1/2} in case d=2. Previous results in nonlinear stochastic homogenization have
been limited to a small algebraic rate of convergence \varepsilon ^\delta . We
also establish error estimates for the approximation of the homogenized operator
by the method of representative volumes of the order (L/\varepsilon )^{-d/2} for
a representative volume of size L. Our results also hold in the case of systems
for which a (small-scale) C^{1,\alpha } regularity theory is available.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). SN acknowledges partial support by the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) – project number 405009441.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Stefan
full_name: Neukamm, Stefan
last_name: Neukamm
citation:
ama: Fischer JL, Neukamm S. Optimal homogenization rates in stochastic homogenization
of nonlinear uniformly elliptic equations and systems. Archive for Rational
Mechanics and Analysis. 2021;242(1):343-452. doi:10.1007/s00205-021-01686-9
apa: Fischer, J. L., & Neukamm, S. (2021). Optimal homogenization rates in stochastic
homogenization of nonlinear uniformly elliptic equations and systems. Archive
for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-021-01686-9
chicago: Fischer, Julian L, and Stefan Neukamm. “Optimal Homogenization Rates in
Stochastic Homogenization of Nonlinear Uniformly Elliptic Equations and Systems.”
Archive for Rational Mechanics and Analysis. Springer Nature, 2021. https://doi.org/10.1007/s00205-021-01686-9.
ieee: J. L. Fischer and S. Neukamm, “Optimal homogenization rates in stochastic
homogenization of nonlinear uniformly elliptic equations and systems,” Archive
for Rational Mechanics and Analysis, vol. 242, no. 1. Springer Nature, pp.
343–452, 2021.
ista: Fischer JL, Neukamm S. 2021. Optimal homogenization rates in stochastic homogenization
of nonlinear uniformly elliptic equations and systems. Archive for Rational Mechanics
and Analysis. 242(1), 343–452.
mla: Fischer, Julian L., and Stefan Neukamm. “Optimal Homogenization Rates in Stochastic
Homogenization of Nonlinear Uniformly Elliptic Equations and Systems.” Archive
for Rational Mechanics and Analysis, vol. 242, no. 1, Springer Nature, 2021,
pp. 343–452, doi:10.1007/s00205-021-01686-9.
short: J.L. Fischer, S. Neukamm, Archive for Rational Mechanics and Analysis 242
(2021) 343–452.
date_created: 2021-12-16T12:12:33Z
date_published: 2021-06-30T00:00:00Z
date_updated: 2023-08-17T06:23:21Z
day: '30'
ddc:
- '530'
department:
- _id: JuFi
doi: 10.1007/s00205-021-01686-9
external_id:
arxiv:
- '1908.02273'
isi:
- '000668431200001'
file:
- access_level: open_access
checksum: cc830b739aed83ca2e32c4e0ce266a4c
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-16T14:58:08Z
date_updated: 2021-12-16T14:58:08Z
file_id: '10558'
file_name: 2021_ArchRatMechAnalysis_Fischer.pdf
file_size: 1640121
relation: main_file
success: 1
file_date_updated: 2021-12-16T14:58:08Z
has_accepted_license: '1'
intvolume: ' 242'
isi: 1
issue: '1'
keyword:
- Mechanical Engineering
- Mathematics (miscellaneous)
- Analysis
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 343-452
publication: Archive for Rational Mechanics and Analysis
publication_identifier:
eissn:
- 1432-0673
issn:
- 0003-9527
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal homogenization rates in stochastic homogenization of nonlinear uniformly
elliptic equations and systems
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: 242
year: '2021'
...