---
OA_place: repository
OA_type: green
_id: '10666'
abstract:
- lang: eng
  text: Adversarial training is an effective method to train deep learning models
    that are resilient to norm-bounded perturbations, with the cost of nominal performance
    drop. While adversarial training appears to enhance the robustness and safety
    of a deep model deployed in open-world decision-critical applications, counterintuitively,
    it induces undesired behaviors in robot learning settings. In this paper, we show
    theoretically and experimentally that neural controllers obtained via adversarial
    training are subjected to three types of defects, namely transient, systematic,
    and conditional errors. We first generalize adversarial training to a safety-domain
    optimization scheme allowing for more generic specifications. We then prove that
    such a learning process tends to cause certain error profiles. We support our
    theoretical results by a thorough experimental safety analysis in a robot-learning
    task. Our results suggest that adversarial training is not yet ready for robot
    learning.
acknowledgement: M.L. and T.A.H. are supported in part by the Austrian Science Fund
  (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by
  Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).
article_processing_charge: No
arxiv: 1
author:
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
- first_name: Ramin
  full_name: Hasani, Ramin
  last_name: Hasani
- first_name: Radu
  full_name: Grosu, Radu
  last_name: Grosu
- first_name: Daniela
  full_name: Rus, Daniela
  last_name: Rus
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
citation:
  ama: 'Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is
    not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics
    and Automation</i>. IEEE; 2021:4140-4147. doi:<a href="https://doi.org/10.1109/ICRA48506.2021.9561036">10.1109/ICRA48506.2021.9561036</a>'
  apa: 'Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021).
    Adversarial training is not ready for robot learning. In <i>2021 IEEE International
    Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China: IEEE.
    <a href="https://doi.org/10.1109/ICRA48506.2021.9561036">https://doi.org/10.1109/ICRA48506.2021.9561036</a>'
  chicago: Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger.
    “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International
    Conference on Robotics and Automation</i>, 4140–47. IEEE, 2021. <a href="https://doi.org/10.1109/ICRA48506.2021.9561036">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.
  ieee: M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial
    training is not ready for robot learning,” in <i>2021 IEEE International Conference
    on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.
  ista: 'Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training
    is not ready for robot learning. 2021 IEEE International Conference on Robotics
    and Automation. ICRA: International Conference on Robotics and Automation, 4140–4147.'
  mla: Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.”
    <i>2021 IEEE International Conference on Robotics and Automation</i>, IEEE, 2021,
    pp. 4140–47, doi:<a href="https://doi.org/10.1109/ICRA48506.2021.9561036">10.1109/ICRA48506.2021.9561036</a>.
  short: M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International
    Conference on Robotics and Automation, IEEE, 2021, pp. 4140–4147.
conference:
  end_date: 2021-06-05
  location: Xi'an, China
  name: 'ICRA: International Conference on Robotics and Automation'
  start_date: 2021-05-30
das_tickbox: '1'
date_created: 2022-01-25T15:44:54Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2026-07-07T06:20:35Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1109/ICRA48506.2021.9561036
external_id:
  arxiv:
  - '2103.08187'
  isi:
  - '000765738803040'
fulldoi: https://doi.org/10.1109/ICRA48506.2021.9561036
has_accepted_license: '1'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2103.08187
month: '06'
oa: 1
oa_version: Preprint
page: 4140-4147
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication: 2021 IEEE International Conference on Robotics and Automation
publication_identifier:
  eisbn:
  - 978-1-7281-9077-8
  eissn:
  - 2577-087X
  isbn:
  - 978-1-7281-9078-5
  issn:
  - 1050-4729
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
  record:
  - id: '11362'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Adversarial training is not ready for robot learning
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
    3.0)
  short: CC BY-NC-ND (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9678'
abstract:
- lang: eng
  text: We introduce a new graph problem, the token dropping game, and we show how
    to solve it efficiently in a distributed setting. We use the token dropping game
    as a tool to design an efficient distributed algorithm for stable orientations
    and more generally for locally optimal semi-matchings. The prior work by Czygrinow
    et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum
    degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ).
    For the more general problem of locally optimal semi-matchings, the prior upper
    bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement
    for C = o(S); here C and S are the maximum degrees of customers and servers, respectively.
acknowledgement: We thank Orr Fischer, Juho Hirvonen, and Tuomo Lempiäinen for valuable
  discussions. This project has received funding from the European Union’s Horizon
  2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement
  No. 840605.
article_processing_charge: No
arxiv: 1
author:
- first_name: Sebastian
  full_name: Brandt, Sebastian
  last_name: Brandt
- first_name: Barbara
  full_name: Keller, Barbara
  last_name: Keller
- first_name: Joel
  full_name: Rybicki, Joel
  id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
  last_name: Rybicki
  orcid: 0000-0002-6432-6646
- first_name: Jukka
  full_name: Suomela, Jukka
  last_name: Suomela
- first_name: Jara
  full_name: Uitto, Jara
  last_name: Uitto
citation:
  ama: 'Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing
    through distributed token dropping. In: <i>Annual ACM Symposium on Parallelism
    in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:129-139.
    doi:<a href="https://doi.org/10.1145/3409964.3461785">10.1145/3409964.3461785</a>'
  apa: 'Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2021).
    Efficient load-balancing through distributed token dropping. In <i>Annual ACM
    Symposium on Parallelism in Algorithms and Architectures</i> (pp. 129–139).  Virtual
    Event, United States: Association for Computing Machinery. <a href="https://doi.org/10.1145/3409964.3461785">https://doi.org/10.1145/3409964.3461785</a>'
  chicago: Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara
    Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In <i>Annual
    ACM Symposium on Parallelism in Algorithms and Architectures</i>, 129–39. Association
    for Computing Machinery, 2021. <a href="https://doi.org/10.1145/3409964.3461785">https://doi.org/10.1145/3409964.3461785</a>.
  ieee: S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing
    through distributed token dropping,” in <i>Annual ACM Symposium on Parallelism
    in Algorithms and Architectures</i>,  Virtual Event, United States, 2021, pp.
    129–139.
  ista: 'Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing
    through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms
    and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures
    , 129–139.'
  mla: Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token
    Dropping.” <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>,
    Association for Computing Machinery, 2021, pp. 129–39, doi:<a href="https://doi.org/10.1145/3409964.3461785">10.1145/3409964.3461785</a>.
  short: S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium
    on Parallelism in Algorithms and Architectures, Association for Computing Machinery,
    2021, pp. 129–139.
conference:
  end_date: 2021-07-08
  location: ' Virtual Event, United States'
  name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures '
  start_date: 2021-07-06
das_tickbox: '1'
date_created: 2021-07-18T22:01:22Z
date_published: 2021-07-06T00:00:00Z
date_updated: 2026-07-07T06:21:32Z
day: '06'
department:
- _id: DaAl
doi: 10.1145/3409964.3461785
ec_funded: 1
external_id:
  arxiv:
  - '2005.07761'
fulldoi: https://doi.org/10.1145/3409964.3461785
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2005.07761
month: '07'
oa: 1
oa_version: Preprint
page: 129-139
project:
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '840605'
  name: Coordination in constrained and natural distributed systems
publication: Annual ACM Symposium on Parallelism in Algorithms and Architectures
publication_identifier:
  isbn:
  - '9781450380706'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
  record:
  - id: '15074'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Efficient load-balancing through distributed token dropping
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10667'
abstract:
- lang: eng
  text: Bayesian neural networks (BNNs) place distributions over the weights of a
    neural network to model uncertainty in the data and the network's prediction.
    We consider the problem of verifying safety when running a Bayesian neural network
    policy in a feedback loop with infinite time horizon systems. Compared to the
    existing sampling-based approaches, which are inapplicable to the infinite time
    horizon setting, we train a separate deterministic neural network that serves
    as an infinite time horizon safety certificate. In particular, we show that the
    certificate network guarantees the safety of the system over a subset of the BNN
    weight posterior's support. Our method first computes a safe weight set and then
    alters the BNN's weight posterior to reject samples outside this set. Moreover,
    we show how to extend our approach to a safe-exploration reinforcement learning
    setting, in order to avoid unsafe trajectories during the training of the policy.
    We evaluate our approach on a series of reinforcement learning benchmarks, including
    non-Lyapunovian safety specifications.
