---
OA_place: repository
OA_type: green
_id: '19511'
abstract:
- lang: eng
  text: We introduce QuaRot, a new Quantization scheme based on Rotations, which is
    able to quantize LLMs end-to-end, including all weights, activations, and KV cache
    in 4 bits. QuaRot rotates LLMs in a way that removes outliers from the hidden
    state without changing the output, making quantization easier. This computational
    invariance is applied to the hidden state (residual) of the LLM, as well as to
    the activations of the feed-forward components, aspects of the attention mechanism,
    and to the KV cache. The result is a quantized model where all matrix multiplications
    are performed in 4 bits, without any channels identified for retention in higher
    precision. Our 4-bit quantized LLAMA2-70B model has losses of at most 0.47 WikiText-2
    perplexity and retains 99% of the zero-shot performance. We also show that QuaRot
    can provide lossless 6 and 8 bit LLAMA-2 models without any calibration data using
    round-to-nearest quantization. Code is available at github.com/spcl/QuaRot.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Saleh
  full_name: Ashkboos, Saleh
  last_name: Ashkboos
- first_name: Amirkeivan
  full_name: Mohtashami, Amirkeivan
  last_name: Mohtashami
- first_name: Maximilian L.
  full_name: Croci, Maximilian L.
  last_name: Croci
- first_name: Bo
  full_name: Li, Bo
  last_name: Li
- first_name: Pashmina
  full_name: Cameron, Pashmina
  last_name: Cameron
- first_name: Martin
  full_name: Jaggi, Martin
  last_name: Jaggi
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: Torsten
  full_name: Hoefler, Torsten
  last_name: Hoefler
- first_name: James
  full_name: Hensman, James
  last_name: Hensman
citation:
  ama: 'Ashkboos S, Mohtashami A, Croci ML, et al. QuaRot: Outlier-free 4-bit inference
    in rotated LLMs. In: <i>38th Conference on Neural Information Processing Systems</i>.
    Vol 37. Neural Information Processing Systems Foundation; 2024.'
  apa: 'Ashkboos, S., Mohtashami, A., Croci, M. L., Li, B., Cameron, P., Jaggi, M.,
    … Hensman, J. (2024). QuaRot: Outlier-free 4-bit inference in rotated LLMs. In
    <i>38th Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver,
    Canada: Neural Information Processing Systems Foundation.'
  chicago: 'Ashkboos, Saleh, Amirkeivan Mohtashami, Maximilian L. Croci, Bo Li, Pashmina
    Cameron, Martin Jaggi, Dan-Adrian Alistarh, Torsten Hoefler, and James Hensman.
    “QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs.” In <i>38th Conference
    on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing
    Systems Foundation, 2024.'
  ieee: 'S. Ashkboos <i>et al.</i>, “QuaRot: Outlier-free 4-bit inference in rotated
    LLMs,” in <i>38th Conference on Neural Information Processing Systems</i>, Vancouver,
    Canada, 2024, vol. 37.'
  ista: 'Ashkboos S, Mohtashami A, Croci ML, Li B, Cameron P, Jaggi M, Alistarh D-A,
    Hoefler T, Hensman J. 2024. QuaRot: Outlier-free 4-bit inference in rotated LLMs.
    38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information
    Processing Systems, Advances in Neural Information Processing Systems, vol. 37.'
  mla: 'Ashkboos, Saleh, et al. “QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs.”
    <i>38th Conference on Neural Information Processing Systems</i>, vol. 37, Neural
    Information Processing Systems Foundation, 2024.'
  short: S. Ashkboos, A. Mohtashami, M.L. Croci, B. Li, P. Cameron, M. Jaggi, D.-A.
    Alistarh, T. Hoefler, J. Hensman, in:, 38th Conference on Neural Information Processing
    Systems, Neural Information Processing Systems Foundation, 2024.
conference:
  end_date: 2024-12-15
  location: Vancouver, Canada
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2024-12-09
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2025-05-14T11:33:12Z
day: '20'
department:
- _id: DaAl
external_id:
  arxiv:
  - '2404.00456'
intvolume: '        37'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2404.00456
month: '12'
oa: 1
oa_version: Preprint
publication: 38th 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:
  link:
  - relation: software
    url: https://github.com/spcl/QuaRot
scopus_import: '1'
status: public
title: 'QuaRot: Outlier-free 4-bit inference in rotated LLMs'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19512'
abstract:
- lang: eng
  text: "Differential privacy with gradual expiration models the setting where data
    items\r\narrive in a stream and at a given time t the privacy loss guaranteed
    for a data item\r\nseen at time (t − d) is εg(d), where g is a monotonically non-decreasing
    function.\r\nWe study the fundamental continual (binary) counting problem where
    each data\r\nitem consists of a bit, and the algorithm needs to output at each
    time step the sum of\r\nall the bits streamed so far. For a stream of length T
    and privacy without expiration\r\ncontinual counting is possible with maximum
    (over all time steps) additive error\r\nO(log2\r\n(T)/ε) and the best known lower
    bound is Ω(log(T)/ε); closing this gap\r\nis a challenging open problem.\r\nWe
    show that the situation is very different for privacy with gradual expiration
    by\r\ngiving upper and lower bounds for a large set of expiration functions g.
    Specifically,\r\nour algorithm achieves an additive error of O(log(T)/ε) for a
    large set of privacy\r\nexpiration functions. We also give a lower bound that
    shows that if C is the additive\r\nerror of any ε-DP algorithm for this problem,
    then the product of C and the privacy\r\nexpiration function after 2C steps must
    be Ω(log(T)/ε). Our algorithm matches\r\nthis lower bound as its additive error
    is O(log(T)/ε), even when g(2C) = O(1).\r\nOur empirical evaluation shows that
    we achieve a slowly growing privacy loss\r\nwith significantly smaller empirical
    privacy loss for large values of d than a natural\r\nbaseline algorithm."
acknowledgement: 'Monika Henzinger: This project has received funding from the European
  Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
  programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant
  DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with
  additional funding from the netidee SCIENCE Stiftung, 2020–2024. Joel Daniel Andersson
  and Rasmus Pagh are affiliated with Basic Algorithms Research Copenhagen (BARC),
  supported by the VILLUM Foundation grant 16582, and are also supported by Providentia,
  a Data Science Distinguished Investigator grant from Novo Nordisk Fonden. Teresa
  Anna Steiner is supported by a research grant (VIL51463) from VILLUM FONDEN. This
  work was done while Teresa Anna Steiner was a Postdoc at the Technical University
  of Denmark. Jalaj Upadhyay’s research was funded by the Rutgers Decanal Grant no.
  302918 and an unrestricted gift from Google.'
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Joel Daniel
  full_name: Andersson, Joel Daniel
  last_name: Andersson
- 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: Rasmus
  full_name: Pagh, Rasmus
  last_name: Pagh
- first_name: Teresa Anna
  full_name: Steiner, Teresa Anna
  last_name: Steiner
- first_name: Jalaj
  full_name: Upadhyay, Jalaj
  last_name: Upadhyay
citation:
  ama: 'Andersson JD, Henzinger M, Pagh R, Steiner TA, Upadhyay J. Continual counting
    with gradual privacy expiration. In: <i>38th Conference on Neural Information
    Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation;
    2024.'
  apa: 'Andersson, J. D., Henzinger, M., Pagh, R., Steiner, T. A., &#38; Upadhyay,
    J. (2024). Continual counting with gradual privacy expiration. In <i>38th Conference
    on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural
    Information Processing Systems Foundation.'
  chicago: Andersson, Joel Daniel, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner,
    and Jalaj Upadhyay. “Continual Counting with Gradual Privacy Expiration.” In <i>38th
    Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information
    Processing Systems Foundation, 2024.
  ieee: J. D. Andersson, M. Henzinger, R. Pagh, T. A. Steiner, and J. Upadhyay, “Continual
    counting with gradual privacy expiration,” in <i>38th Conference on Neural Information
    Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.
  ista: 'Andersson JD, Henzinger M, Pagh R, Steiner TA, Upadhyay J. 2024. Continual
    counting with gradual privacy expiration. 38th Conference on Neural Information
    Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in
    Neural Information Processing Systems, vol. 37.'
  mla: Andersson, Joel Daniel, et al. “Continual Counting with Gradual Privacy Expiration.”
    <i>38th Conference on Neural Information Processing Systems</i>, vol. 37, Neural
    Information Processing Systems Foundation, 2024.
  short: J.D. Andersson, M. Henzinger, R. Pagh, T.A. Steiner, J. Upadhyay, in:, 38th
    Conference on Neural Information Processing Systems, Neural Information Processing
    Systems Foundation, 2024.
conference:
  end_date: 2024-12-15
  location: Vancouver, Canada
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2024-12-09
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2025-05-14T11:33:22Z
day: '20'
department:
- _id: MoHe
ec_funded: 1
external_id:
  arxiv:
  - '2406.03802'
intvolume: '        37'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2406.03802
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
  call_identifier: H2020
  grant_number: '101019564'
  name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
  grant_number: Z00422
  name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
  grant_number: I05982
  name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
  grant_number: P33775
  name: Fast Algorithms for a Reactive Network Layer
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Continual counting with gradual privacy expiration
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19515'
abstract:
- lang: eng
  text: "Neural models learn data representations that lie on low-dimensional manifolds,\r\nyet
    modeling the relation between these representational spaces is an ongoing challenge.
    By integrating spectral geometry principles into neural modeling, we show\r\nthat
    this problem can be better addressed in the functional domain, mitigating complexity,
    while enhancing interpretability and performances on downstream tasks.\r\nTo this
    end, we introduce a multi-purpose framework to the representation learning\r\ncommunity,
    which allows to: (i) compare different spaces in an interpretable way\r\nand measure
    their intrinsic similarity; (ii) find correspondences between them, both\r\nin
    unsupervised and weakly supervised settings, and (iii) to effectively transfer\r\nrepresentations
    between distinct spaces. We validate our framework on various\r\napplications,
    ranging from stitching to retrieval tasks, and on multiple modalities,\r\ndemonstrating
    that Latent Functional Maps can serve as a swiss-army knife for\r\nrepresentation
    alignment"
acknowledgement: MF is supported by the MSCA IST-Bridge fellowship which has received
  funding from the European Union’s Horizon 2020 research and innovation program under
  the Marie Skłodowska-Curie grant agreement No 101034413. ER and VM are supported
  by the PNRR MUR project PE0000013-FAIR. MP is supported by the Sapienza grant "Predicting
  and Explaining Clinical Trial Outcomes", prot. RG12218166FA3F13.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Marco
  full_name: Fumero, Marco
  id: 1c1593eb-393f-11ef-bb8e-ab4f1e979650
  last_name: Fumero
- first_name: Marco
  full_name: Pegoraro, Marco
  last_name: Pegoraro
- first_name: Valentino
  full_name: Maiorca, Valentino
  last_name: Maiorca
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Emanuele
  full_name: Rodolà, Emanuele
  last_name: Rodolà
citation:
  ama: 'Fumero M, Pegoraro M, Maiorca V, Locatello F, Rodolà E. Latent functional
    maps: A spectral framework for representation alignment. In: <i>38th Conference
    on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing
    Systems Foundation; 2024.'
  apa: 'Fumero, M., Pegoraro, M., Maiorca, V., Locatello, F., &#38; Rodolà, E. (2024).
    Latent functional maps: A spectral framework for representation alignment. In
    <i>38th Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver,
    Canada: Neural Information Processing Systems Foundation.'
  chicago: 'Fumero, Marco, Marco Pegoraro, Valentino Maiorca, Francesco Locatello,
    and Emanuele Rodolà. “Latent Functional Maps: A Spectral Framework for Representation
    Alignment.” In <i>38th Conference on Neural Information Processing Systems</i>,
    Vol. 37. Neural Information Processing Systems Foundation, 2024.'
  ieee: 'M. Fumero, M. Pegoraro, V. Maiorca, F. Locatello, and E. Rodolà, “Latent
    functional maps: A spectral framework for representation alignment,” in <i>38th
    Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024,
    vol. 37.'
  ista: 'Fumero M, Pegoraro M, Maiorca V, Locatello F, Rodolà E. 2024. Latent functional
    maps: A spectral framework for representation alignment. 38th Conference on Neural
    Information Processing Systems. NeurIPS: Neural Information Processing Systems,
    Advances in Neural Information Processing Systems, vol. 37.'
  mla: 'Fumero, Marco, et al. “Latent Functional Maps: A Spectral Framework for Representation
    Alignment.” <i>38th Conference on Neural Information Processing Systems</i>, vol.
    37, Neural Information Processing Systems Foundation, 2024.'
  short: M. Fumero, M. Pegoraro, V. Maiorca, F. Locatello, E. Rodolà, in:, 38th Conference
    on Neural Information Processing Systems, Neural Information Processing Systems
    Foundation, 2024.
conference:
  end_date: 2024-12-15
  location: Vancouver, Canada
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2024-12-09
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2025-05-14T11:36:51Z
day: '20'
department:
- _id: FrLo
ec_funded: 1
external_id:
  arxiv:
  - '2406.14183'
intvolume: '        37'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2406.14183
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Latent functional maps: A spectral framework for representation alignment'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19517'
abstract:
- lang: eng
  text: "In this paper, we present a novel data-free method for merging neural networks
    in weight space. Differently from most existing works, our method optimizes for
    the permutations of network neurons globally across all layers. This allows us
    to enforce cycle consistency of the permutations when merging n ≥ 3 models, allowing
    circular compositions of permutations to be computed without accumulating error
    along the path. We qualitatively and quantitatively motivate the need for such
    a constraint, showing its benefits when merging sets of models in scenarios spanning
    varying architectures and datasets. We finally show that, when coupled\r\nwith
    activation renormalization, our approach yields the best results in the task."
acknowledgement: "This work is supported by the ERC grant no.802554 (SPECGEO), PRIN
  2020 project\r\nno.2020TA3K9N (LEGO.AI), and PNRR MUR project PE0000013-FAIR. Marco
  Fumero is supported by the MSCA IST-Bridge fellowship which has received funding
  from the European Union’s Horizon 2020 research and innovation program under the
  Marie Skłodowska-Curie grant agreement No 101034413. We thank Simone Scardapane
  for the helpful feedback on the paper."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Donato
  full_name: Crisostomi, Donato
  last_name: Crisostomi
- first_name: Marco
  full_name: Fumero, Marco
  id: 1c1593eb-393f-11ef-bb8e-ab4f1e979650
  last_name: Fumero
- first_name: Daniele
  full_name: Baieri, Daniele
  last_name: Baieri
- first_name: Florian
  full_name: Bernard, Florian
  last_name: Bernard
- first_name: Emanuele
  full_name: Rodolà, Emanuele
  last_name: Rodolà
citation:
  ama: 'Crisostomi D, Fumero M, Baieri D, Bernard F, Rodolà E. C2M3: Cycle-consistent
    multi-model merging. In: <i>38th Conference on Neural Information Processing Systems</i>.
    Vol 37. Neural Information Processing Systems Foundation; 2024.'
  apa: 'Crisostomi, D., Fumero, M., Baieri, D., Bernard, F., &#38; Rodolà, E. (2024).
    C2M3: Cycle-consistent multi-model merging. In <i>38th Conference on Neural Information
    Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing
    Systems Foundation.'
  chicago: 'Crisostomi, Donato, Marco Fumero, Daniele Baieri, Florian Bernard, and
    Emanuele Rodolà. “C2M3: Cycle-Consistent Multi-Model Merging.” In <i>38th Conference
    on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing
    Systems Foundation, 2024.'
  ieee: 'D. Crisostomi, M. Fumero, D. Baieri, F. Bernard, and E. Rodolà, “C2M3: Cycle-consistent
    multi-model merging,” in <i>38th Conference on Neural Information Processing Systems</i>,
    Vancouver, Canada, 2024, vol. 37.'
  ista: 'Crisostomi D, Fumero M, Baieri D, Bernard F, Rodolà E. 2024. C2M3: Cycle-consistent
    multi-model merging. 38th Conference on Neural Information Processing Systems.
    NeurIPS: Neural Information Processing Systems, Advances in Neural Information
    Processing Systems, vol. 37.'
  mla: 'Crisostomi, Donato, et al. “C2M3: Cycle-Consistent Multi-Model Merging.” <i>38th
    Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information
    Processing Systems Foundation, 2024.'
  short: D. Crisostomi, M. Fumero, D. Baieri, F. Bernard, E. Rodolà, in:, 38th Conference
    on Neural Information Processing Systems, Neural Information Processing Systems
    Foundation, 2024.
