---
_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: '10692'
abstract:
- lang: eng
text: We experimentally investigate narrow and topologically nontrivial moiré minibands
hosted by van der Waals heterostructures consisting of a graphene monolayer rotationally
faulted with respect to a Bernal-stacked bilayer. At fillings ν= 1 and 3 electrons
per moiré unit cell within these bands, we observe quantized anomalous Hall effects
with Rxy≈h/2e2, indicative of spontaneous polarization of the system into a single
valley-projected band with Chern number C= 2. Remarkably, we also observe the
evidence of symmetry broken Chern insulator states at ν= 1.5 and 3.5. At ν= 3
we find that the sign of the quantum anomalous Hall effect can be reversed via
field-effect control of the chemical potential. This curious effect arises from
the magnetization contribution due to topological edge states, which drive a reversal
of the total magnetization and thus a switch of the favored magnetic state. Remarkably,
we find that this switch is hysteretic, which we use to demonstrate non-volatile
electric-field-induced reversal of the magnetic state. Voltage control of magnetic
states can be used to electrically pattern nonvolatile magnetic domain structures
hosting chiral edge states, with applications ranging from reconfigurable microwave
circuit elements to ultra-low-power magnetic memory.
alternative_title:
- Bulletin of the American Physical Society
article_number: E42.00010
article_processing_charge: No
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Jihang
full_name: Zhu, Jihang
last_name: Zhu
- first_name: Manish
full_name: Kumar, Manish
last_name: Kumar
- first_name: Yuxuan
full_name: Zhang, Yuxuan
last_name: Zhang
- first_name: Fangyuan
full_name: Yang, Fangyuan
last_name: Yang
- first_name: Charles
full_name: Tschirhart, Charles
last_name: Tschirhart
- first_name: Marec
full_name: Serlin, Marec
last_name: Serlin
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Takashi
full_name: Tanaguchi, Takashi
last_name: Tanaguchi
- first_name: Allan
full_name: MacDonald, Allan
last_name: MacDonald
- first_name: Andrea
full_name: Young, Andrea
last_name: Young
citation:
ama: 'Polshyn H, Zhu J, Kumar M, et al. Orbital Chern insulator states in twisted
monolayer-bilayer graphene and electrical switching of topological and magnetic
order. In: APS March Meeting 2021. Vol 66. American Physical Society; 2021.'
apa: 'Polshyn, H., Zhu, J., Kumar, M., Zhang, Y., Yang, F., Tschirhart, C., … Young,
A. (2021). Orbital Chern insulator states in twisted monolayer-bilayer graphene
and electrical switching of topological and magnetic order. In APS March Meeting
2021 (Vol. 66). Virtual: American Physical Society.'
chicago: Polshyn, Hryhoriy, Jihang Zhu, Manish Kumar, Yuxuan Zhang, Fangyuan Yang,
Charles Tschirhart, Marec Serlin, et al. “Orbital Chern Insulator States in Twisted
Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic
Order.” In APS March Meeting 2021, Vol. 66. American Physical Society,
2021.
ieee: H. Polshyn et al., “Orbital Chern insulator states in twisted monolayer-bilayer
graphene and electrical switching of topological and magnetic order,” in APS
March Meeting 2021, Virtual, 2021, vol. 66, no. 1.
ista: 'Polshyn H, Zhu J, Kumar M, Zhang Y, Yang F, Tschirhart C, Serlin M, Watanabe
K, Tanaguchi T, MacDonald A, Young A. 2021. Orbital Chern insulator states in
twisted monolayer-bilayer graphene and electrical switching of topological and
magnetic order. APS March Meeting 2021. APS: American Physical Society, Bulletin
of the American Physical Society, vol. 66, E42.00010.'
mla: Polshyn, Hryhoriy, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer
Graphene and Electrical Switching of Topological and Magnetic Order.” APS March
Meeting 2021, vol. 66, no. 1, E42.00010, American Physical Society, 2021.
short: H. Polshyn, J. Zhu, M. Kumar, Y. Zhang, F. Yang, C. Tschirhart, M. Serlin,
K. Watanabe, T. Tanaguchi, A. MacDonald, A. Young, in:, APS March Meeting 2021,
American Physical Society, 2021.
conference:
end_date: 2021-03-19
location: Virtual
name: 'APS: American Physical Society'
start_date: 2021-03-15
date_created: 2022-01-27T09:49:48Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2022-01-27T10:46:23Z
day: '01'
extern: '1'
intvolume: ' 66'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR21/Session/E42.10
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2021
publication_identifier:
issn:
- 0003-0503
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical
switching of topological and magnetic order
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 66
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'
...
---
_id: '10711'
abstract:
- lang: eng
text: In this paper, we investigate the distribution of the maximum of partial sums
of families of m -periodic complex-valued functions satisfying certain conditions.
We obtain precise uniform estimates for the distribution function of this maximum
in a near-optimal range. Our results apply to partial sums of Kloosterman sums
and other families of ℓ -adic trace functions, and are as strong as those obtained
by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular,
we improve on the recent work of the third author for Birch sums. However, unlike
character sums, we are able to construct families of m -periodic complex-valued
functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality
is sharp.
acknowledgement: We would like to thank the anonymous referees for carefully reading
the paper and for their remarks and suggestions.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pascal
full_name: Autissier, Pascal
last_name: Autissier
- first_name: Dante
full_name: Bonolis, Dante
id: 6A459894-5FDD-11E9-AF35-BB24E6697425
last_name: Bonolis
- first_name: Youness
full_name: Lamzouri, Youness
last_name: Lamzouri
citation:
ama: Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial
sums of Kloosterman sums and other trace functions. Compositio Mathematica.
2021;157(7):1610-1651. doi:10.1112/s0010437x21007351
apa: Autissier, P., Bonolis, D., & Lamzouri, Y. (2021). The distribution of
the maximum of partial sums of Kloosterman sums and other trace functions. Compositio
Mathematica. Cambridge University Press. https://doi.org/10.1112/s0010437x21007351
chicago: Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution
of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.”
Compositio Mathematica. Cambridge University Press, 2021. https://doi.org/10.1112/s0010437x21007351.
ieee: P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum
of partial sums of Kloosterman sums and other trace functions,” Compositio
Mathematica, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.
ista: Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum
of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica.
157(7), 1610–1651.
mla: Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums
of Kloosterman Sums and Other Trace Functions.” Compositio Mathematica,
vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:10.1112/s0010437x21007351.
short: P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021)
1610–1651.
date_created: 2022-02-01T08:10:43Z
date_published: 2021-06-28T00:00:00Z
date_updated: 2023-08-17T06:59:16Z
day: '28'
department:
- _id: TiBr
doi: 10.1112/s0010437x21007351
external_id:
arxiv:
- '1909.03266'
isi:
- '000667289300001'
intvolume: ' 157'
isi: 1
issue: '7'
keyword:
- Algebra and Number Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.03266
month: '06'
oa: 1
oa_version: Preprint
page: 1610-1651
publication: Compositio Mathematica
publication_identifier:
eissn:
- 1570-5846
issn:
- 0010-437X
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
status: public
title: The distribution of the maximum of partial sums of Kloosterman sums and other
trace functions
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 157
year: '2021'
...
---
_id: '10738'
abstract:
- lang: eng
text: We prove an adiabatic theorem for the Landau–Pekar equations. This allows
us to derive new results on the accuracy of their use as effective equations for
the time evolution generated by the Fröhlich Hamiltonian with large coupling constant
α. In particular, we show that the time evolution of Pekar product states with
coherent phonon field and the electron being trapped by the phonons is well approximated
by the Landau–Pekar equations until times short compared to α2.
acknowledgement: "N. L. and R. S. gratefully acknowledge financial support by the
European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support
from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR
SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for
interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for
stimulating discussions about the time-evolution of a polaron.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. The Landau–Pekar equations:
Adiabatic theorem and accuracy. Analysis and PDE. 2021;14(7):2079-2100.
doi:10.2140/APDE.2021.14.2079'
apa: 'Leopold, N. K., Rademacher, S. A. E., Schlein, B., & Seiringer, R. (2021). The
Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE.
Mathematical Sciences Publishers. https://doi.org/10.2140/APDE.2021.14.2079'
chicago: 'Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and
Robert Seiringer. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.”
Analysis and PDE. Mathematical Sciences Publishers, 2021. https://doi.org/10.2140/APDE.2021.14.2079.'
ieee: 'N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar
equations: Adiabatic theorem and accuracy,” Analysis and PDE, vol. 14,
no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.'
ista: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021. The Landau–Pekar
equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.'
mla: 'Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem
and Accuracy.” Analysis and PDE, vol. 14, no. 7, Mathematical Sciences
Publishers, 2021, pp. 2079–100, doi:10.2140/APDE.2021.14.2079.'
short: N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE
14 (2021) 2079–2100.
date_created: 2022-02-06T23:01:33Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2023-10-17T11:26:45Z
day: '10'
department:
- _id: RoSe
doi: 10.2140/APDE.2021.14.2079
ec_funded: 1
external_id:
arxiv:
- '1904.12532'
isi:
- '000733976600004'
intvolume: ' 14'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.12532
month: '11'
oa: 1
oa_version: Preprint
page: 2079-2100
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Analysis and PDE
publication_identifier:
eissn:
- 1948-206X
issn:
- 2157-5045
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: ' The Landau–Pekar equations: Adiabatic theorem and accuracy'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2021'
...
---
_id: '10762'
abstract:
- lang: eng
text: Methods inspired from machine learning have recently attracted great interest
in the computational study of quantum many-particle systems. So far, however,
it has proven challenging to deal with microscopic models in which the total number
of particles is not conserved. To address this issue, we propose a new variant
of neural network states, which we term neural coherent states. Taking the Fröhlich
impurity model as a case study, we show that neural coherent states can learn
the ground state of non-additive systems very well. In particular, we observe
substantial improvement over the standard coherent state estimates in the most
challenging intermediate coupling regime. Our approach is generic and does not
assume specific details of the system, suggesting wide applications.
acknowledgement: "We acknowledge fruitful discussions with Giacomo Bighin, Giammarco
Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages
of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy
of Sciences and has received funding from the EU Horizon 2020 programme under the
Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support
by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This
work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy
research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences,
FOM and STW."
article_processing_charge: No
arxiv: 1
author:
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Johan H.
full_name: Mentink, Johan H.
last_name: Mentink
citation:
ama: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv. doi:10.48550/arXiv.2105.15193
apa: Rzadkowski, W., Lemeshko, M., & Mentink, J. H. (n.d.). Artificial neural
network states for non-additive systems. arXiv. https://doi.org/10.48550/arXiv.2105.15193
chicago: Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial
Neural Network States for Non-Additive Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2105.15193.
ieee: W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network
states for non-additive systems,” arXiv. .
ista: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv, 10.48550/arXiv.2105.15193.
mla: Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive
Systems.” ArXiv, doi:10.48550/arXiv.2105.15193.
short: W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).
date_created: 2022-02-17T11:18:57Z
date_published: 2021-05-31T00:00:00Z
date_updated: 2023-09-07T13:44:16Z
day: '31'
department:
- _id: MiLe
doi: 10.48550/arXiv.2105.15193
ec_funded: 1
external_id:
arxiv:
- '2105.15193'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2105.15193
month: '05'
oa: 1
oa_version: Preprint
page: '2105.15193'
project:
- _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
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
status: public
title: Artificial neural network states for non-additive systems
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10803'
abstract:
- lang: eng
text: Given the abundance of applications of ranking in recent years, addressing
fairness concerns around automated ranking systems becomes necessary for increasing
the trust among end-users. Previous work on fair ranking has mostly focused on
application-specific fairness notions, often tailored to online advertising, and
it rarely considers learning as part of the process. In this work, we show how
to transfer numerous fairness notions from binary classification to a learning
to rank setting. Our formalism allows us to design methods for incorporating fairness
objectives with provable generalization guarantees. An extensive experimental
evaluation shows that our method can improve ranking fairness substantially with
no or only little loss of model quality.
article_number: '2102.05996'
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0002-4561-241X
citation:
ama: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv. doi:10.48550/arXiv.2102.05996
apa: Konstantinov, N. H., & Lampert, C. (n.d.). Fairness through regularization
for learning to rank. arXiv. https://doi.org/10.48550/arXiv.2102.05996
chicago: Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.05996.
ieee: N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning
to rank,” arXiv. .
ista: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv, 2102.05996.
mla: Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, 2102.05996, doi:10.48550/arXiv.2102.05996.
short: N.H. Konstantinov, C. Lampert, ArXiv (n.d.).
date_created: 2022-02-28T14:13:59Z
date_published: 2021-06-07T00:00:00Z
date_updated: 2023-09-07T13:42:08Z
day: '07'
department:
- _id: ChLa
doi: 10.48550/arXiv.2102.05996
external_id:
arxiv:
- '2102.05996'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.05996
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10799'
relation: dissertation_contains
status: public
status: public
title: Fairness through regularization for learning to rank
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10806'
abstract:
- lang: eng
text: Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal
syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’
chemical reactivity and electronic structure. Surface chemistry is thus crucial
to understand nanocrystal properties and functionality. Here, we investigate the
synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate
precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals
are capped exclusively with a fatty acid instead of oleylamine. Analysis of the
reaction mixtures with nuclear magnetic resonance spectroscopy revealed several
reaction byproducts and intermediates that are common to the decomposition of
Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of
alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive
surface chemistry.
acknowledgement: 'This work was financially supported by IST Austria and the Werner
Siemens Foundation. M.C. has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385. The work was also financially supported by University of Basel, SNSF
NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project
number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia
program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Mariano
full_name: Calcabrini, Mariano
id: 45D7531A-F248-11E8-B48F-1D18A9856A87
last_name: Calcabrini
- first_name: Dietger
full_name: Van den Eynden, Dietger
last_name: Van den Eynden
- first_name: Sergi
full_name: Sanchez Ribot, Sergi
id: ddae5a59-f6e0-11ea-865d-d9dc61e77a2a
last_name: Sanchez Ribot
- first_name: Rohan
full_name: Pokratath, Rohan
last_name: Pokratath
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Jonathan
full_name: De Roo, Jonathan
last_name: De Roo
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: 'Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion
in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate.
JACS Au. 2021;1(11):1898-1903. doi:10.1021/jacsau.1c00349'
apa: 'Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca,
J., De Roo, J., & Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis:
The oxidation of alkylamines to fatty acids by nitrate. JACS Au. American
Chemical Society. https://doi.org/10.1021/jacsau.1c00349'
chicago: 'Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan
Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion
in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.”
JACS Au. American Chemical Society, 2021. https://doi.org/10.1021/jacsau.1c00349.'
ieee: 'M. Calcabrini et al., “Ligand conversion in nanocrystal synthesis:
The oxidation of alkylamines to fatty acids by nitrate,” JACS Au, vol.
1, no. 11. American Chemical Society, pp. 1898–1903, 2021.'
ista: 'Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De
Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation
of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.'
mla: 'Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The
Oxidation of Alkylamines to Fatty Acids by Nitrate.” JACS Au, vol. 1, no.
11, American Chemical Society, 2021, pp. 1898–903, doi:10.1021/jacsau.1c00349.'
short: M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca,
J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.
date_created: 2022-03-02T15:24:16Z
date_published: 2021-11-22T00:00:00Z
date_updated: 2023-05-05T08:45:36Z
day: '22'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1021/jacsau.1c00349
ec_funded: 1
file:
- access_level: open_access
checksum: 1c66a35369e911312a359111420318a9
content_type: application/pdf
creator: cchlebak
date_created: 2022-03-02T15:33:18Z
date_updated: 2022-03-02T15:33:18Z
file_id: '10807'
file_name: 2021_JACSAu_Calcabrini.pdf
file_size: 1257973
relation: main_file
success: 1
file_date_updated: 2022-03-02T15:33:18Z
has_accepted_license: '1'
intvolume: ' 1'
issue: '11'
keyword:
- general medicine
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1898-1903
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
Semiconductors for Waste Heat Recovery'
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: JACS Au
publication_identifier:
eissn:
- 2691-3704
issn:
- 2691-3704
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: https://doi.org/10.26434/chemrxiv-2021-cn2fr
record:
- id: '12885'
relation: dissertation_contains
status: public
status: public
title: 'Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to
fatty acids by nitrate'
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: '10809'
abstract:
- lang: eng
text: Thermoelectric materials are engines that convert heat into an electrical
current. Intuitively, the efficiency of this process depends on how many electrons
(charge carriers) can move and how easily they do so, how much energy those moving
electrons transport, and how easily the temperature gradient is maintained. In
terms of material properties, an excellent thermoelectric material requires a
high electrical conductivity σ, a high Seebeck coefficient S (a measure of the
induced thermoelectric voltage as a function of temperature gradient), and a low
thermal conductivity κ. The challenge is that these three properties are strongly
interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury
et al. (2) have found a way to partially break these ties in silver antimony telluride
(AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering
in this inherently disordered thermoelectric material.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: Liu Y, Ibáñez M. Tidying up the mess. Science. 2021;371(6530):678-679.
doi:10.1126/science.abg0886
apa: Liu, Y., & Ibáñez, M. (2021). Tidying up the mess. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.abg0886
chicago: Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” Science. American
Association for the Advancement of Science, 2021. https://doi.org/10.1126/science.abg0886.
ieee: Y. Liu and M. Ibáñez, “Tidying up the mess,” Science, vol. 371, no.
6530. American Association for the Advancement of Science, pp. 678–679, 2021.
ista: Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.
mla: Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” Science, vol. 371,
no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79,
doi:10.1126/science.abg0886.
short: Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.
date_created: 2022-03-03T09:51:48Z
date_published: 2021-02-12T00:00:00Z
date_updated: 2023-08-17T07:00:35Z
day: '12'
department:
- _id: MaIb
doi: 10.1126/science.abg0886
external_id:
isi:
- '000617551600027'
pmid:
- '33574201'
intvolume: ' 371'
isi: 1
issue: '6530'
keyword:
- multidisciplinary
language:
- iso: eng
month: '02'
oa_version: None
page: 678-679
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tidying up the mess
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 371
year: '2021'
...
---
_id: '10816'
abstract:
- lang: eng
text: Pattern separation is a fundamental brain computation that converts small
differences in input patterns into large differences in output patterns. Several
synaptic mechanisms of pattern separation have been proposed, including code expansion,
inhibition and plasticity; however, which of these mechanisms play a role in the
entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation
circuit, remains unclear. Here we show that a biologically realistic, full-scale
EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive
inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator.
Both external gamma-modulated inhibition and internal lateral inhibition mediated
by PV+-INs substantially contributed to pattern separation. Both local connectivity
and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness.
Similarly, mossy fiber synapses with conditional detonator properties contributed
to pattern separation. By contrast, perforant path synapses with Hebbian synaptic
plasticity and direct EC–CA3 connection shifted the network towards pattern completion.
Our results demonstrate that the specific properties of cells and synapses optimize
higher-order computations in biological networks and might be useful to improve
the deep learning capabilities of technical networks.
acknowledged_ssus:
- _id: SSU
acknowledgement: We thank A. Aertsen, N. Kopell, W. Maass, A. Roth, F. Stella and
T. Vogels for critically reading earlier versions of the manuscript. We are grateful
to F. Marr and C. Altmutter for excellent technical assistance, E. Kralli-Beller
for manuscript editing, and the Scientific Service Units of IST Austria for efficient
support. Finally, we thank T. Carnevale, L. Erdös, M. Hines, D. Nykamp and D. Schröder
for useful discussions, and R. Friedrich and S. Wiechert for sharing unpublished
data. This project received funding from the European Research Council (ERC) under
the European Union’s Horizon 2020 research and innovation programme (grant agreement
no. 692692, P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z
312-B27, Wittgenstein award to P.J. and P 31815 to S.J.G.).
article_processing_charge: No
article_type: original
author:
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
orcid: 0000-0003-2209-5242
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: 'Claudia '
full_name: 'Espinoza Martinez, Claudia '
id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87
last_name: Espinoza Martinez
orcid: 0000-0003-4710-2082
- first_name: Xiaomin
full_name: Zhang, Xiaomin
id: 423EC9C2-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
- first_name: Benjamin
full_name: Suter, Benjamin
id: 4952F31E-F248-11E8-B48F-1D18A9856A87
last_name: Suter
orcid: 0000-0002-9885-6936
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity
rules and synaptic properties shape the efficacy of pattern separation in the
entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science.
2021;1(12):830-842. doi:10.1038/s43588-021-00157-1
apa: Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., &
Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the
efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network.
Nature Computational Science. Springer Nature. https://doi.org/10.1038/s43588-021-00157-1
chicago: Guzmán, José, Alois Schlögl, Claudia Espinoza Martinez, Xiaomin Zhang,
Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties
Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3
Network.” Nature Computational Science. Springer Nature, 2021. https://doi.org/10.1038/s43588-021-00157-1.
ieee: J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M.
Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern
separation in the entorhinal cortex–dentate gyrus–CA3 network,” Nature Computational
Science, vol. 1, no. 12. Springer Nature, pp. 830–842, 2021.
ista: Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021.
How connectivity rules and synaptic properties shape the efficacy of pattern separation
in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science.
1(12), 830–842.
mla: Guzmán, José, et al. “How Connectivity Rules and Synaptic Properties Shape
the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3
Network.” Nature Computational Science, vol. 1, no. 12, Springer Nature,
2021, pp. 830–42, doi:10.1038/s43588-021-00157-1.
short: J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas,
Nature Computational Science 1 (2021) 830–842.
date_created: 2022-03-04T08:32:36Z
date_published: 2021-12-16T00:00:00Z
date_updated: 2023-08-10T22:30:10Z
day: '16'
ddc:
- '610'
department:
- _id: PeJo
doi: 10.1038/s43588-021-00157-1
ec_funded: 1
file:
- access_level: open_access
checksum: 9fec5b667909ef52be96d502e4f8c2ae
content_type: application/pdf
creator: patrickd
date_created: 2022-06-02T12:51:07Z
date_updated: 2022-06-18T22:30:03Z
embargo: 2022-06-17
file_id: '11430'
file_name: Guzmanetal2021.pdf
file_size: 1699466
relation: main_file
- access_level: open_access
checksum: 52a005b13a114e3c3a28fa6bbe8b1a8d
content_type: application/pdf
creator: patrickd
date_created: 2022-06-02T12:53:47Z
date_updated: 2022-06-18T22:30:03Z
embargo: 2022-06-17
file_id: '11431'
file_name: Guzmanetal2021Suppl.pdf
file_size: 3005651
relation: supplementary_material
title: Supplementary Material
file_date_updated: 2022-06-18T22:30:03Z
has_accepted_license: '1'
intvolume: ' 1'
issue: '12'
keyword:
- general medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/647800
month: '12'
oa: 1
oa_version: Submitted Version
page: 830-842
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glumatergic synapse
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: The Wittgenstein Prize
publication: Nature Computational Science
publication_identifier:
issn:
- 2662-8457
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: press_release
url: https://ista.ac.at/en/news/spot-the-difference/
record:
- id: '10110'
relation: software
status: public
scopus_import: '1'
status: public
title: How connectivity rules and synaptic properties shape the efficacy of pattern
separation in the entorhinal cortex–dentate gyrus–CA3 network
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2021'
...
---
_id: '9408'
abstract:
- lang: eng
text: We present a computational design system that assists users to model, optimize,
and fabricate quad-robots with soft skins. Our system addresses the challenging
task of predicting their physical behavior by fully integrating the multibody
dynamics of the mechanical skeleton and the elastic behavior of the soft skin.
The developed motion control strategy uses an alternating optimization scheme
to avoid expensive full space time-optimization, interleaving space-time optimization
for the skeleton, and frame-by-frame optimization for the full dynamics. The output
are motor torques to drive the robot to achieve a user prescribed motion trajectory.
We also provide a collection of convenient engineering tools and empirical manufacturing
guidance to support the fabrication of the designed quad-robot. We validate the
feasibility of designs generated with our system through physics simulations and
with a physically-fabricated prototype.
acknowledgement: The authors would like to thank anonymous reviewers for their constructive
comments. Weiwei Xu is partially supported by Zhejiang Lab. Yin Yang is partially
spported by NSF under Grant Nos. CHS 1845024 and 1717972. Weiwei Xu and Hujun Bao
are supported by Fundamental Research Funds for the Central Universities. This project
has received funding from the European Research Council (ERC) under the European
Unions Horizon 2020 research and innovation programme (Grant agreement No 715767).
article_number: 2881-2895
article_processing_charge: No
author:
- first_name: Xudong
full_name: Feng, Xudong
last_name: Feng
- first_name: Jiafeng
full_name: Liu, Jiafeng
last_name: Liu
- first_name: Huamin
full_name: Wang, Huamin
last_name: Wang
- first_name: Yin
full_name: Yang, Yin
last_name: Yang
- first_name: Hujun
full_name: Bao, Hujun
last_name: Bao
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Weiwei
full_name: Xu, Weiwei
last_name: Xu
citation:
ama: Feng X, Liu J, Wang H, et al. Computational design of skinned Quad-Robots.
IEEE Transactions on Visualization and Computer Graphics. 2021;27(6). doi:10.1109/TVCG.2019.2957218
apa: Feng, X., Liu, J., Wang, H., Yang, Y., Bao, H., Bickel, B., & Xu, W. (2021).
Computational design of skinned Quad-Robots. IEEE Transactions on Visualization
and Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2019.2957218
chicago: Feng, Xudong, Jiafeng Liu, Huamin Wang, Yin Yang, Hujun Bao, Bernd Bickel,
and Weiwei Xu. “Computational Design of Skinned Quad-Robots.” IEEE Transactions
on Visualization and Computer Graphics. IEEE, 2021. https://doi.org/10.1109/TVCG.2019.2957218.
ieee: X. Feng et al., “Computational design of skinned Quad-Robots,” IEEE
Transactions on Visualization and Computer Graphics, vol. 27, no. 6. IEEE,
2021.
ista: Feng X, Liu J, Wang H, Yang Y, Bao H, Bickel B, Xu W. 2021. Computational
design of skinned Quad-Robots. IEEE Transactions on Visualization and Computer
Graphics. 27(6), 2881–2895.
mla: Feng, Xudong, et al. “Computational Design of Skinned Quad-Robots.” IEEE
Transactions on Visualization and Computer Graphics, vol. 27, no. 6, 2881–2895,
IEEE, 2021, doi:10.1109/TVCG.2019.2957218.
short: X. Feng, J. Liu, H. Wang, Y. Yang, H. Bao, B. Bickel, W. Xu, IEEE Transactions
on Visualization and Computer Graphics 27 (2021).
date_created: 2021-05-23T22:01:42Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2023-08-08T13:45:46Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1109/TVCG.2019.2957218
ec_funded: 1
external_id:
isi:
- '000649620700009'
pmid:
- '31804937'
file:
- access_level: open_access
checksum: a78e6ac94e33ade4ffaea66943d5f7dc
content_type: application/pdf
creator: kschuh
date_created: 2021-05-25T15:08:49Z
date_updated: 2021-05-25T15:08:49Z
file_id: '9427'
file_name: 2021_TVCG_Feng.pdf
file_size: 6183002
relation: main_file
success: 1
file_date_updated: 2021-05-25T15:08:49Z
has_accepted_license: '1'
intvolume: ' 27'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: IEEE Transactions on Visualization and Computer Graphics
publication_identifier:
eissn:
- '10772626'
issn:
- '19410506'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computational design of skinned Quad-Robots
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: 27
year: '2021'
...
---
_id: '9410'
abstract:
- lang: eng
text: Antibiotic concentrations vary dramatically in the body and the environment.
Hence, understanding the dynamics of resistance evolution along antibiotic concentration
gradients is critical for predicting and slowing the emergence and spread of resistance.
While it has been shown that increasing the concentration of an antibiotic slows
resistance evolution, how adaptation to one antibiotic concentration correlates
with fitness at other points along the gradient has not received much attention.
Here, we selected populations of Escherichia coli at several points along a concentration
gradient for three different antibiotics, asking how rapidly resistance evolved
and whether populations became specialized to the antibiotic concentration they
were selected on. Populations selected at higher concentrations evolved resistance
more slowly but exhibited equal or higher fitness across the whole gradient. Populations
selected at lower concentrations evolved resistance rapidly, but overall fitness
in the presence of antibiotics was lower. However, these populations readily adapted
to higher concentrations upon subsequent selection. Our results indicate that
resistance management strategies must account not only for the rates of resistance
evolution but also for the fitness of evolved strains.
acknowledgement: We would like to thank Martin Ackermann, Camilo Barbosa, Nick Barton,
Jonathan Bollback, Sebastian Bonhoeffer, Nick Colegrave, Calin Guet, Alex Hall,
Sally Otto, Tiago Paixao, Srdjan Sarikas, Hinrich Schulenburg, Marjon de Vos and
Michael Whitlock for insightful support.
article_number: '20200913'
article_processing_charge: No
author:
- first_name: Mato
full_name: Lagator, Mato
id: 345D25EC-F248-11E8-B48F-1D18A9856A87
last_name: Lagator
- first_name: Hildegard
full_name: Uecker, Hildegard
id: 2DB8F68A-F248-11E8-B48F-1D18A9856A87
last_name: Uecker
orcid: 0000-0001-9435-2813
- first_name: Paul
full_name: Neve, Paul
last_name: Neve
citation:
ama: Lagator M, Uecker H, Neve P. Adaptation at different points along antibiotic
concentration gradients. Biology letters. 2021;17(5). doi:10.1098/rsbl.2020.0913
apa: Lagator, M., Uecker, H., & Neve, P. (2021). Adaptation at different points
along antibiotic concentration gradients. Biology Letters. Royal Society
of London. https://doi.org/10.1098/rsbl.2020.0913
chicago: Lagator, Mato, Hildegard Uecker, and Paul Neve. “Adaptation at Different
Points along Antibiotic Concentration Gradients.” Biology Letters. Royal
Society of London, 2021. https://doi.org/10.1098/rsbl.2020.0913.
ieee: M. Lagator, H. Uecker, and P. Neve, “Adaptation at different points along
antibiotic concentration gradients,” Biology letters, vol. 17, no. 5. Royal
Society of London, 2021.
ista: Lagator M, Uecker H, Neve P. 2021. Adaptation at different points along antibiotic
concentration gradients. Biology letters. 17(5), 20200913.
mla: Lagator, Mato, et al. “Adaptation at Different Points along Antibiotic Concentration
Gradients.” Biology Letters, vol. 17, no. 5, 20200913, Royal Society of
London, 2021, doi:10.1098/rsbl.2020.0913.
short: M. Lagator, H. Uecker, P. Neve, Biology Letters 17 (2021).
date_created: 2021-05-23T22:01:43Z
date_published: 2021-05-12T00:00:00Z
date_updated: 2025-05-28T11:42:50Z
day: '12'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1098/rsbl.2020.0913
ec_funded: 1
external_id:
isi:
- '000651501400001'
pmid:
- ' 33975485'
file:
- access_level: open_access
checksum: 9c13c1f5af7609c97c741f11d293188a
content_type: application/pdf
creator: kschuh
date_created: 2021-05-25T14:09:03Z
date_updated: 2021-05-25T14:09:03Z
file_id: '9425'
file_name: 2021_BiologyLetters_Lagator.pdf
file_size: 726759
relation: main_file
success: 1
file_date_updated: 2021-05-25T14:09:03Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Biology letters
publication_identifier:
eissn:
- 1744957X
publication_status: published
publisher: Royal Society of London
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adaptation at different points along antibiotic concentration gradients
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: '9411'
abstract:
- lang: eng
text: The dynamics of a triangular magnetocapillary swimmer is studied using the
lattice Boltzmann method. We extend on our previous work, which deals with the
self-assembly and a specific type of the swimmer motion characterized by the swimmer’s
maximum velocity centred around the particle’s inverse viscous time. Here, we
identify additional regimes of motion. First, modifying the ratio of surface tension
and magnetic forces allows to study the swimmer propagation in the regime of significantly
lower frequencies mainly defined by the strength of the magnetocapillary potential.
Second, introducing a constant magnetic contribution in each of the particles
in addition to their magnetic moment induced by external fields leads to another
regime characterized by strong in-plane swimmer reorientations that resemble experimental
observations.
acknowledgement: This work was financially supported by the DFG Priority Programme
SPP 1726 “Microswimmers–From Single Particle Motion to Collective Behaviour” (HA
4382/5-1). We further acknowledge the Jülich Supercomputing Centre (JSC) and the
High Performance Computing Centre Stuttgart (HLRS) for the allocation of computing
time.
article_number: '59'
article_processing_charge: No
author:
- first_name: Alexander
full_name: Sukhov, Alexander
last_name: Sukhov
- first_name: Maxime
full_name: Hubert, Maxime
last_name: Hubert
- first_name: Galien M
full_name: Grosjean, Galien M
id: 0C5FDA4A-9CF6-11E9-8939-FF05E6697425
last_name: Grosjean
orcid: 0000-0001-5154-417X
- first_name: Oleg
full_name: Trosman, Oleg
last_name: Trosman
- first_name: Sebastian
full_name: Ziegler, Sebastian
last_name: Ziegler
- first_name: Ylona
full_name: Collard, Ylona
last_name: Collard
- first_name: Nicolas
full_name: Vandewalle, Nicolas
last_name: Vandewalle
- first_name: Ana Sunčana
full_name: Smith, Ana Sunčana
last_name: Smith
- first_name: Jens
full_name: Harting, Jens
last_name: Harting
citation:
ama: Sukhov A, Hubert M, Grosjean GM, et al. Regimes of motion of magnetocapillary
swimmers. European Physical Journal E. 2021;44(4). doi:10.1140/epje/s10189-021-00065-2
apa: Sukhov, A., Hubert, M., Grosjean, G. M., Trosman, O., Ziegler, S., Collard,
Y., … Harting, J. (2021). Regimes of motion of magnetocapillary swimmers. European
Physical Journal E. Springer. https://doi.org/10.1140/epje/s10189-021-00065-2
chicago: Sukhov, Alexander, Maxime Hubert, Galien M Grosjean, Oleg Trosman, Sebastian
Ziegler, Ylona Collard, Nicolas Vandewalle, Ana Sunčana Smith, and Jens Harting.
“Regimes of Motion of Magnetocapillary Swimmers.” European Physical Journal
E. Springer, 2021. https://doi.org/10.1140/epje/s10189-021-00065-2.
ieee: A. Sukhov et al., “Regimes of motion of magnetocapillary swimmers,”
European Physical Journal E, vol. 44, no. 4. Springer, 2021.
ista: Sukhov A, Hubert M, Grosjean GM, Trosman O, Ziegler S, Collard Y, Vandewalle
N, Smith AS, Harting J. 2021. Regimes of motion of magnetocapillary swimmers.
European Physical Journal E. 44(4), 59.
mla: Sukhov, Alexander, et al. “Regimes of Motion of Magnetocapillary Swimmers.”
European Physical Journal E, vol. 44, no. 4, 59, Springer, 2021, doi:10.1140/epje/s10189-021-00065-2.
short: A. Sukhov, M. Hubert, G.M. Grosjean, O. Trosman, S. Ziegler, Y. Collard,
N. Vandewalle, A.S. Smith, J. Harting, European Physical Journal E 44 (2021).
date_created: 2021-05-23T22:01:44Z
date_published: 2021-04-24T00:00:00Z
date_updated: 2023-08-08T13:36:28Z
day: '24'
ddc:
- '530'
department:
- _id: ScWa
doi: 10.1140/epje/s10189-021-00065-2
external_id:
isi:
- '000643251300001'
file:
- access_level: open_access
checksum: 0ef342d011afbe3c5cb058fda9a3f395
content_type: application/pdf
creator: kschuh
date_created: 2021-05-25T11:32:14Z
date_updated: 2021-05-25T11:32:14Z
file_id: '9422'
file_name: 2021_EPJE_Sukhov.pdf
file_size: 2507870
relation: main_file
success: 1
file_date_updated: 2021-05-25T11:32:14Z
has_accepted_license: '1'
intvolume: ' 44'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: European Physical Journal E
publication_identifier:
eissn:
- 1292895X
issn:
- '12928941'
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Regimes of motion of magnetocapillary swimmers
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: 44
year: '2021'
...
---
_id: '9412'
abstract:
- lang: eng
text: We extend our recent result [22] on the central limit theorem for the linear
eigenvalue statistics of non-Hermitian matrices X with independent, identically
distributed complex entries to the real symmetry class. We find that the expectation
and variance substantially differ from their complex counterparts, reflecting
(i) the special spectral symmetry of real matrices onto the real axis; and (ii)
the fact that real i.i.d. matrices have many real eigenvalues. Our result generalizes
the previously known special cases where either the test function is analytic
[49] or the first four moments of the matrix elements match the real Gaussian
[59, 44]. The key element of the proof is the analysis of several weakly dependent
Dyson Brownian motions (DBMs). The conceptual novelty of the real case compared
with [22] is that the correlation structure of the stochastic differentials in
each individual DBM is non-trivial, potentially even jeopardising its well-posedness.
article_number: '24'
article_processing_charge: No
arxiv: 1
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Cipolloni G, Erdös L, Schröder DJ. Fluctuation around the circular law for
random matrices with real entries. Electronic Journal of Probability. 2021;26.
doi:10.1214/21-EJP591
apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2021). Fluctuation around
the circular law for random matrices with real entries. Electronic Journal
of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/21-EJP591
chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Fluctuation
around the Circular Law for Random Matrices with Real Entries.” Electronic
Journal of Probability. Institute of Mathematical Statistics, 2021. https://doi.org/10.1214/21-EJP591.
ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Fluctuation around the circular
law for random matrices with real entries,” Electronic Journal of Probability,
vol. 26. Institute of Mathematical Statistics, 2021.
ista: Cipolloni G, Erdös L, Schröder DJ. 2021. Fluctuation around the circular law
for random matrices with real entries. Electronic Journal of Probability. 26,
24.
mla: Cipolloni, Giorgio, et al. “Fluctuation around the Circular Law for Random
Matrices with Real Entries.” Electronic Journal of Probability, vol. 26,
24, Institute of Mathematical Statistics, 2021, doi:10.1214/21-EJP591.
short: G. Cipolloni, L. Erdös, D.J. Schröder, Electronic Journal of Probability
26 (2021).
date_created: 2021-05-23T22:01:44Z
date_published: 2021-03-23T00:00:00Z
date_updated: 2023-08-08T13:39:19Z
day: '23'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1214/21-EJP591
ec_funded: 1
external_id:
arxiv:
- '2002.02438'
isi:
- '000641855600001'
file:
- access_level: open_access
checksum: 864ab003ad4cffea783f65aa8c2ba69f
content_type: application/pdf
creator: kschuh
date_created: 2021-05-25T13:24:19Z
date_updated: 2021-05-25T13:24:19Z
file_id: '9423'
file_name: 2021_EJP_Cipolloni.pdf
file_size: 865148
relation: main_file
success: 1
file_date_updated: 2021-05-25T13:24:19Z
has_accepted_license: '1'
intvolume: ' 26'
isi: 1
language:
- iso: eng
month: '03'
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: Electronic Journal of Probability
publication_identifier:
eissn:
- '10836489'
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fluctuation around the circular law for random matrices with real entries
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: 26
year: '2021'
...
---
_id: '9414'
abstract:
- lang: eng
text: Microtubule plus-end depolymerization rate is a potentially important target
of physiological regulation, but it has been challenging to measure, so its role
in spatial organization is poorly understood. Here we apply a method for tracking
plus ends based on time difference imaging to measure depolymerization rates in
large interphase asters growing in Xenopus egg extract. We observed strong spatial
regulation of depolymerization rates, which were higher in the aster interior
compared with the periphery, and much less regulation of polymerization or catastrophe
rates. We interpret these data in terms of a limiting component model, where aster
growth results in lower levels of soluble tubulin and microtubule-associated proteins
(MAPs) in the interior cytosol compared with that at the periphery. The steady-state
polymer fraction of tubulin was ∼30%, so tubulin is not strongly depleted in the
aster interior. We propose that the limiting component for microtubule assembly
is a MAP that inhibits depolymerization, and that egg asters are tuned to low
microtubule density.
acknowledgement: The authors thank the members of Mitchison, Brugués, and Jay Gatlin
groups (University of Wyoming) for discussions. We thank Heino Andreas (MPI-CBG)
for frog maintenance. We thank Nikon for microscopy support at Marine Biological
Laboratory (MBL). K.I. was supported by fellowships from the Honjo International
Scholarship Foundation and Center of Systems Biology Dresden. F.D. was supported
by the DIGGS-BB fellowship provided by the German Research Foundation (DFG). P.C.
is supported by a Boehringer Ingelheim Fonds PhD fellowship. J.F.P. was supported
by a fellowship from the Fannie and John Hertz Foundation. M.L.’s research is supported
by European Research Council (ERC) Grant no. ERC-2015-StG-679239. J.B.’s research
is supported by the Human Frontiers Science Program (CDA00074/2014). T.J.M.’s research
is supported by National Institutes of Health Grant no. R35GM131753.
article_processing_charge: No
article_type: original
author:
- first_name: Keisuke
full_name: Ishihara, Keisuke
last_name: Ishihara
- first_name: Franziska
full_name: Decker, Franziska
last_name: Decker
- first_name: Paulo R
full_name: Dos Santos Caldas, Paulo R
id: 38FCDB4C-F248-11E8-B48F-1D18A9856A87
last_name: Dos Santos Caldas
orcid: 0000-0001-6730-4461
- first_name: James F.
full_name: Pelletier, James F.
last_name: Pelletier
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Jan
full_name: Brugués, Jan
last_name: Brugués
- first_name: Timothy J.
full_name: Mitchison, Timothy J.
last_name: Mitchison
citation:
ama: Ishihara K, Decker F, Dos Santos Caldas PR, et al. Spatial variation of microtubule
depolymerization in large asters. Molecular Biology of the Cell. 2021;32(9):869-879.
doi:10.1091/MBC.E20-11-0723
apa: Ishihara, K., Decker, F., Dos Santos Caldas, P. R., Pelletier, J. F., Loose,
M., Brugués, J., & Mitchison, T. J. (2021). Spatial variation of microtubule
depolymerization in large asters. Molecular Biology of the Cell. American
Society for Cell Biology. https://doi.org/10.1091/MBC.E20-11-0723
chicago: Ishihara, Keisuke, Franziska Decker, Paulo R Dos Santos Caldas, James F.
Pelletier, Martin Loose, Jan Brugués, and Timothy J. Mitchison. “Spatial Variation
of Microtubule Depolymerization in Large Asters.” Molecular Biology of the
Cell. American Society for Cell Biology, 2021. https://doi.org/10.1091/MBC.E20-11-0723.
ieee: K. Ishihara et al., “Spatial variation of microtubule depolymerization
in large asters,” Molecular Biology of the Cell, vol. 32, no. 9. American
Society for Cell Biology, pp. 869–879, 2021.
ista: Ishihara K, Decker F, Dos Santos Caldas PR, Pelletier JF, Loose M, Brugués
J, Mitchison TJ. 2021. Spatial variation of microtubule depolymerization in large
asters. Molecular Biology of the Cell. 32(9), 869–879.
mla: Ishihara, Keisuke, et al. “Spatial Variation of Microtubule Depolymerization
in Large Asters.” Molecular Biology of the Cell, vol. 32, no. 9, American
Society for Cell Biology, 2021, pp. 869–79, doi:10.1091/MBC.E20-11-0723.
short: K. Ishihara, F. Decker, P.R. Dos Santos Caldas, J.F. Pelletier, M. Loose,
J. Brugués, T.J. Mitchison, Molecular Biology of the Cell 32 (2021) 869–879.
date_created: 2021-05-23T22:01:45Z
date_published: 2021-04-19T00:00:00Z
date_updated: 2023-08-08T13:36:02Z
day: '19'
department:
- _id: MaLo
doi: 10.1091/MBC.E20-11-0723
ec_funded: 1
external_id:
isi:
- '000641574700005'
intvolume: ' 32'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.molbiolcell.org/doi/10.1091/mbc.E20-11-0723
month: '04'
oa: 1
oa_version: Published Version
page: 869-879
project:
- _id: 2595697A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '679239'
name: Self-Organization of the Bacterial Cell
- _id: 260D98C8-B435-11E9-9278-68D0E5697425
name: Reconstitution of Bacterial Cell Division Using Purified Components
publication: Molecular Biology of the Cell
publication_identifier:
eissn:
- 1939-4586
issn:
- 1059-1524
publication_status: published
publisher: American Society for Cell Biology
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spatial variation of microtubule depolymerization in large asters
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA
3.0)
short: CC BY-NC-SA (3.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 32
year: '2021'
...
---
_id: '9416'
abstract:
- lang: eng
text: 'We study the inductive bias of two-layer ReLU networks trained by gradient
flow. We identify a class of easy-to-learn (`orthogonally separable'') datasets,
and characterise the solution that ReLU networks trained on such datasets converge
to. Irrespective of network width, the solution turns out to be a combination
of two max-margin classifiers: one corresponding to the positive data subset and
one corresponding to the negative data subset. The proof is based on the recently
introduced concept of extremal sectors, for which we prove a number of properties
in the context of orthogonal separability. In particular, we prove stationarity
of activation patterns from some time onwards, which enables a reduction of the
ReLU network to an ensemble of linear subnetworks.'
article_processing_charge: No
author:
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable
data. In: 9th International Conference on Learning Representations. ; 2021.'
apa: Phuong, M., & Lampert, C. (2021). The inductive bias of ReLU networks on
orthogonally separable data. In 9th International Conference on Learning Representations.
Virtual.
chicago: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks
on Orthogonally Separable Data.” In 9th International Conference on Learning
Representations, 2021.
ieee: M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally
separable data,” in 9th International Conference on Learning Representations,
Virtual, 2021.
ista: 'Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally
separable data. 9th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on
Orthogonally Separable Data.” 9th International Conference on Learning Representations,
2021.
short: M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations,
2021.
conference:
end_date: 2021-05-07
location: Virtual
name: ' ICLR: International Conference on Learning Representations'
start_date: 2021-05-03
date_created: 2021-05-24T11:16:46Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2023-09-07T13:29:50Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ChLa
file:
- access_level: open_access
checksum: f34ff17017527db5ba6927f817bdd125
content_type: application/pdf
creator: bphuong
date_created: 2021-05-24T11:15:57Z
date_updated: 2021-05-24T11:15:57Z
file_id: '9417'
file_name: iclr2021_conference.pdf
file_size: 502356
relation: main_file
file_date_updated: 2021-05-24T11:15:57Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/pdf?id=krz7T0xU9Z_
month: '05'
oa: 1
oa_version: Published Version
publication: 9th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '9418'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The inductive bias of ReLU networks on orthogonally separable data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...