acknowledgement: This research was supported in part by the Austrian Science Fund
  (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and
  the European Union’s Horizon 2020 research and innovation programme under the Marie
  Skłodowska-Curie Grant Agreement No. 665385.
alternative_title:
- ' Advances in Neural Information Processing Systems'
article_processing_charge: No
arxiv: 1
author:
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
- first_name: Ðorđe
  full_name: Žikelić, Ðorđe
  last_name: Žikelić
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
citation:
  ama: 'Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety
    of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing
    Systems</i>. Neural Information Processing Systems Foundation; 2021. doi:<a href="https://doi.org/10.48550/arXiv.2111.03165">10.48550/arXiv.2111.03165</a>'
  apa: 'Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite
    time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural
    Information Processing Systems</i>. Virtual: Neural Information Processing Systems
    Foundation. <a href="https://doi.org/10.48550/arXiv.2111.03165">https://doi.org/10.48550/arXiv.2111.03165</a>'
  chicago: Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger.
    “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference
    on Neural Information Processing Systems</i>. Neural Information Processing Systems
    Foundation, 2021. <a href="https://doi.org/10.48550/arXiv.2111.03165">https://doi.org/10.48550/arXiv.2111.03165</a>.
  ieee: M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time
    horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information
    Processing Systems</i>, Virtual, 2021.
  ista: 'Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon
    safety of Bayesian neural networks. 35th Conference on Neural Information Processing
    Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information
    Processing Systems, .'
  mla: Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.”
    <i>35th Conference on Neural Information Processing Systems</i>, Neural Information
    Processing Systems Foundation, 2021, doi:<a href="https://doi.org/10.48550/arXiv.2111.03165">10.48550/arXiv.2111.03165</a>.
  short: M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference
    on Neural Information Processing Systems, Neural Information Processing Systems
    Foundation, 2021.
conference:
  end_date: 2021-12-10
  location: Virtual
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2021-12-06
corr_author: '1'
das_tickbox: '1'
date_created: 2022-01-25T15:45:58Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2026-07-07T06:49:10Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
- _id: KrCh
doi: 10.48550/arXiv.2111.03165
ec_funded: 1
external_id:
  arxiv:
  - '2111.03165'
file:
- access_level: open_access
  checksum: 0fc0f852525c10dda9cc9ffea07fb4e4
  content_type: application/pdf
  creator: mlechner
  date_created: 2022-01-26T07:39:59Z
  date_updated: 2022-01-26T07:39:59Z
  file_id: '10682'
  file_name: infinite_time_horizon_safety_o.pdf
  file_size: 452492
  relation: main_file
  success: 1
file_date_updated: 2022-01-26T07:39:59Z
fulldoi: https://doi.org/10.48550/arXiv.2111.03165
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
  call_identifier: H2020
  grant_number: '863818'
  name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
related_material:
  record:
  - id: '11362'
    relation: dissertation_contains
    status: public
status: public
title: Infinite time horizon safety of Bayesian neural networks
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
    3.0)
  short: CC BY-NC-ND (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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: <i>35th Conference on Neural Information Processing Systems</i>.
    Neural Information Processing Systems Foundation; 2021.'
  apa: 'Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021).
    Causal navigation by continuous-time neural networks. In <i>35th Conference on
    Neural Information Processing Systems</i>. Virtual: Neural Information Processing
    Systems Foundation.'
  chicago: Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and
    Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th
    Conference on Neural Information Processing Systems</i>. Neural Information Processing
    Systems Foundation, 2021.
  ieee: C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation
    by continuous-time neural networks,” in <i>35th Conference on Neural Information
    Processing Systems</i>, 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.”
    <i>35th Conference on Neural Information Processing Systems</i>, Neural Information
    Processing Systems Foundation, 2021.
  short: C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference
    on Neural Information Processing Systems, Neural Information Processing Systems
    Foundation, 2021.
conference:
  end_date: 2021-12-10
  location: Virtual
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2021-12-06
das_tickbox: '1'
date_created: 2022-01-25T15:47:50Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2026-07-07T06:49:46Z
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: Formal methods for the design and analysis of complex systems
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9293'
abstract:
- lang: eng
  text: 'We consider planning problems for graphs, Markov Decision Processes (MDPs),
    and games on graphs in an explicit state space. While graphs represent the most
    basic planning model, MDPs represent interaction with nature and games on graphs
    represent interaction with an adversarial environment. We consider two planning
    problems with k different target sets: (a) the coverage problem asks whether there
    is a plan for each individual target set; and (b) the sequential target reachability
    problem asks whether the targets can be reached in a given sequence. For the coverage
    problem, we present a linear-time algorithm for graphs, and quadratic conditional
    lower bound for MDPs and games on graphs. For the sequential target problem, we
    present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs,
    and a quadratic conditional lower bound for games on graphs. Our results with
    conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture
    and strong exponential time hypothesis (SETH), establish (i) model-separation
    results showing that for the coverage problem MDPs and games on graphs are harder
    than graphs, and for the sequential reachability problem games on graphs are harder
    than MDPs and graphs; and (ii) problem-separation results showing that for MDPs
    the coverage problem is harder than the sequential target problem.'
article_number: '103499'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Wolfgang
  full_name: Dvořák, Wolfgang
  last_name: Dvořák
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Alexander
  full_name: Svozil, Alexander
  last_name: Svozil
citation:
  ama: Chatterjee K, Dvořák W, Henzinger M, Svozil A. Algorithms and conditional lower
    bounds for planning problems. <i>Artificial Intelligence</i>. 2021;297(8). doi:<a
    href="https://doi.org/10.1016/j.artint.2021.103499">10.1016/j.artint.2021.103499</a>
  apa: Chatterjee, K., Dvořák, W., Henzinger, M., &#38; Svozil, A. (2021). Algorithms
    and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.artint.2021.103499">https://doi.org/10.1016/j.artint.2021.103499</a>
  chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander
    Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial
    Intelligence</i>. Elsevier, 2021. <a href="https://doi.org/10.1016/j.artint.2021.103499">https://doi.org/10.1016/j.artint.2021.103499</a>.
  ieee: K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Algorithms and conditional
    lower bounds for planning problems,” <i>Artificial Intelligence</i>, vol. 297,
    no. 8. Elsevier, 2021.
  ista: Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2021. Algorithms and conditional
    lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.
  mla: Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for
    Planning Problems.” <i>Artificial Intelligence</i>, vol. 297, no. 8, 103499, Elsevier,
    2021, doi:<a href="https://doi.org/10.1016/j.artint.2021.103499">10.1016/j.artint.2021.103499</a>.
  short: K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, Artificial Intelligence
    297 (2021).
corr_author: '1'
date_created: 2021-03-28T22:01:40Z
date_published: 2021-03-16T00:00:00Z
date_updated: 2026-07-07T13:36:04Z
day: '16'
department:
- _id: KrCh
doi: 10.1016/j.artint.2021.103499
external_id:
  arxiv:
  - '1804.07031'
  isi:
  - '000657537500003'
fulldoi: https://doi.org/10.1016/j.artint.2021.103499
intvolume: '       297'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1804.07031
month: '03'
oa: 1
oa_version: Preprint
publication: Artificial Intelligence
publication_identifier:
  issn:
  - 0004-3702
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
  record:
  - id: '35'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Algorithms and conditional lower bounds for planning problems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 297
year: '2021'
...
---
_id: '9441'
abstract:
- lang: eng
  text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
    and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate
    multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension
    of the manifold. A natural way to approximate a smooth isomanifold M is to consider
    its Piecewise-Linear (PL) approximation M̂ based on a triangulation \U0001D4AF
    of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace
    isomanifolds from a given starting point. The algorithm works for arbitrary dimensions
    n and d, and any precision D. Our main result is that, when f (or M) has bounded
    complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and
    unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂
    is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation
    of isomanifolds of bounded complexity in time polynomial in d. Combining this
    algorithm with dimensionality reduction techniques, the dependency on d in the
    size of M̂ can be completely removed with high probability. We also show that
    the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds.
    The algorithm for isomanifolds with boundary has been implemented and experimental
    results are reported, showing that it is practical and can handle cases that are
    far ahead of the state-of-the-art. "
acknowledgement: We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent
  Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge
  the reviewers.
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Jean-Daniel
  full_name: Boissonnat, Jean-Daniel
  last_name: Boissonnat
- first_name: Siargey
  full_name: Kachanovich, Siargey
  last_name: Kachanovich
- first_name: Mathijs
  full_name: Wintraecken, Mathijs
  id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
  last_name: Wintraecken
  orcid: 0000-0002-7472-2220
citation:
  ama: 'Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in
    time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: <i>37th
    International Symposium on Computational Geometry</i>. Vol 189. Leibniz International
    Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik; 2021:17:1-17:16. doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2021.17">10.4230/LIPIcs.SoCG.2021.17</a>'
  apa: 'Boissonnat, J.-D., Kachanovich, S., &#38; Wintraecken, M. (2021). Tracing
    isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations.
    In <i>37th International Symposium on Computational Geometry</i> (Vol. 189, p.
    17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPIcs.SoCG.2021.17">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>'
  chicago: 'Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken.
    “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn
    Triangulations.” In <i>37th International Symposium on Computational Geometry</i>,
    189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
    Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2021.17">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>.'
  ieee: J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds
    in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,”
    in <i>37th International Symposium on Computational Geometry</i>, Virtual, 2021,
    vol. 189, p. 17:1-17:16.
  ista: 'Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds
    in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th
    International Symposium on Computational Geometry. SoCG: Symposium on Computational
    GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol.
    189, 17:1-17:16.'
  mla: Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial
    in d Using Coxeter-Freudenthal-Kuhn Triangulations.” <i>37th International Symposium
    on Computational Geometry</i>, vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für
    Informatik, 2021, p. 17:1-17:16, doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2021.17">10.4230/LIPIcs.SoCG.2021.17</a>.
  short: J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International
    Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    Dagstuhl, Germany, 2021, p. 17:1-17:16.
conference:
  end_date: 2021-06-11
  location: Virtual
  name: 'SoCG: Symposium on Computational Geometry'
  start_date: 2021-06-07
das_tickbox: '1'
date_created: 2021-06-02T10:10:55Z
date_published: 2021-06-02T00:00:00Z
date_updated: 2026-07-07T13:43:40Z
day: '02'
ddc:
- '005'
- '516'
- '514'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2021.17
ec_funded: 1
file:
- access_level: open_access
  checksum: c322aa48d5d35a35877896cc565705b6
  content_type: application/pdf
  creator: mwintrae
  date_created: 2021-06-02T10:22:33Z
  date_updated: 2021-06-02T10:22:33Z
  file_id: '9442'
  file_name: LIPIcs-SoCG-2021-17.pdf
  file_size: 1972902
  relation: main_file
  success: 1
file_date_updated: 2021-06-02T10:22:33Z
fulldoi: https://doi.org/10.4230/LIPIcs.SoCG.2021.17
has_accepted_license: '1'
intvolume: '       189'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 17:1-17:16
place: Dagstuhl, Germany
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: 37th International Symposium on Computational Geometry
publication_identifier:
  isbn:
  - 978-3-95977-184-9
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
  record:
  - id: '12960'
    relation: later_version
    status: public
scopus_import: '1'
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn
  triangulations
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 189
year: '2021'
...
---
_id: '10041'
abstract:
- lang: eng
  text: Yao’s garbling scheme is one of the most fundamental cryptographic constructions.
    Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security
    in the selective setting where the adversary chooses the challenge inputs before
    seeing the garbled circuit assuming secure symmetric-key encryption (and hence
    one-way functions). This was followed by results, both positive and negative,
    concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto
    2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility
    argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s
    scheme (where the output mapping is sent in the online phase, together with the
    garbled input) that circumvents this negative result, and proved that it is adaptively
    secure, at least for shallow circuits. In particular, they showed that for the
    class of circuits of depth   δ , the loss in security is at most exponential in   δ
    . The above results all concern the simulation-based notion of security. In this
    work, we show that the upper bound of Jafargholi and Wichs is basically optimal
    in a strong sense. As our main result, we show that there exists a family of Boolean
    circuits, one for each depth  δ∈N , such that any black-box reduction proving
    the adaptive indistinguishability of the natural adaptation of Yao’s scheme from
    any symmetric-key encryption has to lose a factor that is exponential in   δ√
    . Since indistinguishability is a weaker notion than simulation, our bound also
    applies to adaptive simulation. To establish our results, we build on the recent
    approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction
    with oracle separations to prove fine-grained lower bounds on loss in cryptographic
    security.
acknowledgement: We would like to thank the anonymous reviewers of Crypto’21 whose
  detailed comments helped us considerably improve the presentation of the paper.
alternative_title:
- LCNS
article_processing_charge: No
author:
- first_name: Chethan
  full_name: Kamath Hosdurg, Chethan
  id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
  last_name: Kamath Hosdurg
  orcid: 0009-0006-6812-7317
- first_name: Karen
  full_name: Klein, Karen
  id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
  last_name: Klein
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Daniel
  full_name: Wichs, Daniel
  last_name: Wichs
citation:
  ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security
    of Yao’s Garbling. In: <i>41st Annual International Cryptology Conference</i>.
    Vol 12826. Cham: Springer Nature; 2021:486-515. doi:<a href="https://doi.org/10.1007/978-3-030-84245-1_17">10.1007/978-3-030-84245-1_17</a>'
  apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Wichs, D. (2021). Limits
    on the Adaptive Security of Yao’s Garbling. In <i>41st Annual International Cryptology
    Conference</i> (Vol. 12826, pp. 486–515). Cham: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-84245-1_17">https://doi.org/10.1007/978-3-030-84245-1_17</a>'
  chicago: 'Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel
    Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In <i>41st Annual
    International Cryptology Conference</i>, 12826:486–515. Cham: Springer Nature,
    2021. <a href="https://doi.org/10.1007/978-3-030-84245-1_17">https://doi.org/10.1007/978-3-030-84245-1_17</a>.'
  ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the
    Adaptive Security of Yao’s Garbling,” in <i>41st Annual International Cryptology
    Conference</i>, Virtual, 2021, vol. 12826, pp. 486–515.
  ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive
    Security of Yao’s Garbling. 41st Annual International Cryptology Conference. CRYPTO:
    Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.'
  mla: Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.”
    <i>41st Annual International Cryptology Conference</i>, vol. 12826, Springer Nature,
    2021, pp. 486–515, doi:<a href="https://doi.org/10.1007/978-3-030-84245-1_17">10.1007/978-3-030-84245-1_17</a>.
  short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International
    Cryptology Conference, Springer Nature, Cham, 2021, pp. 486–515.
conference:
  end_date: 2021-08-20
  location: Virtual
  name: 'CRYPTO: Annual International Cryptology Conference'
  start_date: 2021-08-16
cryptoeprintid: 1
date_created: 2021-09-23T14:06:15Z
date_published: 2021-08-11T00:00:00Z
date_updated: 2026-07-07T13:57:01Z
day: '11'
department:
- _id: KrPi
doi: 10.1007/978-3-030-84245-1_17
ec_funded: 1
external_id:
  cryptoeprintid:
  - 2021/945
  isi:
  - '000696697800017'
fulldoi: https://doi.org/10.1007/978-3-030-84245-1_17
intvolume: '     12826'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2021/945
month: '08'
oa: 1
oa_version: Preprint
page: 486-515
place: Cham
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: 41st Annual International Cryptology Conference
publication_identifier:
  eisbn:
  - 978-3-030-84245-1
  eissn:
  - 1611-3349
  isbn:
  - 978-3-030-84244-4
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '10035'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Limits on the Adaptive Security of Yao’s Garbling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12826
year: '2021'
...
---
_id: '11453'
abstract:
- lang: eng
  text: "Neuronal computations depend on synaptic connectivity and intrinsic electrophysiological
    properties. Synaptic connectivity determines which inputs from presynaptic neurons
    are integrated, while cellular properties determine how inputs are filtered over
    time. Unlike their biological counterparts, most computational approaches to learning
    in simulated neural networks are limited to changes in synaptic connectivity.
    However, if intrinsic parameters change, neural computations are altered drastically.
    Here, we include the parameters that determine the intrinsic properties,\r\ne.g.,
    time constants and reset potential, into the learning paradigm. Using sparse feedback
    signals that indicate target spike times, and gradient-based parameter updates,
    we show that the intrinsic parameters can be learned along with the synaptic weights
    to produce specific input-output functions. Specifically, we use a teacher-student
    paradigm in which a randomly initialised leaky integrate-and-fire or resonate-and-fire
    neuron must recover the parameters of a teacher neuron. We show that complex temporal
    functions can be learned online and without backpropagation through time, relying
    on event-based updates only. Our results are a step towards online learning of
    neural computations from ungraded and unsigned sparse feedback signals with a
    biologically inspired learning mechanism."
acknowledgement: We would like to thank Professor Dr. Henning Sprekeler for his valuable
  suggestions and Dr. Andrew Saxe, Milan Klöwer and Anna Wallis for their constructive
  feedback on the manuscript. Lukas Braun was supported by the Network of European
  Neuroscience Schools through their NENS Exchange Grant program, by the European
  Union through their European Community Action Scheme for the Mobility of University
  Students, the Woodward Scholarship awarded by Wadham College, Oxford and the Medical
  Research Council [MR/N013468/1]. Tim P. Vogels was supported by a Wellcome Trust
  Senior Research Fellowship [214316/Z/18/Z].
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
author:
- first_name: Lukas
  full_name: Braun, Lukas
  last_name: Braun
- first_name: Tim P
  full_name: Vogels, Tim P
  id: CB6FF8D2-008F-11EA-8E08-2637E6697425
  last_name: Vogels
  orcid: 0000-0003-3295-6181
citation:
  ama: 'Braun L, Vogels TP. Online learning of neural computations from sparse temporal
    feedback. In: <i>35th Conference on Neural Information Processing Systems</i>.
    Vol 20. Neural Information Processing Systems Foundation; 2021:16437-16450.'
  apa: 'Braun, L., &#38; Vogels, T. P. (2021). Online learning of neural computations
    from sparse temporal feedback. In <i>35th Conference on Neural Information Processing
    Systems</i> (Vol. 20, pp. 16437–16450). Virtual, Online: Neural Information Processing
    Systems Foundation.'
  chicago: Braun, Lukas, and Tim P Vogels. “Online Learning of Neural Computations
    from Sparse Temporal Feedback.” In <i>35th Conference on Neural Information Processing
    Systems</i>, 20:16437–50. Neural Information Processing Systems Foundation, 2021.
  ieee: L. Braun and T. P. Vogels, “Online learning of neural computations from sparse
    temporal feedback,” in <i>35th Conference on Neural Information Processing Systems</i>,
    Virtual, Online, 2021, vol. 20, pp. 16437–16450.
  ista: 'Braun L, Vogels TP. 2021. Online learning of neural computations from sparse
    temporal feedback. 35th Conference on Neural Information Processing Systems. NeurIPS:
    Neural Information Processing Systems, Advances in Neural Information Processing
    Systems, vol. 20, 16437–16450.'
  mla: Braun, Lukas, and Tim P. Vogels. “Online Learning of Neural Computations from
    Sparse Temporal Feedback.” <i>35th Conference on Neural Information Processing
    Systems</i>, vol. 20, Neural Information Processing Systems Foundation, 2021,
    pp. 16437–50.
  short: L. Braun, T.P. Vogels, in:, 35th Conference on Neural Information Processing
    Systems, Neural Information Processing Systems Foundation, 2021, pp. 16437–16450.
conference:
  end_date: 2021-12-14
  location: Virtual, Online
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2021-12-06
corr_author: '1'
das_tickbox: '1'
date_created: 2022-06-19T22:01:59Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2026-07-08T05:45:00Z
day: '01'
ddc:
- '000'
- '570'
department:
- _id: TiVo
intvolume: '        20'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://proceedings.neurips.cc/paper/2021/file/88e1ce84f9feef5a08d0df0334c53468-Paper.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 16437-16450
project:
- _id: c084a126-5a5b-11eb-8a69-d75314a70a87
  grant_number: 214316/Z/18/Z
  name: "Whatâ\x80\x99s in a memory? Spatiotemporal dynamics in strongly coupled recurrent
    neuronal networks."
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
  isbn:
  - '9781713845393'
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online learning of neural computations from sparse temporal feedback
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2021'
...
---
_id: '11452'
abstract:
- lang: eng
  text: We study efficient distributed algorithms for the fundamental problem of principal
    component analysis and leading eigenvector computation on the sphere, when the
    data are randomly distributed among a set of computational nodes. We propose a
    new quantized variant of Riemannian gradient descent to solve this problem, and
    prove that the algorithm converges with high probability under a set of necessary
    spherical-convexity properties. We give bounds on the number of bits transmitted
    by the algorithm under common initialization schemes, and investigate the dependency
    on the problem dimension in each case.
acknowledgement: We would like to thank the anonymous reviewers for helpful comments
  and suggestions. We also thank Aurelien Lucchi and Antonio Orvieto for fruitful
  discussions at an early stage of this work. FA is partially supported by the SNSF
  under research project No. 192363 and conducted part of this work while at IST Austria
  under the European Union’s Horizon 2020 research and innovation programme (grant
  agreement No. 805223 ScaleML). PD partly conducted this work while at IST Austria
  and was supported by the European Union’s Horizon 2020 programme under the Marie
  Skłodowska-Curie grant agreement No. 754411.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Foivos
  full_name: Alimisis, Foivos
  last_name: Alimisis
- first_name: Peter
  full_name: Davies, Peter
  id: 11396234-BB50-11E9-B24C-90FCE5697425
  last_name: Davies
  orcid: 0000-0002-5646-9524
- first_name: Bart
  full_name: Vandereycken, Bart
  last_name: Vandereycken
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
citation:
  ama: 'Alimisis F, Davies P, Vandereycken B, Alistarh D-A. Distributed principal
    component analysis with limited communication. In: <i>35th Conference on Neural
    Information Processing Systems</i>. Vol 4. Neural Information Processing Systems
    Foundation; 2021:2823-2834.'
  apa: 'Alimisis, F., Davies, P., Vandereycken, B., &#38; Alistarh, D.-A. (2021).
    Distributed principal component analysis with limited communication. In <i>35th
    Conference on Neural Information Processing Systems</i> (Vol. 4, pp. 2823–2834).
    Virtual, Online: Neural Information Processing Systems Foundation.'
  chicago: Alimisis, Foivos, Peter Davies, Bart Vandereycken, and Dan-Adrian Alistarh.
    “Distributed Principal Component Analysis with Limited Communication.” In <i>35th
    Conference on Neural Information Processing Systems</i>, 4:2823–34. Neural Information
    Processing Systems Foundation, 2021.
  ieee: F. Alimisis, P. Davies, B. Vandereycken, and D.-A. Alistarh, “Distributed
    principal component analysis with limited communication,” in <i>35th Conference
    on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 4, pp.
    2823–2834.
  ista: 'Alimisis F, Davies P, Vandereycken B, Alistarh D-A. 2021. Distributed principal
    component analysis with limited communication. 35th Conference on Neural Information
    Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in
    Neural Information Processing Systems, vol. 4, 2823–2834.'
  mla: Alimisis, Foivos, et al. “Distributed Principal Component Analysis with Limited
    Communication.” <i>35th Conference on Neural Information Processing Systems</i>,
    vol. 4, Neural Information Processing Systems Foundation, 2021, pp. 2823–34.
  short: F. Alimisis, P. Davies, B. Vandereycken, D.-A. Alistarh, in:, 35th Conference
    on Neural Information Processing Systems, Neural Information Processing Systems
    Foundation, 2021, pp. 2823–2834.
conference:
  end_date: 2021-12-14
  location: Virtual, Online
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2021-12-06
corr_author: '1'
das_tickbox: '1'
date_created: 2022-06-19T22:01:58Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2026-07-08T05:44:33Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
ec_funded: 1
external_id:
  arxiv:
  - '2110.14391'
intvolume: '         4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://proceedings.neurips.cc/paper/2021/file/1680e9fa7b4dd5d62ece800239bb53bd-Paper.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 2823-2834
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '805223'
  name: Elastic Coordination for Scalable Machine Learning
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
  isbn:
  - '9781713845393'
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distributed principal component analysis with limited communication
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '22156'
abstract:
- lang: eng
  text: Extending a recent breakthrough of Shitov, we prove that the chromatic number
    of the tensor product of two graphs can be a constant factor smaller than the
    minimum chromatic number of the two graphs. More precisely, we prove that there
    exists an absolute constant δ>0 such that for all c sufficiently large, there
    exist graphs G and H with chromatic number at least (1+δ)c for which χ(G×H)≤c.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xiaoyu
  full_name: He, Xiaoyu
  last_name: He
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  ama: He X, Wigderson Y. Hedetniemi’s conjecture is asymptotically false. <i>Journal
    of Combinatorial Theory, Series B</i>. 2021;146:485-494. doi:<a href="https://doi.org/10.1016/j.jctb.2020.03.003">10.1016/j.jctb.2020.03.003</a>
  apa: He, X., &#38; Wigderson, Y. (2021). Hedetniemi’s conjecture is asymptotically
    false. <i>Journal of Combinatorial Theory, Series B</i>. Elsevier. <a href="https://doi.org/10.1016/j.jctb.2020.03.003">https://doi.org/10.1016/j.jctb.2020.03.003</a>
  chicago: He, Xiaoyu, and Yuval Wigderson. “Hedetniemi’s Conjecture Is Asymptotically
    False.” <i>Journal of Combinatorial Theory, Series B</i>. Elsevier, 2021. <a href="https://doi.org/10.1016/j.jctb.2020.03.003">https://doi.org/10.1016/j.jctb.2020.03.003</a>.
  ieee: X. He and Y. Wigderson, “Hedetniemi’s conjecture is asymptotically false,”
    <i>Journal of Combinatorial Theory, Series B</i>, vol. 146. Elsevier, pp. 485–494,
    2021.
  ista: He X, Wigderson Y. 2021. Hedetniemi’s conjecture is asymptotically false.
    Journal of Combinatorial Theory, Series B. 146, 485–494.
  mla: He, Xiaoyu, and Yuval Wigderson. “Hedetniemi’s Conjecture Is Asymptotically
    False.” <i>Journal of Combinatorial Theory, Series B</i>, vol. 146, Elsevier,
    2021, pp. 485–94, doi:<a href="https://doi.org/10.1016/j.jctb.2020.03.003">10.1016/j.jctb.2020.03.003</a>.
  short: X. He, Y. Wigderson, Journal of Combinatorial Theory, Series B 146 (2021)
    485–494.
date_created: 2026-06-29T10:50:09Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2026-07-08T07:43:57Z
day: '01'
doi: 10.1016/j.jctb.2020.03.003
extern: '1'
external_id:
  arxiv:
  - '1906.06783'
fulldoi: https://doi.org/10.1016/j.jctb.2020.03.003
intvolume: '       146'
keyword:
- Graph coloring
- Hedetniemi's conjecture
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1906.06783
month: '01'
oa: 1
oa_version: Preprint
page: 485-494
publication: Journal of Combinatorial Theory, Series B
publication_identifier:
  issn:
  - 0095-8956
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hedetniemi's conjecture is asymptotically false
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 146
year: '2021'
...
---
_id: '9331'
abstract:
- lang: eng
  text: 'Quantum entanglement has been generated and verified in cold-atom experiments
    and used to make atom-interferometric measurements below the shot-noise limit.
    However, current state-of-the-art cold-atom devices exploit separable (i.e., unentangled)
    atomic states. This perspective piece asks the question: can entanglement usefully
    improve cold-atom sensors, in the sense that it gives new sensing capabilities
    unachievable with current state-of-the-art devices? We briefly review the state-of-the-art
    in precision cold-atom sensing, focusing on clocks and inertial sensors, identifying
    the potential benefits entanglement could bring to these devices, and the challenges
    that need to be overcome to realize these benefits. We survey demonstrated methods
    of generating metrologically useful entanglement in cold-atom systems, note their
    relative strengths and weaknesses, and assess their prospects for near-to-medium
    term quantum-enhanced cold-atom sensing.'
acknowledgement: We acknowledge fruitful discussions with John Close, Chris Freier,
  Kyle Hardman, Joseph Hope, and Paul Wigley, and insightful suggestions made by Franck
  Pereira dos Santos on behalf of the Atom Interferometry and Inertial Sensors team
  at SYRTE. S.S.S. was supported by an Australian Research Council Discovery Early
  Career Researcher Award (DECRA), Project No. DE200100495. O.H. was supported by
  IST Austria.
article_number: '140501'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Stuart S.
  full_name: Szigeti, Stuart S.
  last_name: Szigeti
- first_name: Onur
  full_name: Hosten, Onur
  id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
  last_name: Hosten
  orcid: 0000-0002-2031-204X
- first_name: Simon A.
  full_name: Haine, Simon A.
  last_name: Haine
citation:
  ama: 'Szigeti SS, Hosten O, Haine SA. Improving cold-atom sensors with quantum entanglement:
    Prospects and challenges. <i>Applied Physics Letters</i>. 2021;118(14). doi:<a
    href="https://doi.org/10.1063/5.0050235">10.1063/5.0050235</a>'
  apa: 'Szigeti, S. S., Hosten, O., &#38; Haine, S. A. (2021). Improving cold-atom
    sensors with quantum entanglement: Prospects and challenges. <i>Applied Physics
    Letters</i>. AIP Publishing. <a href="https://doi.org/10.1063/5.0050235">https://doi.org/10.1063/5.0050235</a>'
  chicago: 'Szigeti, Stuart S., Onur Hosten, and Simon A. Haine. “Improving Cold-Atom
    Sensors with Quantum Entanglement: Prospects and Challenges.” <i>Applied Physics
    Letters</i>. AIP Publishing, 2021. <a href="https://doi.org/10.1063/5.0050235">https://doi.org/10.1063/5.0050235</a>.'
  ieee: 'S. S. Szigeti, O. Hosten, and S. A. Haine, “Improving cold-atom sensors with
    quantum entanglement: Prospects and challenges,” <i>Applied Physics Letters</i>,
    vol. 118, no. 14. AIP Publishing, 2021.'
  ista: 'Szigeti SS, Hosten O, Haine SA. 2021. Improving cold-atom sensors with quantum
    entanglement: Prospects and challenges. Applied Physics Letters. 118(14), 140501.'
  mla: 'Szigeti, Stuart S., et al. “Improving Cold-Atom Sensors with Quantum Entanglement:
    Prospects and Challenges.” <i>Applied Physics Letters</i>, vol. 118, no. 14, 140501,
    AIP Publishing, 2021, doi:<a href="https://doi.org/10.1063/5.0050235">10.1063/5.0050235</a>.'
  short: S.S. Szigeti, O. Hosten, S.A. Haine, Applied Physics Letters 118 (2021).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: The data that support the findings of this study are available
  from the corresponding author upon reasonable request.
date_created: 2021-04-18T22:01:40Z
date_published: 2021-04-07T00:00:00Z
date_updated: 2026-07-08T08:53:45Z
day: '07'
department:
- _id: OnHo
doi: 10.1063/5.0050235
external_id:
  arxiv:
  - '2010.09168'
  isi:
  - '000637702100001'
fulldoi: https://doi.org/10.1063/5.0050235
intvolume: '       118'
isi: 1
issue: '14'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2010.09168
month: '04'
oa: 1
oa_version: Preprint
publication: Applied Physics Letters
publication_identifier:
  issn:
  - 0003-6951
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
researchdata_availability: upon request
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Improving cold-atom sensors with quantum entanglement: Prospects and challenges'
type: journal_article
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 118
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '22161'
abstract:
- lang: eng
  text: "Recently, Souza introduced blowup Ramsey numbers as a gener-\r\nalization
    of bipartite Ramsey numbers. For graphs G and H, say\r\nG r\r\n−→ H if every r-edge-coloring
    of G contains a monochromatic\r\ncopy of H. Let H[t] denote the t-blowup of H.
    Then the blowup\r\nRamsey number of G, H, r, and t is defined as the minimum n\r\nsuch
    that G[n] r\r\n−→ H[t]. Souza proved upper and lower bounds on\r\nn that are exponential
    in t, and conjectured that the exponential\r\nconstant does not depend on G. We
    prove that the dependence on\r\nG in the exponential constant is indeed unnecessary,
    but conjecture\r\nthat some dependence on G is unavoidable.\r\nAn important step
    in both Souza’s proof and ours is a theorem of\r\nNikiforov, which says that if
    a graph contains a constant fraction\r\nof the possible copies of H, then it contains
    a blowup of H of\r\nlogarithmic size. We also provide a new proof of this theorem
    with\r\na better quantitative dependence."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
  full_name: Fox, Jacob
  last_name: Fox
- first_name: Sammy
  full_name: Luo, Sammy
  last_name: Luo
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  ama: Fox J, Luo S, Wigderson Y. Extremal and Ramsey results on graph blowups. <i>Journal
    of Combinatorics</i>. 2021;12(1):1-15. doi:<a href="https://doi.org/10.4310/joc.2021.v12.n1.a1">10.4310/joc.2021.v12.n1.a1</a>
  apa: Fox, J., Luo, S., &#38; Wigderson, Y. (2021). Extremal and Ramsey results on
    graph blowups. <i>Journal of Combinatorics</i>. International Press of Boston.
    <a href="https://doi.org/10.4310/joc.2021.v12.n1.a1">https://doi.org/10.4310/joc.2021.v12.n1.a1</a>
  chicago: Fox, Jacob, Sammy Luo, and Yuval Wigderson. “Extremal and Ramsey Results
    on Graph Blowups.” <i>Journal of Combinatorics</i>. International Press of Boston,
    2021. <a href="https://doi.org/10.4310/joc.2021.v12.n1.a1">https://doi.org/10.4310/joc.2021.v12.n1.a1</a>.
  ieee: J. Fox, S. Luo, and Y. Wigderson, “Extremal and Ramsey results on graph blowups,”
    <i>Journal of Combinatorics</i>, vol. 12, no. 1. International Press of Boston,
    pp. 1–15, 2021.
  ista: Fox J, Luo S, Wigderson Y. 2021. Extremal and Ramsey results on graph blowups.
    Journal of Combinatorics. 12(1), 1–15.
  mla: Fox, Jacob, et al. “Extremal and Ramsey Results on Graph Blowups.” <i>Journal
    of Combinatorics</i>, vol. 12, no. 1, International Press of Boston, 2021, pp.
    1–15, doi:<a href="https://doi.org/10.4310/joc.2021.v12.n1.a1">10.4310/joc.2021.v12.n1.a1</a>.
  short: J. Fox, S. Luo, Y. Wigderson, Journal of Combinatorics 12 (2021) 1–15.
date_created: 2026-06-29T10:52:13Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2026-07-08T10:41:31Z
day: '01'
doi: 10.4310/joc.2021.v12.n1.a1
extern: '1'
external_id:
  arxiv:
  - '1912.08328'
fulldoi: https://doi.org/10.4310/joc.2021.v12.n1.a1
intvolume: '        12'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1912.08328
mathsc:
- 05C35
- 05C55
month: '01'
oa: 1
oa_version: Preprint
page: 1-15
publication: Journal of Combinatorics
publication_identifier:
  eissn:
  - 2150-959X
  issn:
  - 2156-3527
publication_status: published
publisher: International Press of Boston
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extremal and Ramsey results on graph blowups
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2021'
...
---
_id: '17132'
abstract:
- lang: eng
  text: <jats:p>Extracellular recording is an accessible technique used in animals
    and humans to study the brain physiology and pathology. As the number of recording
    channels and their density grows it is natural to ask how much improvement the
    additional channels bring in and how we can optimally use the new capabilities
    for monitoring the brain. Here we show that for any given distribution of electrodes
    we can establish exactly what information about current sources in the brain can
    be recovered and what information is strictly unobservable. We demonstrate this
    in the general setting of previously proposed kernel Current Source Density method
    and illustrate it with simplified examples as well as using evoked potentials
    from the barrel cortex obtained with a Neuropixels probe and with compatible model
    data. We show that with conceptual separation of the estimation space from experimental
    setup one can recover sources not accessible to standard methods.</jats:p>
article_number: e1008615
article_processing_charge: No
article_type: original
author:
- first_name: Chaitanya
  full_name: Chintaluri, Chaitanya
  id: BA06AFEE-A4BA-11EA-AE5C-14673DDC885E
  last_name: Chintaluri
  orcid: 0000-0003-4252-1608
- first_name: Marta
  full_name: Bejtka, Marta
  last_name: Bejtka
- first_name: Władysław
  full_name: Średniawa, Władysław
  last_name: Średniawa
- first_name: Michał
  full_name: Czerwiński, Michał
  last_name: Czerwiński
- first_name: Jakub M.
  full_name: Dzik, Jakub M.
  last_name: Dzik
- first_name: Joanna
  full_name: Jędrzejewska-Szmek, Joanna
  last_name: Jędrzejewska-Szmek
- first_name: Kacper
  full_name: Kondrakiewicz, Kacper
  last_name: Kondrakiewicz
- first_name: Ewa
  full_name: Kublik, Ewa
  last_name: Kublik
- first_name: Daniel K.
  full_name: Wójcik, Daniel K.
  last_name: Wójcik
citation:
  ama: Chintaluri C, Bejtka M, Średniawa W, et al. What we can and what we cannot
    see with extracellular multielectrodes. <i>PLOS Computational Biology</i>. 2021;17(5).
    doi:<a href="https://doi.org/10.1371/journal.pcbi.1008615">10.1371/journal.pcbi.1008615</a>
  apa: Chintaluri, C., Bejtka, M., Średniawa, W., Czerwiński, M., Dzik, J. M., Jędrzejewska-Szmek,
    J., … Wójcik, D. K. (2021). What we can and what we cannot see with extracellular
    multielectrodes. <i>PLOS Computational Biology</i>. Public Library of Science.
    <a href="https://doi.org/10.1371/journal.pcbi.1008615">https://doi.org/10.1371/journal.pcbi.1008615</a>
  chicago: Chintaluri, Chaitanya, Marta Bejtka, Władysław Średniawa, Michał Czerwiński,
    Jakub M. Dzik, Joanna Jędrzejewska-Szmek, Kacper Kondrakiewicz, Ewa Kublik, and
    Daniel K. Wójcik. “What We Can and What We Cannot See with Extracellular Multielectrodes.”
    <i>PLOS Computational Biology</i>. Public Library of Science, 2021. <a href="https://doi.org/10.1371/journal.pcbi.1008615">https://doi.org/10.1371/journal.pcbi.1008615</a>.
  ieee: C. Chintaluri <i>et al.</i>, “What we can and what we cannot see with extracellular
    multielectrodes,” <i>PLOS Computational Biology</i>, vol. 17, no. 5. Public Library
    of Science, 2021.
  ista: Chintaluri C, Bejtka M, Średniawa W, Czerwiński M, Dzik JM, Jędrzejewska-Szmek
    J, Kondrakiewicz K, Kublik E, Wójcik DK. 2021. What we can and what we cannot
    see with extracellular multielectrodes. PLOS Computational Biology. 17(5), e1008615.
  mla: Chintaluri, Chaitanya, et al. “What We Can and What We Cannot See with Extracellular
    Multielectrodes.” <i>PLOS Computational Biology</i>, vol. 17, no. 5, e1008615,
    Public Library of Science, 2021, doi:<a href="https://doi.org/10.1371/journal.pcbi.1008615">10.1371/journal.pcbi.1008615</a>.
  short: C. Chintaluri, M. Bejtka, W. Średniawa, M. Czerwiński, J.M. Dzik, J. Jędrzejewska-Szmek,
    K. Kondrakiewicz, E. Kublik, D.K. Wójcik, PLOS Computational Biology 17 (2021).
das_tickbox: '1'
date_created: 2024-06-11T14:43:37Z
date_published: 2021-05-14T00:00:00Z
date_updated: 2026-07-13T12:31:04Z
day: '14'
doi: 10.1371/journal.pcbi.1008615
extern: '1'
fulldoi: https://doi.org/10.1371/journal.pcbi.1008615
has_accepted_license: '1'
intvolume: '        17'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1371/journal.pcbi.1008615
month: '05'
oa: 1
oa_version: Published Version
publication: PLOS Computational Biology
publication_identifier:
  issn:
  - 1553-7358
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
status: public
title: What we can and what we cannot see with extracellular multielectrodes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '22169'
abstract:
- lang: eng
  text: A recent breakthrough of Conlon and Ferber yielded an exponential improvement
    on the lower bounds for multicolor diagonal Ramsey numbers. In this note, we modify
    their construction and obtain improved bounds for more than three colors.
article_processing_charge: No
article_type: original
author:
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  ama: Wigderson Y. An improved lower bound on multicolor Ramsey numbers. <i>Proceedings
    of the American Mathematical Society</i>. 2021;149(6):2371-2374. doi:<a href="https://doi.org/10.1090/proc/15447">10.1090/proc/15447</a>
  apa: Wigderson, Y. (2021). An improved lower bound on multicolor Ramsey numbers.
    <i>Proceedings of the American Mathematical Society</i>. American Mathematical
    Society. <a href="https://doi.org/10.1090/proc/15447">https://doi.org/10.1090/proc/15447</a>
  chicago: Wigderson, Yuval. “An Improved Lower Bound on Multicolor Ramsey Numbers.”
    <i>Proceedings of the American Mathematical Society</i>. American Mathematical
    Society, 2021. <a href="https://doi.org/10.1090/proc/15447">https://doi.org/10.1090/proc/15447</a>.
  ieee: Y. Wigderson, “An improved lower bound on multicolor Ramsey numbers,” <i>Proceedings
    of the American Mathematical Society</i>, vol. 149, no. 6. American Mathematical
    Society, pp. 2371–2374, 2021.
  ista: Wigderson Y. 2021. An improved lower bound on multicolor Ramsey numbers. Proceedings
    of the American Mathematical Society. 149(6), 2371–2374.
  mla: Wigderson, Yuval. “An Improved Lower Bound on Multicolor Ramsey Numbers.” <i>Proceedings
    of the American Mathematical Society</i>, vol. 149, no. 6, American Mathematical
    Society, 2021, pp. 2371–74, doi:<a href="https://doi.org/10.1090/proc/15447">10.1090/proc/15447</a>.
  short: Y. Wigderson, Proceedings of the American Mathematical Society 149 (2021)
    2371–2374.
date_created: 2026-06-29T10:55:23Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2026-07-14T08:42:59Z
day: '01'
doi: 10.1090/proc/15447
extern: '1'
external_id:
  unknown:
  - '2009.12020'
fulldoi: https://doi.org/10.1090/proc/15447
intvolume: '       149'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2009.12020
month: '06'
oa: 1
oa_version: Preprint
page: 2371-2374
publication: Proceedings of the American Mathematical Society
publication_identifier:
  eissn:
  - 1088-6826
  issn:
  - 0002-9939
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: An improved lower bound on multicolor Ramsey numbers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 149
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '22175'
abstract:
- lang: eng
  text: We show how a number of well-known uncertainty principles for the Fourier
    transform, such as the Heisenberg uncertainty principle, the Donoho–Stark uncertainty
    principle, and Meshulam’s nonabelian uncertainty principle, have little to do
    with the structure of the Fourier transform itself. Rather, all of these results
    follow from very weak properties of the Fourier transform (shared by numerous
    linear operators), namely that it is bounded as an operator  L1 → L∞, and that
    it is unitary. Using a single, simple proof template, and only these (or weaker)
    properties, we obtain some new proofs and many generalizations of these basic
    uncertainty principles, to new operators and to new settings, in a completely
    unified way. Together with our general overview, this paper can also serve as
    a survey of the many facets of the phenomena known as uncertainty principles.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Avi
  full_name: Wigderson, Avi
  last_name: Wigderson
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  ama: 'Wigderson A, Wigderson Y. The uncertainty principle: Variations on a theme.
    <i>Bulletin of the American Mathematical Society</i>. 2021;58(2):225-261. doi:<a
    href="https://doi.org/10.1090/bull/1715">10.1090/bull/1715</a>'
  apa: 'Wigderson, A., &#38; Wigderson, Y. (2021). The uncertainty principle: Variations
    on a theme. <i>Bulletin of the American Mathematical Society</i>. American Mathematical
    Society. <a href="https://doi.org/10.1090/bull/1715">https://doi.org/10.1090/bull/1715</a>'
  chicago: 'Wigderson, Avi, and Yuval Wigderson. “The Uncertainty Principle: Variations
    on a Theme.” <i>Bulletin of the American Mathematical Society</i>. American Mathematical
    Society, 2021. <a href="https://doi.org/10.1090/bull/1715">https://doi.org/10.1090/bull/1715</a>.'
  ieee: 'A. Wigderson and Y. Wigderson, “The uncertainty principle: Variations on
    a theme,” <i>Bulletin of the American Mathematical Society</i>, vol. 58, no. 2.
    American Mathematical Society, pp. 225–261, 2021.'
  ista: 'Wigderson A, Wigderson Y. 2021. The uncertainty principle: Variations on
    a theme. Bulletin of the American Mathematical Society. 58(2), 225–261.'
  mla: 'Wigderson, Avi, and Yuval Wigderson. “The Uncertainty Principle: Variations
    on a Theme.” <i>Bulletin of the American Mathematical Society</i>, vol. 58, no.
    2, American Mathematical Society, 2021, pp. 225–61, doi:<a href="https://doi.org/10.1090/bull/1715">10.1090/bull/1715</a>.'
  short: A. Wigderson, Y. Wigderson, Bulletin of the American Mathematical Society
    58 (2021) 225–261.
date_created: 2026-06-29T10:57:49Z
date_published: 2021-01-04T00:00:00Z
date_updated: 2026-07-14T09:02:39Z
day: '04'
doi: 10.1090/bull/1715
extern: '1'
external_id:
  arxiv:
  - '2006.11206'
fulldoi: https://doi.org/10.1090/bull/1715
intvolume: '        58'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2006.11206
mathsc:
- 81S07
- 43A25
- 20C15
- 94A12
month: '01'
oa: 1
oa_version: Preprint
page: 225-261
publication: Bulletin of the American Mathematical Society
publication_identifier:
  eissn:
  - 1088-9485
  issn:
  - 0273-0979
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The uncertainty principle: Variations on a theme'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2021'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '22207'
abstract:
- lang: eng
  text: Phase separation is a ubiquitous process and finds applications in a variety
    of biological, organic, and inorganic systems. Nature has evolved the ability
    to control phase separation to both regulate cellular processes and make composite
    materials with outstanding mechanical and optical properties. Striking examples
    of the latter are the vibrant blue and green feathers of many bird species, which
    are thought to result from an exquisite control of the size and spatial correlations
    of their phase-separated microstructures. By contrast, it is much harder for material
    scientists to arrest and control phase separation in synthetic materials with
    such a high level of precision at these length scales. In this Perspective, we
    briefly review some established methods to control liquid–liquid phase separation
    processes and then highlight the emergence of a promising arrest method based
    on phase separation in an elastic polymer network. Finally, we discuss upcoming
    challenges and opportunities for fabricating microstructured materials via mechanically
    controlled phase separation.
article_processing_charge: No
article_type: original
author:
- first_name: Carla
  full_name: Fernández-Rico, Carla
  id: 492def71-6250-11f0-b278-d41dbd241b62
  last_name: Fernández-Rico
- first_name: Tianqi
  full_name: Sai, Tianqi
  last_name: Sai
- first_name: Alba
  full_name: Sicher, Alba
  last_name: Sicher
- first_name: Robert W.
  full_name: Style, Robert W.
  last_name: Style
- first_name: Eric R.
  full_name: Dufresne, Eric R.
  last_name: Dufresne
citation:
  ama: Fernández-Rico C, Sai T, Sicher A, Style RW, Dufresne ER. Putting the squeeze
    on phase separation. <i>JACS Au</i>. 2021;2(1):66-73. doi:<a href="https://doi.org/10.1021/jacsau.1c00443">10.1021/jacsau.1c00443</a>
  apa: Fernández-Rico, C., Sai, T., Sicher, A., Style, R. W., &#38; Dufresne, E. R.
    (2021). Putting the squeeze on phase separation. <i>JACS Au</i>. American Chemical
    Society. <a href="https://doi.org/10.1021/jacsau.1c00443">https://doi.org/10.1021/jacsau.1c00443</a>
  chicago: Fernández-Rico, Carla, Tianqi Sai, Alba Sicher, Robert W. Style, and Eric
    R. Dufresne. “Putting the Squeeze on Phase Separation.” <i>JACS Au</i>. American
    Chemical Society, 2021. <a href="https://doi.org/10.1021/jacsau.1c00443">https://doi.org/10.1021/jacsau.1c00443</a>.
  ieee: C. Fernández-Rico, T. Sai, A. Sicher, R. W. Style, and E. R. Dufresne, “Putting
    the squeeze on phase separation,” <i>JACS Au</i>, vol. 2, no. 1. American Chemical
    Society, pp. 66–73, 2021.
  ista: Fernández-Rico C, Sai T, Sicher A, Style RW, Dufresne ER. 2021. Putting the
    squeeze on phase separation. JACS Au. 2(1), 66–73.
  mla: Fernández-Rico, Carla, et al. “Putting the Squeeze on Phase Separation.” <i>JACS
    Au</i>, vol. 2, no. 1, American Chemical Society, 2021, pp. 66–73, doi:<a href="https://doi.org/10.1021/jacsau.1c00443">10.1021/jacsau.1c00443</a>.
  short: C. Fernández-Rico, T. Sai, A. Sicher, R.W. Style, E.R. Dufresne, JACS Au
    2 (2021) 66–73.
date_created: 2026-06-30T06:30:18Z
date_published: 2021-12-10T00:00:00Z
date_updated: 2026-07-15T05:55:35Z
day: '10'
ddc:
- '540'
doi: 10.1021/jacsau.1c00443
extern: '1'
external_id:
  pmid:
  - '35098222'
fulldoi: https://doi.org/10.1021/jacsau.1c00443
has_accepted_license: '1'
intvolume: '         2'
issue: '1'
keyword:
- phase separation
- arrest
- bird feathers
- elasticity
- polymer networks
- microstructured materials
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1021/jacsau.1c00443
month: '12'
oa: 1
oa_version: Published Version
page: 66-73
pmid: 1
publication: JACS Au
publication_identifier:
  eissn:
  - 2691-3704
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Putting the squeeze on phase separation
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22211'
abstract:
- lang: eng
  text: Hierarchically self-assembled materials—structures with order at multiple
    length scales—can be found everywhere. Examples range from collagen structures
    in human bones to engineered photonic materials. These structures usually assemble
    from monodisperse microscopic building blocks that interact via complex directional
    interactions. In this work, we show that hierarchical materials can, in fact,
    also be assembled from polydisperse building blocks and by entropic interactions
    alone. Our simple yet powerful assembly mechanism opens up avenues toward rationally
    exploiting the often undesired polydispersity of colloidal building blocks for
    programming entropy-driven self-assembly of hierarchical materials.
article_number: e2107241118
article_processing_charge: No
article_type: original
author:
- first_name: Carla
  full_name: Fernández-Rico, Carla
  id: 492def71-6250-11f0-b278-d41dbd241b62
  last_name: Fernández-Rico
- first_name: Roel P. A.
  full_name: Dullens, Roel P. A.
  last_name: Dullens
citation:
  ama: Fernández-Rico C, Dullens RPA. Hierarchical self-assembly of polydisperse colloidal
    bananas into a two-dimensional vortex phase. <i>Proceedings of the National Academy
    of Sciences</i>. 2021;118(33). doi:<a href="https://doi.org/10.1073/pnas.2107241118">10.1073/pnas.2107241118</a>
  apa: Fernández-Rico, C., &#38; Dullens, R. P. A. (2021). Hierarchical self-assembly
    of polydisperse colloidal bananas into a two-dimensional vortex phase. <i>Proceedings
    of the National Academy of Sciences</i>. National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.2107241118">https://doi.org/10.1073/pnas.2107241118</a>
  chicago: Fernández-Rico, Carla, and Roel P. A. Dullens. “Hierarchical Self-Assembly
    of Polydisperse Colloidal Bananas into a Two-Dimensional Vortex Phase.” <i>Proceedings
    of the National Academy of Sciences</i>. National Academy of Sciences, 2021. <a
    href="https://doi.org/10.1073/pnas.2107241118">https://doi.org/10.1073/pnas.2107241118</a>.
  ieee: C. Fernández-Rico and R. P. A. Dullens, “Hierarchical self-assembly of polydisperse
    colloidal bananas into a two-dimensional vortex phase,” <i>Proceedings of the
    National Academy of Sciences</i>, vol. 118, no. 33. National Academy of Sciences,
    2021.
  ista: Fernández-Rico C, Dullens RPA. 2021. Hierarchical self-assembly of polydisperse
    colloidal bananas into a two-dimensional vortex phase. Proceedings of the National
    Academy of Sciences. 118(33), e2107241118.
  mla: Fernández-Rico, Carla, and Roel P. A. Dullens. “Hierarchical Self-Assembly
    of Polydisperse Colloidal Bananas into a Two-Dimensional Vortex Phase.” <i>Proceedings
    of the National Academy of Sciences</i>, vol. 118, no. 33, e2107241118, National
    Academy of Sciences, 2021, doi:<a href="https://doi.org/10.1073/pnas.2107241118">10.1073/pnas.2107241118</a>.
  short: C. Fernández-Rico, R.P.A. Dullens, Proceedings of the National Academy of
    Sciences 118 (2021).
date_created: 2026-06-30T06:31:50Z
date_published: 2021-08-13T00:00:00Z
date_updated: 2026-07-15T07:02:38Z
day: '13'
ddc:
- '540'
doi: 10.1073/pnas.2107241118
extern: '1'
external_id:
  pmid:
  - '34389681'
fulldoi: https://doi.org/10.1073/pnas.2107241118
has_accepted_license: '1'
intvolume: '       118'
issue: '33'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1073/pnas.2107241118
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
  eissn:
  - 1091-6490
  issn:
  - 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hierarchical self-assembly of polydisperse colloidal bananas into a two-dimensional
  vortex phase
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 118
year: '2021'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22217'
abstract:
- lang: eng
  text: Surface roughness plays an important role in determining the mechanical properties,
    wettability, and self-assembly in colloidal systems. In this work, we develop
    a simple and fast method to produce rough colloidal SU-8 rods, bananas, and spheres,
    via the nanoprecipitation of SU-8 in water. During this process, SU-8 nanospheres
    are absorbed onto the surface of the colloidal SU-8 particles and then cross-linked
    using UV-light. The size of the spherical asperities and the asperity density
    are controlled by the concentration of SU-8 used during the nanoprecipitation
    reaction. Fluorescent labeling of the rough SU-8 colloidal particles allows for
    their confocal imaging, which demonstrates their stability at high packing fractions.
    With these newly developed rough particles, we provide a colloidal model system
    that allows for studies addressing the impact of surface roughness on materials
    composed of anisotropic particles.
article_processing_charge: No
article_type: original
author:
- first_name: Carla
  full_name: Fernández-Rico, Carla
  id: 492def71-6250-11f0-b278-d41dbd241b62
  last_name: Fernández-Rico
- first_name: Jeffrey S.
  full_name: Urbach, Jeffrey S.
  last_name: Urbach
- first_name: Roel P. A.
  full_name: Dullens, Roel P. A.
  last_name: Dullens
citation:
  ama: Fernández-Rico C, Urbach JS, Dullens RPA. Synthesis of rough colloidal SU-8
    rods and bananas via nanoprecipitation. <i>Langmuir</i>. 2021;37(9):2900-2906.
    doi:<a href="https://doi.org/10.1021/acs.langmuir.0c03361">10.1021/acs.langmuir.0c03361</a>
  apa: Fernández-Rico, C., Urbach, J. S., &#38; Dullens, R. P. A. (2021). Synthesis
    of rough colloidal SU-8 rods and bananas via nanoprecipitation. <i>Langmuir</i>.
    American Chemical Society. <a href="https://doi.org/10.1021/acs.langmuir.0c03361">https://doi.org/10.1021/acs.langmuir.0c03361</a>
  chicago: Fernández-Rico, Carla, Jeffrey S. Urbach, and Roel P. A. Dullens. “Synthesis
    of Rough Colloidal SU-8 Rods and Bananas via Nanoprecipitation.” <i>Langmuir</i>.
    American Chemical Society, 2021. <a href="https://doi.org/10.1021/acs.langmuir.0c03361">https://doi.org/10.1021/acs.langmuir.0c03361</a>.
  ieee: C. Fernández-Rico, J. S. Urbach, and R. P. A. Dullens, “Synthesis of rough
    colloidal SU-8 rods and bananas via nanoprecipitation,” <i>Langmuir</i>, vol.
    37, no. 9. American Chemical Society, pp. 2900–2906, 2021.
  ista: Fernández-Rico C, Urbach JS, Dullens RPA. 2021. Synthesis of rough colloidal
    SU-8 rods and bananas via nanoprecipitation. Langmuir. 37(9), 2900–2906.
  mla: Fernández-Rico, Carla, et al. “Synthesis of Rough Colloidal SU-8 Rods and Bananas
    via Nanoprecipitation.” <i>Langmuir</i>, vol. 37, no. 9, American Chemical Society,
    2021, pp. 2900–06, doi:<a href="https://doi.org/10.1021/acs.langmuir.0c03361">10.1021/acs.langmuir.0c03361</a>.
  short: C. Fernández-Rico, J.S. Urbach, R.P.A. Dullens, Langmuir 37 (2021) 2900–2906.
date_created: 2026-06-30T06:36:01Z
date_published: 2021-02-26T00:00:00Z
date_updated: 2026-07-15T07:48:42Z
day: '26'
ddc:
- '540'
doi: 10.1021/acs.langmuir.0c03361
extern: '1'
external_id:
  pmid:
  - '33635671'
fulldoi: https://doi.org/10.1021/acs.langmuir.0c03361
has_accepted_license: '1'
intvolume: '        37'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1021/acs.langmuir.0c03361
month: '02'
oa: 1
oa_version: Published Version
page: 2900-2906
pmid: 1
publication: Langmuir
publication_identifier:
  eissn:
  - 1520-5827
  issn:
  - 0743-7463
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesis of rough colloidal SU-8 rods and bananas via nanoprecipitation
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2021'
...
---
OA_place: publisher
OA_type: free access
_id: '9168'
abstract:
- lang: eng
  text: Interspecific crossing experiments have shown that sex chromosomes play a
    major role in reproductive isolation between many pairs of species. However, their
    ability to act as reproductive barriers, which hamper interspecific genetic exchange,
    has rarely been evaluated quantitatively compared to Autosomes. This genome-wide
    limitation of gene flow is essential for understanding the complete separation
    of species, and thus speciation. Here, we develop a mainland-island model of secondary
    contact between hybridizing species of an XY (or ZW) sexual system. We obtain
    theoretical predictions for the frequency of introgressed alleles, and the strength
    of the barrier to neutral gene flow for the two types of chromosomes carrying
    multiple interspecific barrier loci. Theoretical predictions are obtained for
    scenarios where introgressed alleles are rare. We show that the same analytical
    expressions apply for sex chromosomes and autosomes, but with different sex-averaged
    effective parameters. The specific features of sex chromosomes (hemizygosity and
    absence of recombination in the heterogametic sex) lead to reduced levels of introgression
    on the X (or Z) compared to autosomes. This effect can be enhanced by certain
    types of sex-biased forces, but it remains overall small (except when alleles
    causing incompatibilities are recessive). We discuss these predictions in the
    light of empirical data comprising model-based tests of introgression and cline
    surveys in various biological systems.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "The computations were performed with the IST Austria High-Performance
  Computing (HPC) Cluster and the Institut Français de Bioinformatique (IFB) Core
  Cluster. We are grateful to Nick Barton and Beatriz Vicoso for critical comments
  on the model and the manuscript. We also thank Brian Charlesworth, Stuart Baird,
  and an anonymous reviewer for insightful comments.\r\nC.F. was supported by an Austrian
  Science Foundation FWF grant (Project M 2463-B29)."
article_number: iyaa025
article_processing_charge: No
article_type: original
author:
- first_name: Christelle
  full_name: Fraisse, Christelle
  id: 32DF5794-F248-11E8-B48F-1D18A9856A87
  last_name: Fraisse
  orcid: 0000-0001-8441-5075
- first_name: Himani
  full_name: Sachdeva, Himani
  id: 42377A0A-F248-11E8-B48F-1D18A9856A87
  last_name: Sachdeva
citation:
  ama: 'Fraisse C, Sachdeva H. The rates of introgression and barriers to genetic
    exchange between hybridizing species: Sex chromosomes vs autosomes. <i>Genetics</i>.
    2021;217(2). doi:<a href="https://doi.org/10.1093/genetics/iyaa025">10.1093/genetics/iyaa025</a>'
  apa: 'Fraisse, C., &#38; Sachdeva, H. (2021). The rates of introgression and barriers
    to genetic exchange between hybridizing species: Sex chromosomes vs autosomes.
    <i>Genetics</i>. Genetics Society of America. <a href="https://doi.org/10.1093/genetics/iyaa025">https://doi.org/10.1093/genetics/iyaa025</a>'
  chicago: 'Fraisse, Christelle, and Himani Sachdeva. “The Rates of Introgression
    and Barriers to Genetic Exchange between Hybridizing Species: Sex Chromosomes
    vs Autosomes.” <i>Genetics</i>. Genetics Society of America, 2021. <a href="https://doi.org/10.1093/genetics/iyaa025">https://doi.org/10.1093/genetics/iyaa025</a>.'
  ieee: 'C. Fraisse and H. Sachdeva, “The rates of introgression and barriers to genetic
    exchange between hybridizing species: Sex chromosomes vs autosomes,” <i>Genetics</i>,
    vol. 217, no. 2. Genetics Society of America, 2021.'
  ista: 'Fraisse C, Sachdeva H. 2021. The rates of introgression and barriers to genetic
    exchange between hybridizing species: Sex chromosomes vs autosomes. Genetics.
    217(2), iyaa025.'
  mla: 'Fraisse, Christelle, and Himani Sachdeva. “The Rates of Introgression and
    Barriers to Genetic Exchange between Hybridizing Species: Sex Chromosomes vs Autosomes.”
    <i>Genetics</i>, vol. 217, no. 2, iyaa025, Genetics Society of America, 2021,
    doi:<a href="https://doi.org/10.1093/genetics/iyaa025">10.1093/genetics/iyaa025</a>.'
  short: C. Fraisse, H. Sachdeva, Genetics 217 (2021).
corr_author: '1'
date_created: 2021-02-18T14:41:30Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2026-07-28T12:39:03Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/genetics/iyaa025
external_id:
  isi:
  - '000637218100005'
  pmid:
  - '33724409'
fulldoi: https://doi.org/10.1093/genetics/iyaa025
intvolume: '       217'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1093/genetics/iyaa025
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 2662AADE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02463
  name: Sex chromosomes and species barriers
publication: Genetics
publication_identifier:
  issn:
  - 1943-2631
publication_status: published
publisher: Genetics Society of America
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The rates of introgression and barriers to genetic exchange between hybridizing
  species: Sex chromosomes vs autosomes'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 217
year: '2021'
...
---
OA_place: publisher
OA_type: free access
_id: '9793'
abstract:
- lang: eng
  text: Astrocytes extensively infiltrate the neuropil to regulate critical aspects
    of synaptic development and function. This process is regulated by transcellular
    interactions between astrocytes and neurons via cell adhesion molecules. How astrocytes
    coordinate developmental processes among one another to parse out the synaptic
    neuropil and form non-overlapping territories is unknown. Here we identify a molecular
    mechanism regulating astrocyte-astrocyte interactions during development to coordinate
    astrocyte morphogenesis and gap junction coupling. We show that hepaCAM, a disease-linked,
    astrocyte-enriched cell adhesion molecule, regulates astrocyte competition for
    territory and morphological complexity in the developing mouse cortex. Furthermore,
    conditional deletion of Hepacam from developing astrocytes significantly impairs
    gap junction coupling between astrocytes and disrupts the balance between synaptic
    excitation and inhibition. Mutations in HEPACAM cause megalencephalic leukoencephalopathy
    with subcortical cysts in humans. Therefore, our findings suggest that disruption
    of astrocyte self-organization mechanisms could be an underlying cause of neural
    pathology.
acknowledgement: This work was supported by the National Institutes of Health (R01
  DA047258 and R01 NS102237 to C.E., F32 NS100392 to K.T.B.) and the Holland-Trice
  Brain Research Award (to C.E.). K.T.B. was supported by postdoctoral fellowships
  from the Foerster-Bernstein Family and The Hartwell Foundation. The Hippenmeyer
  lab was supported by the European Research Council (ERC) under the European Union’s
  Horizon 2020 research and innovations program (725780 LinPro) to S.H. R.E. was supported
  by Ministerio de Ciencia y Tecnología (RTI2018-093493-B-I00). We thank the Duke
  Light Microscopy Core Facility, the Duke Transgenic Mouse Facility, Dr. U. Schulte
  for assistance with proteomic experiments, and Dr. D. Silver for critical review
  of the manuscript. Cartoon elements of figure panels were created using BioRender.com.
article_processing_charge: No
article_type: original
author:
- first_name: Katherine T.
  full_name: Baldwin, Katherine T.
  last_name: Baldwin
- first_name: Christabel X.
  full_name: Tan, Christabel X.
  last_name: Tan
- first_name: Samuel T.
  full_name: Strader, Samuel T.
  last_name: Strader
- first_name: Changyu
  full_name: Jiang, Changyu
  last_name: Jiang
- first_name: Justin T.
  full_name: Savage, Justin T.
  last_name: Savage
- first_name: Xabier
  full_name: Elorza-Vidal, Xabier
  last_name: Elorza-Vidal
- first_name: Ximena
  full_name: Contreras, Ximena
  id: 475990FE-F248-11E8-B48F-1D18A9856A87
  last_name: Contreras
- first_name: Thomas
  full_name: Rülicke, Thomas
  last_name: Rülicke
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
- first_name: Raúl
  full_name: Estévez, Raúl
  last_name: Estévez
- first_name: Ru-Rong
  full_name: Ji, Ru-Rong
  last_name: Ji
- first_name: Cagla
  full_name: Eroglu, Cagla
  last_name: Eroglu
citation:
  ama: Baldwin KT, Tan CX, Strader ST, et al. HepaCAM controls astrocyte self-organization
    and coupling. <i>Neuron</i>. 2021;109(15):2427-2442.e10. doi:<a href="https://doi.org/10.1016/j.neuron.2021.05.025">10.1016/j.neuron.2021.05.025</a>
  apa: Baldwin, K. T., Tan, C. X., Strader, S. T., Jiang, C., Savage, J. T., Elorza-Vidal,
    X., … Eroglu, C. (2021). HepaCAM controls astrocyte self-organization and coupling.
    <i>Neuron</i>. Elsevier. <a href="https://doi.org/10.1016/j.neuron.2021.05.025">https://doi.org/10.1016/j.neuron.2021.05.025</a>
  chicago: Baldwin, Katherine T., Christabel X. Tan, Samuel T. Strader, Changyu Jiang,
    Justin T. Savage, Xabier Elorza-Vidal, Ximena Contreras, et al. “HepaCAM Controls
    Astrocyte Self-Organization and Coupling.” <i>Neuron</i>. Elsevier, 2021. <a href="https://doi.org/10.1016/j.neuron.2021.05.025">https://doi.org/10.1016/j.neuron.2021.05.025</a>.
  ieee: K. T. Baldwin <i>et al.</i>, “HepaCAM controls astrocyte self-organization
    and coupling,” <i>Neuron</i>, vol. 109, no. 15. Elsevier, p. 2427–2442.e10, 2021.
  ista: Baldwin KT, Tan CX, Strader ST, Jiang C, Savage JT, Elorza-Vidal X, Contreras
    X, Rülicke T, Hippenmeyer S, Estévez R, Ji R-R, Eroglu C. 2021. HepaCAM controls
    astrocyte self-organization and coupling. Neuron. 109(15), 2427–2442.e10.
  mla: Baldwin, Katherine T., et al. “HepaCAM Controls Astrocyte Self-Organization
    and Coupling.” <i>Neuron</i>, vol. 109, no. 15, Elsevier, 2021, p. 2427–2442.e10,
    doi:<a href="https://doi.org/10.1016/j.neuron.2021.05.025">10.1016/j.neuron.2021.05.025</a>.
  short: K.T. Baldwin, C.X. Tan, S.T. Strader, C. Jiang, J.T. Savage, X. Elorza-Vidal,
    X. Contreras, T. Rülicke, S. Hippenmeyer, R. Estévez, R.-R. Ji, C. Eroglu, Neuron
    109 (2021) 2427–2442.e10.
date_created: 2021-08-06T09:08:25Z
date_published: 2021-08-04T00:00:00Z
date_updated: 2026-07-28T12:30:05Z
day: '04'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1016/j.neuron.2021.05.025
ec_funded: 1
external_id:
  isi:
  - '000692851900010'
  pmid:
  - '34171291'
fulldoi: https://doi.org/10.1016/j.neuron.2021.05.025
intvolume: '       109'
isi: 1
issue: '15'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.neuron.2021.05.025
month: '08'
oa: 1
oa_version: Published Version
page: 2427-2442.e10
pmid: 1
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '725780'
  name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
publication: Neuron
publication_identifier:
  eissn:
  - 1097-4199
  issn:
  - 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: HepaCAM controls astrocyte self-organization and coupling
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 109
year: '2021'
...