conference:
  end_date: 2024-12-15
  location: Vancouver, Canada
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2024-12-09
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2025-05-14T11:36:59Z
day: '20'
department:
- _id: FrLo
ec_funded: 1
external_id:
  arxiv:
  - '2405.17897'
intvolume: '        37'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2405.17897
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'C2M3: Cycle-consistent multi-model merging'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19518'
abstract:
- lang: eng
  text: "The rising footprint of machine learning has led to a focus on imposing model\r\nsparsity
    as a means of reducing computational and memory costs. For deep neural\r\nnetworks
    (DNNs), the state-of-the-art accuracy-vs-sparsity is achieved by heuristics\r\ninspired
    by the classical Optimal Brain Surgeon (OBS) framework [LeCun et al.,\r\n1989,
    Hassibi and Stork, 1992, Hassibi et al., 1993], which leverages loss curvature\r\ninformation
    to make better pruning decisions. Yet, these results still lack a solid\r\ntheoretical
    understanding, and it is unclear whether they can be improved by\r\nleveraging
    connections to the wealth of work on sparse recovery algorithms. In this\r\npaper,
    we draw new connections between these two areas and present new sparse\r\nrecovery
    algorithms inspired by the OBS framework that comes with theoretical\r\nguarantees
    under reasonable assumptions and have strong practical performance.\r\nSpecifically,
    our work starts from the observation that we can leverage curvature\r\ninformation
    in OBS-like fashion upon the projection step of classic iterative sparse\r\nrecovery
    algorithms such as IHT. We show for the first time that this leads both\r\nto
    improved convergence bounds under standard assumptions. Furthermore, we\r\npresent
    extensions of this approach to the practical task of obtaining accurate sparse\r\nDNNs,
    and validate it experimentally at scale for Transformer-based models on\r\nvision
    and language tasks."
acknowledged_ssus:
- _id: CampIT
acknowledgement: The authors thank the anonymous NeurIPS reviewers for their useful
  comments and feedback, the IT department from the Institute of Science and Technology
  Austria for the hardware support, and Weights and Biases for the infrastructure
  to track all our experiments. Mher Safaryan has received funding from the European
  Union’s Horizon 2020 research and innovation program under the Maria Skłodowska-Curie
  grant agreement No 101034413.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Diyuan
  full_name: Wu, Diyuan
  id: 1a5914c2-896a-11ed-bdf8-fb80621a0635
  last_name: Wu
- first_name: Ionut-Vlad
  full_name: Modoranu, Ionut-Vlad
  id: 449f7a18-f128-11eb-9611-9b430c0c6333
  last_name: Modoranu
- first_name: Mher
  full_name: Safaryan, Mher
  id: dd546b39-0804-11ed-9c55-ef075c39778d
  last_name: Safaryan
- first_name: Denis
  full_name: Kuznedelev, Denis
  last_name: Kuznedelev
- 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: 'Wu D, Modoranu I-V, Safaryan M, Kuznedelev D, Alistarh D-A. The iterative
    optimal brain surgeon: Faster sparse recovery by leveraging second-order information.
    In: <i>38th Conference on Neural Information Processing Systems</i>. Vol 37. Neural
    Information Processing Systems Foundation; 2024.'
  apa: 'Wu, D., Modoranu, I.-V., Safaryan, M., Kuznedelev, D., &#38; Alistarh, D.-A.
    (2024). The iterative optimal brain surgeon: Faster sparse recovery by leveraging
    second-order information. In <i>38th Conference on Neural Information Processing
    Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems
    Foundation.'
  chicago: 'Wu, Diyuan, Ionut-Vlad Modoranu, Mher Safaryan, Denis Kuznedelev, and
    Dan-Adrian Alistarh. “The Iterative Optimal Brain Surgeon: Faster Sparse Recovery
    by Leveraging Second-Order Information.” In <i>38th Conference on Neural Information
    Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation,
    2024.'
  ieee: 'D. Wu, I.-V. Modoranu, M. Safaryan, D. Kuznedelev, and D.-A. Alistarh, “The
    iterative optimal brain surgeon: Faster sparse recovery by leveraging second-order
    information,” in <i>38th Conference on Neural Information Processing Systems</i>,
    Vancouver, Canada, 2024, vol. 37.'
  ista: 'Wu D, Modoranu I-V, Safaryan M, Kuznedelev D, Alistarh D-A. 2024. The iterative
    optimal brain surgeon: Faster sparse recovery by leveraging second-order information.
    38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information
    Processing Systems, Advances in Neural Information Processing Systems, vol. 37.'
  mla: 'Wu, Diyuan, et al. “The Iterative Optimal Brain Surgeon: Faster Sparse Recovery
    by Leveraging Second-Order Information.” <i>38th Conference on Neural Information
    Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation,
    2024.'
  short: D. Wu, I.-V. Modoranu, M. Safaryan, D. Kuznedelev, D.-A. Alistarh, in:, 38th
    Conference on Neural Information Processing Systems, Neural Information Processing
    Systems Foundation, 2024.
conference:
  end_date: 2024-12-15
  location: Vancouver, Canada
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2024-12-09
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2025-05-14T11:37:10Z
day: '20'
department:
- _id: DaAl
- _id: MaMo
ec_funded: 1
external_id:
  arxiv:
  - '2408.17163'
intvolume: '        37'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2408.17163
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The iterative optimal brain surgeon: Faster sparse recovery by leveraging
  second-order information'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '19519'
abstract:
- lang: eng
  text: There has been significant interest in "extreme" compression of large language
    models (LLMs), i.e. to 1-2 bits per parameter, which allows such models to be
    executed efficiently on resource-constrained devices. Existing work focused on
    improved one-shot quantization techniques and weight representations; yet, purely
    post-training approaches are reaching diminishing returns in terms of the accuracy-vs-bit-width
    trade-off. State-of-the-art quantization methods such as QuIP# and AQLM include
    fine-tuning (part of) the compressed parameters over a limited amount of calibration
    data; however, such fine-tuning techniques over compressed weights often make
    exclusive use of straight-through estimators (STE), whose performance is not well-understood
    in this setting. In this work, we question the use of STE for extreme LLM compression,
    showing that it can be sub-optimal, and perform a systematic study of quantization-aware
    fine-tuning strategies for LLMs.We propose PV-Tuning - a representation-agnostic
    framework that generalizes and improves upon existing fine-tuning strategies,
    and provides convergence guarantees in restricted cases.On the practical side,
    when used for 1-2 bit vector quantization, PV-Tuning outperforms prior techniques
    for highly-performant models such as Llama and Mistral. Using PV-Tuning, we achieve
    the first Pareto-optimal quantization for Llama-2 family models at 2 bits per
    parameter.
acknowledgement: "Authors would like to thank Vage Egiazarian, Andrei Panferov and
  Ruslan Svirschevski for their\r\nhelp and advice on AQLM codebase and running large-scale
  experiments. We also thank Philip\r\nZmushko and Artem Fedorov for helpful discussions
  during the early stages of our research. The research of Kai Yi, Konstantin Burlachenko,
  and Peter Richtárik reported in this publication was supported by funding from King
  Abdullah University of Science and Technology (KAUST) – Center of Excellence for
  Generative AI, under award number 5940. We would also like to thank our NeurIPS
  reviewers for their helpful suggestions, we specifically highlight p3Lv’s suggestions
  to consider smaller codebook sizes and evaluate PV-Tuning with QuIP#, both of which
  produced interesting findings. Finally, we thank the open-source contributors from
  llama.cpp9 and the LocalLlama10 community for discussions and inspirations on practical
  use cases of quantized language models, and in particular, Yalda Shabanzadeh and
  Arthur Aardvark for their help with improving the codebase."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
  full_name: Malinovskii, Vladimir
  last_name: Malinovskii
- first_name: Denis
  full_name: Mazur, Denis
  last_name: Mazur
- first_name: Ivan
  full_name: Ilin, Ivan
  last_name: Ilin
- first_name: Denis
  full_name: Kuznedelev, Denis
  last_name: Kuznedelev
- first_name: Konstantin
  full_name: Burlachenko, Konstantin
  last_name: Burlachenko
- first_name: Kai
  full_name: Yi, Kai
  last_name: Yi
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: Peter
  full_name: Richtarik, Peter
  last_name: Richtarik
citation:
  ama: 'Malinovskii V, Mazur D, Ilin I, et al. PV-tuning: Beyond straight-through
    estimation for extreme LLM compression. In: <i>38th Conference on Neural Information
    Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation;
    2024.'
  apa: 'Malinovskii, V., Mazur, D., Ilin, I., Kuznedelev, D., Burlachenko, K., Yi,
    K., … Richtarik, P. (2024). PV-tuning: Beyond straight-through estimation for
    extreme LLM compression. In <i>38th Conference on Neural Information Processing
    Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems
    Foundation.'
  chicago: 'Malinovskii, Vladimir, Denis Mazur, Ivan Ilin, Denis Kuznedelev, Konstantin
    Burlachenko, Kai Yi, Dan-Adrian Alistarh, and Peter Richtarik. “PV-Tuning: Beyond
    Straight-through Estimation for Extreme LLM Compression.” In <i>38th Conference
    on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing
    Systems Foundation, 2024.'
  ieee: 'V. Malinovskii <i>et al.</i>, “PV-tuning: Beyond straight-through estimation
    for extreme LLM compression,” in <i>38th Conference on Neural Information Processing
    Systems</i>, Vancouver, Canada, 2024, vol. 37.'
  ista: 'Malinovskii V, Mazur D, Ilin I, Kuznedelev D, Burlachenko K, Yi K, Alistarh
    D-A, Richtarik P. 2024. PV-tuning: Beyond straight-through estimation for extreme
    LLM compression. 38th Conference on Neural Information Processing Systems. NeurIPS:
    Neural Information Processing Systems, Advances in Neural Information Processing
    Systems, vol. 37.'
  mla: 'Malinovskii, Vladimir, et al. “PV-Tuning: Beyond Straight-through Estimation
    for Extreme LLM Compression.” <i>38th Conference on Neural Information Processing
    Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.'
  short: V. Malinovskii, D. Mazur, I. Ilin, D. Kuznedelev, K. Burlachenko, K. Yi,
    D.-A. Alistarh, P. Richtarik, in:, 38th Conference on Neural Information Processing
    Systems, Neural Information Processing Systems Foundation, 2024.
conference:
  end_date: 2024-12-15
  location: Vancouver, Canada
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2024-12-10
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2025-05-14T10:49:20Z
day: '20'
ddc:
- '000'
department:
- _id: DaAl
external_id:
  arxiv:
  - '2405.14852'
file:
- access_level: open_access
  checksum: 54d36f947887e26d0e568b512167001a
  content_type: application/pdf
  creator: dernst
  date_created: 2025-04-07T09:17:10Z
  date_updated: 2025-04-07T09:17:10Z
  file_id: '19521'
  file_name: 2024_NeurIPS_Malinovskii.pdf
  file_size: 939712
  relation: main_file
  success: 1
file_date_updated: 2025-04-07T09:17:10Z
has_accepted_license: '1'
intvolume: '        37'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
  isbn:
  - '9798331314385'
  issn:
  - 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'PV-tuning: Beyond straight-through estimation for extreme LLM compression'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19520'
abstract:
- lang: eng
  text: Vertebrates exhibit a wide range of motor behaviors, ranging from swimming
    to complex limb-based movements. Here we take advantage of frog metamorphosis,
    which captures a swim-to-limb-based movement transformation during the development
    of a single organism, to explore changes in the underlying spinal circuits. We
    find that the tadpole spinal cord contains small and largely homogeneous populations
    of motor neurons (MNs) and V1 interneurons (V1s) at early escape swimming stages.
    These neuronal populations only modestly increase in number and subtype heterogeneity
    with the emergence of free swimming. In contrast, during frog metamorphosis and
    the emergence of limb movement, there is a dramatic expansion of MN and V1 interneuron
    number and transcriptional heterogeneity, culminating in cohorts of neurons that
    exhibit striking molecular similarity to mammalian motor circuits. CRISPR/Cas9-mediated
    gene disruption of the limb MN and V1 determinants FoxP1 and Engrailed-1, respectively,
    results in severe but selective deficits in tail and limb function. Our work thus
    demonstrates that neural diversity scales exponentially with increasing behavioral
    complexity and illustrates striking evolutionary conservation in the molecular
    organization and function of motor circuits across species.
acknowledged_ssus:
- _id: Bio
acknowledgement: "We would like to thank the members of the Sweeney Lab (especially
  Stavros Papadopoulos and\r\nSophie Gobeil) for their contributions to this project
  and, in addition to the lab, Graziana Gatto\r\nand Mario de Bono, for discussion,
  and support. We are also grateful to Tom Jessell and Chris\r\nKintner for their
  scientific insight and mentorship during the conception of this project. This\r\nproject
  would also not have been possible with the technical support of the Matthias Nowak,\r\nVerena
  Mayer and the Aquatics as well as the Imaging and Optics Facility support teams\r\n(ISTA).
  In addition, we thank our funding sources for providing the resources to do these\r\nexperiments:
  FTI Strategy Lower Austria Dissertation Grant Number FT121-D-046 (D.V.);\r\nHorizon
  Europe ERC Starting Grant Number 101041551 (L.B.S., F.A.T. and D.V); Special\r\nResearch
  Program (SFB) of the Austrian Science Fund (FWF) Project number F7814-B (L.B.S);\r\nNINDS
  5R35NS116858 (J.S.D); CZI grant DAF2020-225401 (DOI): 10.37921/120055ratwvi\r\n(R.H.);
  NIH grant number R01NS123116 (J.B.B); American Lebanese Syrian Associated\r\nCharities
  (ALSAC) (J.B.B.); German Academic Exchange Service (DAAD) IFI Grant Number\r\n57515251-91853472
  (Z.H.); and Project A.L.S. (S.B-M.). "
article_processing_charge: No
author:
- first_name: David
  full_name: Vijatovic, David
  id: cf391e77-ec3c-11ea-a124-d69323410b58
  last_name: Vijatovic
- first_name: 'Florina Alexandra '
  full_name: 'Toma, Florina Alexandra '
  id: 2f73f876-f128-11eb-9611-b96b5a30cb0e
  last_name: Toma
- first_name: Zoe P
  full_name: Harrington, Zoe P
  id: a8144562-32c9-11ee-b5ce-d9800628bda2
  last_name: Harrington
  orcid: 0009-0008-0158-4032
- first_name: Christoph M
  full_name: Sommer, Christoph M
  id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
  last_name: Sommer
  orcid: 0000-0003-1216-9105
- first_name: Robert
  full_name: Hauschild, Robert
  id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
  last_name: Hauschild
  orcid: 0000-0001-9843-3522
- first_name: Alexandra J.
  full_name: Trevisan, Alexandra J.
  last_name: Trevisan
- first_name: Phillip
  full_name: Chapman, Phillip
  last_name: Chapman
- first_name: Mara
  full_name: Julseth, Mara
  id: 1cf464b2-dc7d-11ea-9b2f-f9b1aa9417d1
  last_name: Julseth
- first_name: Susan
  full_name: Brenner-Morton, Susan
  last_name: Brenner-Morton
- first_name: Mariano I.
  full_name: Gabitto, Mariano I.
  last_name: Gabitto
- first_name: Jeremy S.
  full_name: Dasen, Jeremy S.
  last_name: Dasen
- first_name: Jay B.
  full_name: Bikoff, Jay B.
  last_name: Bikoff
- first_name: Lora Beatrice Jaeger
  full_name: Sweeney, Lora Beatrice Jaeger
  id: 56BE8254-C4F0-11E9-8E45-0B23E6697425
  last_name: Sweeney
  orcid: 0000-0001-9242-5601
