---
_id: '10609'
abstract:
- lang: eng
text: "We study Multi-party computation (MPC) in the setting of subversion, where
the adversary tampers with the machines of honest parties. Our goal is to construct
actively secure MPC protocols where parties are corrupted adaptively by an adversary
(as in the standard adaptive security setting), and in addition, honest parties’
machines are compromised.\r\nThe idea of reverse firewalls (RF) was introduced
at EUROCRYPT’15 by Mironov and Stephens-Davidowitz as an approach to protecting
protocols against corruption of honest parties’ devices. Intuitively, an RF for
a party P is an external entity that sits between P and the outside world
and whose scope is to sanitize P ’s incoming and outgoing messages in the face
of subversion of their computer. Mironov and Stephens-Davidowitz constructed a
protocol for passively-secure two-party computation. At CRYPTO’20, Chakraborty,
Dziembowski and Nielsen constructed a protocol for secure computation with firewalls
that improved on this result, both by extending it to multi-party computation
protocol, and considering active security in the presence of static corruptions.
In this paper, we initiate the study of RF for MPC in the adaptive setting. We
put forward a definition for adaptively secure MPC in the reverse firewall setting,
explore relationships among the security notions, and then construct reverse firewalls
for MPC in this stronger setting of adaptive security. We also resolve the open
question of Chakraborty, Dziembowski and Nielsen by removing the need for a trusted
setup in constructing RF for MPC. Towards this end, we construct reverse firewalls
for adaptively secure augmented coin tossing and adaptively secure zero-knowledge
protocols and obtain a constant round adaptively secure MPC protocol in the reverse
firewall setting without setup. Along the way, we propose a new multi-party adaptively
secure coin tossing protocol in the plain model, that is of independent interest."
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: Chaya
full_name: Ganesh, Chaya
last_name: Ganesh
- first_name: Mahak
full_name: Pancholi, Mahak
last_name: Pancholi
- first_name: Pratik
full_name: Sarkar, Pratik
last_name: Sarkar
citation:
ama: 'Chakraborty S, Ganesh C, Pancholi M, Sarkar P. Reverse firewalls for adaptively
secure MPC without setup. In: 27th International Conference on the Theory and
Application of Cryptology and Information Security. Vol 13091. Springer Nature;
2021:335-364. doi:10.1007/978-3-030-92075-3_12'
apa: 'Chakraborty, S., Ganesh, C., Pancholi, M., & Sarkar, P. (2021). Reverse
firewalls for adaptively secure MPC without setup. In 27th International Conference
on the Theory and Application of Cryptology and Information Security (Vol.
13091, pp. 335–364). Virtual, Singapore: Springer Nature. https://doi.org/10.1007/978-3-030-92075-3_12'
chicago: Chakraborty, Suvradip, Chaya Ganesh, Mahak Pancholi, and Pratik Sarkar.
“Reverse Firewalls for Adaptively Secure MPC without Setup.” In 27th International
Conference on the Theory and Application of Cryptology and Information Security,
13091:335–64. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-92075-3_12.
ieee: S. Chakraborty, C. Ganesh, M. Pancholi, and P. Sarkar, “Reverse firewalls
for adaptively secure MPC without setup,” in 27th International Conference
on the Theory and Application of Cryptology and Information Security, Virtual,
Singapore, 2021, vol. 13091, pp. 335–364.
ista: 'Chakraborty S, Ganesh C, Pancholi M, Sarkar P. 2021. Reverse firewalls for
adaptively secure MPC without setup. 27th International Conference on the Theory
and Application of Cryptology and Information Security. ASIACRYPT: International
Conference on Cryptology in Asia, LNCS, vol. 13091, 335–364.'
mla: Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC
without Setup.” 27th International Conference on the Theory and Application
of Cryptology and Information Security, vol. 13091, Springer Nature, 2021,
pp. 335–64, doi:10.1007/978-3-030-92075-3_12.
short: S. Chakraborty, C. Ganesh, M. Pancholi, P. Sarkar, in:, 27th International
Conference on the Theory and Application of Cryptology and Information Security,
Springer Nature, 2021, pp. 335–364.
conference:
end_date: 2021-12-10
location: Virtual, Singapore
name: 'ASIACRYPT: International Conference on Cryptology in Asia'
start_date: 2021-12-06
date_created: 2022-01-09T23:01:27Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2023-08-17T06:34:41Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-030-92075-3_12
ec_funded: 1
external_id:
isi:
- '000927876200012'
intvolume: ' 13091'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1262
month: '12'
oa: 1
oa_version: Preprint
page: 335-364
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 27th International Conference on the Theory and Application of Cryptology
and Information Security
publication_identifier:
eisbn:
- 978-3-030-92075-3
eissn:
- 1611-3349
isbn:
- 978-3-030-92074-6
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reverse firewalls for adaptively secure MPC without setup
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13091
year: '2021'
...
---
_id: '10613'
abstract:
- lang: eng
text: Motivated by the recent preprint [\emph{arXiv:2004.08412}] by Ayala, Carinci,
and Redig, we first provide a general framework for the study of scaling limits
of higher-order fields. Then, by considering the same class of infinite interacting
particle systems as in [\emph{arXiv:2004.08412}], namely symmetric simple exclusion
and inclusion processes in the d-dimensional Euclidean lattice, we prove the hydrodynamic
limit, and convergence for the equilibrium fluctuations, of higher-order fields.
In particular, the limit fields exhibit a tensor structure. Our fluctuation result
differs from that in [\emph{arXiv:2004.08412}], since we considered-dimensional
Euclidean lattice, we prove the hydrodynamic limit, and convergence for the equilibrium
fluctuations, of higher-order fields. In particular, the limit fields exhibit
a tensor structure. Our fluctuation result differs from that in [\emph{arXiv:2004.08412}],
since we consider a different notion of higher-order fluctuation fields.
acknowledgement: "F.S. would like to thank Mario Ayala and Frank Redig for useful
discussions. J.P.C. acknowledges partial financial support from the US National
Science Foundation (DMS-1855604). F.S. was financially supported by the European
Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie
grant agreement No. 754411.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Joe P.
full_name: Chen, Joe P.
last_name: Chen
- first_name: Federico
full_name: Sau, Federico
id: E1836206-9F16-11E9-8814-AEFDE5697425
last_name: Sau
citation:
ama: Chen JP, Sau F. Higher-order hydrodynamics and equilibrium fluctuations of
interacting particle systems. Markov Processes And Related Fields. 2021;27(3):339-380.
apa: Chen, J. P., & Sau, F. (2021). Higher-order hydrodynamics and equilibrium
fluctuations of interacting particle systems. Markov Processes And Related
Fields. Polymat Publishing.
chicago: Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium
Fluctuations of Interacting Particle Systems.” Markov Processes And Related
Fields. Polymat Publishing, 2021.
ieee: J. P. Chen and F. Sau, “Higher-order hydrodynamics and equilibrium fluctuations
of interacting particle systems,” Markov Processes And Related Fields,
vol. 27, no. 3. Polymat Publishing, pp. 339–380, 2021.
ista: Chen JP, Sau F. 2021. Higher-order hydrodynamics and equilibrium fluctuations
of interacting particle systems. Markov Processes And Related Fields. 27(3), 339–380.
mla: Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium
Fluctuations of Interacting Particle Systems.” Markov Processes And Related
Fields, vol. 27, no. 3, Polymat Publishing, 2021, pp. 339–80.
short: J.P. Chen, F. Sau, Markov Processes And Related Fields 27 (2021) 339–380.
date_created: 2022-01-10T14:02:31Z
date_published: 2021-03-16T00:00:00Z
date_updated: 2022-01-10T15:29:08Z
day: '16'
department:
- _id: JaMa
ec_funded: 1
external_id:
arxiv:
- '2008.13403'
intvolume: ' 27'
issue: '3'
keyword:
- interacting particle systems
- higher-order fields
- hydrodynamic limit
- equilibrium fluctuations
- duality
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2008.13403
month: '03'
oa: 1
oa_version: Preprint
page: 339-380
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Markov Processes And Related Fields
publication_identifier:
issn:
- 1024-2953
publication_status: published
publisher: Polymat Publishing
quality_controlled: '1'
related_material:
link:
- description: Link to Abstract on publisher's website
relation: other
url: http://math-mprf.org/journal/articles/id1614/
- description: Referred to in Abstract
relation: used_for_analysis_in
url: https://arxiv.org/abs/2004.08412
status: public
title: Higher-order hydrodynamics and equilibrium fluctuations of interacting particle
systems
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 27
year: '2021'
...
---
_id: '10628'
abstract:
- lang: eng
text: The surface states of 3D topological insulators in general have negligible
quantum oscillations (QOs) when the chemical potential is tuned to the Dirac points.
In contrast, we find that topological Kondo insulators (TKIs) can support surface
states with an arbitrarily large Fermi surface (FS) when the chemical potential
is pinned to the Dirac point. We illustrate that these FSs give rise to finite-frequency
QOs, which can become comparable to the extremal area of the unhybridized bulk
bands. We show that this occurs when the crystal symmetry is lowered from cubic
to tetragonal in a minimal two-orbital model. We label such surface modes as 'shadow
surface states'. Moreover, we show that the sufficient next-nearest neighbor out-of-plane
hybridization leading to shadow surface states can be self-consistently stabilized
for tetragonal TKIs. Consequently, shadow surface states provide an important
example of high-frequency QOs beyond the context of cubic TKIs.
acknowledgement: PG acknowledges support from National Science Foundation Awards No.
DMR-1824265 for this work. AG acknowledges support from the European Union's Horizon
2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement
No. 754411. EMN is supported by ASU startup grant. OE is in part supported by NSF-DMR-1904716.
article_number: '123042'
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: Emilian M.
full_name: Nica, Emilian M.
last_name: Nica
- first_name: Onur
full_name: Erten, Onur
last_name: Erten
- first_name: Pouyan
full_name: Ghaemi, Pouyan
last_name: Ghaemi
citation:
ama: Ghazaryan A, Nica EM, Erten O, Ghaemi P. Shadow surface states in topological
Kondo insulators. New Journal of Physics. 2021;23(12). doi:10.1088/1367-2630/ac4124
apa: Ghazaryan, A., Nica, E. M., Erten, O., & Ghaemi, P. (2021). Shadow surface
states in topological Kondo insulators. New Journal of Physics. IOP Publishing.
https://doi.org/10.1088/1367-2630/ac4124
chicago: Ghazaryan, Areg, Emilian M. Nica, Onur Erten, and Pouyan Ghaemi. “Shadow
Surface States in Topological Kondo Insulators.” New Journal of Physics.
IOP Publishing, 2021. https://doi.org/10.1088/1367-2630/ac4124.
ieee: A. Ghazaryan, E. M. Nica, O. Erten, and P. Ghaemi, “Shadow surface states
in topological Kondo insulators,” New Journal of Physics, vol. 23, no.
12. IOP Publishing, 2021.
ista: Ghazaryan A, Nica EM, Erten O, Ghaemi P. 2021. Shadow surface states in topological
Kondo insulators. New Journal of Physics. 23(12), 123042.
mla: Ghazaryan, Areg, et al. “Shadow Surface States in Topological Kondo Insulators.”
New Journal of Physics, vol. 23, no. 12, 123042, IOP Publishing, 2021,
doi:10.1088/1367-2630/ac4124.
short: A. Ghazaryan, E.M. Nica, O. Erten, P. Ghaemi, New Journal of Physics 23 (2021).
date_created: 2022-01-16T23:01:28Z
date_published: 2021-12-23T00:00:00Z
date_updated: 2023-08-17T06:54:54Z
day: '23'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1088/1367-2630/ac4124
ec_funded: 1
external_id:
arxiv:
- '2012.11625'
isi:
- '000734063700001'
file:
- access_level: open_access
checksum: 0c3cb6816242fa8afd1cc87a5fe77821
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-17T10:01:58Z
date_updated: 2022-01-17T10:01:58Z
file_id: '10632'
file_name: 2021_NewJourPhys_Ghazaryan.pdf
file_size: 2533102
relation: main_file
success: 1
file_date_updated: 2022-01-17T10:01:58Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
issue: '12'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
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
publication: New Journal of Physics
publication_identifier:
issn:
- 1367-2630
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shadow surface states in topological Kondo insulators
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: 23
year: '2021'
...
---
_id: '10629'
abstract:
- lang: eng
text: "Product graphs arise naturally in formal verification and program analysis.
For example, the analysis of two concurrent threads requires the product of two
component control-flow graphs, and for language inclusion of deterministic automata
the product of two automata is constructed. In many cases, the component graphs
have constant treewidth, e.g., when the input contains control-flow graphs of
programs. We consider the algorithmic analysis of products of two constant-treewidth
graphs with respect to three classic specification languages, namely, (a) algebraic
properties, (b) mean-payoff properties, and (c) initial credit for energy properties.\r\nOur
main contributions are as follows. Consider a graph G that is the product of two
constant-treewidth graphs of size n each. First, given an idempotent semiring,
we present an algorithm that computes the semiring transitive closure of G in
time Õ(n⁴). Since the output has size Θ(n⁴), our algorithm is optimal (up to
polylog factors). Second, given a mean-payoff objective, we present an O(n³)-time
algorithm for deciding whether the value of a starting state is non-negative,
improving the previously known O(n⁴) bound. Third, given an initial credit for
energy objective, we present an O(n⁵)-time algorithm for computing the minimum
initial credit for all nodes of G, improving the previously known O(n⁸) bound.
At the heart of our approach lies an algorithm for the efficient construction
of strongly-balanced tree decompositions of constant-treewidth graphs. Given a
constant-treewidth graph G' of n nodes and a positive integer λ, our algorithm
constructs a binary tree decomposition of G' of width O(λ) with the property that
the size of each subtree decreases geometrically with rate (1/2 + 2^{-λ})."
alternative_title:
- LIPIcs
article_number: '42'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on
product graphs of small treewidth. In: 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science. Vol 213. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.42'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative
verification on product graphs of small treewidth. In 41st IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science (Vol.
213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Quantitative Verification on Product Graphs of Small Treewidth.” In 41st IARCS
Annual Conference on Foundations of Software Technology and Theoretical Computer
Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification
on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science, Virtual, 2021, vol.
213.
ista: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification
on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of
Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.'
mla: Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs
of Small Treewidth.” 41st IARCS Annual Conference on Foundations of Software
Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
conference:
end_date: 2021-12-17
location: Virtual
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2021-12-15
date_created: 2022-01-16T23:01:28Z
date_published: 2021-11-29T00:00:00Z
date_updated: 2022-01-17T10:39:40Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.FSTTCS.2021.42
file:
- access_level: open_access
checksum: 71141acdeffa9056f24d6dbef952d254
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-17T10:36:08Z
date_updated: 2022-01-17T10:36:08Z
file_id: '10633'
file_name: 2021_LIPIcs_Chatterjee.pdf
file_size: 891566
relation: main_file
success: 1
file_date_updated: 2022-01-17T10:36:08Z
has_accepted_license: '1'
intvolume: ' 213'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: 41st IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science
publication_identifier:
isbn:
- 978-3-9597-7215-0
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative verification on product graphs of small treewidth
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 213
year: '2021'
...
---
_id: '10630'
abstract:
- lang: eng
text: In the Intersection Non-emptiness problem, we are given a list of finite automata
A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine
whether some string w ∈ Σ^* lies in the intersection of the languages accepted
by the automata in the list. We analyze the complexity of the Intersection Non-emptiness
problem under the promise that all input automata accept a language in some level
of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy.
Automata accepting languages from the lowest levels of these hierarchies arise
naturally in the context of model checking. We identify a dichotomy in the dot-depth
hierarchy by showing that the problem is already NP-complete when all input automata
accept languages of the levels B_0 or B_{1/2} and already PSPACE-hard when all
automata accept a language from the level B_1. Conversely, we identify a tetrachotomy
in the Straubing-Thérien hierarchy. More precisely, we show that the problem is
in AC^0 when restricted to level L_0; complete for L or NL, depending on the input
representation, when restricted to languages in the level L_{1/2}; NP-complete
when the input is given as DFAs accepting a language in L_1 or L_{3/2}; and finally,
PSPACE-complete when the input automata accept languages in level L_2 or higher.
Moreover, we show that the proof technique used to show containment in NP for
DFAs accepting languages in L_1 or L_{3/2} does not generalize to the context
of NFAs. To prove this, we identify a family of languages that provide an exponential
separation between the state complexity of general NFAs and that of partially
ordered NFAs. To the best of our knowledge, this is the first superpolynomial
separation between these two models of computation.
acknowledgement: "We like to thank Lukas Fleischer and Michael Wehar for our discussions.
This work started at the Schloss Dagstuhl Event 20483 Moderne Aspekte der Komplexitätstheorie
in der Automatentheorie https://www.dagstuhl.de/20483.\r\n"
alternative_title:
- LIPIcs
article_number: '34'
article_processing_charge: No
arxiv: 1
author:
- first_name: Emmanuel
full_name: Arrighi, Emmanuel
last_name: Arrighi
- first_name: Henning
full_name: Fernau, Henning
last_name: Fernau
- first_name: Stefan
full_name: Hoffmann, Stefan
last_name: Hoffmann
- first_name: Markus
full_name: Holzer, Markus
last_name: Holzer
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Mateus
full_name: De Oliveira Oliveira, Mateus
last_name: De Oliveira Oliveira
- first_name: Petra
full_name: Wolf, Petra
last_name: Wolf
citation:
ama: 'Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection
non-emptiness for star-free language classes. In: 41st IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science. Vol
213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.34'
apa: 'Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira
Oliveira, M., & Wolf, P. (2021). On the complexity of intersection non-emptiness
for star-free language classes. In 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science (Vol. 213). Virtual:
Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34'
chicago: Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael
R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection
Non-Emptiness for Star-Free Language Classes.” In 41st IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science, Vol.
213. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34.
ieee: E. Arrighi et al., “On the complexity of intersection non-emptiness
for star-free language classes,” in 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science, Virtual, 2021, vol.
213.
ista: 'Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira
M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free
language classes. 41st IARCS Annual Conference on Foundations of Software Technology
and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and
Theoretical Computer Science, LIPIcs, vol. 213, 34.'
mla: Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness
for Star-Free Language Classes.” 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss
Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.
short: E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira
Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software
Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum
für Informatik, 2021.
conference:
end_date: 2021-12-17
location: Virtual
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2021-12-15
date_created: 2022-01-16T23:01:29Z
date_published: 2021-11-29T00:00:00Z
date_updated: 2022-01-17T10:56:19Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.FSTTCS.2021.34
ec_funded: 1
external_id:
arxiv:
- '2110.01279'
file:
- access_level: open_access
checksum: d5a82ba893c3bc5da5914edbb3efb92b
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-17T10:49:03Z
date_updated: 2022-01-17T10:49:03Z
file_id: '10634'
file_name: 2021_LIPIcs_Arrighi.pdf
file_size: 844224
relation: main_file
success: 1
file_date_updated: 2022-01-17T10:49:03Z
has_accepted_license: '1'
intvolume: ' 213'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 41st IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science
publication_identifier:
isbn:
- 978-3-9597-7215-0
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the complexity of intersection non-emptiness for star-free language classes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 213
year: '2021'
...
---
_id: '10631'
abstract:
- lang: eng
text: We combine experimental and theoretical approaches to explore excited rotational
states of molecules embedded in helium nanodroplets using CS2 and I2 as examples.
Laser-induced nonadiabatic molecular alignment is employed to measure spectral
lines for rotational states extending beyond those initially populated at the
0.37 K droplet temperature. We construct a simple quantum-mechanical model, based
on a linear rotor coupled to a single-mode bosonic bath, to determine the rotational
energy structure in its entirety. The calculated and measured spectral lines are
in good agreement. We show that the effect of the surrounding superfluid on molecular
rotation can be rationalized by a single quantity, the angular momentum, transferred
from the molecule to the droplet.
acknowledgement: I.C. acknowledges the support by the European Union’s Horizon 2020
research and innovation programme under the Marie Sklodowska-Curie Grant Agreement
No. 665385. G.B. acknowledges support from the Austrian Science Fund (FWF), under
project No. M2461-N27. M.L. acknowledges support by the Austrian Science Fund (FWF),
under project No. P29902-N27, and by the European Research Council (ERC) Starting
Grant No. 801770 (ANGULON). H.S acknowledges support from the European Research
Council-AdG (Project No. 320459, DropletControl) and from The Villum Foundation
through a Villum Investigator grant no. 25886.
article_number: L061303
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Igor
full_name: Cherepanov, Igor
id: 339C7E5A-F248-11E8-B48F-1D18A9856A87
last_name: Cherepanov
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Constant A.
full_name: Schouder, Constant A.
last_name: Schouder
- first_name: Adam S.
full_name: Chatterley, Adam S.
last_name: Chatterley
- first_name: Simon H.
full_name: Albrechtsen, Simon H.
last_name: Albrechtsen
- first_name: Alberto Viñas
full_name: Muñoz, Alberto Viñas
last_name: Muñoz
- first_name: Lars
full_name: Christiansen, Lars
last_name: Christiansen
- first_name: Henrik
full_name: Stapelfeldt, Henrik
last_name: Stapelfeldt
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Cherepanov I, Bighin G, Schouder CA, et al. Excited rotational states of molecules
in a superfluid. Physical Review A. 2021;104(6). doi:10.1103/PhysRevA.104.L061303
apa: Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Albrechtsen,
S. H., Muñoz, A. V., … Lemeshko, M. (2021). Excited rotational states of molecules
in a superfluid. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.104.L061303
chicago: Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley,
Simon H. Albrechtsen, Alberto Viñas Muñoz, Lars Christiansen, Henrik Stapelfeldt,
and Mikhail Lemeshko. “Excited Rotational States of Molecules in a Superfluid.”
Physical Review A. American Physical Society, 2021. https://doi.org/10.1103/PhysRevA.104.L061303.
ieee: I. Cherepanov et al., “Excited rotational states of molecules in a
superfluid,” Physical Review A, vol. 104, no. 6. American Physical Society,
2021.
ista: Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Albrechtsen SH, Muñoz
AV, Christiansen L, Stapelfeldt H, Lemeshko M. 2021. Excited rotational states
of molecules in a superfluid. Physical Review A. 104(6), L061303.
mla: Cherepanov, Igor, et al. “Excited Rotational States of Molecules in a Superfluid.”
Physical Review A, vol. 104, no. 6, L061303, American Physical Society,
2021, doi:10.1103/PhysRevA.104.L061303.
short: I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, S.H. Albrechtsen,
A.V. Muñoz, L. Christiansen, H. Stapelfeldt, M. Lemeshko, Physical Review A 104
(2021).
date_created: 2022-01-16T23:01:29Z
date_published: 2021-12-30T00:00:00Z
date_updated: 2024-08-07T07:16:52Z
day: '30'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.104.L061303
ec_funded: 1
external_id:
arxiv:
- '2107.00468'
isi:
- '000739618300001'
intvolume: ' 104'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://128.84.4.18/abs/2107.00468
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 26986C82-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02641
name: A path-integral approach to composite impurities
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Excited rotational states of molecules in a superfluid
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 104
year: '2021'
...
---
_id: '10635'
abstract:
- lang: eng
text: The brain efficiently performs nonlinear computations through its intricate
networks of spiking neurons, but how this is done remains elusive. While nonlinear
computations can be implemented successfully in spiking neural networks, this
requires supervised training and the resulting connectivity can be hard to interpret.
In contrast, the required connectivity for any computation in the form of a linear
dynamical system can be directly derived and understood with the spike coding
network (SCN) framework. These networks also have biologically realistic activity
patterns and are highly robust to cell death. Here we extend the SCN framework
to directly implement any polynomial dynamical system, without the need for training.
This results in networks requiring a mix of synapse types (fast, slow, and multiplicative),
which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate
how to directly derive the required connectivity for several nonlinear dynamical
systems. We also show how to carry out higher-order polynomials with coupled networks
that use only pair-wise multiplicative synapses, and provide expected numbers
of connections for each synapse type. Overall, our work demonstrates a novel method
for implementing nonlinear computations in spiking neural networks, while keeping
the attractive features of standard SCNs (robustness, realistic activity patterns,
and interpretable connectivity). Finally, we discuss the biological plausibility
of our approach, and how the high accuracy and robustness of the approach may
be of interest for neuromorphic computing.
acknowledgement: "A preprint version of this article has been peer-reviewed and recommended
by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe
thank Christian Machens and Nuno Calaim for useful discussions on the project. This
report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience
Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during
the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers,
and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration
on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported
by European Union Horizon 2020 (665385).\r\n"
article_number: e68
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Michele
full_name: Nardin, Michele
id: 30BD0376-F248-11E8-B48F-1D18A9856A87
last_name: Nardin
orcid: 0000-0001-8849-6570
- first_name: James W.
full_name: Phillips, James W.
last_name: Phillips
- first_name: William F.
full_name: Podlaski, William F.
last_name: Podlaski
- first_name: Sander W.
full_name: Keemink, Sander W.
last_name: Keemink
citation:
ama: Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking
neural networks through multiplicative synapses. Peer Community Journal.
2021;1. doi:10.24072/pcjournal.69
apa: Nardin, M., Phillips, J. W., Podlaski, W. F., & Keemink, S. W. (2021).
Nonlinear computations in spiking neural networks through multiplicative synapses.
Peer Community Journal. Centre Mersenne ; Peer Community In. https://doi.org/10.24072/pcjournal.69
chicago: Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W.
Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative
Synapses.” Peer Community Journal. Centre Mersenne ; Peer Community In,
2021. https://doi.org/10.24072/pcjournal.69.
ieee: M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations
in spiking neural networks through multiplicative synapses,” Peer Community
Journal, vol. 1. Centre Mersenne ; Peer Community In, 2021.
ista: Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations
in spiking neural networks through multiplicative synapses. Peer Community Journal.
1, e68.
mla: Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks
through Multiplicative Synapses.” Peer Community Journal, vol. 1, e68,
Centre Mersenne ; Peer Community In, 2021, doi:10.24072/pcjournal.69.
short: M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal
1 (2021).
date_created: 2022-01-17T11:12:40Z
date_published: 2021-12-15T00:00:00Z
date_updated: 2022-01-17T13:30:01Z
day: '15'
ddc:
- '519'
department:
- _id: GradSch
- _id: JoCs
doi: 10.24072/pcjournal.69
ec_funded: 1
external_id:
arxiv:
- '2009.03857'
file:
- access_level: open_access
checksum: cd9af6b331918608f2e3d1c7940cbf4f
content_type: application/pdf
creator: mnardin
date_created: 2022-01-17T11:15:26Z
date_updated: 2022-01-17T11:15:26Z
file_id: '10636'
file_name: 10_24072_pcjournal_69.pdf
file_size: 3311494
relation: main_file
success: 1
file_date_updated: 2022-01-17T11:15:26Z
has_accepted_license: '1'
intvolume: ' 1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Peer Community Journal
publication_identifier:
eissn:
- 2804-3871
publication_status: published
publisher: Centre Mersenne ; Peer Community In
quality_controlled: '1'
status: public
title: Nonlinear computations in spiking neural networks through multiplicative synapses
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 1
year: '2021'
...
---
_id: '10644'
abstract:
- lang: eng
text: The purpose of this application note is to demonstrate a working example of
a superconducting qubit measurement in a Bluefors cryostat using the Keysight
quantum control hardware. Our motivation is twofold. First, we provide pre-qualification
data that the Bluefors cryostat, including filtering and wiring, can support long-lived
qubits. Second, we demonstrate that the Keysight system (controlled using Labber)
provides a straightforward solution to perform these characterization measurements.
This document is intended as a brief guide for starting an experimental platform
for testing superconducting qubits. The setup described here is an immediate jumping
off point for a suite of applications including testing quantum logical gates,
quantum optics with microwaves, or even using the qubit itself as a sensitive
probe of local electromagnetic fields. Qubit measurements rely on high performance
of both the physical sample environment and the measurement electronics. An overview
of the cryogenic system is shown in Figure 1, and an overview of the integration
between the electronics and cryostat (including wiring details) is shown in Figure
2.
alternative_title:
- Bluefors Blog
article_processing_charge: No
author:
- first_name: Russell
full_name: Lake, Russell
last_name: Lake
- first_name: Slawomir
full_name: Simbierowicz, Slawomir
last_name: Simbierowicz
- first_name: Philip
full_name: Krantz, Philip
last_name: Krantz
- first_name: Farid
full_name: Hassani, Farid
id: 2AED110C-F248-11E8-B48F-1D18A9856A87
last_name: Hassani
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: 'Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. The Bluefors Dilution
Refrigerator as an Integrated Quantum Measurement System. Helsinki, Finland:
Bluefors Oy; 2021.'
apa: 'Lake, R., Simbierowicz, S., Krantz, P., Hassani, F., & Fink, J. M. (2021).
The Bluefors dilution refrigerator as an integrated quantum measurement system.
Helsinki, Finland: Bluefors Oy.'
chicago: 'Lake, Russell, Slawomir Simbierowicz, Philip Krantz, Farid Hassani, and
Johannes M Fink. The Bluefors Dilution Refrigerator as an Integrated Quantum
Measurement System. Helsinki, Finland: Bluefors Oy, 2021.'
ieee: 'R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, and J. M. Fink, The Bluefors
dilution refrigerator as an integrated quantum measurement system. Helsinki,
Finland: Bluefors Oy, 2021.'
ista: 'Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. 2021. The Bluefors
dilution refrigerator as an integrated quantum measurement system, Helsinki, Finland:
Bluefors Oy, 9p.'
mla: Lake, Russell, et al. The Bluefors Dilution Refrigerator as an Integrated
Quantum Measurement System. Bluefors Oy, 2021.
short: R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, J.M. Fink, The Bluefors
Dilution Refrigerator as an Integrated Quantum Measurement System, Bluefors Oy,
Helsinki, Finland, 2021.
date_created: 2022-01-19T08:29:57Z
date_published: 2021-04-20T00:00:00Z
date_updated: 2022-01-19T09:11:33Z
day: '20'
department:
- _id: JoFi
keyword:
- Application note
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://bluefors.com/blog/integrated-quantum-measurement-system/
month: '04'
oa: 1
oa_version: Published Version
page: '9'
place: Helsinki, Finland
publication_status: published
publisher: Bluefors Oy
quality_controlled: '1'
status: public
title: The Bluefors dilution refrigerator as an integrated quantum measurement system
type: other_academic_publication
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10645'
abstract:
- lang: eng
text: "Superconducting qubits have emerged as a highly versatile and useful platform
for quantum technological applications [1]. Bluefors and Zurich Instruments have
supported the growth of this field from the 2010s onwards by providing well-engineered
and reliable measurement infrastructure [2]– [6]. Having a long and stable qubit
lifetime is a critical system property. Therefore, considerable effort has already
gone into measuring qubit energy-relaxation timescales and their fluctuations,
see Refs. [7]–[10] among others. Accurately extracting the statistics of a quantum
device requires users to perform time consuming measurements. One measurement
challenge is that the detection of the state-dependent\r\nresponse of a superconducting
resonator due to a dispersively-coupled qubit requires an inherently low signal
level. Consequently, measurements must be performed using a microwave probe that
contains only a few microwave photons. Improving the signal-to-noise ratio (SNR)
by using near-quantum limited parametric amplifiers as well as the use of optimized
signal processing enabled by efficient room temperature instrumentation help to
reduce measurement time. An empirical observation for fixed frequency transmons
from recent literature is that as the energy-relaxation time \U0001D447\U0001D4471
increases, so do its natural temporal fluctuations [7], [10]. This necessitates
many repeated measurements to understand the statistics (see for example, Ref.
[10]). In addition, as state-of-the-art qubits increase in lifetime, longer\r\nmeasurement
times are expected to obtain accurate statistics. As described below, the scaling
of the widths of the qubit energy-relaxation distributions also reveal clues about
the origin of the energy-relaxation."
alternative_title:
- Bluefors Blog
article_processing_charge: No
author:
- first_name: Slawomir
full_name: Simbierowicz, Slawomir
last_name: Simbierowicz
- first_name: Chunyan
full_name: Shi, Chunyan
last_name: Shi
- first_name: Michele
full_name: Collodo, Michele
last_name: Collodo
- first_name: Moritz
full_name: Kirste, Moritz
last_name: Kirste
- first_name: Farid
full_name: Hassani, Farid
id: 2AED110C-F248-11E8-B48F-1D18A9856A87
last_name: Hassani
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Jonas
full_name: Bylander, Jonas
last_name: Bylander
- first_name: Daniel
full_name: Perez Lozano, Daniel
last_name: Perez Lozano
- first_name: Russell
full_name: Lake, Russell
last_name: Lake
citation:
ama: 'Simbierowicz S, Shi C, Collodo M, et al. Qubit Energy-Relaxation Statistics
in the Bluefors Quantum Measurement System. Helsinki, Finland: Bluefors Oy;
2021.'
apa: 'Simbierowicz, S., Shi, C., Collodo, M., Kirste, M., Hassani, F., Fink, J.
M., … Lake, R. (2021). Qubit energy-relaxation statistics in the Bluefors quantum
measurement system. Helsinki, Finland: Bluefors Oy.'
chicago: 'Simbierowicz, Slawomir, Chunyan Shi, Michele Collodo, Moritz Kirste, Farid
Hassani, Johannes M Fink, Jonas Bylander, Daniel Perez Lozano, and Russell Lake.
Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System.
Helsinki, Finland: Bluefors Oy, 2021.'
ieee: 'S. Simbierowicz et al., Qubit energy-relaxation statistics in the
Bluefors quantum measurement system. Helsinki, Finland: Bluefors Oy, 2021.'
ista: 'Simbierowicz S, Shi C, Collodo M, Kirste M, Hassani F, Fink JM, Bylander
J, Perez Lozano D, Lake R. 2021. Qubit energy-relaxation statistics in the Bluefors
quantum measurement system, Helsinki, Finland: Bluefors Oy, 8p.'
mla: Simbierowicz, Slawomir, et al. Qubit Energy-Relaxation Statistics in the
Bluefors Quantum Measurement System. Bluefors Oy, 2021.
short: S. Simbierowicz, C. Shi, M. Collodo, M. Kirste, F. Hassani, J.M. Fink, J.
Bylander, D. Perez Lozano, R. Lake, Qubit Energy-Relaxation Statistics in the
Bluefors Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021.
date_created: 2022-01-19T08:41:14Z
date_published: 2021-06-03T00:00:00Z
date_updated: 2022-01-19T09:11:39Z
day: '03'
department:
- _id: JoFi
keyword:
- Application note
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://bluefors.com/blog/application-note-qubit-energy-relaxation-statistics-bluefors-quantum-measurement-system/
month: '06'
oa: 1
oa_version: Published Version
page: '8'
place: Helsinki, Finland
publication_status: published
publisher: Bluefors Oy
quality_controlled: '1'
status: public
title: Qubit energy-relaxation statistics in the Bluefors quantum measurement system
type: other_academic_publication
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10655'
abstract:
- lang: eng
text: "Adeno-associated viruses (AAVs) are widely used to deliver genetic material
in vivo to distinct cell types such as neurons or glial cells, allowing for targeted
manipulation. Transduction of microglia is mostly excluded from this strategy,
likely due to the cells’ heterogeneous state upon environmental changes, which
makes AAV design challenging. Here, we established the retina as a model system
for microglial AAV validation and optimization. First, we show that AAV2/6 transduced
microglia in both synaptic layers, where layer preference corresponds to the intravitreal
or subretinal delivery method. Surprisingly, we observed significantly enhanced
microglial transduction during photoreceptor degeneration. Thus, we modified the
AAV6 capsid to reduce heparin binding by introducing four point mutations (K531E,
R576Q, K493S, and K459S), resulting in increased microglial transduction in the
outer plexiform layer. Finally, to improve microglial-specific transduction, we
validated a Cre-dependent transgene delivery cassette for use in combination with
the Cx3cr1CreERT2 mouse line. Together, our results provide a foundation for future
studies optimizing AAV-mediated microglia transduction and highlight that environmental
conditions influence microglial transduction efficiency.\r\n"
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
- _id: PreCl
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement no. 715571). The research was supported by the Scientific Service
Units (SSU) of IST Austria through resources provided by the Bioimaging Facility,
the Life Science Facility, and the Pre-Clinical Facility, namely Sonja Haslinger
and Michael Schunn for their animal colony management and support. We would also
like to thank Chakrabarty Lab for sharing the plasmids for AAV2/6 production. Finally,
we would like to thank the Siegert team members for discussion about the manuscript.
article_processing_charge: Yes
article_type: original
author:
- first_name: Margaret E
full_name: Maes, Margaret E
id: 3838F452-F248-11E8-B48F-1D18A9856A87
last_name: Maes
orcid: 0000-0001-9642-1085
- first_name: Gabriele M.
full_name: Wögenstein, Gabriele M.
last_name: Wögenstein
- first_name: Gloria
full_name: Colombo, Gloria
id: 3483CF6C-F248-11E8-B48F-1D18A9856A87
last_name: Colombo
orcid: 0000-0001-9434-8902
- first_name: Raquel
full_name: Casado Polanco, Raquel
id: 15240fc1-dbcd-11ea-9d1d-ac5a786425fd
last_name: Casado Polanco
orcid: 0000-0001-8293-4568
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
citation:
ama: Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. Optimizing
AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor
degenerative environment. Molecular Therapy - Methods and Clinical Development.
2021;23:210-224. doi:10.1016/j.omtm.2021.09.006
apa: Maes, M. E., Wögenstein, G. M., Colombo, G., Casado Polanco, R., & Siegert,
S. (2021). Optimizing AAV2/6 microglial targeting identified enhanced efficiency
in the photoreceptor degenerative environment. Molecular Therapy - Methods
and Clinical Development. Elsevier. https://doi.org/10.1016/j.omtm.2021.09.006
chicago: Maes, Margaret E, Gabriele M. Wögenstein, Gloria Colombo, Raquel Casado
Polanco, and Sandra Siegert. “Optimizing AAV2/6 Microglial Targeting Identified
Enhanced Efficiency in the Photoreceptor Degenerative Environment.” Molecular
Therapy - Methods and Clinical Development. Elsevier, 2021. https://doi.org/10.1016/j.omtm.2021.09.006.
ieee: M. E. Maes, G. M. Wögenstein, G. Colombo, R. Casado Polanco, and S. Siegert,
“Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the
photoreceptor degenerative environment,” Molecular Therapy - Methods and Clinical
Development, vol. 23. Elsevier, pp. 210–224, 2021.
ista: Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. 2021. Optimizing
AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor
degenerative environment. Molecular Therapy - Methods and Clinical Development.
23, 210–224.
mla: Maes, Margaret E., et al. “Optimizing AAV2/6 Microglial Targeting Identified
Enhanced Efficiency in the Photoreceptor Degenerative Environment.” Molecular
Therapy - Methods and Clinical Development, vol. 23, Elsevier, 2021, pp. 210–24,
doi:10.1016/j.omtm.2021.09.006.
short: M.E. Maes, G.M. Wögenstein, G. Colombo, R. Casado Polanco, S. Siegert, Molecular
Therapy - Methods and Clinical Development 23 (2021) 210–224.
date_created: 2022-01-23T23:01:28Z
date_published: 2021-12-10T00:00:00Z
date_updated: 2023-11-16T13:12:03Z
day: '10'
ddc:
- '570'
department:
- _id: SaSi
- _id: SiHi
doi: 10.1016/j.omtm.2021.09.006
ec_funded: 1
external_id:
isi:
- '000748748500019'
file:
- access_level: open_access
checksum: 77dc540e8011c5475031bdf6ccef20a6
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-24T07:43:09Z
date_updated: 2022-01-24T07:43:09Z
file_id: '10657'
file_name: 2021_MolTherMethodsClinDev_Maes.pdf
file_size: 4794147
relation: main_file
success: 1
file_date_updated: 2022-01-24T07:43:09Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 210-224
project:
- _id: 25D4A630-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715571'
name: Microglia action towards neuronal circuit formation and function in health
and disease
publication: Molecular Therapy - Methods and Clinical Development
publication_identifier:
eissn:
- 2329-0501
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the
photoreceptor degenerative environment
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2021'
...
---
_id: '10665'
abstract:
- lang: eng
text: "Formal verification of neural networks is an active topic of research, and
recent advances have significantly increased the size of the networks that verification
tools can handle. However, most methods are designed for verification of an idealized
model of the actual network which works over real arithmetic and ignores rounding
imprecisions. This idealization is in stark contrast to network quantization,
which is a technique that trades numerical precision for computational efficiency
and is, therefore, often applied in practice. Neglecting rounding errors of such
low-bit quantized neural networks has been shown to lead to wrong conclusions
about the network’s correctness. Thus, the desired approach for verifying quantized
neural networks would be one that takes these rounding errors\r\ninto account.
In this paper, we show that verifying the bitexact implementation of quantized
neural networks with bitvector specifications is PSPACE-hard, even though verifying
idealized real-valued networks and satisfiability of bit-vector specifications
alone are each in NP. Furthermore, we explore several practical heuristics toward
closing the complexity gap between idealized and bit-exact verification. In particular,
we propose three techniques for making SMT-based verification of quantized neural
networks more scalable. Our experiments demonstrate that our proposed methods
allow a speedup of up to three orders of magnitude over existing approaches."
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt),
and the European Union’s Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n"
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural
networks. In: Proceedings of the AAAI Conference on Artificial Intelligence.
Vol 35. AAAI Press; 2021:3787-3795.'
apa: 'Henzinger, T. A., Lechner, M., & Zikelic, D. (2021). Scalable verification
of quantized neural networks. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.'
chicago: Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification
of Quantized Neural Networks.” In Proceedings of the AAAI Conference on Artificial
Intelligence, 35:3787–95. AAAI Press, 2021.
ieee: T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized
neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.
ista: 'Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized
neural networks. Proceedings of the AAAI Conference on Artificial Intelligence.
AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks,
vol. 35, 3787–3795.'
mla: Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.”
Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35,
no. 5A, AAAI Press, 2021, pp. 3787–95.
short: T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference
on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
date_created: 2022-01-25T15:15:02Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2025-07-14T09:10:11Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
ec_funded: 1
external_id:
arxiv:
- '2012.08185'
file:
- access_level: open_access
checksum: 2bc8155b2526a70fba5b7301bc89dbd1
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:41:16Z
date_updated: 2022-01-26T07:41:16Z
file_id: '10684'
file_name: 16496-Article Text-19990-1-2-20210518 (1).pdf
file_size: 137235
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:41:16Z
has_accepted_license: '1'
intvolume: ' 35'
issue: 5A
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/16496
month: '05'
oa: 1
oa_version: Published Version
page: 3787-3795
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Scalable verification of quantized neural networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10666'
abstract:
- lang: eng
text: Adversarial training is an effective method to train deep learning models
that are resilient to norm-bounded perturbations, with the cost of nominal performance
drop. While adversarial training appears to enhance the robustness and safety
of a deep model deployed in open-world decision-critical applications, counterintuitively,
it induces undesired behaviors in robot learning settings. In this paper, we show
theoretically and experimentally that neural controllers obtained via adversarial
training are subjected to three types of defects, namely transient, systematic,
and conditional errors. We first generalize adversarial training to a safety-domain
optimization scheme allowing for more generic specifications. We then prove that
such a learning process tends to cause certain error profiles. We support our
theoretical results by a thorough experimental safety analysis in a robot-learning
task. Our results suggest that adversarial training is not yet ready for robot
learning.
acknowledgement: M.L. and T.A.H. are supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by
Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).
article_processing_charge: No
arxiv: 1
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is
not ready for robot learning. In: 2021 IEEE International Conference on Robotics
and Automation. ICRA. ; 2021:4140-4147. doi:10.1109/ICRA48506.2021.9561036'
apa: Lechner, M., Hasani, R., Grosu, R., Rus, D., & Henzinger, T. A. (2021).
Adversarial training is not ready for robot learning. In 2021 IEEE International
Conference on Robotics and Automation (pp. 4140–4147). Xi’an, China. https://doi.org/10.1109/ICRA48506.2021.9561036
chicago: Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger.
“Adversarial Training Is Not Ready for Robot Learning.” In 2021 IEEE International
Conference on Robotics and Automation, 4140–47. ICRA, 2021. https://doi.org/10.1109/ICRA48506.2021.9561036.
ieee: M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial
training is not ready for robot learning,” in 2021 IEEE International Conference
on Robotics and Automation, Xi’an, China, 2021, pp. 4140–4147.
ista: 'Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training
is not ready for robot learning. 2021 IEEE International Conference on Robotics
and Automation. ICRA: International Conference on Robotics and AutomationICRA,
4140–4147.'
mla: Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.”
2021 IEEE International Conference on Robotics and Automation, 2021, pp.
4140–47, doi:10.1109/ICRA48506.2021.9561036.
short: M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International
Conference on Robotics and Automation, 2021, pp. 4140–4147.
conference:
end_date: 2021-06-05
location: Xi'an, China
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2021-05-30
date_created: 2022-01-25T15:44:54Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2023-08-17T06:58:38Z
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1109/ICRA48506.2021.9561036
external_id:
arxiv:
- '2103.08187'
isi:
- '000765738803040'
has_accepted_license: '1'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2103.08187
oa: 1
oa_version: None
page: 4140-4147
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 2021 IEEE International Conference on Robotics and Automation
publication_identifier:
eisbn:
- 978-1-7281-9077-8
eissn:
- 2577-087X
isbn:
- 978-1-7281-9078-5
issn:
- 1050-4729
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
series_title: ICRA
status: public
title: Adversarial training is not ready for robot learning
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10667'
abstract:
- lang: eng
text: Bayesian neural networks (BNNs) place distributions over the weights of a
neural network to model uncertainty in the data and the network's prediction.
We consider the problem of verifying safety when running a Bayesian neural network
policy in a feedback loop with infinite time horizon systems. Compared to the
existing sampling-based approaches, which are inapplicable to the infinite time
horizon setting, we train a separate deterministic neural network that serves
as an infinite time horizon safety certificate. In particular, we show that the
certificate network guarantees the safety of the system over a subset of the BNN
weight posterior's support. Our method first computes a safe weight set and then
alters the BNN's weight posterior to reject samples outside this set. Moreover,
we show how to extend our approach to a safe-exploration reinforcement learning
setting, in order to avoid unsafe trajectories during the training of the policy.
We evaluate our approach on a series of reinforcement learning benchmarks, including
non-Lyapunovian safety specifications.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and
the European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie Grant Agreement No. 665385.
alternative_title:
- ' Advances in Neural Information Processing Systems'
article_processing_charge: No
arxiv: 1
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ðorđe
full_name: Žikelić, Ðorđe
last_name: Žikelić
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety
of Bayesian neural networks. In: 35th Conference on Neural Information Processing
Systems. ; 2021. doi:10.48550/arXiv.2111.03165'
apa: Lechner, M., Žikelić, Ð., Chatterjee, K., & Henzinger, T. A. (2021). Infinite
time horizon safety of Bayesian neural networks. In 35th Conference on Neural
Information Processing Systems. Virtual. https://doi.org/10.48550/arXiv.2111.03165
chicago: Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger.
“Infinite Time Horizon Safety of Bayesian Neural Networks.” In 35th Conference
on Neural Information Processing Systems, 2021. https://doi.org/10.48550/arXiv.2111.03165.
ieee: M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time
horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information
Processing Systems, Virtual, 2021.
ista: 'Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon
safety of Bayesian neural networks. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, .'
mla: Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.”
35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165.
short: M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference
on Neural Information Processing Systems, 2021.
conference:
end_date: 2021-12-10
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
date_created: 2022-01-25T15:45:58Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2025-07-14T09:10:12Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
- _id: KrCh
doi: 10.48550/arXiv.2111.03165
ec_funded: 1
external_id:
arxiv:
- '2111.03165'
file:
- access_level: open_access
checksum: 0fc0f852525c10dda9cc9ffea07fb4e4
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:39:59Z
date_updated: 2022-01-26T07:39:59Z
file_id: '10682'
file_name: infinite_time_horizon_safety_o.pdf
file_size: 452492
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:39:59Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 35th Conference on Neural Information Processing Systems
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
status: public
title: Infinite time horizon safety of Bayesian neural networks
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10668'
abstract:
- lang: eng
text: 'Robustness to variations in lighting conditions is a key objective for any
deep vision system. To this end, our paper extends the receptive field of convolutional
neural networks with two residual components, ubiquitous in the visual processing
system of vertebrates: On-center and off-center pathways, with an excitatory center
and inhibitory surround; OOCS for short. The On-center pathway is excited by the
presence of a light stimulus in its center, but not in its surround, whereas the
Off-center pathway is excited by the absence of a light stimulus in its center,
but not in its surround. We design OOCS pathways via a difference of Gaussians,
with their variance computed analytically from the size of the receptive fields.
OOCS pathways complement each other in their response to light stimuli, ensuring
this way a strong edge-detection capability, and as a result an accurate and robust
inference under challenging lighting conditions. We provide extensive empirical
evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness
from the novel edge representation, compared to other baselines.'
acknowledgement: Z.B. is supported by the Doctoral College Resilient Embedded Systems,
which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum
Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad,
and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported
by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF)
under grant Z211-N23 (Wittgenstein Award).
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Zahra
full_name: Babaiee, Zahra
last_name: Babaiee
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive
fields for accurate and robust image classification. In: Proceedings of the
38th International Conference on Machine Learning. Vol 139. ML Research Press;
2021:478-489.'
apa: 'Babaiee, Z., Hasani, R., Lechner, M., Rus, D., & Grosu, R. (2021). On-off
center-surround receptive fields for accurate and robust image classification.
In Proceedings of the 38th International Conference on Machine Learning
(Vol. 139, pp. 478–489). Virtual: ML Research Press.'
chicago: Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu.
“On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.”
In Proceedings of the 38th International Conference on Machine Learning,
139:478–89. ML Research Press, 2021.
ieee: Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround
receptive fields for accurate and robust image classification,” in Proceedings
of the 38th International Conference on Machine Learning, Virtual, 2021, vol.
139, pp. 478–489.
ista: 'Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround
receptive fields for accurate and robust image classification. Proceedings of
the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR,
vol. 139, 478–489.'
mla: Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate
and Robust Image Classification.” Proceedings of the 38th International Conference
on Machine Learning, vol. 139, ML Research Press, 2021, pp. 478–89.
short: Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of
the 38th International Conference on Machine Learning, ML Research Press, 2021,
pp. 478–489.
conference:
end_date: 2021-07-24
location: Virtual
name: 'ML: Machine Learning'
start_date: 2021-07-18
date_created: 2022-01-25T15:46:33Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2022-05-04T15:02:27Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
checksum: d30eae62561bb517d9f978437d7677db
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:38:32Z
date_updated: 2022-01-26T07:38:32Z
file_id: '10681'
file_name: babaiee21a.pdf
file_size: 4246561
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:38:32Z
has_accepted_license: '1'
intvolume: ' 139'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.mlr.press/v139/babaiee21a
month: '07'
oa: 1
oa_version: Published Version
page: 478-489
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 38th International Conference on Machine Learning
publication_identifier:
issn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: On-off center-surround receptive fields for accurate and robust image classification
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2021'
...
---
_id: '10669'
abstract:
- lang: eng
text: "We show that Neural ODEs, an emerging class of timecontinuous neural networks,
can be verified by solving a set of global-optimization problems. For this purpose,
we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based
technique for constructing a tight Reachtube (an over-approximation of the set
of reachable states\r\nover a given time-horizon), and provide stochastic guarantees
in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids
the infamous wrapping effect (accumulation of over-approximation errors) by performing
local optimization steps to expand safe regions instead of repeatedly forward-propagating
them as is done by deterministic reachability methods. To enable fast local optimizations,
we introduce a novel forward-mode adjoint sensitivity method to compute gradients
without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic
convergence rates for SLR."
acknowledgement: "The authors would like to thank the reviewers for their insightful
comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant
No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin
part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).
SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish
Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599,
CCF-1918225, and CPS-1446832.\r\n"
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Sophie
full_name: Grunbacher, Sophie
last_name: Grunbacher
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Jacek
full_name: Cyranka, Jacek
last_name: Cyranka
- first_name: Scott A
full_name: Smolka, Scott A
last_name: Smolka
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification
of neural ODEs with stochastic guarantees. In: Proceedings of the AAAI Conference
on Artificial Intelligence. Vol 35. AAAI Press; 2021:11525-11535.'
apa: 'Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &
Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees.
In Proceedings of the AAAI Conference on Artificial Intelligence (Vol.
35, pp. 11525–11535). Virtual: AAAI Press.'
chicago: Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott
A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic
Guarantees.” In Proceedings of the AAAI Conference on Artificial Intelligence,
35:11525–35. AAAI Press, 2021.
ieee: S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu,
“On the verification of neural ODEs with stochastic guarantees,” in Proceedings
of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35,
no. 13, pp. 11525–11535.
ista: 'Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On
the verification of neural ODEs with stochastic guarantees. Proceedings of the
AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement
of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.'
mla: Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic
Guarantees.” Proceedings of the AAAI Conference on Artificial Intelligence,
vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.
short: S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu,
in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press,
2021, pp. 11525–11535.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
date_created: 2022-01-25T15:47:20Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2022-05-24T06:33:14Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
external_id:
arxiv:
- '2012.08863'
file:
- access_level: open_access
checksum: 468d07041e282a1d46ffdae92f709630
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:38:08Z
date_updated: 2022-01-26T07:38:08Z
file_id: '10680'
file_name: 17372-Article Text-20866-1-2-20210518.pdf
file_size: 286906
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:38:08Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/17372
month: '05'
oa: 1
oa_version: Published Version
page: 11525-11535
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
status: public
title: On the verification of neural ODEs with stochastic guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10670'
abstract:
- lang: eng
text: "Imitation learning enables high-fidelity, vision-based learning of policies
within rich, photorealistic environments. However, such techniques often rely
on traditional discrete-time neural models and face difficulties in generalizing
to domain shifts by failing to account for the causal relationships between the
agent and the environment. In this paper, we propose a theoretical and experimental
framework for learning causal representations using continuous-time neural networks,
specifically over their discrete-time counterparts. We evaluate our method in
the context of visual-control learning of drones over a series of complex tasks,
ranging from short- and long-term navigation, to chasing static and dynamic objects
through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep
models can perform robust navigation tasks, where advanced recurrent models fail.
These models learn complex causal control representations directly from raw visual
inputs and scale to solve a variety of tasks using imitation learning."
acknowledgement: "C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT.
A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship
Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant
Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force
Research Laboratory and the United States Air Force Artificial Intelligence Accelerator
and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views
and conclusions contained in this document are those of the authors\r\nand should
not be interpreted as representing the official policies, either expressed or implied,
of the United States Air Force or the U.S. Government. The U.S. Government is authorized
to reproduce and distribute reprints for Government purposes notwithstanding any
copyright notation herein.\r\n"
alternative_title:
- ' Advances in Neural Information Processing Systems'
article_processing_charge: No
arxiv: 1
author:
- first_name: Charles J
full_name: Vorbach, Charles J
last_name: Vorbach
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
citation:
ama: 'Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time
neural networks. In: 35th Conference on Neural Information Processing Systems.
; 2021.'
apa: Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., & Rus, D. (2021). Causal
navigation by continuous-time neural networks. In 35th Conference on Neural
Information Processing Systems. Virtual.
chicago: Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and
Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In 35th
Conference on Neural Information Processing Systems, 2021.
ieee: C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation
by continuous-time neural networks,” in 35th Conference on Neural Information
Processing Systems, Virtual, 2021.
ista: 'Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation
by continuous-time neural networks. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, .'
mla: Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.”
35th Conference on Neural Information Processing Systems, 2021.
short: C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference
on Neural Information Processing Systems, 2021.
conference:
end_date: 2021-12-10
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
date_created: 2022-01-25T15:47:50Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2022-01-26T14:33:31Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
external_id:
arxiv:
- '2106.08314'
file:
- access_level: open_access
checksum: be81f0ade174a8c9b2d4fe09590b2021
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:37:24Z
date_updated: 2022-01-26T07:37:24Z
file_id: '10679'
file_name: NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf
file_size: 6841228
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:37:24Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 35th Conference on Neural Information Processing Systems
publication_status: published
quality_controlled: '1'
status: public
title: Causal navigation by continuous-time neural networks
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10671'
abstract:
- lang: eng
text: We introduce a new class of time-continuous recurrent neural network models.
Instead of declaring a learning system’s dynamics by implicit nonlinearities,
we construct networks of linear first-order dynamical systems modulated via nonlinear
interlinked gates. The resulting models represent dynamical systems with varying
(i.e., liquid) time-constants coupled to their hidden state, with outputs being
computed by numerical differential equation solvers. These neural networks exhibit
stable and bounded behavior, yield superior expressivity within the family of
neural ordinary differential equations, and give rise to improved performance
on time-series prediction tasks. To demonstrate these properties, we first take
a theoretical approach to find bounds over their dynamics, and compute their expressive
power by the trajectory length measure in a latent trajectory space. We then conduct
a series of time-series prediction experiments to manifest the approximation capability
of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.
acknowledgement: "R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were
partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40).
M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23
(Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF)
Graduate Research Fellowship Program. This research work is partially drawn from
the PhD dissertation of R.H."
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks.
In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol
35. AAAI Press; 2021:7657-7666.'
apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2021). Liquid
time-constant networks. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.'
chicago: Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu
Grosu. “Liquid Time-Constant Networks.” In Proceedings of the AAAI Conference
on Artificial Intelligence, 35:7657–66. AAAI Press, 2021.
ieee: R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant
networks,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.
ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant
networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI:
Association for the Advancement of Artificial Intelligence, Technical Tracks,
vol. 35, 7657–7666.'
mla: Hasani, Ramin, et al. “Liquid Time-Constant Networks.” Proceedings of the
AAAI Conference on Artificial Intelligence, vol. 35, no. 9, AAAI Press, 2021,
pp. 7657–66.
short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the
AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
date_created: 2022-01-25T15:48:36Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2022-05-24T06:36:54Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
external_id:
arxiv:
- '2006.04439'
file:
- access_level: open_access
checksum: 0f06995fba06dbcfa7ed965fc66027ff
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:36:03Z
date_updated: 2022-01-26T07:36:03Z
file_id: '10678'
file_name: 16936-Article Text-20430-1-2-20210518 (1).pdf
file_size: 4302669
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:36:03Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/16936
month: '05'
oa: 1
oa_version: Published Version
page: 7657-7666
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
status: public
title: Liquid time-constant networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10674'
abstract:
- lang: eng
text: 'In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the winner of the game. Such games
are central in formal methods since they model the interaction between a non-terminating
system and its environment. In bidding games the players bid for the right to
move the token: in each round, the players simultaneously submit bids, and the
higher bidder moves the token and pays the other player. Bidding games are known
to have a clean and elegant mathematical structure that relies on the ability
of the players to submit arbitrarily small bids. Many applications, however, require
a fixed granularity for the bids, which can represent, for example, the monetary
value expressed in cents. We study, for the first time, the combination of discrete-bidding
and infinite-duration games. Our most important result proves that these games
form a large determined subclass of concurrent games, where determinacy is the
strong property that there always exists exactly one player who can guarantee
winning the game. In particular, we show that, in contrast to non-discrete bidding
games, the mechanism with which tied bids are resolved plays an important role
in discrete-bidding games. We study several natural tie-breaking mechanisms and
show that, while some do not admit determinacy, most natural mechanisms imply
determinacy for every pair of initial budgets.'
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M
2369-N33 (Meitner fellowship).\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Milad
full_name: Aghajohari, Milad
last_name: Aghajohari
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration
games. Logical Methods in Computer Science. 2021;17(1):10:1-10:23. doi:10.23638/LMCS-17(1:10)2021
apa: Aghajohari, M., Avni, G., & Henzinger, T. A. (2021). Determinacy in discrete-bidding
infinite-duration games. Logical Methods in Computer Science. International
Federation for Computational Logic. https://doi.org/10.23638/LMCS-17(1:10)2021
chicago: Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding
Infinite-Duration Games.” Logical Methods in Computer Science. International
Federation for Computational Logic, 2021. https://doi.org/10.23638/LMCS-17(1:10)2021.
ieee: M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding
infinite-duration games,” Logical Methods in Computer Science, vol. 17,
no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.
ista: Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding
infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.
mla: Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration
Games.” Logical Methods in Computer Science, vol. 17, no. 1, International
Federation for Computational Logic, 2021, p. 10:1-10:23, doi:10.23638/LMCS-17(1:10)2021.
short: M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science
17 (2021) 10:1-10:23.
date_created: 2022-01-25T16:32:13Z
date_published: 2021-02-03T00:00:00Z
date_updated: 2023-08-17T06:56:42Z
day: '03'
ddc:
- '510'
department:
- _id: ToHe
doi: 10.23638/LMCS-17(1:10)2021
external_id:
arxiv:
- '1905.03588'
isi:
- '000658724600010'
file:
- access_level: open_access
checksum: b35586a50ed1ca8f44767de116d18d81
content_type: application/pdf
creator: alisjak
date_created: 2022-01-26T08:04:50Z
date_updated: 2022-01-26T08:04:50Z
file_id: '10690'
file_name: 2021_LMCS_AGHAJOHAR.pdf
file_size: 819878
relation: main_file
success: 1
file_date_updated: 2022-01-26T08:04:50Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '1'
keyword:
- computer science
- computer science and game theory
- logic in computer science
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 10:1-10:23
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Logical Methods in Computer Science
publication_identifier:
eissn:
- 1860-5974
publication_status: published
publisher: International Federation for Computational Logic
quality_controlled: '1'
scopus_import: '1'
status: public
title: Determinacy in discrete-bidding infinite-duration games
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: 17
year: '2021'
...
---
_id: '10688'
abstract:
- lang: eng
text: "Civl is a static verifier for concurrent programs designed around the conceptual
framework of layered refinement,\r\nwhich views the task of verifying a program
as a sequence of program simplification steps each justified by its own invariant.
Civl verifies a layered concurrent program that compactly expresses all the programs
in this sequence and the supporting invariants. This paper presents the design
and implementation of the Civl verifier."
acknowledgement: This research was performed while Bernhard Kragl was at IST Austria,
supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein
Award).
alternative_title:
- Conference Series
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. Proceedings
of the 21st Conference on Formal Methods in Computer-Aided Design. Vol 2.
TU Wien Academic Press; 2021:143–152. doi:10.34727/2021/isbn.978-3-85448-046-4_23'
apa: 'Kragl, B., & Qadeer, S. (2021). The Civl verifier. In P. Ruzica &
M. W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in
Computer-Aided Design (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press.
https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23'
chicago: Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In Proceedings
of the 21st Conference on Formal Methods in Computer-Aided Design, edited
by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021.
https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23.
ieee: B. Kragl and S. Qadeer, “The Civl verifier,” in Proceedings of the 21st
Conference on Formal Methods in Computer-Aided Design, Virtual, 2021, vol.
2, pp. 143–152.
ista: 'Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference
on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided
Design, Conference Series, vol. 2, 143–152.'
mla: Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” Proceedings of the
21st Conference on Formal Methods in Computer-Aided Design, edited by Piskac
Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152,
doi:10.34727/2021/isbn.978-3-85448-046-4_23.
short: B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the
21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press,
2021, pp. 143–152.
conference:
end_date: 2021-10-22
location: Virtual
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2021-10-20
date_created: 2022-01-26T08:01:30Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2022-01-26T08:20:41Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.34727/2021/isbn.978-3-85448-046-4_23
editor:
- first_name: Piskac
full_name: Ruzica, Piskac
last_name: Ruzica
- first_name: Michael W.
full_name: Whalen, Michael W.
last_name: Whalen
file:
- access_level: open_access
checksum: 35438ac9f9750340b7f8ae4ae3220d9f
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-26T08:04:29Z
date_updated: 2022-01-26T08:04:29Z
file_id: '10689'
file_name: 2021_FCAD2021_Kragl.pdf
file_size: 390555
relation: main_file
success: 1
file_date_updated: 2022-01-26T08:04:29Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 143–152
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 21st Conference on Formal Methods in Computer-Aided
Design
publication_identifier:
isbn:
- 978-3-85448-046-4
publication_status: published
publisher: TU Wien Academic Press
quality_controlled: '1'
status: public
title: The Civl verifier
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2021'
...
---
_id: '10694'
abstract:
- lang: eng
text: 'In a two-player zero-sum graph game the players move a token throughout a
graph to produce an infinite path, which determines the winner or payoff of the
game. Traditionally, the players alternate turns in moving the token. In bidding
games, however, the players have budgets, and in each turn, we hold an “auction”
(bidding) to determine which player moves the token: both players simultaneously
submit bids and the higher bidder moves the token. The bidding mechanisms differ
in their payment schemes. Bidding games were largely studied with variants of
first-price bidding in which only the higher bidder pays his bid. We focus on
all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding
games were studied and shown to be technically more challenging than their first-price
counterparts. We study for the first time, infinite-duration all-pay bidding games.
Our most interesting results are for mean-payoff objectives: we portray a complete
picture for games played on strongly-connected graphs. We study both pure (deterministic)
and mixed (probabilistic) strategies and completely characterize the optimal and
almost-sure (with probability 1) payoffs the players can respectively guarantee.
We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical
properties of their first-price counterparts; namely, an equivalence with random-turn
games in which in each turn, the player who moves is selected according to a (biased)
coin toss. The equivalences for all-pay bidding are more intricate and unexpected
than for first-price bidding.'
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and
by the European Union's Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 665385.
article_processing_charge: No
arxiv: 1
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In:
Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial and Applied Mathematics; 2021:617-636. doi:10.1137/1.9781611976465.38'
apa: 'Avni, G., Jecker, I. R., & Zikelic, D. (2021). Infinite-duration all-pay
bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium
on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and
Applied Mathematics. https://doi.org/10.1137/1.9781611976465.38'
chicago: Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay
Bidding Games.” In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms,
edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics,
2021. https://doi.org/10.1137/1.9781611976465.38.
ieee: G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding
games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms,
Virtual, 2021, pp. 617–636.
ista: 'Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium
on Discrete Algorithms, 617–636.'
mla: Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” Proceedings
of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx,
Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.
short: G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the
2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied
Mathematics, 2021, pp. 617–636.
conference:
end_date: 2021-01-13
location: Virtual
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2021-01-10
date_created: 2022-01-27T12:11:23Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2025-07-14T09:10:12Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1137/1.9781611976465.38
ec_funded: 1
editor:
- first_name: Dániel
full_name: Marx, Dániel
last_name: Marx
external_id:
arxiv:
- '2005.06636'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.06636
month: '01'
oa: 1
oa_version: Preprint
page: 617-636
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _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: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- 978-1-61197-646-5
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Infinite-duration all-pay bidding games
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...