citation:
  ama: Vijatovic D, Toma FA, Harrington ZP, et al. Spinal neuron diversity scales
    exponentially with swim-to-limb transformation during frog metamorphosis. <i>bioRxiv</i>.
    doi:<a href="https://doi.org/10.1101/2024.09.20.614050">10.1101/2024.09.20.614050</a>
  apa: Vijatovic, D., Toma, F. A., Harrington, Z. P., Sommer, C. M., Hauschild, R.,
    Trevisan, A. J., … Sweeney, L. B. (n.d.). Spinal neuron diversity scales exponentially
    with swim-to-limb transformation during frog metamorphosis. <i>bioRxiv</i>. <a
    href="https://doi.org/10.1101/2024.09.20.614050">https://doi.org/10.1101/2024.09.20.614050</a>
  chicago: Vijatovic, David, Florina Alexandra  Toma, Zoe P Harrington, Christoph
    M Sommer, Robert Hauschild, Alexandra J. Trevisan, Phillip Chapman, et al. “Spinal
    Neuron Diversity Scales Exponentially with Swim-to-Limb Transformation during
    Frog Metamorphosis.” <i>BioRxiv</i>, n.d. <a href="https://doi.org/10.1101/2024.09.20.614050">https://doi.org/10.1101/2024.09.20.614050</a>.
  ieee: D. Vijatovic <i>et al.</i>, “Spinal neuron diversity scales exponentially
    with swim-to-limb transformation during frog metamorphosis,” <i>bioRxiv</i>. .
  ista: Vijatovic D, Toma FA, Harrington ZP, Sommer CM, Hauschild R, Trevisan AJ,
    Chapman P, Julseth M, Brenner-Morton S, Gabitto MI, Dasen JS, Bikoff JB, Sweeney
    LB. Spinal neuron diversity scales exponentially with swim-to-limb transformation
    during frog metamorphosis. bioRxiv, <a href="https://doi.org/10.1101/2024.09.20.614050">10.1101/2024.09.20.614050</a>.
  mla: Vijatovic, David, et al. “Spinal Neuron Diversity Scales Exponentially with
    Swim-to-Limb Transformation during Frog Metamorphosis.” <i>BioRxiv</i>, doi:<a
    href="https://doi.org/10.1101/2024.09.20.614050">10.1101/2024.09.20.614050</a>.
  short: D. Vijatovic, F.A. Toma, Z.P. Harrington, C.M. Sommer, R. Hauschild, A.J.
    Trevisan, P. Chapman, M. Julseth, S. Brenner-Morton, M.I. Gabitto, J.S. Dasen,
    J.B. Bikoff, L.B. Sweeney, BioRxiv (n.d.).
corr_author: '1'
date_created: 2025-04-07T08:48:28Z
date_published: 2024-09-27T00:00:00Z
date_updated: 2025-05-14T11:40:13Z
day: '27'
department:
- _id: LoSw
- _id: TiVo
- _id: Bio
- _id: NiBa
doi: 10.1101/2024.09.20.614050
fulldoi: https://doi.org/10.1101/2024.09.20.614050
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1101/2024.09.20.614050
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: bd73af52-d553-11ed-ba76-912049f0ac7a
  grant_number: FTI21-D-046
  name: Development of V1 interneuron diversity during swim-to-walk transition of
    Xenopus metamorphosis
- _id: ebb66355-77a9-11ec-83b8-b8ac210a4dae
  grant_number: '101041551'
  name: Development and Evolution of Tetrapod Motor Circuits
- _id: c08e9ad1-5a5b-11eb-8a69-9d1cf3b07473
  grant_number: CZI01
  name: Tools for automation and feedback microscopy
publication: bioRxiv
publication_status: submitted
status: public
title: Spinal neuron diversity scales exponentially with swim-to-limb transformation
  during frog metamorphosis
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19800'
abstract:
- lang: eng
  text: "This archive contains all the code and data necessary to reproduce the results
    presented in the \r\n\"Mapping the attractor landscape of Boolean networks\" paper."
article_processing_charge: No
author:
- first_name: Van Giang
  full_name: trinh, Van Giang
  last_name: trinh
- first_name: Kyu Hyong
  full_name: Park, Kyu Hyong
  last_name: Park
- first_name: Samuel
  full_name: Pastva, Samuel
  id: 07c5ea74-f61c-11ec-a664-aa7c5d957b2b
  last_name: Pastva
  orcid: 0000-0003-1993-0331
- first_name: Jordan
  full_name: Rozum, Jordan
  last_name: Rozum
citation:
  ama: trinh VG, Park KH, Pastva S, Rozum J. Mapping the attractor landscape of Boolean
    networks. 2024. doi:<a href="https://doi.org/10.5281/ZENODO.13854759">10.5281/ZENODO.13854759</a>
  apa: trinh, V. G., Park, K. H., Pastva, S., &#38; Rozum, J. (2024). Mapping the
    attractor landscape of Boolean networks. Zenodo. <a href="https://doi.org/10.5281/ZENODO.13854759">https://doi.org/10.5281/ZENODO.13854759</a>
  chicago: trinh, Van Giang, Kyu Hyong Park, Samuel Pastva, and Jordan Rozum. “Mapping
    the Attractor Landscape of Boolean Networks.” Zenodo, 2024. <a href="https://doi.org/10.5281/ZENODO.13854759">https://doi.org/10.5281/ZENODO.13854759</a>.
  ieee: V. G. trinh, K. H. Park, S. Pastva, and J. Rozum, “Mapping the attractor landscape
    of Boolean networks.” Zenodo, 2024.
  ista: trinh VG, Park KH, Pastva S, Rozum J. 2024. Mapping the attractor landscape
    of Boolean networks, Zenodo, <a href="https://doi.org/10.5281/ZENODO.13854759">10.5281/ZENODO.13854759</a>.
  mla: trinh, Van Giang, et al. <i>Mapping the Attractor Landscape of Boolean Networks</i>.
    Zenodo, 2024, doi:<a href="https://doi.org/10.5281/ZENODO.13854759">10.5281/ZENODO.13854759</a>.
  short: V.G. trinh, K.H. Park, S. Pastva, J. Rozum, (2024).
date_created: 2025-06-10T07:10:01Z
date_published: 2024-09-28T00:00:00Z
date_updated: 2025-09-30T12:46:33Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.5281/ZENODO.13854759
fulldoi: https://doi.org/10.5281/ZENODO.13854759
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.13854760
month: '09'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '19796'
    relation: used_in_publication
    status: public
status: public
title: Mapping the attractor landscape of Boolean networks
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: repository
_id: '19884'
abstract:
- lang: eng
  text: "This is Marlin, a Mixed Auto-Regressive Linear kernel (and the name of one
    of the planet's fastest fish), an extremely optimized FP16xINT4 matmul kernel
    aimed at LLM inference that can deliver close to ideal (4x) speedups up to batchsizes
    of 16-32 tokens (in contrast to the 1-2 tokens of prior work with comparable speedup).\r\n\r\nAdditionally,
    it includes Sparse-Marlin, an extension of the MARLIN kernels adding support to
    2:4 weight sparsity, achieving 5.3x speedups on NVIDIA GPUs (Ampere/Ada)."
article_processing_charge: No
author:
- first_name: Elias
  full_name: Frantar, Elias
  id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
  last_name: Frantar
- first_name: Roberto
  full_name: Castro, Roberto
  last_name: Castro
- first_name: Jiale
  full_name: Chen, Jiale
  id: 4d0a9064-1ff6-11ee-9fa6-ec046c604785
  last_name: Chen
  orcid: 0000-0001-5337-5875
- first_name: Torsten
  full_name: Hoefler, Torsten
  last_name: Hoefler
- 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: 'Frantar E, Castro R, Chen J, Hoefler T, Alistarh D-A. MARLIN: Mixed-precision
    auto-regressive parallel inference on Large Language Models. 2024. doi:<a href="https://doi.org/10.5281/ZENODO.14213091">10.5281/ZENODO.14213091</a>'
  apa: 'Frantar, E., Castro, R., Chen, J., Hoefler, T., &#38; Alistarh, D.-A. (2024).
    MARLIN: Mixed-precision auto-regressive parallel inference on Large Language Models.
    Zenodo. <a href="https://doi.org/10.5281/ZENODO.14213091">https://doi.org/10.5281/ZENODO.14213091</a>'
  chicago: 'Frantar, Elias, Roberto Castro, Jiale Chen, Torsten Hoefler, and Dan-Adrian
    Alistarh. “MARLIN: Mixed-Precision Auto-Regressive Parallel Inference on Large
    Language Models.” Zenodo, 2024. <a href="https://doi.org/10.5281/ZENODO.14213091">https://doi.org/10.5281/ZENODO.14213091</a>.'
  ieee: 'E. Frantar, R. Castro, J. Chen, T. Hoefler, and D.-A. Alistarh, “MARLIN:
    Mixed-precision auto-regressive parallel inference on Large Language Models.”
    Zenodo, 2024.'
  ista: 'Frantar E, Castro R, Chen J, Hoefler T, Alistarh D-A. 2024. MARLIN: Mixed-precision
    auto-regressive parallel inference on Large Language Models, Zenodo, <a href="https://doi.org/10.5281/ZENODO.14213091">10.5281/ZENODO.14213091</a>.'
  mla: 'Frantar, Elias, et al. <i>MARLIN: Mixed-Precision Auto-Regressive Parallel
    Inference on Large Language Models</i>. Zenodo, 2024, doi:<a href="https://doi.org/10.5281/ZENODO.14213091">10.5281/ZENODO.14213091</a>.'
  short: E. Frantar, R. Castro, J. Chen, T. Hoefler, D.-A. Alistarh, (2024).
corr_author: '1'
date_created: 2025-06-24T06:09:18Z
date_published: 2024-11-24T00:00:00Z
date_updated: 2025-09-30T13:41:56Z
day: '24'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.5281/ZENODO.14213091
fulldoi: https://doi.org/10.5281/ZENODO.14213091
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/ZENODO.14213091
month: '11'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '19877'
    relation: used_for_analysis_in
    status: public
status: public
title: 'MARLIN: Mixed-precision auto-regressive parallel inference on Large Language
  Models'
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_type: closed access
_id: '20039'
abstract:
- lang: eng
  text: This Comment presents a high-level protocol for data harmonization within
    large cohorts, in which it postulates four main steps including (1) expert review,
    (2) pre-statistical harmonization, (3) statistical harmonization, and (4) validation.
acknowledgement: Funded by the European Union. Complementary funding was received
  by UK Research and Innovation (UKRI) under the UK government’s Horizon Europe funding
  guarantee (10041392 and 10038599). Views and opinions expressed are however those
  of the author(s) only and do not necessarily reflect those of the European Union,
  the European Health and Digital Executive Agency (HADEA) or UKRI. The European Union,
  HADEA or UKRI cannot be held responsible for them. This work received support from
  the Chinese Ministry for Science and Technology (MOST), the Horizon 2020-funded
  European Research Council advanced grant ‘STRATIFY’ (695313); the German Research
  Foundation (COPE; 675346; NE 1383/15-1 and BA 2088/7-1 (CoviDrug)), the National
  Natural Science Foundation of China grant 82150710554, the Hector II foundation
  and the German Center for Mental Health (DZPG) (01EE2301A, 01EE2304A, 01EE2301D).
article_processing_charge: No
article_type: comment
author:
- first_name: Maja
  full_name: Neidhart, Maja
  last_name: Neidhart
- first_name: Rikka
  full_name: Kjelkenes, Rikka
  last_name: Kjelkenes
- first_name: Karina
  full_name: Jansone, Karina
  last_name: Jansone
- first_name: Barbora
  full_name: Rehák Bučková, Barbora
  last_name: Rehák Bučková
- first_name: Nathalie
  full_name: Holz, Nathalie
  last_name: Holz
- first_name: Frauke
  full_name: Nees, Frauke
  last_name: Nees
- first_name: Henrik
  full_name: Walter, Henrik
  last_name: Walter
- first_name: Gunter
  full_name: Schumann, Gunter
  last_name: Schumann
- first_name: Michael A.
  full_name: Rapp, Michael A.
  last_name: Rapp
- first_name: Tobias
  full_name: Banaschewski, Tobias
  last_name: Banaschewski
- first_name: Emanuel
  full_name: Schwarz, Emanuel
  last_name: Schwarz
- first_name: Andre
  full_name: Marquand, Andre
  last_name: Marquand
- first_name: George
  full_name: Ogoh, George
  last_name: Ogoh
- first_name: Bernd
  full_name: Stahl, Bernd
  last_name: Stahl
- first_name: Allan H.
  full_name: Young, Allan H.
  last_name: Young
- first_name: Sylvane
  full_name: Desrivières, Sylvane
  last_name: Desrivières
- first_name: Nicholas
  full_name: Clinton, Nicholas
  last_name: Clinton
- first_name: Paul
  full_name: Thompson, Paul
  last_name: Thompson
- first_name: Ameli
  full_name: Schwalber, Ameli
  last_name: Schwalber
- first_name: Jingyu
  full_name: Liu, Jingyu
  last_name: Liu
- first_name: Vince
  full_name: Calhoun, Vince
  last_name: Calhoun
- first_name: Xiao
  full_name: Chang, Xiao
  last_name: Chang
- first_name: Yunman
  full_name: Xia, Yunman
  last_name: Xia
- first_name: Yanting
  full_name: Gong, Yanting
  last_name: Gong
- first_name: Tianye
  full_name: Jia, Tianye
  last_name: Jia
- first_name: Paul
  full_name: Renner, Paul
  last_name: Renner
- first_name: Sören
  full_name: Hese, Sören
  last_name: Hese
- first_name: Arantxa
  full_name: Giner, Arantxa
  last_name: Giner
- first_name: Mavi
  full_name: Sanchez, Mavi
  last_name: Sanchez
- first_name: Elena
  full_name: Alvarez, Elena
  last_name: Alvarez
- first_name: Bernhard
  full_name: Spanlang, Bernhard
  last_name: Spanlang
- first_name: Charlie
  full_name: Pearmund, Charlie
  last_name: Pearmund
- first_name: Anastasios Polykarpos
  full_name: Athanasiadis, Anastasios Polykarpos
  last_name: Athanasiadis
- first_name: Lisa
  full_name: Otten, Lisa
  last_name: Otten
- first_name: Séverine
  full_name: Pitel, Séverine
  last_name: Pitel
- first_name: Spase
  full_name: Petkoski, Spase
  last_name: Petkoski
- first_name: Viktor
  full_name: Jirsa, Viktor
  last_name: Jirsa
- first_name: Karen
  full_name: Schmitt, Karen
  last_name: Schmitt
- first_name: Johannes
  full_name: Wilbertz, Johannes
  last_name: Wilbertz
- first_name: Myrto
  full_name: Patraskaki, Myrto
  last_name: Patraskaki
- first_name: Peter
  full_name: Sommer, Peter
  last_name: Sommer
- first_name: Stefanie
  full_name: Heilmann-Heimbach, Stefanie
  last_name: Heilmann-Heimbach
- first_name: Carina M.
  full_name: Mathey, Carina M.
  last_name: Mathey
- first_name: Abigail
  full_name: Miller, Abigail
  last_name: Miller
- first_name: Isabelle
  full_name: Claus, Isabelle
  last_name: Claus
- first_name: Markus M.
  full_name: Nöthen, Markus M.
  last_name: Nöthen
- first_name: Per
  full_name: Hoffmann, Per
  last_name: Hoffmann
- first_name: Andreas J.
  full_name: Forstner, Andreas J.
  last_name: Forstner
- first_name: Alvaro
  full_name: Pastor, Alvaro
  last_name: Pastor
- first_name: Jaime
  full_name: Gallego, Jaime
  last_name: Gallego
- first_name: Francisco Eiroa
  full_name: Orosa, Francisco Eiroa
  last_name: Orosa
- first_name: Guillem Feixas
  full_name: Viapiana, Guillem Feixas
  last_name: Viapiana
- first_name: Mel
  full_name: Slater, Mel
  last_name: Slater
- first_name: Lena
  full_name: Marr, Lena
  id: 4406F586-F248-11E8-B48F-1D18A9856A87
  last_name: Marr
- first_name: Gaia
  full_name: Novarino, Gaia
  id: 3E57A680-F248-11E8-B48F-1D18A9856A87
  last_name: Novarino
  orcid: 0000-0002-7673-7178
- first_name: Sarah Jane
  full_name: Böttger, Sarah Jane
  last_name: Böttger
- first_name: Mira
  full_name: Tschorn, Mira
  last_name: Tschorn
- first_name: Michael
  full_name: Rapp, Michael
  last_name: Rapp
- first_name: Helga
  full_name: Ask, Helga
  last_name: Ask
- first_name: Sara
  full_name: Fernandez, Sara
  last_name: Fernandez
- first_name: Dennis
  full_name: Van Der Meer, Dennis
  last_name: Van Der Meer
- first_name: Lars T.
  full_name: Westlye, Lars T.
  last_name: Westlye
- first_name: Ole A.
  full_name: Andreassen, Ole A.
  last_name: Andreassen
- first_name: Rieke
  full_name: Aden, Rieke
  last_name: Aden
- first_name: Beke
  full_name: Seefried, Beke
  last_name: Seefried
- first_name: Sebastian
  full_name: Siehl, Sebastian
  last_name: Siehl
- first_name: Frauke
  full_name: Nees, Frauke
  last_name: Nees
- first_name: Argyris
  full_name: Stringaris, Argyris
  last_name: Stringaris
- first_name: Heike
  full_name: Tost, Heike
  last_name: Tost
- first_name: Andreas
  full_name: Meyer-Lindenberg, Andreas
  last_name: Meyer-Lindenberg
- first_name: Nina
  full_name: Christmann, Nina
  last_name: Christmann
- first_name: Jamie
  full_name: Banks, Jamie
  last_name: Banks
- first_name: Kerstin
  full_name: Schepanski, Kerstin
  last_name: Schepanski
- first_name: Tatjana
  full_name: Schütz, Tatjana
  last_name: Schütz
- first_name: Ulrike Helene
  full_name: Taron, Ulrike Helene
  last_name: Taron
- first_name: Roland
  full_name: Eils, Roland
  last_name: Eils
- first_name: Jean Charles
  full_name: Roy, Jean Charles
  last_name: Roy
- first_name: Tristram A.
  full_name: Lett, Tristram A.
  last_name: Lett
- first_name: Hedi
  full_name: Kebir, Hedi
  last_name: Kebir
- first_name: Elli
  full_name: Polemiti, Elli
  last_name: Polemiti
- first_name: Esther
  full_name: Hitchen, Esther
  last_name: Hitchen
- first_name: Marcel
  full_name: Jentsch, Marcel
  last_name: Jentsch
- first_name: Emin
  full_name: Serin, Emin
  last_name: Serin
- first_name: Antoine
  full_name: Bernas, Antoine
  last_name: Bernas
- first_name: Nilakshi
  full_name: Vaidya, Nilakshi
  last_name: Vaidya
- first_name: Sven
  full_name: Twardziok, Sven
  last_name: Twardziok
- first_name: Markus
  full_name: Ralser, Markus
  last_name: Ralser
- first_name: Andreas
  full_name: Heinz, Andreas
  last_name: Heinz
citation:
  ama: Neidhart M, Kjelkenes R, Jansone K, et al. A protocol for data harmonization
    in large cohorts. <i>Nature Mental Health</i>. 2024;2(10):1134-1137. doi:<a href="https://doi.org/10.1038/s44220-024-00315-0">10.1038/s44220-024-00315-0</a>
  apa: Neidhart, M., Kjelkenes, R., Jansone, K., Rehák Bučková, B., Holz, N., Nees,
    F., … Heinz, A. (2024). A protocol for data harmonization in large cohorts. <i>Nature
    Mental Health</i>. Springer Nature. <a href="https://doi.org/10.1038/s44220-024-00315-0">https://doi.org/10.1038/s44220-024-00315-0</a>
  chicago: Neidhart, Maja, Rikka Kjelkenes, Karina Jansone, Barbora Rehák Bučková,
    Nathalie Holz, Frauke Nees, Henrik Walter, et al. “A Protocol for Data Harmonization
    in Large Cohorts.” <i>Nature Mental Health</i>. Springer Nature, 2024. <a href="https://doi.org/10.1038/s44220-024-00315-0">https://doi.org/10.1038/s44220-024-00315-0</a>.
  ieee: M. Neidhart <i>et al.</i>, “A protocol for data harmonization in large cohorts,”
    <i>Nature Mental Health</i>, vol. 2, no. 10. Springer Nature, pp. 1134–1137, 2024.
  ista: Neidhart M, Kjelkenes R, Jansone K, Rehák Bučková B, Holz N, Nees F, Walter
    H, Schumann G, Rapp MA, Banaschewski T, Schwarz E, Marquand A, Ogoh G, Stahl B,
    Young AH, Desrivières S, Clinton N, Thompson P, Schwalber A, Liu J, Calhoun V,
    Chang X, Xia Y, Gong Y, Jia T, Renner P, Hese S, Giner A, Sanchez M, Alvarez E,
    Spanlang B, Pearmund C, Athanasiadis AP, Otten L, Pitel S, Petkoski S, Jirsa V,
    Schmitt K, Wilbertz J, Patraskaki M, Sommer P, Heilmann-Heimbach S, Mathey CM,
    Miller A, Claus I, Nöthen MM, Hoffmann P, Forstner AJ, Pastor A, Gallego J, Orosa
    FE, Viapiana GF, Slater M, Marr L, Novarino G, Böttger SJ, Tschorn M, Rapp M,
    Ask H, Fernandez S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried
    B, Siehl S, Nees F, Stringaris A, Tost H, Meyer-Lindenberg A, Christmann N, Banks
    J, Schepanski K, Schütz T, Taron UH, Eils R, Roy JC, Lett TA, Kebir H, Polemiti
    E, Hitchen E, Jentsch M, Serin E, Bernas A, Vaidya N, Twardziok S, Ralser M, Heinz
    A. 2024. A protocol for data harmonization in large cohorts. Nature Mental Health.
    2(10), 1134–1137.
  mla: Neidhart, Maja, et al. “A Protocol for Data Harmonization in Large Cohorts.”
    <i>Nature Mental Health</i>, vol. 2, no. 10, Springer Nature, 2024, pp. 1134–37,
    doi:<a href="https://doi.org/10.1038/s44220-024-00315-0">10.1038/s44220-024-00315-0</a>.
  short: M. Neidhart, R. Kjelkenes, K. Jansone, B. Rehák Bučková, N. Holz, F. Nees,
    H. Walter, G. Schumann, M.A. Rapp, T. Banaschewski, E. Schwarz, A. Marquand, G.
    Ogoh, B. Stahl, A.H. Young, S. Desrivières, N. Clinton, P. Thompson, A. Schwalber,
    J. Liu, V. Calhoun, X. Chang, Y. Xia, Y. Gong, T. Jia, P. Renner, S. Hese, A.
    Giner, M. Sanchez, E. Alvarez, B. Spanlang, C. Pearmund, A.P. Athanasiadis, L.
    Otten, S. Pitel, S. Petkoski, V. Jirsa, K. Schmitt, J. Wilbertz, M. Patraskaki,
    P. Sommer, S. Heilmann-Heimbach, C.M. Mathey, A. Miller, I. Claus, M.M. Nöthen,
    P. Hoffmann, A.J. Forstner, A. Pastor, J. Gallego, F.E. Orosa, G.F. Viapiana,
    M. Slater, L. Marr, G. Novarino, S.J. Böttger, M. Tschorn, M. Rapp, H. Ask, S.
    Fernandez, D. Van Der Meer, L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried,
    S. Siehl, F. Nees, A. Stringaris, H. Tost, A. Meyer-Lindenberg, N. Christmann,
    J. Banks, K. Schepanski, T. Schütz, U.H. Taron, R. Eils, J.C. Roy, T.A. Lett,
    H. Kebir, E. Polemiti, E. Hitchen, M. Jentsch, E. Serin, A. Bernas, N. Vaidya,
    S. Twardziok, M. Ralser, A. Heinz, Nature Mental Health 2 (2024) 1134–1137.
date_created: 2025-07-20T22:02:04Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2025-07-22T08:59:10Z
day: '01'
department:
- _id: GaNo
doi: 10.1038/s44220-024-00315-0
fulldoi: https://doi.org/10.1038/s44220-024-00315-0
intvolume: '         2'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 1134-1137
publication: Nature Mental Health
publication_identifier:
  eissn:
  - 2731-6076
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A protocol for data harmonization in large cohorts
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2024'
...
---
OA_place: publisher
OA_type: free access
_id: '20057'
abstract:
- lang: eng
  text: In article number 2305128, Qing Sun, Shang Wang, Yanhong Tian, Andreu Cabot,
    and co-workers report an investigation of the energy-storage mechanism of a layered
    Bi2Te3-based cathode for aqueous zinc-ion batteries (ZIBs). They demonstrate that
    the zinc ion is not inserted into the cathode as previously assumed; in contrast,
    proton charge-storage dominates the process. They also demonstrate the great application
    prospects of aqueous ZIBs in flexible electronics via jet printing technology.
article_number: '2470004'
article_processing_charge: No
author:
- first_name: Guifang
  full_name: Zeng, Guifang
  last_name: Zeng
- first_name: Qing
  full_name: Sun, Qing
  last_name: Sun
- first_name: Sharona
  full_name: Horta, Sharona
  id: 03a7e858-01b1-11ec-8b71-99ae6c4a05bc
  last_name: Horta
- first_name: Shang
  full_name: Wang, Shang
  last_name: Wang
- first_name: Xuan
  full_name: Lu, Xuan
  last_name: Lu
- first_name: Chao Yue
  full_name: Zhang, Chao Yue
  last_name: Zhang
- first_name: Jing
  full_name: Li, Jing
  last_name: Li
- first_name: Junshan
  full_name: Li, Junshan
  last_name: Li
- first_name: Lijie
  full_name: Ci, Lijie
  last_name: Ci
- first_name: Yanhong
  full_name: Tian, Yanhong
  last_name: Tian
- first_name: Maria
  full_name: Ibáñez, Maria
  id: 43C61214-F248-11E8-B48F-1D18A9856A87
  last_name: Ibáñez
  orcid: 0000-0001-5013-2843
- first_name: Andreu
  full_name: Cabot, Andreu
  last_name: Cabot
citation:
  ama: 'Zeng G, Sun Q, Horta S, et al. <i>A Layered Bi2Te3@PPy Cathode for Aqueous
    Zinc‐Ion Batteries: Mechanism and Application in Printed Flexible Batteries</i>.
    Vol 36. Wiley; 2024. doi:<a href="https://doi.org/10.1002/adma.202470004">10.1002/adma.202470004</a>'
  apa: 'Zeng, G., Sun, Q., Horta, S., Wang, S., Lu, X., Zhang, C. Y., … Cabot, A.
    (2024). <i>A layered Bi2Te3@PPy cathode for aqueous Zinc‐Ion batteries: Mechanism
    and application in printed flexible batteries</i>. <i>Advanced Materials</i> (Vol.
    36). Wiley. <a href="https://doi.org/10.1002/adma.202470004">https://doi.org/10.1002/adma.202470004</a>'
  chicago: 'Zeng, Guifang, Qing Sun, Sharona Horta, Shang Wang, Xuan Lu, Chao Yue
    Zhang, Jing Li, et al. <i>A Layered Bi2Te3@PPy Cathode for Aqueous Zinc‐Ion Batteries:
    Mechanism and Application in Printed Flexible Batteries</i>. <i>Advanced Materials</i>.
    Vol. 36. Wiley, 2024. <a href="https://doi.org/10.1002/adma.202470004">https://doi.org/10.1002/adma.202470004</a>.'
  ieee: 'G. Zeng <i>et al.</i>, <i>A layered Bi2Te3@PPy cathode for aqueous Zinc‐Ion
    batteries: Mechanism and application in printed flexible batteries</i>, vol. 36,
    no. 1. Wiley, 2024.'
  ista: 'Zeng G, Sun Q, Horta S, Wang S, Lu X, Zhang CY, Li J, Li J, Ci L, Tian Y,
    Ibáñez M, Cabot A. 2024. A layered Bi2Te3@PPy cathode for aqueous Zinc‐Ion batteries:
    Mechanism and application in printed flexible batteries, Wiley,p.'
  mla: 'Zeng, Guifang, et al. “A Layered Bi2Te3@PPy Cathode for Aqueous Zinc‐Ion Batteries:
    Mechanism and Application in Printed Flexible Batteries.” <i>Advanced Materials</i>,
    vol. 36, no. 1, 2470004, Wiley, 2024, doi:<a href="https://doi.org/10.1002/adma.202470004">10.1002/adma.202470004</a>.'
  short: 'G. Zeng, Q. Sun, S. Horta, S. Wang, X. Lu, C.Y. Zhang, J. Li, J. Li, L.
    Ci, Y. Tian, M. Ibáñez, A. Cabot, A Layered Bi2Te3@PPy Cathode for Aqueous Zinc‐Ion
    Batteries: Mechanism and Application in Printed Flexible Batteries, Wiley, 2024.'
date_created: 2025-07-21T08:53:06Z
date_published: 2024-01-04T00:00:00Z
date_updated: 2026-06-18T18:19:28Z
day: '04'
ddc:
- '530'
department:
- _id: MaIb
doi: 10.1002/adma.202470004
fulldoi: https://doi.org/10.1002/adma.202470004
intvolume: '        36'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1002/adma.202470004
month: '01'
oa: 1
oa_version: Published Version
publication: Advanced Materials
publication_identifier:
  eissn:
  - 1521-4095
  issn:
  - 0935-9648
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: 'A layered Bi2Te3@PPy cathode for aqueous Zinc‐Ion batteries: Mechanism and
  application in printed flexible batteries'
type: other_academic_publication
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2024'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '20060'
abstract:
- lang: spa
  text: "Un fenómeno a menudo asociado con el autismo es un modo atípico de función
    ejecutiva, cuyas manifestaciones incluyen dificultad para iniciar tareas. En algunos
    casos, esto va acompañado de sentimientos de inercia y sensaciones que pueden
    describirse como inquietud y parálisis simultáneas. En consecuencia, la dificultad
    para iniciar las tareas puede dar lugar a la procrastinación, ya sea simplemente
    posponiendo el trabajo en la tarea objetivo o realizando otras tareas no relacionadas
    antes de dedicarse a la tarea objetivo. Curiosamente, sin embargo, también está
    documentado que, una vez iniciada una tarea, los autistas pueden centrarse en
    ella intensamente y durante periodos prolongados de tiempo, especialmente cuando
    les resulta interesante.&#x0D;\r\nEste trabajo utiliza el procesamiento predictivo
    y la inferencia activa para modelar la relación entre la función ejecutiva, la
    procrastinación y la hiperfocalización en el autismo. Este modelo integra las
    causas conocidas y propuestas de los déficits en la función ejecutiva y el papel
    que desempeña el interés en la regulación de la atención y la motivación. El modelo
    propone que la procrastinación es el resultado de procesos diferenciales de minimización
    de errores de predicción, como la ponderación de estímulos sensoriales. Se discuten
    los vínculos con modelos propuestos previamente, como la coherencia central débil
    (CCC), y la teoría de los priores altos e inflexibles de los errores de predicción
    en el autismo (HIPPEA)."
- lang: eng
  text: A  phenomenon  often  associated  with  autism  is  an  atypical  mode  of  executive  function,
    manifestations  of  which  include  difficulty  in  initiating  tasks.  In  some  cases,  this
    is accompanied  by  feelings  of  inertia  and  sensations  that  can  be  described  as  simultaneous
    restlessness  and  paralysis.  Consequently,  difficulty  in  getting  started  on  tasks  can  result  in
    procrastination,  either  by  simply  postponing  working  on  the  target  task  or  by  performing
    other  unrelated  tasks  before  engaging  in  the  target  task.  Interestingly,  however,  it  is  also
    documented  that  once  a  task  has  been  started,  autistic  persons  may  focus  on  it  intensely
    and for prolonged periods of time, especially when it is interesting to them.This  paper  uses  predictive  processing  and  active  inference  to  model  therelationship
    between  executive   function,   procrastination,  and   hyperfocus   in  autism.   This   model
    integrates  the  known  and  proposed  causes  of  deficits  in  executive  function  and  the  role
    played  by  interest  in  attention  regulation  and  motivation.  The  model  proposes  that
    procrastination  is  the  outcome  of  differential  prediction-error  minimizing  processes,  such
    as weighting of sensory stimuli. Links to previously proposed models such as weak
    central coherence  (WCC),  and  the  theory  of  high,  inflexible  priors  of  prediction  errors  in  autism
    (HIPPEA) are discussed
acknowledgement: Sidney Carls-Diamante was supported by the Federal Ministry of Education
  and Research (BMBF) and the Baden-Württemberg Ministry of Science as part of the
  Excellence Strategy of the German Federal and State Governments. Alice Laciny was
  supported by the 2021 UNESCO L’Oréal grant for women in science, awarded for the
  project “Neurodiversity and anthropomorphism in social insect research”.
article_processing_charge: Yes
article_type: original
author:
- first_name: Sidney
  full_name: Carls-Diamante, Sidney
  last_name: Carls-Diamante
- first_name: Alice
  full_name: Laciny, Alice
  id: accace3f-3f77-11eb-b1df-f1221b04cb95
  last_name: Laciny
  orcid: 0000-0002-5485-1391
citation:
  ama: 'Carls-Diamante S, Laciny A. Stuck in uncertainty: A predictive processing/
    active inference account of procrastination-like behaviour in autism. <i>Lógoi
    Revista de Filosofía</i>. 2024;(45):88-114. doi:<a href="https://doi.org/10.62876/lr.vi45.6481">10.62876/lr.vi45.6481</a>'
  apa: 'Carls-Diamante, S., &#38; Laciny, A. (2024). Stuck in uncertainty: A predictive
    processing/ active inference account of procrastination-like behaviour in autism.
    <i>Lógoi. Revista de Filosofía</i>. Universidad Católica Andrés Bello. <a href="https://doi.org/10.62876/lr.vi45.6481">https://doi.org/10.62876/lr.vi45.6481</a>'
  chicago: 'Carls-Diamante, Sidney, and Alice Laciny. “Stuck in Uncertainty: A Predictive
    Processing/ Active Inference Account of Procrastination-like Behaviour in Autism.”
    <i>Lógoi. Revista de Filosofía</i>. Universidad Católica Andrés Bello, 2024. <a
    href="https://doi.org/10.62876/lr.vi45.6481">https://doi.org/10.62876/lr.vi45.6481</a>.'
  ieee: 'S. Carls-Diamante and A. Laciny, “Stuck in uncertainty: A predictive processing/
    active inference account of procrastination-like behaviour in autism,” <i>Lógoi.
    Revista de Filosofía</i>, no. 45. Universidad Católica Andrés Bello, pp. 88–114,
    2024.'
  ista: 'Carls-Diamante S, Laciny A. 2024. Stuck in uncertainty: A predictive processing/
    active inference account of procrastination-like behaviour in autism. Lógoi. Revista
    de Filosofía. (45), 88–114.'
  mla: 'Carls-Diamante, Sidney, and Alice Laciny. “Stuck in Uncertainty: A Predictive
    Processing/ Active Inference Account of Procrastination-like Behaviour in Autism.”
    <i>Lógoi. Revista de Filosofía</i>, no. 45, Universidad Católica Andrés Bello,
    2024, pp. 88–114, doi:<a href="https://doi.org/10.62876/lr.vi45.6481">10.62876/lr.vi45.6481</a>.'
  short: S. Carls-Diamante, A. Laciny, Lógoi. Revista de Filosofía (2024) 88–114.
corr_author: '1'
date_created: 2025-07-21T10:35:39Z
date_published: 2024-03-19T00:00:00Z
date_updated: 2025-09-09T08:51:00Z
day: '19'
ddc:
- '570'
doi: 10.62876/lr.vi45.6481
file:
- access_level: open_access
  checksum: 04c950f26ad68455c3a303c87ccf2349
  content_type: application/pdf
  creator: dernst
  date_created: 2025-09-09T08:48:53Z
  date_updated: 2025-09-09T08:48:53Z
  file_id: '20317'
  file_name: 2025_Logoi_CarlsDiamante.pdf
  file_size: 354124
  relation: main_file
  success: 1
file_date_updated: 2025-09-09T08:48:53Z
fulldoi: https://doi.org/10.62876/lr.vi45.6481
has_accepted_license: '1'
issue: '45'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 88-114
publication: Lógoi. Revista de Filosofía
publication_identifier:
  eissn:
  - 1316-693X
  issn:
  - 2790-5144
publication_status: published
publisher: Universidad Católica Andrés Bello
quality_controlled: '1'
status: public
title: 'Stuck in uncertainty: A predictive processing/ active inference account of
  procrastination-like behaviour in autism'
tmp:
  image: /images/cc_by_nc_sa.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
    BY-NC-SA 4.0)
  short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
_id: '20121'
abstract:
- lang: eng
  text: PyDaddy is an open source package which is a key contribution of the manuscript
    Nabeel et al, arXiv:2205.02645. The basic scientific premise for this package
    is to discover the nature of stochasticity in ecological time series datasets.
    It is well known that the stochasticity can affect the dynamics of ecological
    systems in counter-intuitive ways. Without understanding the equations (typically,
    in the form of stochastic differential equations or SDEs, in short) that govern
    the dynamics of populations or ecosystems, it's challenging to determine the impact
    of randomness on real datasets. In this manuscript and accompanying package, we
    introduce a methodology for discovering equations (SDEs) that transforms time
    series data of state variables into stochastic differential equations. This approach
    merges traditional stochastic calculus with modern equation-discovery techniques.
    We showcase the generality of our method through various applications and discuss
    its limitations and potential pitfalls, offering diagnostic measures to address
    these challenges.
acknowledgement: This study was partially funded by Science and Engineering Research
  Board, Department of Science and Technology, Government of India to Vishwesha Guttal.
article_processing_charge: No
author:
- first_name: Arshed
  full_name: Nabeel, Arshed
  last_name: Nabeel
- first_name: Ashwin
  full_name: Karichannavar, Ashwin
  last_name: Karichannavar
- first_name: Shuaib
  full_name: Palathingal, Shuaib
  last_name: Palathingal
- first_name: Jitesh
  full_name: Jhawar, Jitesh
  last_name: Jhawar
- first_name: David
  full_name: Brückner, David
  id: e1e86031-6537-11eb-953a-f7ab92be508d
  last_name: Brückner
  orcid: 0000-0001-7205-2975
- first_name: Masila
  full_name: Danny Raj, Masila
  last_name: Danny Raj
- first_name: Vishwesha
  full_name: Guttal, Vishwesha
  last_name: Guttal
citation:
  ama: 'Nabeel A, Karichannavar A, Palathingal S, et al. PyDaddy: A Python Package
    for Discovering SDEs from Time Series Data. 2024. doi:<a href="https://doi.org/10.5281/ZENODO.7137151">10.5281/ZENODO.7137151</a>'
  apa: 'Nabeel, A., Karichannavar, A., Palathingal, S., Jhawar, J., Brückner, D.,
    Danny Raj, M., &#38; Guttal, V. (2024). PyDaddy: A Python Package for Discovering
    SDEs from Time Series Data. Zenodo. <a href="https://doi.org/10.5281/ZENODO.7137151">https://doi.org/10.5281/ZENODO.7137151</a>'
  chicago: 'Nabeel, Arshed, Ashwin Karichannavar, Shuaib Palathingal, Jitesh Jhawar,
    David Brückner, Masila Danny Raj, and Vishwesha Guttal. “PyDaddy: A Python Package
    for Discovering SDEs from Time Series Data.” Zenodo, 2024. <a href="https://doi.org/10.5281/ZENODO.7137151">https://doi.org/10.5281/ZENODO.7137151</a>.'
  ieee: 'A. Nabeel <i>et al.</i>, “PyDaddy: A Python Package for Discovering SDEs
    from Time Series Data.” Zenodo, 2024.'
  ista: 'Nabeel A, Karichannavar A, Palathingal S, Jhawar J, Brückner D, Danny Raj
    M, Guttal V. 2024. PyDaddy: A Python Package for Discovering SDEs from Time Series
    Data, Zenodo, <a href="https://doi.org/10.5281/ZENODO.7137151">10.5281/ZENODO.7137151</a>.'
  mla: 'Nabeel, Arshed, et al. <i>PyDaddy: A Python Package for Discovering SDEs from
    Time Series Data</i>. Zenodo, 2024, doi:<a href="https://doi.org/10.5281/ZENODO.7137151">10.5281/ZENODO.7137151</a>.'
  short: A. Nabeel, A. Karichannavar, S. Palathingal, J. Jhawar, D. Brückner, M. Danny
    Raj, V. Guttal, (2024).
date_created: 2025-08-05T06:49:59Z
date_published: 2024-09-18T00:00:00Z
date_updated: 2025-09-30T14:14:42Z
day: '18'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.5281/ZENODO.7137151
fulldoi: https://doi.org/10.5281/ZENODO.7137151
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.7137151
month: '09'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '20056'
    relation: used_for_analysis_in
    status: public
status: public
title: 'PyDaddy: A Python Package for Discovering SDEs from Time Series Data'
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_type: closed access
_id: '20156'
abstract:
- lang: eng
  text: Integrative analyses that incorporate different levels of ‘-omics’ data represent
    a powerful tool for deciphering the biological mechanisms that underlie environmental
    influences on mental health and disease. This Comment highlights various aspects
    of such multi-omics approaches, using the example of the EU-funded environMENTAL
    project.
acknowledgement: 'This work was supported by the Horizon 2021 (grant 101057429) and
  UK Research and Innovation (grants 10038599 and 10041392)-funded project environMENTAL.
  Other funding included the Medical Research Council and Medical Research Foundation
  (MR/R00465X/, MRF-058-0004-RG-DESRI, ‘ESTRA’- Neurobiological underpinning of eating
  disorders: integrative biopsychosocial longitudinal analyses in adolescents; and
  MR/S020306/1, MRF-058-0009-RG-DESR-C0759 ‘ESTRA’-Establishing causal relationships
  between biopsychosocial predictors and correlates of eating disorders and their
  mediation by neural pathways), the EU-funded FP6 Integrated Project IMAGEN (reinforcement-related
  behavior in normal brain function and psychopathology; LSHM-CT- 2007-037286), the
  Horizon 2020-funded European Research Council advanced grant for STRATIFY (brain
  network-based stratification of reinforcement-related disorders; 695313) and the
  National Institute for Health Research (NIHR) Biomedical Research Centre at South
  London and Maudsley NHS Foundation Trust and King’s College London. This paper represents
  independent research, partly funded by the NIHR Maudsley Biomedical Research Centre
  at South London and Maudsley NHS Foundation Trust and King’s College London. The
  views expressed are those of the authors and not necessarily those of the NIHR or
  the Department of Health and Social Care. The authors thank C. Schmäl for proofreading
  the manuscript.'
article_processing_charge: No
article_type: comment
author:
- first_name: Sylvane
  full_name: Desrivières, Sylvane
  last_name: Desrivières
- first_name: Abigail
  full_name: Miller, Abigail
  last_name: Miller
- first_name: Carina M.
  full_name: Mathey, Carina M.
  last_name: Mathey
- first_name: Xinyang
  full_name: Yu, Xinyang
  last_name: Yu
- first_name: Di
  full_name: Chen, Di
  last_name: Chen
- first_name: Kofoworola
  full_name: Agunbiade, Kofoworola
  last_name: Agunbiade
- first_name: Stefanie
  full_name: Heilmann-Heimbach, Stefanie
  last_name: Heilmann-Heimbach
- first_name: Andreas J.
  full_name: Forstner, Andreas J.
  last_name: Forstner
- first_name: Gunter
  full_name: Schumann, Gunter
  last_name: Schumann
- first_name: Per
  full_name: Hoffmann, Per
  last_name: Hoffmann
- first_name: Markus M.
  full_name: Nöthen, Markus M.
  last_name: Nöthen
- first_name: George
  full_name: Ogoh, George
  last_name: Ogoh
- first_name: Bernd
  full_name: Stahl, Bernd
  last_name: Stahl
- first_name: Allan H.
  full_name: Young, Allan H.
  last_name: Young
- first_name: Nicholas
  full_name: Clinton, Nicholas
  last_name: Clinton
- first_name: Paul
  full_name: Thompson, Paul
  last_name: Thompson
- first_name: Ameli
  full_name: Schwalber, Ameli
  last_name: Schwalber
- first_name: Jingyu
  full_name: Liu, Jingyu
  last_name: Liu
- first_name: Vince
  full_name: Calhoun, Vince
  last_name: Calhoun
- first_name: Xiao
  full_name: Chang, Xiao
  last_name: Chang
- first_name: Yunman
  full_name: Xia, Yunman
  last_name: Xia
- first_name: Yanting
  full_name: Gong, Yanting
  last_name: Gong
- first_name: Tianye
  full_name: Jia, Tianye
  last_name: Jia
- first_name: Paul
  full_name: Renner, Paul
  last_name: Renner
- first_name: Sören
  full_name: Hese, Sören
  last_name: Hese
- first_name: Arantxa
  full_name: Giner, Arantxa
  last_name: Giner
- first_name: Mavi
  full_name: Sanchez, Mavi
  last_name: Sanchez
- first_name: Elena
  full_name: Alvarez, Elena
  last_name: Alvarez
- first_name: Bernhard
  full_name: Spanlang, Bernhard
  last_name: Spanlang
- first_name: Charlie
  full_name: Pearmund, Charlie
  last_name: Pearmund
- first_name: Anastasios Polykarpos
  full_name: Athanasiadis, Anastasios Polykarpos
  last_name: Athanasiadis
- first_name: Lisa
  full_name: Otten, Lisa
  last_name: Otten
- first_name: Séverine
  full_name: Pitel, Séverine
  last_name: Pitel
- first_name: Spase
  full_name: Petkoski, Spase
  last_name: Petkoski
- first_name: Viktor
  full_name: Jirsa, Viktor
  last_name: Jirsa
- first_name: Karen
  full_name: Schmitt, Karen
  last_name: Schmitt
- first_name: Johannes
  full_name: Wilbertz, Johannes
  last_name: Wilbertz
- first_name: Myrto
  full_name: Patraskaki, Myrto
  last_name: Patraskaki
- first_name: Peter
  full_name: Sommer, Peter
  last_name: Sommer
- first_name: Isabelle
  full_name: Claus, Isabelle
  last_name: Claus
- first_name: Alvaro
  full_name: Pastor, Alvaro
  last_name: Pastor
- first_name: Jaime
  full_name: Gallego, Jaime
  last_name: Gallego
- first_name: Francisco Eiroa
  full_name: Orosa, Francisco Eiroa
  last_name: Orosa
- first_name: Guillem Feixas
  full_name: Viapiana, Guillem Feixas
  last_name: Viapiana
- first_name: Mel
  full_name: Slater, Mel
  last_name: Slater
- first_name: Lena
  full_name: Marr, Lena
  id: 4406F586-F248-11E8-B48F-1D18A9856A87
  last_name: Marr
- first_name: Gaia
  full_name: Novarino, Gaia
  id: 3E57A680-F248-11E8-B48F-1D18A9856A87
  last_name: Novarino
  orcid: 0000-0002-7673-7178
- first_name: Andre
  full_name: Marquand, Andre
  last_name: Marquand
- first_name: Sarah Jane
  full_name: Böttger, Sarah Jane
  last_name: Böttger
- first_name: Mira
  full_name: Tschorn, Mira
  last_name: Tschorn
- first_name: Michael
  full_name: Rapp, Michael
  last_name: Rapp
- first_name: Helga
  full_name: Ask, Helga
  last_name: Ask
- first_name: Rikka
  full_name: Kjelkenes, Rikka
  last_name: Kjelkenes
- first_name: Sara
  full_name: Fernandez, Sara
  last_name: Fernandez
- first_name: Dennis
  full_name: Van Der Meer, Dennis
  last_name: Van Der Meer
- first_name: Lars T.
  full_name: Westlye, Lars T.
  last_name: Westlye
- first_name: Ole A.
  full_name: Andreassen, Ole A.
  last_name: Andreassen
- first_name: Rieke
  full_name: Aden, Rieke
  last_name: Aden
- first_name: Beke
  full_name: Seefried, Beke
  last_name: Seefried
- first_name: Sebastian
  full_name: Siehl, Sebastian
  last_name: Siehl
- first_name: Frauke
  full_name: Nees, Frauke
  last_name: Nees
- first_name: Maja
  full_name: Neidhart, Maja
  last_name: Neidhart
- first_name: Argyris
  full_name: Stringaris, Argyris
  last_name: Stringaris
- first_name: Emanuel
  full_name: Schwarz, Emanuel
  last_name: Schwarz
- first_name: Nathalie
  full_name: Holz, Nathalie
  last_name: Holz
- first_name: Heike
  full_name: Tost, Heike
  last_name: Tost
- first_name: Andreas
  full_name: Meyer-Lindenberg, Andreas
  last_name: Meyer-Lindenberg
- first_name: Nina
  full_name: Christmann, Nina
  last_name: Christmann
- first_name: Karina
  full_name: Jansone, Karina
  last_name: Jansone
- first_name: Tobias
  full_name: Banaschewski, Tobias
  last_name: Banaschewski
- first_name: Jamie
  full_name: Banks, Jamie
  last_name: Banks
- first_name: Kerstin
  full_name: Schepanski, Kerstin
  last_name: Schepanski
- first_name: Tatjana
  full_name: Schütz, Tatjana
  last_name: Schütz
- first_name: Ulrike Helene
  full_name: Taron, Ulrike Helene
  last_name: Taron
- first_name: Roland
  full_name: Eils, Roland
  last_name: Eils
- first_name: Jean Charles
  full_name: Roy, Jean Charles
  last_name: Roy
- first_name: Tristram A.
  full_name: Lett, Tristram A.
  last_name: Lett
- first_name: Hedi
  full_name: Kebir, Hedi
  last_name: Kebir
- first_name: Elli
  full_name: Polemiti, Elli
  last_name: Polemiti
- first_name: Esther
  full_name: Hitchen, Esther
  last_name: Hitchen
- first_name: Marcel
  full_name: Jentsch, Marcel
  last_name: Jentsch
- first_name: Emin
  full_name: Serin, Emin
  last_name: Serin
- first_name: Antoine
  full_name: Bernas, Antoine
  last_name: Bernas
- first_name: Nilakshi
  full_name: Vaidya, Nilakshi
  last_name: Vaidya
- first_name: Sven
  full_name: Twardziok, Sven
  last_name: Twardziok
- first_name: Markus
  full_name: Ralser, Markus
  last_name: Ralser
- first_name: Andreas
  full_name: Heinz, Andreas
  last_name: Heinz
- first_name: Henrik
  full_name: Walter, Henrik
  last_name: Walter
citation:
  ama: Desrivières S, Miller A, Mathey CM, et al. Multi-omics analyses of the environMENTAL
    project provide insights into mental health and disease. <i>Nature Mental Health</i>.
    2024;2(10):1131-1133. doi:<a href="https://doi.org/10.1038/s44220-024-00317-y">10.1038/s44220-024-00317-y</a>
  apa: Desrivières, S., Miller, A., Mathey, C. M., Yu, X., Chen, D., Agunbiade, K.,
    … Walter, H. (2024). Multi-omics analyses of the environMENTAL project provide
    insights into mental health and disease. <i>Nature Mental Health</i>. Springer
    Nature. <a href="https://doi.org/10.1038/s44220-024-00317-y">https://doi.org/10.1038/s44220-024-00317-y</a>
  chicago: Desrivières, Sylvane, Abigail Miller, Carina M. Mathey, Xinyang Yu, Di
    Chen, Kofoworola Agunbiade, Stefanie Heilmann-Heimbach, et al. “Multi-Omics Analyses
    of the EnvironMENTAL Project Provide Insights into Mental Health and Disease.”
    <i>Nature Mental Health</i>. Springer Nature, 2024. <a href="https://doi.org/10.1038/s44220-024-00317-y">https://doi.org/10.1038/s44220-024-00317-y</a>.
  ieee: S. Desrivières <i>et al.</i>, “Multi-omics analyses of the environMENTAL project
    provide insights into mental health and disease,” <i>Nature Mental Health</i>,
    vol. 2, no. 10. Springer Nature, pp. 1131–1133, 2024.
  ista: Desrivières S, Miller A, Mathey CM, Yu X, Chen D, Agunbiade K, Heilmann-Heimbach
    S, Forstner AJ, Schumann G, Hoffmann P, Nöthen MM, Ogoh G, Stahl B, Young AH,
    Clinton N, Thompson P, Schwalber A, Liu J, Calhoun V, Chang X, Xia Y, Gong Y,
    Jia T, Renner P, Hese S, Giner A, Sanchez M, Alvarez E, Spanlang B, Pearmund C,
    Athanasiadis AP, Otten L, Pitel S, Petkoski S, Jirsa V, Schmitt K, Wilbertz J,
    Patraskaki M, Sommer P, Claus I, Pastor A, Gallego J, Orosa FE, Viapiana GF, Slater
    M, Marr L, Novarino G, Marquand A, Böttger SJ, Tschorn M, Rapp M, Ask H, Kjelkenes
    R, Fernandez S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried B,
    Siehl S, Nees F, Neidhart M, Stringaris A, Schwarz E, Holz N, Tost H, Meyer-Lindenberg
    A, Christmann N, Jansone K, Banaschewski T, Banks J, Schepanski K, Schütz T, Taron
    UH, Eils R, Roy JC, Lett TA, Kebir H, Polemiti E, Hitchen E, Jentsch M, Serin
    E, Bernas A, Vaidya N, Twardziok S, Ralser M, Heinz A, Walter H. 2024. Multi-omics
    analyses of the environMENTAL project provide insights into mental health and
    disease. Nature Mental Health. 2(10), 1131–1133.
  mla: Desrivières, Sylvane, et al. “Multi-Omics Analyses of the EnvironMENTAL Project
    Provide Insights into Mental Health and Disease.” <i>Nature Mental Health</i>,
    vol. 2, no. 10, Springer Nature, 2024, pp. 1131–33, doi:<a href="https://doi.org/10.1038/s44220-024-00317-y">10.1038/s44220-024-00317-y</a>.
  short: S. Desrivières, A. Miller, C.M. Mathey, X. Yu, D. Chen, K. Agunbiade, S.
    Heilmann-Heimbach, A.J. Forstner, G. Schumann, P. Hoffmann, M.M. Nöthen, G. Ogoh,
    B. Stahl, A.H. Young, N. Clinton, P. Thompson, A. Schwalber, J. Liu, V. Calhoun,
    X. Chang, Y. Xia, Y. Gong, T. Jia, P. Renner, S. Hese, A. Giner, M. Sanchez, E.
    Alvarez, B. Spanlang, C. Pearmund, A.P. Athanasiadis, L. Otten, S. Pitel, S. Petkoski,
    V. Jirsa, K. Schmitt, J. Wilbertz, M. Patraskaki, P. Sommer, I. Claus, A. Pastor,
    J. Gallego, F.E. Orosa, G.F. Viapiana, M. Slater, L. Marr, G. Novarino, A. Marquand,
    S.J. Böttger, M. Tschorn, M. Rapp, H. Ask, R. Kjelkenes, S. Fernandez, D. Van
    Der Meer, L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried, S. Siehl, F. Nees,
    M. Neidhart, A. Stringaris, E. Schwarz, N. Holz, H. Tost, A. Meyer-Lindenberg,
    N. Christmann, K. Jansone, T. Banaschewski, J. Banks, K. Schepanski, T. Schütz,
    U.H. Taron, R. Eils, J.C. Roy, T.A. Lett, H. Kebir, E. Polemiti, E. Hitchen, M.
    Jentsch, E. Serin, A. Bernas, N. Vaidya, S. Twardziok, M. Ralser, A. Heinz, H.
    Walter, Nature Mental Health 2 (2024) 1131–1133.
date_created: 2025-08-10T22:01:30Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2025-08-11T06:44:03Z
day: '01'
department:
- _id: GaNo
doi: 10.1038/s44220-024-00317-y
fulldoi: https://doi.org/10.1038/s44220-024-00317-y
intvolume: '         2'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 1131-1133
publication: Nature Mental Health
publication_identifier:
  eissn:
  - 2731-6076
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multi-omics analyses of the environMENTAL project provide insights into mental
  health and disease
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2024'
...
---
OA_type: closed access
_id: '20157'
abstract:
- lang: eng
  text: The focus of much of contemporary research ethics is on compliance with established
    protocols. However, large data-driven neuroscience research raises new ethical
    concerns that have no agreed-upon solution. Here we reflect on these challenges
    and propose better integration of public and patient involvement in this evolving
    landscape.
acknowledgement: Funded provided by the European Union. Complementary funding was
  received by UK Research and Innovation (UKRI) under the UK government’s Horizon
  Europe funding guarantee (10131373and 10038599) and Ministry of Science and Technology
  of China (MOST) National Key Project of ‘Inter-governmental International Scientific
  and Technological Innovation Cooperation’ (2023YFE0199700).
article_number: 1128-1130
article_processing_charge: No
article_type: comment
author:
- first_name: Bernd
  full_name: Stahl, Bernd
  last_name: Stahl
- first_name: George
  full_name: Ogoh, George
  last_name: Ogoh
- first_name: Gunter
  full_name: Schumann, Gunter
  last_name: Schumann
- first_name: Henrik
  full_name: Walter, Henrik
  last_name: Walter
- first_name: Bernd
  full_name: Stahl, Bernd
  last_name: Stahl
- first_name: Allan H.
  full_name: Young, Allan H.
  last_name: Young
- first_name: Sylvane
  full_name: Desrivières, Sylvane
  last_name: Desrivières
- first_name: Nicholas
  full_name: Clinton, Nicholas
  last_name: Clinton
- first_name: Paul
  full_name: Thompson, Paul
  last_name: Thompson
- first_name: Ameli
  full_name: Schwalber, Ameli
  last_name: Schwalber
- first_name: Jingyu
  full_name: Liu, Jingyu
  last_name: Liu
- first_name: Vince
  full_name: Calhoun, Vince
  last_name: Calhoun
- first_name: Xiao
  full_name: Chang, Xiao
  last_name: Chang
- first_name: Yunman
  full_name: Xia, Yunman
  last_name: Xia
- first_name: Yanting
  full_name: Gong, Yanting
  last_name: Gong
- first_name: Tianye
  full_name: Jia, Tianye
  last_name: Jia
- first_name: Paul
  full_name: Renner, Paul
  last_name: Renner
- first_name: Sören
  full_name: Hese, Sören
  last_name: Hese
- first_name: Arantxa
  full_name: Giner, Arantxa
  last_name: Giner
- first_name: Mavi
  full_name: Sanchez, Mavi
  last_name: Sanchez
- first_name: Elena
  full_name: Alvarez, Elena
  last_name: Alvarez
- first_name: Bernhard
  full_name: Spanlang, Bernhard
  last_name: Spanlang
- first_name: Charlie
  full_name: Pearmund, Charlie
  last_name: Pearmund
- first_name: Anastasios Polykarpos
  full_name: Athanasiadis, Anastasios Polykarpos
  last_name: Athanasiadis
- first_name: Lisa
  full_name: Otten, Lisa
  last_name: Otten
- first_name: Séverine
  full_name: Pitel, Séverine
  last_name: Pitel
- first_name: Spase
  full_name: Petkoski, Spase
  last_name: Petkoski
- first_name: Viktor
  full_name: Jirsa, Viktor
  last_name: Jirsa
- first_name: Karen
  full_name: Schmitt, Karen
  last_name: Schmitt
- first_name: Johannes
  full_name: Wilbertz, Johannes
  last_name: Wilbertz
- first_name: Myrto
  full_name: Patraskaki, Myrto
  last_name: Patraskaki
- first_name: Peter
  full_name: Sommer, Peter
  last_name: Sommer
- first_name: Stefanie
  full_name: Heilmann-Heimbach, Stefanie
  last_name: Heilmann-Heimbach
- first_name: Carina M.
  full_name: Mathey, Carina M.
  last_name: Mathey
- first_name: Abigail
  full_name: Miller, Abigail
  last_name: Miller
- first_name: Isabelle
  full_name: Claus, Isabelle
  last_name: Claus
- first_name: Markus M.
  full_name: Nöthen, Markus M.
  last_name: Nöthen
- first_name: Per
  full_name: Hoffmann, Per
  last_name: Hoffmann
- first_name: Andreas J.
  full_name: Forstner, Andreas J.
  last_name: Forstner
- first_name: Alvaro
  full_name: Pastor, Alvaro
  last_name: Pastor
- first_name: Jaime
  full_name: Gallego, Jaime
  last_name: Gallego
- first_name: Francisco Eiroa
  full_name: Orosa, Francisco Eiroa
  last_name: Orosa
- first_name: Guillem Feixas
  full_name: Viapiana, Guillem Feixas
  last_name: Viapiana
- first_name: Mel
  full_name: Slater, Mel
  last_name: Slater
- first_name: Lena
  full_name: Marr, Lena
  id: 4406F586-F248-11E8-B48F-1D18A9856A87
  last_name: Marr
- first_name: Gaia
  full_name: Novarino, Gaia
  id: 3E57A680-F248-11E8-B48F-1D18A9856A87
  last_name: Novarino
  orcid: 0000-0002-7673-7178
- first_name: Andre
  full_name: Marquand, Andre
  last_name: Marquand
- first_name: Sarah Jane
  full_name: Böttger, Sarah Jane
  last_name: Böttger
- first_name: Mira
  full_name: Tschorn, Mira
  last_name: Tschorn
- first_name: Michael
  full_name: Rapp, Michael
  last_name: Rapp
- first_name: Helga
  full_name: Ask, Helga
  last_name: Ask
- first_name: Rikka
  full_name: Kjelkenes, Rikka
  last_name: Kjelkenes
- first_name: Sara
  full_name: Fernandez, Sara
  last_name: Fernandez
- first_name: Dennis
  full_name: Van Der Meer, Dennis
  last_name: Van Der Meer
- first_name: Lars T.
  full_name: Westlye, Lars T.
  last_name: Westlye
- first_name: Ole A.
  full_name: Andreassen, Ole A.
  last_name: Andreassen
- first_name: Rieke
  full_name: Aden, Rieke
  last_name: Aden
- first_name: Beke
  full_name: Seefried, Beke
  last_name: Seefried
- first_name: Sebastian
  full_name: Siehl, Sebastian
  last_name: Siehl
- first_name: Frauke
  full_name: Nees, Frauke
  last_name: Nees
- first_name: Maja
  full_name: Neidhart, Maja
  last_name: Neidhart
- first_name: Argyris
  full_name: Stringaris, Argyris
  last_name: Stringaris
- first_name: Emanuel
  full_name: Schwarz, Emanuel
  last_name: Schwarz
- first_name: Nathalie
  full_name: Holz, Nathalie
  last_name: Holz
- first_name: Heike
  full_name: Tost, Heike
  last_name: Tost
- first_name: Andreas
  full_name: Meyer-Lindenberg, Andreas
  last_name: Meyer-Lindenberg
- first_name: Nina
  full_name: Christmann, Nina
  last_name: Christmann
- first_name: Karina
  full_name: Jansone, Karina
  last_name: Jansone
- first_name: Tobias
  full_name: Banaschewski, Tobias
  last_name: Banaschewski
- first_name: Jamie
  full_name: Banks, Jamie
  last_name: Banks
- first_name: Kerstin
  full_name: Schepanski, Kerstin
  last_name: Schepanski
- first_name: Tatjana
  full_name: Schütz, Tatjana
  last_name: Schütz
- first_name: Ulrike Helene
  full_name: Taron, Ulrike Helene
  last_name: Taron
- first_name: Roland
  full_name: Eils, Roland
  last_name: Eils
- first_name: Jean Charles
  full_name: Roy, Jean Charles
  last_name: Roy
- first_name: Tristram A.
  full_name: Lett, Tristram A.
  last_name: Lett
- first_name: Hedi
  full_name: Kebir, Hedi
  last_name: Kebir
- first_name: Elli
  full_name: Polemiti, Elli
  last_name: Polemiti
- first_name: Esther
  full_name: Hitchen, Esther
  last_name: Hitchen
- first_name: Marcel
  full_name: Jentsch, Marcel
  last_name: Jentsch
- first_name: Emin
  full_name: Serin, Emin
  last_name: Serin
- first_name: Antoine
  full_name: Bernas, Antoine
  last_name: Bernas
- first_name: Nilakshi
  full_name: Vaidya, Nilakshi
  last_name: Vaidya
- first_name: Sven
  full_name: Twardziok, Sven
  last_name: Twardziok
- first_name: Markus
  full_name: Ralser, Markus
  last_name: Ralser
- first_name: Andreas
  full_name: Heinz, Andreas
  last_name: Heinz
- first_name: Henrik
  full_name: Walter, Henrik
  last_name: Walter
citation:
  ama: Stahl B, Ogoh G, Schumann G, et al. Rethinking ethics in interdisciplinary
    and big data-driven neuroscience projects. <i>Nature Mental Health</i>. 2024;2(10).
    doi:<a href="https://doi.org/10.1038/s44220-024-00320-3">10.1038/s44220-024-00320-3</a>
  apa: Stahl, B., Ogoh, G., Schumann, G., Walter, H., Stahl, B., Young, A. H., … Walter,
    H. (2024). Rethinking ethics in interdisciplinary and big data-driven neuroscience
    projects. <i>Nature Mental Health</i>. Springer Nature. <a href="https://doi.org/10.1038/s44220-024-00320-3">https://doi.org/10.1038/s44220-024-00320-3</a>
  chicago: Stahl, Bernd, George Ogoh, Gunter Schumann, Henrik Walter, Bernd Stahl,
    Allan H. Young, Sylvane Desrivières, et al. “Rethinking Ethics in Interdisciplinary
    and Big Data-Driven Neuroscience Projects.” <i>Nature Mental Health</i>. Springer
    Nature, 2024. <a href="https://doi.org/10.1038/s44220-024-00320-3">https://doi.org/10.1038/s44220-024-00320-3</a>.
  ieee: B. Stahl <i>et al.</i>, “Rethinking ethics in interdisciplinary and big data-driven
    neuroscience projects,” <i>Nature Mental Health</i>, vol. 2, no. 10. Springer
    Nature, 2024.
  ista: Stahl B, Ogoh G, Schumann G, Walter H, Stahl B, Young AH, Desrivières S, Clinton
    N, Thompson P, Schwalber A, Liu J, Calhoun V, Chang X, Xia Y, Gong Y, Jia T, Renner
    P, Hese S, Giner A, Sanchez M, Alvarez E, Spanlang B, Pearmund C, Athanasiadis
    AP, Otten L, Pitel S, Petkoski S, Jirsa V, Schmitt K, Wilbertz J, Patraskaki M,
    Sommer P, Heilmann-Heimbach S, Mathey CM, Miller A, Claus I, Nöthen MM, Hoffmann
    P, Forstner AJ, Pastor A, Gallego J, Orosa FE, Viapiana GF, Slater M, Marr L,
    Novarino G, Marquand A, Böttger SJ, Tschorn M, Rapp M, Ask H, Kjelkenes R, Fernandez
    S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried B, Siehl S, Nees
    F, Neidhart M, Stringaris A, Schwarz E, Holz N, Tost H, Meyer-Lindenberg A, Christmann
    N, Jansone K, Banaschewski T, Banks J, Schepanski K, Schütz T, Taron UH, Eils
    R, Roy JC, Lett TA, Kebir H, Polemiti E, Hitchen E, Jentsch M, Serin E, Bernas
    A, Vaidya N, Twardziok S, Ralser M, Heinz A, Walter H. 2024. Rethinking ethics
    in interdisciplinary and big data-driven neuroscience projects. Nature Mental
    Health. 2(10), 1128–1130.
  mla: Stahl, Bernd, et al. “Rethinking Ethics in Interdisciplinary and Big Data-Driven
    Neuroscience Projects.” <i>Nature Mental Health</i>, vol. 2, no. 10, 1128–1130,
    Springer Nature, 2024, doi:<a href="https://doi.org/10.1038/s44220-024-00320-3">10.1038/s44220-024-00320-3</a>.
  short: B. Stahl, G. Ogoh, G. Schumann, H. Walter, B. Stahl, A.H. Young, S. Desrivières,
    N. Clinton, P. Thompson, A. Schwalber, J. Liu, V. Calhoun, X. Chang, Y. Xia, Y.
    Gong, T. Jia, P. Renner, S. Hese, A. Giner, M. Sanchez, E. Alvarez, B. Spanlang,
    C. Pearmund, A.P. Athanasiadis, L. Otten, S. Pitel, S. Petkoski, V. Jirsa, K.
    Schmitt, J. Wilbertz, M. Patraskaki, P. Sommer, S. Heilmann-Heimbach, C.M. Mathey,
    A. Miller, I. Claus, M.M. Nöthen, P. Hoffmann, A.J. Forstner, A. Pastor, J. Gallego,
    F.E. Orosa, G.F. Viapiana, M. Slater, L. Marr, G. Novarino, A. Marquand, S.J.
    Böttger, M. Tschorn, M. Rapp, H. Ask, R. Kjelkenes, S. Fernandez, D. Van Der Meer,
    L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried, S. Siehl, F. Nees, M. Neidhart,
    A. Stringaris, E. Schwarz, N. Holz, H. Tost, A. Meyer-Lindenberg, N. Christmann,
    K. Jansone, T. Banaschewski, J. Banks, K. Schepanski, T. Schütz, U.H. Taron, R.
    Eils, J.C. Roy, T.A. Lett, H. Kebir, E. Polemiti, E. Hitchen, M. Jentsch, E. Serin,
    A. Bernas, N. Vaidya, S. Twardziok, M. Ralser, A. Heinz, H. Walter, Nature Mental
    Health 2 (2024).
date_created: 2025-08-10T22:01:30Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2025-08-11T06:53:55Z
day: '01'
department:
- _id: GaNo
doi: 10.1038/s44220-024-00320-3
fulldoi: https://doi.org/10.1038/s44220-024-00320-3
intvolume: '         2'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
publication: Nature Mental Health
publication_identifier:
  eissn:
  - 2731-6076
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rethinking ethics in interdisciplinary and big data-driven neuroscience projects
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '9651'
abstract:
- lang: eng
  text: We introduce a hierachy of equivalence relations on the set of separated nets
    of a given Euclidean space, indexed by concave increasing functions ϕ:(0,∞)→(0,∞).
    Two separated nets are called ϕ-displacement equivalent if, roughly speaking,
    there is a bijection between them which, for large radii R, displaces points of
    norm at most R by something of order at most ϕ(R). We show that the spectrum of
    ϕ-displacement equivalence spans from the established notion of bounded displacement
    equivalence, which corresponds to bounded ϕ, to the indiscrete equivalence relation,
    coresponding to ϕ(R)∈Ω(R), in which all separated nets are equivalent. In between
    the two ends of this spectrum, the notions of ϕ-displacement equivalence are shown
    to be pairwise distinct with respect to the asymptotic classes of ϕ(R) for R→∞.
    We further undertake a comparison of our notion of ϕ-displacement equivalence
    with previously studied relations on separated nets. Particular attention is given
    to the interaction of the notions of ϕ-displacement equivalence with that of bilipschitz
    equivalence.
acknowledgement: 'Open access funding provided by Institute of Science and Technology
  (IST Austria). This work was started while both authors were employed at the University
  of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35.
  It was continued when the first named author was employed at University of Leipzig
  and the second named author was employed at Institute of Science and Technology
  of Austria, where he was supported by an IST Fellowship.'
article_number: '15'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Michael
  full_name: Dymond, Michael
  last_name: Dymond
- first_name: Vojtech
  full_name: Kaluza, Vojtech
  id: 21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E
  last_name: Kaluza
  orcid: 0000-0002-2512-8698
citation:
  ama: Dymond M, Kaluza V. Divergence of separated nets with respect to displacement
    equivalence. <i>Geometriae Dedicata</i>. 2024;218. doi:<a href="https://doi.org/10.1007/s10711-023-00862-3">10.1007/s10711-023-00862-3</a>
  apa: Dymond, M., &#38; Kaluza, V. (2024). Divergence of separated nets with respect
    to displacement equivalence. <i>Geometriae Dedicata</i>. Springer Nature. <a href="https://doi.org/10.1007/s10711-023-00862-3">https://doi.org/10.1007/s10711-023-00862-3</a>
  chicago: Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with
    Respect to Displacement Equivalence.” <i>Geometriae Dedicata</i>. Springer Nature,
    2024. <a href="https://doi.org/10.1007/s10711-023-00862-3">https://doi.org/10.1007/s10711-023-00862-3</a>.
  ieee: M. Dymond and V. Kaluza, “Divergence of separated nets with respect to displacement
    equivalence,” <i>Geometriae Dedicata</i>, vol. 218. Springer Nature, 2024.
  ista: Dymond M, Kaluza V. 2024. Divergence of separated nets with respect to displacement
    equivalence. Geometriae Dedicata. 218, 15.
  mla: Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect
    to Displacement Equivalence.” <i>Geometriae Dedicata</i>, vol. 218, 15, Springer
    Nature, 2024, doi:<a href="https://doi.org/10.1007/s10711-023-00862-3">10.1007/s10711-023-00862-3</a>.
  short: M. Dymond, V. Kaluza, Geometriae Dedicata 218 (2024).
corr_author: '1'
date_created: 2021-07-14T07:01:27Z
date_published: 2024-02-01T00:00:00Z
date_updated: 2025-04-23T07:37:26Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/s10711-023-00862-3
external_id:
  arxiv:
  - '2102.13046'
  isi:
  - '001105681500001'
  pmid:
  - '38021107'
file:
- access_level: open_access
  checksum: 9418534ac2f3d6f1f091a8b8ccaed01e
  content_type: application/pdf
  creator: dernst
  date_created: 2024-07-16T10:14:13Z
  date_updated: 2024-07-16T10:14:13Z
  file_id: '17257'
  file_name: 2024_GeometriaeDedicata_Dymond.pdf
  file_size: 540981
  relation: main_file
  success: 1
file_date_updated: 2024-07-16T10:14:13Z
fulldoi: https://doi.org/10.1007/s10711-023-00862-3
has_accepted_license: '1'
intvolume: '       218'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: Geometriae Dedicata
publication_identifier:
  eissn:
  - 1572-9168
  issn:
  - 0046-5755
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Divergence of separated nets with respect to displacement equivalence
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 218
year: '2024'
...
---
APC_amount: 6828 EUR
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '17202'
abstract:
- lang: eng
  text: Gate-tunable transmons (gatemons) employing semiconductor Josephson junctions
    have recently emerged as building blocks for hybrid quantum circuits. In this
    study, we present a gatemon fabricated in planar Germanium. We induce superconductivity
    in a two-dimensional hole gas by evaporating aluminum atop a thin spacer, which
    separates the superconductor from the Ge quantum well. The Josephson junction
    is then integrated into an Xmon circuit and capacitively coupled to a transmission
    line resonator. We showcase the qubit tunability in a broad frequency range with
    resonator and two-tone spectroscopy. Time-domain characterizations reveal energy
    relaxation and coherence times up to 75 ns. Our results, combined with the recent
    advances in the spin qubit field, pave the way towards novel hybrid and protected
    qubits in a group IV, CMOS-compatible material.
acknowledged_ssus:
- _id: ScienComp
- _id: M-Shop
- _id: NanoFab
acknowledgement: "We acknowledge Lucas Casparis, Jeroen Danon, Valla Fatemi, Morten
  Kjaergard and Javad Shabani for their valuable insights and comments. This research
  was supported by the Scientific Service Units of ISTA through resources provided
  by the MIBA Machine Shop\r\nand the Nanofabrication facility. This research and
  related results were made possible with the support of the NOMIS Foundation and
  the FWF Projects with DOI:10.55776/I5060 and DOI:10.55776/P36507. We also acknowledge
  the NextGenerationEU PRIN project\r\n2022A8CJP3 (GAMESQUAD) for partial financial
  support."
article_number: '6400'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Oliver
  full_name: Sagi, Oliver
  id: 71616374-A8E9-11E9-A7CA-09ECE5697425
  last_name: Sagi
- first_name: Alessandro
  full_name: Crippa, Alessandro
  id: 1F2B21A2-F6E7-11E9-9B82-F7DBE5697425
  last_name: Crippa
  orcid: 0000-0002-2968-611X
- first_name: Marco
  full_name: Valentini, Marco
  id: C0BB2FAC-D767-11E9-B658-BC13E6697425
  last_name: Valentini
- first_name: Marian
  full_name: Janik, Marian
  id: 396A1950-F248-11E8-B48F-1D18A9856A87
  last_name: Janik
  orcid: 0009-0003-9037-8831
- first_name: Levon
  full_name: Baghumyan, Levon
  id: 7aa1f788-b527-11ee-aa9e-e6111a79e0c7
  last_name: Baghumyan
- first_name: Giorgio
  full_name: Fabris, Giorgio
  id: 298cf6f3-1ff6-11ee-9fa6-d94cfa0b3352
  last_name: Fabris
- first_name: Lucky
  full_name: Kapoor, Lucky
  id: 84b9700b-15b2-11ec-abd3-831089e67615
  last_name: Kapoor
  orcid: 0000-0001-8319-2148
- first_name: Farid
  full_name: Hassani, Farid
  id: 2AED110C-F248-11E8-B48F-1D18A9856A87
  last_name: Hassani
  orcid: 0000-0001-6937-5773
- first_name: Johannes M
  full_name: Fink, Johannes M
  id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
  last_name: Fink
  orcid: 0000-0001-8112-028X
- first_name: Stefano
  full_name: Calcaterra, Stefano
  last_name: Calcaterra
- first_name: Daniel
  full_name: Chrastina, Daniel
  last_name: Chrastina
- first_name: Giovanni
  full_name: Isella, Giovanni
  last_name: Isella
- first_name: Georgios
  full_name: Katsaros, Georgios
  id: 38DB5788-F248-11E8-B48F-1D18A9856A87
  last_name: Katsaros
  orcid: 0000-0001-8342-202X
citation:
  ama: Sagi O, Crippa A, Valentini M, et al. A gate tunable transmon qubit in planar
    Ge. <i>Nature Communications</i>. 2024;15. doi:<a href="https://doi.org/10.1038/s41467-024-50763-6">10.1038/s41467-024-50763-6</a>
  apa: Sagi, O., Crippa, A., Valentini, M., Janik, M., Baghumyan, L., Fabris, G.,
    … Katsaros, G. (2024). A gate tunable transmon qubit in planar Ge. <i>Nature Communications</i>.
    Springer Nature. <a href="https://doi.org/10.1038/s41467-024-50763-6">https://doi.org/10.1038/s41467-024-50763-6</a>
  chicago: Sagi, Oliver, Alessandro Crippa, Marco Valentini, Marian Janik, Levon Baghumyan,
    Giorgio Fabris, Lucky Kapoor, et al. “A Gate Tunable Transmon Qubit in Planar
    Ge.” <i>Nature Communications</i>. Springer Nature, 2024. <a href="https://doi.org/10.1038/s41467-024-50763-6">https://doi.org/10.1038/s41467-024-50763-6</a>.
  ieee: O. Sagi <i>et al.</i>, “A gate tunable transmon qubit in planar Ge,” <i>Nature
    Communications</i>, vol. 15. Springer Nature, 2024.
  ista: Sagi O, Crippa A, Valentini M, Janik M, Baghumyan L, Fabris G, Kapoor L, Hassani
    F, Fink JM, Calcaterra S, Chrastina D, Isella G, Katsaros G. 2024. A gate tunable
    transmon qubit in planar Ge. Nature Communications. 15, 6400.
  mla: Sagi, Oliver, et al. “A Gate Tunable Transmon Qubit in Planar Ge.” <i>Nature
    Communications</i>, vol. 15, 6400, Springer Nature, 2024, doi:<a href="https://doi.org/10.1038/s41467-024-50763-6">10.1038/s41467-024-50763-6</a>.
  short: O. Sagi, A. Crippa, M. Valentini, M. Janik, L. Baghumyan, G. Fabris, L. Kapoor,
    F. Hassani, J.M. Fink, S. Calcaterra, D. Chrastina, G. Isella, G. Katsaros, Nature
    Communications 15 (2024).
corr_author: '1'
date_created: 2024-07-04T11:40:45Z
date_published: 2024-07-30T00:00:00Z
date_updated: 2026-04-07T13:01:55Z
day: '30'
ddc:
- '530'
department:
- _id: GeKa
- _id: JoFi
- _id: GradSch
doi: 10.1038/s41467-024-50763-6
external_id:
  arxiv:
  - '2403.16774'
  isi:
  - '001281271000022'
  pmid:
  - '39080279'
file:
- access_level: open_access
  checksum: ddf5361dcb6c543e2cea818501c09910
  content_type: application/pdf
  creator: dernst
  date_created: 2024-08-05T08:38:01Z
  date_updated: 2024-08-05T08:38:01Z
  file_id: '17388'
  file_name: 2024_NatureComm_Sagi.pdf
  file_size: 1928001
  relation: main_file
  success: 1
file_date_updated: 2024-08-05T08:38:01Z
fulldoi: https://doi.org/10.1038/s41467-024-50763-6
has_accepted_license: '1'
intvolume: '        15'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: bd8bd29e-d553-11ed-ba76-f0070d4b237a
  grant_number: P36507
  name: Merging spin and superconducting qubits in planar Ge
- _id: c0977eea-5a5b-11eb-8a69-a862db0cf4d1
  grant_number: I05060
  name: High impedance circuit quantum electrodynamics with hole spins
- _id: 262116AA-B435-11E9-9278-68D0E5697425
  name: Hybrid Semiconductor - Superconductor Quantum Devices
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
  call_identifier: FWF
  name: FWF Open Access Fund
publication: Nature Communications
publication_identifier:
  eissn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  link:
  - relation: erratum
    url: https://doi.org/10.1038/s41467-024-53910-1
  record:
  - id: '17196'
    relation: research_data
    status: public
  - id: '18076'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: A gate tunable transmon qubit in planar Ge
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 15
year: '2024'
...
---
_id: '17203'
abstract:
- lang: eng
  text: "The behavior of a rigid body primarily depends on its mass moments, which
    consist of the mass, center of mass, and moments of inertia. It is possible to
    manipulate these quantities without altering the geometric appearance of an object
    by introducing cavities in its interior. Algorithms that find cavities of suitable
    shapes and sizes have enabled the computational design of spinning tops, yo-yos,
    wheels, buoys, and statically balanced objects. Previous work is based, for example,
    on topology optimization on voxel grids, which introduces a large number of optimization
    variables and box constraints, or offset surface computation, which cannot guarantee
    that solutions to a feasible problem will always be found.\r\n\r\nIn this work,
    we provide a mathematical analysis of constrained topology optimization problems
    that depend only on mass moments. This class of problems covers, among others,
    all applications mentioned above. Our main result is to show that no matter the
    outer shape of the rigid body to be optimized or the optimization objective and
    constraints considered, the optimal solution always features a quadric-shaped
    interface between material and cavities. This proves that optimal interfaces are
    always ellipsoids, hyperboloids, paraboloids, or one of a few degenerate cases,
    such as planes.\r\n\r\nThis insight lets us replace a difficult topology optimization
    problem with a provably equivalent non-linear equation system in a small number
    (<10) of variables, which represent the coefficients of the quadric. This system
    can be solved in a few seconds for most examples, provides insights into the geometric
    structure of many specific applications, and lets us describe their solution properties.
    Finally, our method integrates seamlessly into modern fabrication workflows because
    our solutions are analytical surfaces that are native to the CAD domain."
acknowledgement: We thank Gianmarco Cherchi for his help in tailoring the Mesh Booleans
  code for this project, Stefan Jeschke for his help with the photographs, Malina
  Strugaru and Aleksei Kalinov for their help with the samples, and the anonymous
  reviewers as well as the members of the ISTA Visual Computing Group for their feedback.
  This project was funded in part by the European Research Council (ERC Consolidator
  Grant 101045083 CoDiNA).
article_number: '78'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Christian
  full_name: Hafner, Christian
  id: 400429CC-F248-11E8-B48F-1D18A9856A87
  last_name: Hafner
- first_name: Mickaël
  full_name: Ly, Mickaël
  id: 6340d7f0-b48d-11eb-b10d-b7487e71d9f1
  last_name: Ly
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
citation:
  ama: 'Hafner C, Ly M, Wojtan C. Spin-it faster: Quadrics solve all topology optimization
    problems that depend only on mass moments. <i>Transactions on Graphics</i>. 2024;43(4).
    doi:<a href="https://doi.org/10.1145/3658194">10.1145/3658194</a>'
  apa: 'Hafner, C., Ly, M., &#38; Wojtan, C. (2024). Spin-it faster: Quadrics solve
    all topology optimization problems that depend only on mass moments. <i>Transactions
    on Graphics</i>. Denver, Colorado: Association for Computing Machinery. <a href="https://doi.org/10.1145/3658194">https://doi.org/10.1145/3658194</a>'
  chicago: 'Hafner, Christian, Mickaël Ly, and Chris Wojtan. “Spin-It Faster: Quadrics
    Solve All Topology Optimization Problems That Depend Only on Mass Moments.” <i>Transactions
    on Graphics</i>. Association for Computing Machinery, 2024. <a href="https://doi.org/10.1145/3658194">https://doi.org/10.1145/3658194</a>.'
  ieee: 'C. Hafner, M. Ly, and C. Wojtan, “Spin-it faster: Quadrics solve all topology
    optimization problems that depend only on mass moments,” <i>Transactions on Graphics</i>,
    vol. 43, no. 4. Association for Computing Machinery, 2024.'
  ista: 'Hafner C, Ly M, Wojtan C. 2024. Spin-it faster: Quadrics solve all topology
    optimization problems that depend only on mass moments. Transactions on Graphics.
    43(4), 78.'
  mla: 'Hafner, Christian, et al. “Spin-It Faster: Quadrics Solve All Topology Optimization
    Problems That Depend Only on Mass Moments.” <i>Transactions on Graphics</i>, vol.
    43, no. 4, 78, Association for Computing Machinery, 2024, doi:<a href="https://doi.org/10.1145/3658194">10.1145/3658194</a>.'
  short: C. Hafner, M. Ly, C. Wojtan, Transactions on Graphics 43 (2024).
conference:
  end_date: 2024-08-01
  location: Denver, Colorado
  start_date: 2024-07-28
corr_author: '1'
date_created: 2024-07-05T12:08:57Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-09-08T08:29:09Z
day: '01'
ddc:
- '516'
department:
- _id: ChWo
doi: 10.1145/3658194
external_id:
  isi:
  - '001289270900045'
file:
- access_level: open_access
  checksum: 0dc9f5a6422b8a49a79026900f349ee5
  content_type: application/pdf
  creator: chafner
  date_created: 2024-07-05T12:05:17Z
  date_updated: 2024-07-05T12:05:17Z
  file_id: '17204'
  file_name: sif-final.pdf
  file_size: 7225150
  relation: main_file
  success: 1
- access_level: open_access
  checksum: cde433c6a40688d5f1187fb5721f6f94
  content_type: application/pdf
  creator: chafner
  date_created: 2024-07-05T12:06:03Z
  date_updated: 2024-07-05T12:06:03Z
  file_id: '17205'
  file_name: sif-supp-final.pdf
  file_size: 397262
  relation: supplementary_material
- access_level: open_access
  checksum: c0457a09c2ab9a1c2935c995dcc84907
  content_type: video/mp4
  creator: chafner
  date_created: 2024-07-17T09:29:13Z
  date_updated: 2024-07-17T09:29:13Z
  file_id: '17276'
  file_name: sif-video-final.mp4
  file_size: 170001305
  relation: supplementary_material
  title: Submission Video
file_date_updated: 2024-07-17T09:29:13Z
fulldoi: https://doi.org/10.1145/3658194
has_accepted_license: '1'
intvolume: '        43'
isi: 1
issue: '4'
keyword:
- Topology Optimization
- Mass Moments
- Computational Geometry
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088
  grant_number: '101045083'
  name: Computational Discovery of Numerical Algorithms for Animation and Simulation
    of Natural Phenomena
publication: Transactions on Graphics
publication_identifier:
  eissn:
  - 1557-7368
  issn:
  - 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Spin-it faster: Quadrics solve all topology optimization problems that depend
  only on mass moments'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 43
year: '2024'
...
---
_id: '17207'
acknowledgement: "This research was funded by the Austrian Science Fund (FWF), project
  doi: 10.55776/P32896, Institutional Identifier: 501100002428, grant number: P32896
  and L.F. acknowledges the support of the NOMIS-ISTA Fellowship Program.\r\nWe would
  like to thank Nick Barton, Roger Butlin, Stuart Baird, Patrik Nosil, and Jason Sexton
  for their insightful comments on the earlier drafts, and to John Carchrae for his
  valuable contribution in refining phrasing and enhancing clarity. For open access
  purposes, the author has applied a CC BY public copyright license to any author-accepted
  manuscript version arising from this submission."
article_processing_charge: No
article_type: letter_note
author:
- first_name: Louise
  full_name: Fouqueau, Louise
  id: 1676e173-8143-11ed-8927-fe165216a93f
  last_name: Fouqueau
  orcid: 0000-0003-0371-9339
- first_name: Jitka
  full_name: Polechova, Jitka
  id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
  last_name: Polechova
  orcid: 0000-0003-0951-3112
citation:
  ama: 'Fouqueau L, Polechova J. Eco-evolutionary dynamics in changing environments:
    Integrating theory with data. <i>Journal of evolutionary biology</i>. 2024;37(6):579-587.
    doi:<a href="https://doi.org/10.1093/jeb/voae067">10.1093/jeb/voae067</a>'
  apa: 'Fouqueau, L., &#38; Polechova, J. (2024). Eco-evolutionary dynamics in changing
    environments: Integrating theory with data. <i>Journal of Evolutionary Biology</i>.
    Oxford University Press. <a href="https://doi.org/10.1093/jeb/voae067">https://doi.org/10.1093/jeb/voae067</a>'
  chicago: 'Fouqueau, Louise, and Jitka Polechova. “Eco-Evolutionary Dynamics in Changing
    Environments: Integrating Theory with Data.” <i>Journal of Evolutionary Biology</i>.
    Oxford University Press, 2024. <a href="https://doi.org/10.1093/jeb/voae067">https://doi.org/10.1093/jeb/voae067</a>.'
  ieee: 'L. Fouqueau and J. Polechova, “Eco-evolutionary dynamics in changing environments:
    Integrating theory with data,” <i>Journal of evolutionary biology</i>, vol. 37,
    no. 6. Oxford University Press, pp. 579–587, 2024.'
  ista: 'Fouqueau L, Polechova J. 2024. Eco-evolutionary dynamics in changing environments:
    Integrating theory with data. Journal of evolutionary biology. 37(6), 579–587.'
  mla: 'Fouqueau, Louise, and Jitka Polechova. “Eco-Evolutionary Dynamics in Changing
    Environments: Integrating Theory with Data.” <i>Journal of Evolutionary Biology</i>,
    vol. 37, no. 6, Oxford University Press, 2024, pp. 579–87, doi:<a href="https://doi.org/10.1093/jeb/voae067">10.1093/jeb/voae067</a>.'
  short: L. Fouqueau, J. Polechova, Journal of Evolutionary Biology 37 (2024) 579–587.
date_created: 2024-07-07T22:01:04Z
date_published: 2024-06-28T00:00:00Z
date_updated: 2026-06-18T17:53:35Z
day: '28'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/jeb/voae067
external_id:
  isi:
  - '001258359900001'
  pmid:
  - '38941551'
fulldoi: https://doi.org/10.1093/jeb/voae067
intvolume: '        37'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1093/jeb/voae067
month: '06'
oa: 1
oa_version: Published Version
page: 579-587
pmid: 1
project:
- _id: c08d3278-5a5b-11eb-8a69-fdb09b55f4b8
  grant_number: P32896
  name: Causes and consequences of population fragmentation
- _id: 9B861AAC-BA93-11EA-9121-9846C619BF3A
  name: NOMIS Fellowship Program
publication: Journal of evolutionary biology
publication_identifier:
  eissn:
  - 1420-9101
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Eco-evolutionary dynamics in changing environments: Integrating theory with
  data'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: publisher
_id: '17208'
abstract:
- lang: eng
  text: "Can current quantum computers provide a speedup over their classical counterparts
    for some kinds of problems? In this thesis, with a focus on ground state search/preparation,
    we address some of the challenges that both quantum annealing and variational
    quantum algorithms suffer from, hindering any possible practical speedup in comparison
    to the best classical counterparts. \r\n\r\nIn the first part of the thesis, we
    study the performance of quantum annealing for solving a particular combinatorial
    optimization problem called 3-XOR satisfability (3-XORSAT). The classical problem
    is mapped into a ground state search of a 3-local classical Hamiltonian $H_C$.
    We consider how modifying the initial problem, by adding more interaction terms
    to the corresponding Hamiltonian, leads to the emergence of a first-order phase
    transition during the annealing process. This phenomenon causes the total annealing
    duration, $T$, required to prepare the ground state of $H_C$ with a high probability
    to increase exponentially with the size of the problem. Our findings indicate
    that with the growing complexity of problem instances, the likelihood of encountering
    first-order phase transitions also increases, making quantum annealing an impractical
    solution for these types of combinatorial optimization problems.\r\n\r\nIn the
    second part, we focus on the problem of barren plateaus in generic variational
    quantum algorithms. Barren plateaus correspond to flat regions in the parameter
    space where the gradient of the cost function is zero in expectation, and with
    the variance decaying exponentially with the system size, thus obstructing an
    efficient parameter optimization.  We propose an algorithm to circumvent Barren
    Plateaus by monitoring the entanglement entropy of k-local reduced density matrices,
    alongside a method for estimating entanglement entropy via classical shadow tomography.
    We illustrate the approach with the paradigmatic example of the variational quantum
    eigensolver, and show that our algorithm effectively avoids barren plateaus in
    the initialization as well as during the optimization stage. \r\n\r\nLastly, in
    the last two Chapters of this thesis, we focus on the quantum approximate optimization
    algorithm (QAOA), originally introduced as an algorithm for solving generic combinatorial
    optimization problems in near-term quantum devices. Specifically, we focus on
    how to develop rigorous initialization strategies with guarantee improvement.
    Our motivation for this study lies in that for random initialization, the optimization
    typically leads to local minima with poor performance. Our main result corresponds
    to the analytical construction of index-1 saddle points or transition states,
    stationary points with a single direction of descent, as a tool for systematically
    exploring the QAOA optimization landscape. This leads us to propose a novel greedy
    parameter initialization strategy that guarantees for the energy to decrease with
    an increasing number of circuit layers. Furthermore, with precise estimates for
    the negative Hessian eigenvalue and its eigenvector, we establish a lower bound
    for energy improvement following a QAOA iteration."
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Raimel A
  full_name: Medina Ramos, Raimel A
  id: CE680B90-D85A-11E9-B684-C920E6697425
  last_name: Medina Ramos
  orcid: 0000-0002-5383-2869
citation:
  ama: Medina Ramos RA. Exploring the optimization landscape of variational quantum
    algorithms. 2024. doi:<a href="https://doi.org/10.15479/at:ista:17208">10.15479/at:ista:17208</a>
  apa: Medina Ramos, R. A. (2024). <i>Exploring the optimization landscape of variational
    quantum algorithms</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:17208">https://doi.org/10.15479/at:ista:17208</a>
  chicago: Medina Ramos, Raimel A. “Exploring the Optimization Landscape of Variational
    Quantum Algorithms.” Institute of Science and Technology Austria, 2024. <a href="https://doi.org/10.15479/at:ista:17208">https://doi.org/10.15479/at:ista:17208</a>.
  ieee: R. A. Medina Ramos, “Exploring the optimization landscape of variational quantum
    algorithms,” Institute of Science and Technology Austria, 2024.
  ista: Medina Ramos RA. 2024. Exploring the optimization landscape of variational
    quantum algorithms. Institute of Science and Technology Austria.
  mla: Medina Ramos, Raimel A. <i>Exploring the Optimization Landscape of Variational
    Quantum Algorithms</i>. Institute of Science and Technology Austria, 2024, doi:<a
    href="https://doi.org/10.15479/at:ista:17208">10.15479/at:ista:17208</a>.
  short: R.A. Medina Ramos, Exploring the Optimization Landscape of Variational Quantum
    Algorithms, Institute of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-07-09T09:14:24Z
date_published: 2024-07-09T00:00:00Z
date_updated: 2026-04-07T12:43:22Z
day: '09'
ddc:
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: MaSe
doi: 10.15479/at:ista:17208
ec_funded: 1
file:
- access_level: closed
  checksum: 6f45273d04f4418bc2adc018baed0525
  content_type: application/zip
  creator: rmedinar
  date_created: 2024-07-09T09:21:44Z
  date_updated: 2024-07-10T11:34:09Z
  file_id: '17212'
  file_name: Raimel_Thesis-Final.zip
  file_size: '14218691'
  relation: source_file
- access_level: open_access
  checksum: 6724a95bec772dbabc0111b9f08a805e
  content_type: application/pdf
  creator: rmedinar
  date_created: 2024-07-17T09:23:24Z
  date_updated: 2024-07-17T09:23:24Z
  file_id: '17275'
  file_name: Raimel_Thesis-20_pdfa.pdf
  file_size: 11253627
  relation: main_file
  success: 1
file_date_updated: 2024-07-17T09:23:24Z
fulldoi: https://doi.org/10.15479/at:ista:17208
has_accepted_license: '1'
keyword:
- Quantum computing
- Variational Quantum Algorithms
- Optimization
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '133'
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
  call_identifier: H2020
  grant_number: '850899'
  name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '10545'
    relation: part_of_dissertation
    status: public
  - id: '10067'
    relation: part_of_dissertation
    status: public
  - id: '17222'
    relation: part_of_dissertation
    status: public
  - id: '13125'
    relation: part_of_dissertation
    status: public
  - id: '11471'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Maksym
  full_name: Serbyn, Maksym
  id: 47809E7E-F248-11E8-B48F-1D18A9856A87
  last_name: Serbyn
  orcid: 0000-0002-2399-5827
title: Exploring the optimization landscape of variational quantum algorithms
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: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
