---
OA_place: publisher
_id: '12358'
abstract:
- lang: eng
  text: "The complex yarn structure of knitted and woven fabrics gives rise to both
    a mechanical and\r\nvisual complexity. The small-scale interactions of yarns colliding
    with and pulling on each\r\nother result in drastically different large-scale
    stretching and bending behavior, introducing\r\nanisotropy, curling, and more.
    While simulating cloth as individual yarns can reproduce this\r\ncomplexity and
    match the quality of real fabric, it may be too computationally expensive for\r\nlarge
    fabrics. On the other hand, continuum-based approaches do not need to discretize
    the\r\ncloth at a stitch-level, but it is non-trivial to find a material model
    that would replicate the\r\nlarge-scale behavior of yarn fabrics, and they discard
    the intricate visual detail. In this thesis,\r\nwe discuss three methods to try
    and bridge the gap between small-scale and large-scale yarn\r\nmechanics using
    numerical homogenization: fitting a continuum model to periodic yarn simulations,
    adding mechanics-aware yarn detail onto thin-shell simulations, and quantitatively\r\nfitting
    yarn parameters to physical measurements of real fabric.\r\nTo start, we present
    a method for animating yarn-level cloth effects using a thin-shell solver.\r\nWe
    first use a large number of periodic yarn-level simulations to build a model of
    the potential\r\nenergy density of the cloth, and then use it to compute forces
    in a thin-shell simulator. The\r\nresulting simulations faithfully reproduce expected
    effects like the stiffening of woven fabrics\r\nand the highly deformable nature
    and anisotropy of knitted fabrics at a fraction of the cost of\r\nfull yarn-level
    simulation.\r\nWhile our thin-shell simulations are able to capture large-scale
    yarn mechanics, they lack\r\nthe rich visual detail of yarn-level simulations.
    Therefore, we propose a method to animate\r\nyarn-level cloth geometry on top
    of an underlying deforming mesh in a mechanics-aware\r\nfashion in real time.
    Using triangle strains to interpolate precomputed yarn geometry, we are\r\nable
    to reproduce effects such as knit loops tightening under stretching at negligible
    cost.\r\nFinally, we introduce a methodology for inverse-modeling of yarn-level
    mechanics of cloth,\r\nbased on the mechanical response of fabrics in the real
    world. We compile a database from\r\nphysical tests of several knitted fabrics
    used in the textile industry spanning diverse physical\r\nproperties like stiffness,
    nonlinearity, and anisotropy. We then develop a system for approximating these
    mechanical responses with yarn-level cloth simulation, using homogenized\r\nshell
    models to speed up computation and adding some small-but-necessary extensions
    to\r\nyarn-level models used in computer graphics.\r\n"
acknowledged_ssus:
- _id: SSU
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Georg
  full_name: Sperl, Georg
  id: 4DD40360-F248-11E8-B48F-1D18A9856A87
  last_name: Sperl
citation:
  ama: 'Sperl G. Homogenizing yarn simulations: Large-scale mechanics, small-scale
    detail, and quantitative fitting. 2022. doi:<a href="https://doi.org/10.15479/at:ista:12103">10.15479/at:ista:12103</a>'
  apa: 'Sperl, G. (2022). <i>Homogenizing yarn simulations: Large-scale mechanics,
    small-scale detail, and quantitative fitting</i>. Institute of Science and Technology
    Austria. <a href="https://doi.org/10.15479/at:ista:12103">https://doi.org/10.15479/at:ista:12103</a>'
  chicago: 'Sperl, Georg. “Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale
    Detail, and Quantitative Fitting.” Institute of Science and Technology Austria,
    2022. <a href="https://doi.org/10.15479/at:ista:12103">https://doi.org/10.15479/at:ista:12103</a>.'
  ieee: 'G. Sperl, “Homogenizing yarn simulations: Large-scale mechanics, small-scale
    detail, and quantitative fitting,” Institute of Science and Technology Austria,
    2022.'
  ista: 'Sperl G. 2022. Homogenizing yarn simulations: Large-scale mechanics, small-scale
    detail, and quantitative fitting. Institute of Science and Technology Austria.'
  mla: 'Sperl, Georg. <i>Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale
    Detail, and Quantitative Fitting</i>. Institute of Science and Technology Austria,
    2022, doi:<a href="https://doi.org/10.15479/at:ista:12103">10.15479/at:ista:12103</a>.'
  short: 'G. Sperl, Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale
    Detail, and Quantitative Fitting, Institute of Science and Technology Austria,
    2022.'
corr_author: '1'
date_created: 2023-01-24T10:49:46Z
date_published: 2022-09-22T00:00:00Z
date_updated: 2026-06-18T19:57:47Z
day: '22'
ddc:
- '000'
- '620'
degree_awarded: PhD
department:
- _id: GradSch
- _id: ChWo
doi: 10.15479/at:ista:12103
ec_funded: 1
file:
- access_level: open_access
  checksum: 083722acbb8115e52e3b0fdec6226769
  content_type: application/pdf
  creator: cchlebak
  date_created: 2023-01-25T12:04:41Z
  date_updated: 2023-02-02T09:29:57Z
  description: 'This is the main PDF file of the thesis. File size: 105 MB'
  file_id: '12371'
  file_name: thesis_gsperl.pdf
  file_size: 104497530
  relation: main_file
  title: Thesis
- access_level: open_access
  checksum: 511f82025e5fcb70bff4731d6896ca07
  content_type: application/pdf
  creator: cchlebak
  date_created: 2023-02-02T09:33:37Z
  date_updated: 2023-02-02T09:33:37Z
  description: This version of the thesis uses stronger image compression for a smaller
    file size of 23MB.
  file_id: '12483'
  file_name: thesis_gsperl_compressed.pdf
  file_size: 23183710
  relation: main_file
  title: Thesis (compressed 23MB)
- access_level: open_access
  checksum: ed4cb85225eedff761c25bddfc37a2ed
  content_type: application/x-zip-compressed
  creator: cchlebak
  date_created: 2023-02-02T09:39:25Z
  date_updated: 2023-02-02T09:39:25Z
  file_id: '12484'
  file_name: thesis-source.zip
  file_size: 98382247
  relation: source_file
file_date_updated: 2023-02-02T09:39:25Z
fulldoi: https://doi.org/10.15479/at:ista:12103
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '138'
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '638176'
  name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
    Scales'
publication_identifier:
  isbn:
  - 978-3-99078-020-6
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '8385'
    relation: part_of_dissertation
    status: public
  - id: '11736'
    relation: part_of_dissertation
    status: public
  - id: '9818'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
title: 'Homogenizing yarn simulations: Large-scale mechanics, small-scale detail,
  and quantitative fitting'
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2022'
...
---
OA_place: publisher
_id: '12368'
abstract:
- lang: eng
  text: "Metazoan development relies on the formation and remodeling of cell-cell
    contacts. The \r\nbinding of adhesion receptors and remodeling of the actomyosin
    cell cortex at cell-cell \r\ninteraction sites have been implicated in cell-cell
    contact formation. Yet, how these two \r\nprocesses functionally interact to drive
    cell-cell contact expansion and strengthening \r\nremains unclear. Here, we study
    how primary germ layer progenitor cells from zebrafish \r\nbind to supported lipid
    bilayers (SLB) functionalized with E-cadherin ectodomains as an \r\nassay system
    for monitoring cell-cell contact formation at high spatiotemporal resolution.
    \r\nWe show that cell-cell contact formation represents a two-tiered process:
    E-cadherin\x02mediated downregulation of the small GTPase RhoA at the forming
    contact leads to both \r\ndepletion of Myosin-2 and decrease of F-actin. This
    is followed by centrifugal actin \r\nnetwork flows at the contact triggered by
    a sharp gradient of Myosin-2 at the rim of the \r\ncontact zone, with Myosin-2
    displaying higher cortical localization outside than inside of \r\nthe contact.
    These centrifugal cortical actin flows, in turn, not only further dilute the actin
    \r\nnetwork at the contact disc, but also lead to an accumulation of both F-actin
    and E\x02cadherin at the contact rim. Eventually, this combination of actomyosin
    downregulation \r\nand flows at the contact contribute to the characteristic molecular
    organization implicated \r\nin contact formation and maintenance: depletion of
    cortical actomyosin at the contact disc, \r\ndriving contact expansion by lowering
    interfacial tension at the contact, and accumulation \r\nof both E-cadherin and
    F-actin at the contact rim, mechanically linking the contractile \r\ncortices
    of the adhering cells. Thus, using a biomimetic assay, we exemplify how \r\nadhesion
    signaling and cell mechanics function together to modulate the spatial \r\norganization
    of cell-cell contacts."
acknowledged_ssus:
- _id: LifeSc
- _id: Bio
- _id: NanoFab
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Feyza N
  full_name: Arslan, Feyza N
  id: 49DA7910-F248-11E8-B48F-1D18A9856A87
  last_name: Arslan
  orcid: 0000-0001-5809-9566
citation:
  ama: Arslan FN. Remodeling of E-cadherin-mediated contacts via cortical  flows.
    2022. doi:<a href="https://doi.org/10.15479/at:ista:12153">10.15479/at:ista:12153</a>
  apa: Arslan, F. N. (2022). <i>Remodeling of E-cadherin-mediated contacts via cortical 
    flows</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:12153">https://doi.org/10.15479/at:ista:12153</a>
  chicago: Arslan, Feyza N. “Remodeling of E-Cadherin-Mediated Contacts via Cortical 
    Flows.” Institute of Science and Technology Austria, 2022. <a href="https://doi.org/10.15479/at:ista:12153">https://doi.org/10.15479/at:ista:12153</a>.
  ieee: F. N. Arslan, “Remodeling of E-cadherin-mediated contacts via cortical  flows,”
    Institute of Science and Technology Austria, 2022.
  ista: Arslan FN. 2022. Remodeling of E-cadherin-mediated contacts via cortical 
    flows. Institute of Science and Technology Austria.
  mla: Arslan, Feyza N. <i>Remodeling of E-Cadherin-Mediated Contacts via Cortical 
    Flows</i>. Institute of Science and Technology Austria, 2022, doi:<a href="https://doi.org/10.15479/at:ista:12153">10.15479/at:ista:12153</a>.
  short: F.N. Arslan, Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows,
    Institute of Science and Technology Austria, 2022.
corr_author: '1'
date_created: 2023-01-25T10:43:24Z
date_published: 2022-09-29T00:00:00Z
date_updated: 2026-06-18T19:47:50Z
day: '29'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: CaHe
doi: 10.15479/at:ista:12153
ec_funded: 1
file:
- access_level: open_access
  checksum: e54a3e69b83ebf166544164afd25608e
  content_type: application/pdf
  creator: cchlebak
  date_created: 2023-01-25T10:52:46Z
  date_updated: 2023-01-25T10:52:46Z
  file_id: '12369'
  file_name: THESIS_FINAL_FArslan_pdfa.pdf
  file_size: 14581024
  relation: main_file
  success: 1
file_date_updated: 2023-01-25T10:52:46Z
fulldoi: https://doi.org/10.15479/at:ista:12153
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: '113'
project:
- _id: 260F1432-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '742573'
  name: Interaction and feedback between cell mechanics and fate specification in
    vertebrate gastrulation
publication_identifier:
  isbn:
  - '978-3-99078-025-1 '
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '9350'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
title: Remodeling of E-cadherin-mediated contacts via cortical  flows
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: '2022'
...
---
OA_place: publisher
_id: '12390'
abstract:
- lang: eng
  text: "The scope of this thesis is to study quantum systems exhibiting a continuous
    symmetry that\r\nis broken on the level of the corresponding effective theory.
    In particular we are going to\r\ninvestigate translation-invariant Bose gases
    in the mean field limit, effectively described by\r\nthe Hartree functional, and
    the Fröhlich Polaron in the regime of strong coupling, effectively\r\ndescribed
    by the Pekar functional. The latter is a model describing the interaction between
    a\r\ncharged particle and the optical modes of a polar crystal. Regarding the
    former, we assume in\r\naddition that the particles in the gas are unconfined,
    and typically we will consider particles\r\nthat are subject to an attractive
    interaction. In both cases the ground state energy of the\r\nHamiltonian is not
    a proper eigenvalue due to the underlying translation-invariance, while on\r\nthe
    contrary there exists a whole invariant orbit of minimizers for the corresponding
    effective\r\nfunctionals. Both, the absence of proper eigenstates and the broken
    symmetry of the effective\r\ntheory, make the study significantly more involved
    and it is the content of this thesis to\r\ndevelop a frameworks which allows for
    a systematic way to circumvent these issues.\r\nIt is a well-established result
    that the ground state energy of Bose gases in the mean field limit,\r\nas well
    as the ground state energy of the Fröhlich Polaron in the regime of strong coupling,
    is\r\nto leading order given by the minimal energy of the corresponding effective
    theory. As part\r\nof this thesis we identify the sub-leading term in the expansion
    of the ground state energy,\r\nwhich can be interpreted as the quantum correction
    to the classical energy, since the effective\r\ntheories under consideration can
    be seen as classical counterparts.\r\nWe are further going to establish an asymptotic
    expression for the energy-momentum relation\r\nof the Fröhlich Polaron in the
    strong coupling limit. In the regime of suitably small momenta,\r\nthis asymptotic
    expression agrees with the energy-momentum relation of a free particle having\r\nan
    effectively increased mass, and we find that this effectively increased mass agrees
    with the\r\nconjectured value in the physics literature.\r\nIn addition we will
    discuss two unrelated papers written by the author during his stay at ISTA\r\nin
    the appendix. The first one concerns the realization of anyons, which are quasi-particles\r\nacquiring
    a non-trivial phase under the exchange of two particles, as molecular impurities.\r\nThe
    second one provides a classification of those vector fields defined on a given
    manifold\r\nthat can be written as the gradient of a given functional with respect
    to a suitable metric,\r\nprovided that some mild smoothness assumptions hold.
    This classification is subsequently\r\nused to identify those quantum Markov semigroups
    that can be written as a gradient flow of\r\nthe relative entropy.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Morris
  full_name: Brooks, Morris
  id: B7ECF9FC-AA38-11E9-AC9A-0930E6697425
  last_name: Brooks
  orcid: 0000-0002-6249-0928
citation:
  ama: Brooks M. Translation-invariant quantum systems with effectively broken symmetry.
    2022. doi:<a href="https://doi.org/10.15479/at:ista:12390">10.15479/at:ista:12390</a>
  apa: Brooks, M. (2022). <i>Translation-invariant quantum systems with effectively
    broken symmetry</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:12390">https://doi.org/10.15479/at:ista:12390</a>
  chicago: Brooks, Morris. “Translation-Invariant Quantum Systems with Effectively
    Broken Symmetry.” Institute of Science and Technology Austria, 2022. <a href="https://doi.org/10.15479/at:ista:12390">https://doi.org/10.15479/at:ista:12390</a>.
  ieee: M. Brooks, “Translation-invariant quantum systems with effectively broken
    symmetry,” Institute of Science and Technology Austria, 2022.
  ista: Brooks M. 2022. Translation-invariant quantum systems with effectively broken
    symmetry. Institute of Science and Technology Austria.
  mla: Brooks, Morris. <i>Translation-Invariant Quantum Systems with Effectively Broken
    Symmetry</i>. Institute of Science and Technology Austria, 2022, doi:<a href="https://doi.org/10.15479/at:ista:12390">10.15479/at:ista:12390</a>.
  short: M. Brooks, Translation-Invariant Quantum Systems with Effectively Broken
    Symmetry, Institute of Science and Technology Austria, 2022.
corr_author: '1'
date_created: 2023-01-26T10:00:42Z
date_published: 2022-12-15T00:00:00Z
date_updated: 2026-04-16T08:20:52Z
day: '15'
ddc:
- '500'
degree_awarded: PhD
department:
- _id: GradSch
- _id: RoSe
doi: 10.15479/at:ista:12390
ec_funded: 1
file:
- access_level: open_access
  checksum: b31460e937f33b557abb40ebef02b567
  content_type: application/pdf
  creator: cchlebak
  date_created: 2023-01-26T10:02:34Z
  date_updated: 2023-01-26T10:02:34Z
  file_id: '12391'
  file_name: Brooks_Thesis.pdf
  file_size: 3095225
  relation: main_file
  success: 1
- access_level: closed
  checksum: 9751869fa5e7981588ad4228f4fd4bd6
  content_type: application/octet-stream
  creator: cchlebak
  date_created: 2023-01-26T10:02:42Z
  date_updated: 2023-01-26T10:02:42Z
  file_id: '12392'
  file_name: Brooks_Thesis.tex
  file_size: 809842
  relation: source_file
file_date_updated: 2023-01-26T10:02:42Z
fulldoi: https://doi.org/10.15479/at:ista:12390
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: '196'
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '694227'
  name: Analysis of quantum many-body systems
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '9005'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
title: Translation-invariant quantum systems with effectively broken symmetry
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: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2022'
...
---
_id: '12431'
abstract:
- lang: eng
  text: This paper presents a new representation of curve dynamics, with applications
    to vortex filaments in fluid dynamics. Instead of representing these filaments
    with explicit curve geometry and Lagrangian equations of motion, we represent
    curves implicitly with a new co-dimensional 2 level set description. Our implicit
    representation admits several redundant mathematical degrees of freedom in both
    the configuration and the dynamics of the curves, which can be tailored specifically
    to improve numerical robustness, in contrast to naive approaches for implicit
    curve dynamics that suffer from overwhelming numerical stability problems. Furthermore,
    we note how these hidden degrees of freedom perfectly map to a Clebsch representation
    in fluid dynamics. Motivated by these observations, we introduce untwisted level
    set functions and non-swirling dynamics which successfully regularize sources
    of numerical instability, particularly in the twisting modes around curve filaments.
    A consequence is a novel simulation method which produces stable dynamics for
    large numbers of interacting vortex filaments and effortlessly handles topological
    changes and re-connection events.
acknowledgement: We thank the visual computing group at IST Austria for their valuable
  discussions and feedback. Houdini Education licenses were provided by SideFX software.
  This project was funded in part by the European Research Council (ERC Consolidator
  Grant 101045083 CoDiNA).
article_number: '241'
article_processing_charge: No
article_type: original
author:
- first_name: Sadashige
  full_name: Ishida, Sadashige
  id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425
  last_name: Ishida
  orcid: 0000-0002-3121-3100
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
- first_name: Albert
  full_name: Chern, Albert
  last_name: Chern
citation:
  ama: Ishida S, Wojtan C, Chern A. Hidden degrees of freedom in implicit vortex filaments.
    <i>ACM Transactions on Graphics</i>. 2022;41(6). doi:<a href="https://doi.org/10.1145/3550454.3555459">10.1145/3550454.3555459</a>
  apa: Ishida, S., Wojtan, C., &#38; Chern, A. (2022). Hidden degrees of freedom in
    implicit vortex filaments. <i>ACM Transactions on Graphics</i>. Association for
    Computing Machinery. <a href="https://doi.org/10.1145/3550454.3555459">https://doi.org/10.1145/3550454.3555459</a>
  chicago: Ishida, Sadashige, Chris Wojtan, and Albert Chern. “Hidden Degrees of Freedom
    in Implicit Vortex Filaments.” <i>ACM Transactions on Graphics</i>. Association
    for Computing Machinery, 2022. <a href="https://doi.org/10.1145/3550454.3555459">https://doi.org/10.1145/3550454.3555459</a>.
  ieee: S. Ishida, C. Wojtan, and A. Chern, “Hidden degrees of freedom in implicit
    vortex filaments,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 6. Association
    for Computing Machinery, 2022.
  ista: Ishida S, Wojtan C, Chern A. 2022. Hidden degrees of freedom in implicit vortex
    filaments. ACM Transactions on Graphics. 41(6), 241.
  mla: Ishida, Sadashige, et al. “Hidden Degrees of Freedom in Implicit Vortex Filaments.”
    <i>ACM Transactions on Graphics</i>, vol. 41, no. 6, 241, Association for Computing
    Machinery, 2022, doi:<a href="https://doi.org/10.1145/3550454.3555459">10.1145/3550454.3555459</a>.
  short: S. Ishida, C. Wojtan, A. Chern, ACM Transactions on Graphics 41 (2022).
date_created: 2023-01-29T23:00:59Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2026-04-07T12:02:23Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3550454.3555459
external_id:
  isi:
  - '000891651900061'
file:
- access_level: open_access
  checksum: a2fba257fdefe0e747182be6c0f7c70c
  content_type: application/pdf
  creator: dernst
  date_created: 2023-01-30T07:15:48Z
  date_updated: 2023-01-30T07:15:48Z
  file_id: '12433'
  file_name: 2022_ACM_Ishida.pdf
  file_size: 15551202
  relation: main_file
  success: 1
file_date_updated: 2023-01-30T07:15:48Z
fulldoi: https://doi.org/10.1145/3550454.3555459
has_accepted_license: '1'
intvolume: '        41'
isi: 1
issue: '6'
language:
- iso: eng
month: '12'
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: ACM Transactions on Graphics
publication_identifier:
  eissn:
  - 1557-7368
  issn:
  - 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
  record:
  - id: '20551'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Hidden degrees of freedom in implicit vortex filaments
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2022'
...
---
_id: '12452'
abstract:
- lang: eng
  text: Portrait viewpoint and illumination editing is an important problem with several
    applications in VR/AR, movies, and photography. Comprehensive knowledge of geometry
    and illumination is critical for obtaining photorealistic results. Current methods
    are unable to explicitly model in 3D while handing both viewpoint and illumination
    editing from a single image. In this paper, we propose VoRF, a novel approach
    that can take even a single portrait image as input and relight human heads under
    novel illuminations that can be viewed from arbitrary viewpoints. VoRF represents
    a human head as a continuous volumetric field and learns a prior model of human
    heads using a coordinate-based MLP with separate latent spaces for identity and
    illumination. The prior model is learnt in an auto-decoder manner over a diverse
    class of head shapes and appearances, allowing VoRF to generalize to novel test
    identities from a single input image. Additionally, VoRF has a reflectance MLP
    that uses the intermediate features of the prior model for rendering One-Light-at-A-Time
    (OLAT) images under novel views. We synthesize novel illuminations by combining
    these OLAT images with target environment maps. Qualitative and quantitative evaluations
    demonstrate the effectiveness of VoRF for relighting and novel view synthesis
    even when applied to unseen subjects under uncontrolled illuminations.
acknowledgement: This work was supported by the ERC Consolidator Grant 4DReply (770784).
article_number: '708'
article_processing_charge: No
author:
- first_name: Pramod
  full_name: Rao, Pramod
  last_name: Rao
- first_name: Mallikarjun
  full_name: B R, Mallikarjun
  last_name: B R
- first_name: Gereon
  full_name: Fox, Gereon
  last_name: Fox
- first_name: Tim
  full_name: Weyrich, Tim
  last_name: Weyrich
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Hans-Peter
  full_name: Seidel, Hans-Peter
  last_name: Seidel
- first_name: Hanspeter
  full_name: Pfister, Hanspeter
  last_name: Pfister
- first_name: Wojciech
  full_name: Matusik, Wojciech
  last_name: Matusik
- first_name: Ayush
  full_name: Tewari, Ayush
  last_name: Tewari
- first_name: Christian
  full_name: Theobalt, Christian
  last_name: Theobalt
- first_name: Mohamed
  full_name: Elgharib, Mohamed
  last_name: Elgharib
citation:
  ama: 'Rao P, B R M, Fox G, et al. VoRF: Volumetric Relightable Faces. In: <i>33rd
    British Machine Vision Conference</i>. British Machine Vision Association and
    Society for Pattern Recognition; 2022.'
  apa: 'Rao, P., B R, M., Fox, G., Weyrich, T., Bickel, B., Seidel, H.-P., … Elgharib,
    M. (2022). VoRF: Volumetric Relightable Faces. In <i>33rd British Machine Vision
    Conference</i>. London, United Kingdom: British Machine Vision Association and
    Society for Pattern Recognition.'
  chicago: 'Rao, Pramod, Mallikarjun B R, Gereon Fox, Tim Weyrich, Bernd Bickel, Hans-Peter
    Seidel, Hanspeter Pfister, et al. “VoRF: Volumetric Relightable Faces.” In <i>33rd
    British Machine Vision Conference</i>. British Machine Vision Association and
    Society for Pattern Recognition, 2022.'
  ieee: 'P. Rao <i>et al.</i>, “VoRF: Volumetric Relightable Faces,” in <i>33rd British
    Machine Vision Conference</i>, London, United Kingdom, 2022.'
  ista: 'Rao P, B R M, Fox G, Weyrich T, Bickel B, Seidel H-P, Pfister H, Matusik
    W, Tewari A, Theobalt C, Elgharib M. 2022. VoRF: Volumetric Relightable Faces.
    33rd British Machine Vision Conference. BMVC: British Machine Vision Conference,
    708.'
  mla: 'Rao, Pramod, et al. “VoRF: Volumetric Relightable Faces.” <i>33rd British
    Machine Vision Conference</i>, 708, British Machine Vision Association and Society
    for Pattern Recognition, 2022.'
  short: P. Rao, M. B R, G. Fox, T. Weyrich, B. Bickel, H.-P. Seidel, H. Pfister,
    W. Matusik, A. Tewari, C. Theobalt, M. Elgharib, in:, 33rd British Machine Vision
    Conference, British Machine Vision Association and Society for Pattern Recognition,
    2022.
conference:
  end_date: 2022-11-24
  location: London, United Kingdom
  name: 'BMVC: British Machine Vision Conference'
  start_date: 2022-11-21
date_created: 2023-01-30T10:47:06Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2023-10-31T08:40:55Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
file:
- access_level: open_access
  checksum: b60b70bb48700aee709c85a69231821d
  content_type: application/pdf
  creator: bbickel
  date_created: 2023-01-30T10:48:18Z
  date_updated: 2023-01-30T10:48:18Z
  file_id: '12453'
  file_name: vorf_main.pdf
  file_size: 5202710
  relation: main_file
  title: 'VoRF: Volumetric Relightable Faces'
- access_level: open_access
  checksum: ce5f4ce66eaaa1590ee5df989fca6f61
  content_type: application/pdf
  creator: bbickel
  date_created: 2023-01-30T10:48:29Z
  date_updated: 2023-01-30T10:48:29Z
  file_id: '12454'
  file_name: vorf_supp.pdf
  file_size: 37953188
  relation: supplementary_material
  title: 'VoRF: Volumetric Relightable Faces – SUPPLEMENTAL MATERIAL –'
- access_level: open_access
  checksum: 08aecca434b08fee75ee1efe87943718
  content_type: video/mp4
  creator: bbickel
  date_created: 2023-01-30T10:48:37Z
  date_updated: 2023-01-30T10:48:37Z
  file_id: '12455'
  file_name: video.mp4
  file_size: 57855492
  relation: supplementary_material
file_date_updated: 2023-01-30T10:48:37Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://bmvc2022.mpi-inf.mpg.de/708/
month: '12'
oa: 1
oa_version: Published Version
publication: 33rd British Machine Vision Conference
publication_status: published
publisher: British Machine Vision Association and Society for Pattern Recognition
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'VoRF: Volumetric Relightable Faces'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12480'
abstract:
- lang: eng
  text: 'We consider the problem of estimating a signal from measurements obtained
    via a generalized linear model. We focus on estimators based on approximate message
    passing (AMP), a family of iterative algorithms with many appealing features:
    the performance of AMP in the high-dimensional limit can be succinctly characterized
    under suitable model assumptions; AMP can also be tailored to the empirical distribution
    of the signal entries, and for a wide class of estimation problems, AMP is conjectured
    to be optimal among all polynomial-time algorithms. However, a major issue of
    AMP is that in many models (such as phase retrieval), it requires an initialization
    correlated with the ground-truth signal and independent from the measurement matrix.
    Assuming that such an initialization is available is typically not realistic.
    In this paper, we solve this problem by proposing an AMP algorithm initialized
    with a spectral estimator. With such an initialization, the standard AMP analysis
    fails since the spectral estimator depends in a complicated way on the design
    matrix. Our main contribution is a rigorous characterization of the performance
    of AMP with spectral initialization in the high-dimensional limit. The key technical
    idea is to define and analyze a two-phase artificial AMP algorithm that first
    produces the spectral estimator, and then closely approximates the iterates of
    the true AMP. We also provide numerical results that demonstrate the validity
    of the proposed approach.'
acknowledgement: "The authors would like to thank Andrea Montanari for helpful discussions.\r\nM
  Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R Venkataramanan
  was partially supported by the Alan Turing Institute under the EPSRC Grant\r\nEP/N510129/1."
article_number: '114003'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Ramji
  full_name: Venkataramanan, Ramji
  last_name: Venkataramanan
citation:
  ama: 'Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization
    for generalized linear models. <i>Journal of Statistical Mechanics: Theory and
    Experiment</i>. 2022;2022(11). doi:<a href="https://doi.org/10.1088/1742-5468/ac9828">10.1088/1742-5468/ac9828</a>'
  apa: 'Mondelli, M., &#38; Venkataramanan, R. (2022). Approximate message passing
    with spectral initialization for generalized linear models. <i>Journal of Statistical
    Mechanics: Theory and Experiment</i>. IOP Publishing. <a href="https://doi.org/10.1088/1742-5468/ac9828">https://doi.org/10.1088/1742-5468/ac9828</a>'
  chicago: 'Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing
    with Spectral Initialization for Generalized Linear Models.” <i>Journal of Statistical
    Mechanics: Theory and Experiment</i>. IOP Publishing, 2022. <a href="https://doi.org/10.1088/1742-5468/ac9828">https://doi.org/10.1088/1742-5468/ac9828</a>.'
  ieee: 'M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral
    initialization for generalized linear models,” <i>Journal of Statistical Mechanics:
    Theory and Experiment</i>, vol. 2022, no. 11. IOP Publishing, 2022.'
  ista: 'Mondelli M, Venkataramanan R. 2022. Approximate message passing with spectral
    initialization for generalized linear models. Journal of Statistical Mechanics:
    Theory and Experiment. 2022(11), 114003.'
  mla: 'Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with
    Spectral Initialization for Generalized Linear Models.” <i>Journal of Statistical
    Mechanics: Theory and Experiment</i>, vol. 2022, no. 11, 114003, IOP Publishing,
    2022, doi:<a href="https://doi.org/10.1088/1742-5468/ac9828">10.1088/1742-5468/ac9828</a>.'
  short: 'M. Mondelli, R. Venkataramanan, Journal of Statistical Mechanics: Theory
    and Experiment 2022 (2022).'
corr_author: '1'
date_created: 2023-02-02T08:31:57Z
date_published: 2022-11-24T00:00:00Z
date_updated: 2025-04-15T07:50:16Z
day: '24'
ddc:
- '510'
- '530'
department:
- _id: MaMo
doi: 10.1088/1742-5468/ac9828
external_id:
  isi:
  - '000889589900001'
file:
- access_level: open_access
  checksum: 01411ffa76d3e380a0446baeb89b1ef7
  content_type: application/pdf
  creator: dernst
  date_created: 2023-02-02T08:35:52Z
  date_updated: 2023-02-02T08:35:52Z
  file_id: '12481'
  file_name: 2022_JourStatisticalMechanics_Mondelli.pdf
  file_size: 1729997
  relation: main_file
  success: 1
file_date_updated: 2023-02-02T08:35:52Z
fulldoi: https://doi.org/10.1088/1742-5468/ac9828
has_accepted_license: '1'
intvolume: '      2022'
isi: 1
issue: '11'
keyword:
- Statistics
- Probability and Uncertainty
- Statistics and Probability
- Statistical and Nonlinear Physics
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
  name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 'Journal of Statistical Mechanics: Theory and Experiment'
publication_identifier:
  issn:
  - 1742-5468
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
related_material:
  record:
  - id: '10598'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Approximate message passing with spectral initialization for generalized linear
  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: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 2022
year: '2022'
...
---
_id: '12495'
abstract:
- lang: eng
  text: "Fairness-aware learning aims at constructing classifiers that not only make
    accurate predictions, but also do not discriminate against specific groups. It
    is a fast-growing area of\r\nmachine learning with far-reaching societal impact.
    However, existing fair learning methods\r\nare vulnerable to accidental or malicious
    artifacts in the training data, which can cause\r\nthem to unknowingly produce
    unfair classifiers. In this work we address the problem of\r\nfair learning from
    unreliable training data in the robust multisource setting, where the\r\navailable
    training data comes from multiple sources, a fraction of which might not be representative
    of the true data distribution. We introduce FLEA, a filtering-based algorithm\r\nthat
    identifies and suppresses those data sources that would have a negative impact
    on\r\nfairness or accuracy if they were used for training. As such, FLEA is not
    a replacement of\r\nprior fairness-aware learning methods but rather an augmentation
    that makes any of them\r\nrobust against unreliable training data. We show the
    effectiveness of our approach by a\r\ndiverse range of experiments on multiple
    datasets. Additionally, we prove formally that\r\n–given enough data– FLEA protects
    the learner against corruptions as long as the fraction of\r\naffected data sources
    is less than half. Our source code and documentation are available at\r\nhttps://github.com/ISTAustria-CVML/FLEA."
acknowledged_ssus:
- _id: ScienComp
acknowledgement: 'The authors would like to thank Bernd Prach, Elias Frantar, Alexandra
  Peste, Mahdi Nikdan, and Peter Súkeník for their helpful feedback. This research
  was supported by the Scientific Service Units (SSU) of IST Austria through resources
  provided by Scientific Computing (SciComp). This publication was made possible by
  an ETH AI Center postdoctoral fellowship granted to Nikola Konstantinov. Eugenia
  Iofinova was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Eugenia B
  full_name: Iofinova, Eugenia B
  id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
  last_name: Iofinova
  orcid: 0000-0002-7778-3221
- first_name: Nikola H
  full_name: Konstantinov, Nikola H
  id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
  last_name: Konstantinov
  orcid: 0009-0009-5204-7621
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource
    learning from unreliable training data. <i>Transactions on Machine Learning Research</i>.
    2022.'
  apa: 'Iofinova, E. B., Konstantinov, N. H., &#38; Lampert, C. (2022). FLEA: Provably
    robust fair multisource learning from unreliable training data. <i>Transactions
    on Machine Learning Research</i>. ML Research Press.'
  chicago: 'Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA:
    Provably Robust Fair Multisource Learning from Unreliable Training Data.” <i>Transactions
    on Machine Learning Research</i>. ML Research Press, 2022.'
  ieee: 'E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust
    fair multisource learning from unreliable training data,” <i>Transactions on Machine
    Learning Research</i>. ML Research Press, 2022.'
  ista: 'Iofinova EB, Konstantinov NH, Lampert C. 2022. FLEA: Provably robust fair
    multisource learning from unreliable training data. Transactions on Machine Learning
    Research.'
  mla: 'Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning
    from Unreliable Training Data.” <i>Transactions on Machine Learning Research</i>,
    ML Research Press, 2022.'
  short: E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning
    Research (2022).
corr_author: '1'
date_created: 2023-02-02T20:29:57Z
date_published: 2022-12-22T00:00:00Z
date_updated: 2025-12-30T11:04:31Z
day: '22'
ddc:
- '000'
department:
- _id: ChLa
external_id:
  arxiv:
  - '2106.11732'
file:
- access_level: open_access
  checksum: 97c8a8470759cab597abb973ca137a3b
  content_type: application/pdf
  creator: dernst
  date_created: 2023-02-23T10:30:04Z
  date_updated: 2023-02-23T10:30:04Z
  file_id: '12673'
  file_name: 2022_TMLR_Iofinova.pdf
  file_size: 1948063
  relation: main_file
  success: 1
file_date_updated: 2023-02-23T10:30:04Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://openreview.net/forum?id=XsPopigZXV
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
  grant_number: W1260-N35
  name: Vienna Graduate School on Computational Optimization
publication: Transactions on Machine Learning Research
publication_identifier:
  issn:
  - 2835-8856
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
  link:
  - description: source code
    relation: software
    url: https://github.com/ISTAustria-CVML/FLEA
status: public
title: 'FLEA: Provably robust fair multisource learning from unreliable training 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
year: '2022'
...
---
_id: '12509'
abstract:
- lang: eng
  text: A graph game is a two-player zero-sum game in which the players move a token
    throughout a graph to produce an infinite path, which determines the winner or
    payoff of the game. In bidding games, both players have budgets, and in each turn,
    we hold an "auction" (bidding) to determine which player moves the token. In this
    survey, we consider several bidding mechanisms and their effect on the properties
    of the game. Specifically, bidding games, and in particular bidding games of infinite
    duration, have an intriguing equivalence with random-turn games in which in each
    turn, the player who moves is chosen randomly. We summarize how minor changes
    in the bidding mechanism lead to unexpected differences in the equivalence with
    random-turn games.
acknowledgement: "Guy Avni: Work partially supported by the Israel Science Foundation,
  ISF grant agreement\r\nno 1679/21.\r\nThomas A. Henzinger: This work was supported
  in part by the ERC-2020-AdG 101020093.\r\nWe would like to thank all our collaborators
  Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný,
  Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful
  for you as it was for us."
article_processing_charge: No
author:
- first_name: Guy
  full_name: Avni, Guy
  id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Avni
  orcid: 0000-0001-5588-8287
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
citation:
  ama: 'Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: <i>47th
    International Symposium on Mathematical Foundations of Computer Science</i>. Vol
    241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany:
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2022.3">10.4230/LIPIcs.MFCS.2022.3</a>'
  apa: 'Avni, G., &#38; Henzinger, T. A. (2022). An updated survey of bidding games
    on graphs. In <i>47th International Symposium on Mathematical Foundations of Computer
    Science</i> (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.4230/LIPIcs.MFCS.2022.3">https://doi.org/10.4230/LIPIcs.MFCS.2022.3</a>'
  chicago: 'Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games
    on Graphs.” In <i>47th International Symposium on Mathematical Foundations of
    Computer Science</i>, 241:3:1-3:6. Leibniz International Proceedings in Informatics
    (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2022. <a href="https://doi.org/10.4230/LIPIcs.MFCS.2022.3">https://doi.org/10.4230/LIPIcs.MFCS.2022.3</a>.'
  ieee: G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,”
    in <i>47th International Symposium on Mathematical Foundations of Computer Science</i>,
    Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.
  ista: 'Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs.
    47th International Symposium on Mathematical Foundations of Computer Science.
    MFCS: Mathematical Foundations of Computer ScienceLeibniz International Proceedings
    in Informatics (LIPIcs) vol. 241, 3:1-3:6.'
  mla: Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on
    Graphs.” <i>47th International Symposium on Mathematical Foundations of Computer
    Science</i>, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022,
    p. 3:1-3:6, doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2022.3">10.4230/LIPIcs.MFCS.2022.3</a>.
  short: G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical
    Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    Dagstuhl, Germany, 2022, p. 3:1-3:6.
conference:
  end_date: 2022-08-26
  location: Vienna, Austria
  name: 'MFCS: Mathematical Foundations of Computer Science'
  start_date: 2022-08-22
corr_author: '1'
date_created: 2023-02-05T17:26:01Z
date_published: 2022-08-22T00:00:00Z
date_updated: 2025-07-10T11:50:27Z
day: '22'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2022.3
ec_funded: 1
file:
- access_level: open_access
  checksum: 1888ec9421622f9526fbec2de035f132
  content_type: application/pdf
  creator: dernst
  date_created: 2023-02-06T09:13:04Z
  date_updated: 2023-02-06T09:13:04Z
  file_id: '12519'
  file_name: 2022_LIPICs_Avni.pdf
  file_size: 624586
  relation: main_file
  success: 1
file_date_updated: 2023-02-06T09:13:04Z
fulldoi: https://doi.org/10.4230/LIPIcs.MFCS.2022.3
has_accepted_license: '1'
intvolume: '       241'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 3:1-3:6
place: Dagstuhl, Germany
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: 47th International Symposium on Mathematical Foundations of Computer
  Science
publication_identifier:
  isbn:
  - '9783959772563'
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: An updated survey of bidding games on graphs
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 241
year: '2022'
...
---
_id: '12510'
abstract:
- lang: eng
  text: "We introduce a new statistical verification algorithm that formally quantifies
    the behavioral robustness of any time-continuous process formulated as a continuous-depth
    model. Our algorithm solves a set of global optimization (Go) problems over a
    given time horizon to construct a tight enclosure (Tube) of the set of all process
    executions starting from a ball of initial states. We call our algorithm GoTube.
    Through its construction, GoTube ensures that the bounding tube is conservative
    up to a desired probability and up to a desired tightness.\r\n GoTube is implemented
    in JAX and optimized to scale to complex continuous-depth neural network models.
    Compared to advanced reachability analysis tools for time-continuous neural networks,
    GoTube does not accumulate overapproximation errors between time steps and avoids
    the infamous wrapping effect inherent in symbolic techniques. We show that GoTube
    substantially outperforms state-of-the-art verification tools in terms of the
    size of the initial ball, speed, time-horizon, task completion, and scalability
    on a large set of experiments.\r\n GoTube is stable and sets the state-of-the-art
    in terms of its ability to scale to time horizons well beyond what has been previously
    possible."
acknowledgement: SG is funded by the Austrian Science Fund (FWF) project number W1255-N23.
  ML and TH are supported in part by FWF under grant Z211-N23 (Wittgenstein Award)
  and the ERC-2020-AdG 101020093. SS is supported by NSF awards DCL-2040599, CCF-1918225,
  and CPS-1446832. RH and DR are partially supported by Boeing. RG is partially supported
  by Horizon-2020 ECSEL Project grant No. 783163 (iDev40).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sophie A.
  full_name: Gruenbacher, Sophie A.
  last_name: Gruenbacher
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
- first_name: Ramin
  full_name: Hasani, Ramin
  last_name: Hasani
- first_name: Daniela
  full_name: Rus, Daniela
  last_name: Rus
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Scott A.
  full_name: Smolka, Scott A.
  last_name: Smolka
- first_name: Radu
  full_name: Grosu, Radu
  last_name: Grosu
citation:
  ama: 'Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification
    of continuous-depth models. <i>Proceedings of the AAAI Conference on Artificial
    Intelligence</i>. 2022;36(6):6755-6764. doi:<a href="https://doi.org/10.1609/aaai.v36i6.20631">10.1609/aaai.v36i6.20631</a>'
  apa: 'Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka,
    S. A., &#38; Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth
    models. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>.
    Association for the Advancement of Artificial Intelligence. <a href="https://doi.org/10.1609/aaai.v36i6.20631">https://doi.org/10.1609/aaai.v36i6.20631</a>'
  chicago: 'Gruenbacher, Sophie A., Mathias Lechner, Ramin Hasani, Daniela Rus, Thomas
    A Henzinger, Scott A. Smolka, and Radu Grosu. “GoTube: Scalable Statistical Verification
    of Continuous-Depth Models.” <i>Proceedings of the AAAI Conference on Artificial
    Intelligence</i>. Association for the Advancement of Artificial Intelligence,
    2022. <a href="https://doi.org/10.1609/aaai.v36i6.20631">https://doi.org/10.1609/aaai.v36i6.20631</a>.'
  ieee: 'S. A. Gruenbacher <i>et al.</i>, “GoTube: Scalable statistical verification
    of continuous-depth models,” <i>Proceedings of the AAAI Conference on Artificial
    Intelligence</i>, vol. 36, no. 6. Association for the Advancement of Artificial
    Intelligence, pp. 6755–6764, 2022.'
  ista: 'Gruenbacher SA, Lechner M, Hasani R, Rus D, Henzinger TA, Smolka SA, Grosu
    R. 2022. GoTube: Scalable statistical verification of continuous-depth models.
    Proceedings of the AAAI Conference on Artificial Intelligence. 36(6), 6755–6764.'
  mla: 'Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification
    of Continuous-Depth Models.” <i>Proceedings of the AAAI Conference on Artificial
    Intelligence</i>, vol. 36, no. 6, Association for the Advancement of Artificial
    Intelligence, 2022, pp. 6755–64, doi:<a href="https://doi.org/10.1609/aaai.v36i6.20631">10.1609/aaai.v36i6.20631</a>.'
  short: S.A. Gruenbacher, M. Lechner, R. Hasani, D. Rus, T.A. Henzinger, S.A. Smolka,
    R. Grosu, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022)
    6755–6764.
date_created: 2023-02-05T17:27:42Z
date_published: 2022-06-28T00:00:00Z
date_updated: 2025-04-15T06:26:14Z
day: '28'
department:
- _id: ToHe
doi: 10.1609/aaai.v36i6.20631
ec_funded: 1
external_id:
  arxiv:
  - '2107.08467'
fulldoi: https://doi.org/10.1609/aaai.v36i6.20631
intvolume: '        36'
issue: '6'
keyword:
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2107.08467
month: '06'
oa: 1
oa_version: Preprint
page: 6755-6764
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
  eissn:
  - 2374-3468
  isbn:
  - '978577358350'
  issn:
  - 2159-5399
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'GoTube: Scalable statistical verification of continuous-depth models'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2022'
...
---
_id: '12511'
abstract:
- lang: eng
  text: "We consider the problem of formally verifying almost-sure (a.s.) asymptotic
    stability in discrete-time nonlinear stochastic control systems. While verifying
    stability in deterministic control systems is extensively studied in the literature,
    verifying stability in stochastic control systems is an open problem. The few
    existing works on this topic either consider only specialized forms of stochasticity
    or make restrictive assumptions on the system, rendering them inapplicable to
    learning algorithms with neural network policies. \r\n In this work, we present
    an approach for general nonlinear stochastic control problems with two novel aspects:
    (a) instead of classical stochastic extensions of Lyapunov functions, we use ranking
    supermartingales (RSMs) to certify a.s. asymptotic stability, and (b) we present
    a method for learning neural network RSMs. \r\n We prove that our approach guarantees
    a.s. asymptotic stability of the system and\r\n provides the first method to obtain
    bounds on the stabilization time, which stochastic Lyapunov functions do not.\r\n
    Finally, we validate our approach experimentally on a set of nonlinear stochastic
    reinforcement learning environments with neural network policies."
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093, ERC
  CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation
  programme\r\nunder the Marie Skłodowska-Curie Grant Agreement No. 665385."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
- first_name: Dorde
  full_name: Zikelic, Dorde
  id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
  last_name: Zikelic
  orcid: 0000-0002-4681-1699
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
citation:
  ama: Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in
    stochastic control systems via neural network supermartingales. <i>Proceedings
    of the AAAI Conference on Artificial Intelligence</i>. 2022;36(7):7326-7336. doi:<a
    href="https://doi.org/10.1609/aaai.v36i7.20695">10.1609/aaai.v36i7.20695</a>
  apa: Lechner, M., Zikelic, D., Chatterjee, K., &#38; Henzinger, T. A. (2022). Stability
    verification in stochastic control systems via neural network supermartingales.
    <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association
    for the Advancement of Artificial Intelligence. <a href="https://doi.org/10.1609/aaai.v36i7.20695">https://doi.org/10.1609/aaai.v36i7.20695</a>
  chicago: Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger.
    “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.”
    <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association
    for the Advancement of Artificial Intelligence, 2022. <a href="https://doi.org/10.1609/aaai.v36i7.20695">https://doi.org/10.1609/aaai.v36i7.20695</a>.
  ieee: M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification
    in stochastic control systems via neural network supermartingales,” <i>Proceedings
    of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7. Association
    for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.
  ista: Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification
    in stochastic control systems via neural network supermartingales. Proceedings
    of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.
  mla: Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems
    via Neural Network Supermartingales.” <i>Proceedings of the AAAI Conference on
    Artificial Intelligence</i>, vol. 36, no. 7, Association for the Advancement of
    Artificial Intelligence, 2022, pp. 7326–36, doi:<a href="https://doi.org/10.1609/aaai.v36i7.20695">10.1609/aaai.v36i7.20695</a>.
  short: M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the
    AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.
corr_author: '1'
date_created: 2023-02-05T17:29:50Z
date_published: 2022-06-28T00:00:00Z
date_updated: 2026-04-07T13:27:55Z
day: '28'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1609/aaai.v36i7.20695
ec_funded: 1
external_id:
  arxiv:
  - '2112.09495'
fulldoi: https://doi.org/10.1609/aaai.v36i7.20695
intvolume: '        36'
issue: '7'
keyword:
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2112.09495
month: '06'
oa: 1
oa_version: Preprint
page: 7326-7336
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
  call_identifier: H2020
  grant_number: '863818'
  name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
  eissn:
  - 2374-3468
  isbn:
  - '9781577358350'
  issn:
  - 2159-5399
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
related_material:
  record:
  - id: '14539'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Stability verification in stochastic control systems via neural network supermartingales
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2022'
...
---
_id: '12516'
abstract:
- lang: eng
  text: "The homogeneous continuous LWE (hCLWE) problem is to distinguish samples
    of a specific high-dimensional Gaussian mixture from standard normal samples.
    It was shown to be at least as hard as Learning with Errors, but no reduction
    in the other direction is currently known.\r\nWe present four new public-key encryption
    schemes based on the hardness of hCLWE, with varying tradeoffs between decryption
    and security errors, and different discretization techniques. Our schemes yield
    a polynomial-time algorithm for solving hCLWE using a Statistical Zero-Knowledge
    oracle."
acknowledgement: "We are grateful to Devika Sharma and Luca Trevisan for their insight
  and advice and to an anonymous reviewer for helpful comments.\r\n\r\nThis work was
  supported by the European Research Council (ERC) under the European Union’s Horizon
  2020 research and innovation programme (Grant agreement No. 101019547). The first
  author was additionally supported by RGC GRF CUHK14209920 and the fourth author
  was additionally supported by ISF grant No. 1399/17, project PROMETHEUS (Grant 780701),
  and Cariplo CRYPTONOMEX grant."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Andrej
  full_name: Bogdanov, Andrej
  last_name: Bogdanov
- first_name: Miguel
  full_name: Cueto Noval, Miguel
  id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
  last_name: Cueto Noval
  orcid: 0000-0002-2505-4246
- first_name: Charlotte
  full_name: Hoffmann, Charlotte
  id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
  last_name: Hoffmann
  orcid: 0000-0003-2027-5549
- first_name: Alon
  full_name: Rosen, Alon
  last_name: Rosen
citation:
  ama: 'Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. Public-Key Encryption from Homogeneous
    CLWE. In: <i>Theory of Cryptography</i>. Vol 13748. Springer Nature; 2022:565-592.
    doi:<a href="https://doi.org/10.1007/978-3-031-22365-5_20">10.1007/978-3-031-22365-5_20</a>'
  apa: 'Bogdanov, A., Cueto Noval, M., Hoffmann, C., &#38; Rosen, A. (2022). Public-Key
    Encryption from Homogeneous CLWE. In <i>Theory of Cryptography</i> (Vol. 13748,
    pp. 565–592). Chicago, IL, United States: Springer Nature. <a href="https://doi.org/10.1007/978-3-031-22365-5_20">https://doi.org/10.1007/978-3-031-22365-5_20</a>'
  chicago: Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen.
    “Public-Key Encryption from Homogeneous CLWE.” In <i>Theory of Cryptography</i>,
    13748:565–92. Springer Nature, 2022. <a href="https://doi.org/10.1007/978-3-031-22365-5_20">https://doi.org/10.1007/978-3-031-22365-5_20</a>.
  ieee: A. Bogdanov, M. Cueto Noval, C. Hoffmann, and A. Rosen, “Public-Key Encryption
    from Homogeneous CLWE,” in <i>Theory of Cryptography</i>, Chicago, IL, United
    States, 2022, vol. 13748, pp. 565–592.
  ista: 'Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. 2022. Public-Key Encryption
    from Homogeneous CLWE. Theory of Cryptography. TCC: Theory of Cryptography, LNCS,
    vol. 13748, 565–592.'
  mla: Bogdanov, Andrej, et al. “Public-Key Encryption from Homogeneous CLWE.” <i>Theory
    of Cryptography</i>, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:<a href="https://doi.org/10.1007/978-3-031-22365-5_20">10.1007/978-3-031-22365-5_20</a>.
  short: A. Bogdanov, M. Cueto Noval, C. Hoffmann, A. Rosen, in:, Theory of Cryptography,
    Springer Nature, 2022, pp. 565–592.
conference:
  end_date: 2022-11-10
  location: Chicago, IL, United States
  name: 'TCC: Theory of Cryptography'
  start_date: 2022-11-07
corr_author: '1'
date_created: 2023-02-05T23:01:00Z
date_published: 2022-12-21T00:00:00Z
date_updated: 2024-10-09T21:04:05Z
day: '21'
department:
- _id: KrPi
doi: 10.1007/978-3-031-22365-5_20
external_id:
  isi:
  - '000921318200020'
fulldoi: https://doi.org/10.1007/978-3-031-22365-5_20
intvolume: '     13748'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2022/093
month: '12'
oa: 1
oa_version: Preprint
page: 565-592
publication: Theory of Cryptography
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783031223648'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Public-Key Encryption from Homogeneous CLWE
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13748
year: '2022'
...
---
_id: '12522'
abstract:
- lang: eng
  text: This .zip File contains the transport data, the codes for the data analysis,
    the microscopy analysis and the codes for the theoretical simulations for "Majorana-like
    Coulomb spectroscopy in the absence of zero bias peaks" by M. Valentini, et. al.
    The transport data are saved with hdf5 file format. The files can be open with
    the log browser of Labber.
article_processing_charge: No
author:
- first_name: Marco
  full_name: Valentini, Marco
  id: C0BB2FAC-D767-11E9-B658-BC13E6697425
  last_name: Valentini
- first_name: Pablo
  full_name: San-Jose, Pablo
  last_name: San-Jose
- first_name: Jordi
  full_name: Arbiol, Jordi
  last_name: Arbiol
- first_name: Sara
  full_name: Marti-Sanchez, Sara
  last_name: Marti-Sanchez
- first_name: Marc
  full_name: Botifoll, Marc
  last_name: Botifoll
citation:
  ama: Valentini M, San-Jose P, Arbiol J, Marti-Sanchez S, Botifoll M. Data for “Majorana-like
    Coulomb spectroscopy in the absence of zero bias peaks.” 2022. doi:<a href="https://doi.org/10.15479/AT:ISTA:12102">10.15479/AT:ISTA:12102</a>
  apa: Valentini, M., San-Jose, P., Arbiol, J., Marti-Sanchez, S., &#38; Botifoll,
    M. (2022). Data for “Majorana-like Coulomb spectroscopy in the absence of zero
    bias peaks.” Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:12102">https://doi.org/10.15479/AT:ISTA:12102</a>
  chicago: Valentini, Marco, Pablo San-Jose, Jordi Arbiol, Sara Marti-Sanchez, and
    Marc Botifoll. “Data for ‘Majorana-like Coulomb Spectroscopy in the Absence of
    Zero Bias Peaks.’” Institute of Science and Technology Austria, 2022. <a href="https://doi.org/10.15479/AT:ISTA:12102">https://doi.org/10.15479/AT:ISTA:12102</a>.
  ieee: M. Valentini, P. San-Jose, J. Arbiol, S. Marti-Sanchez, and M. Botifoll, “Data
    for ‘Majorana-like Coulomb spectroscopy in the absence of zero bias peaks.’” Institute
    of Science and Technology Austria, 2022.
  ista: Valentini M, San-Jose P, Arbiol J, Marti-Sanchez S, Botifoll M. 2022. Data
    for ‘Majorana-like Coulomb spectroscopy in the absence of zero bias peaks’, Institute
    of Science and Technology Austria, <a href="https://doi.org/10.15479/AT:ISTA:12102">10.15479/AT:ISTA:12102</a>.
  mla: Valentini, Marco, et al. <i>Data for “Majorana-like Coulomb Spectroscopy in
    the Absence of Zero Bias Peaks.”</i> Institute of Science and Technology Austria,
    2022, doi:<a href="https://doi.org/10.15479/AT:ISTA:12102">10.15479/AT:ISTA:12102</a>.
  short: M. Valentini, P. San-Jose, J. Arbiol, S. Marti-Sanchez, M. Botifoll, (2022).
contributor:
- contributor_type: contact_person
  first_name: Marco
  id: C0BB2FAC-D767-11E9-B658-BC13E6697425
  last_name: Valentini
corr_author: '1'
date_created: 2023-02-07T08:13:39Z
date_published: 2022-09-25T00:00:00Z
date_updated: 2026-04-07T13:27:22Z
day: '25'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.15479/AT:ISTA:12102
file:
- access_level: open_access
  checksum: 0dbd6327bf84c7e81b295c4bc9d12826
  content_type: application/x-zip-compressed
  creator: dernst
  date_created: 2023-02-07T08:18:24Z
  date_updated: 2023-02-07T08:18:24Z
  file_id: '12523'
  file_name: Majorana_like.zip
  file_size: 3609122411
  relation: main_file
  success: 1
file_date_updated: 2023-02-07T08:18:24Z
fulldoi: https://doi.org/10.15479/AT:ISTA:12102
has_accepted_license: '1'
month: '09'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '12118'
    relation: used_in_publication
    status: public
  - id: '13286'
    relation: used_in_publication
    status: public
status: public
title: Data for "Majorana-like Coulomb spectroscopy in the absence of zero bias peaks"
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
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12538'
abstract:
- lang: eng
  text: In this paper, we study the compression of a target two-layer neural network
    with N nodes into a compressed network with M<N nodes. More precisely, we consider
    the setting in which the weights of the target network are i.i.d. sub-Gaussian,
    and we minimize the population L_2 loss between the outputs of the target and
    of the compressed network, under the assumption of Gaussian inputs. By using tools
    from high-dimensional probability, we show that this non-convex problem can be
    simplified when the target network is sufficiently over-parameterized, and provide
    the error rate of this approximation as a function of the input dimension and
    N. In this mean-field limit, the simplified objective, as well as the optimal
    weights of the compressed network, does not depend on the realization of the target
    network, but only on expected scaling factors. Furthermore, for networks with
    ReLU activation, we conjecture that the optimum of the simplified optimization
    problem is achieved by taking weights on the Equiangular Tight Frame (ETF), while
    the scaling of the weights and the orientation of the ETF depend on the parameters
    of the target network. Numerical evidence is provided to support this conjecture.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Mohammad Hossein
  full_name: Amani, Mohammad Hossein
  last_name: Amani
- first_name: Simone
  full_name: Bombari, Simone
  id: ca726dda-de17-11ea-bc14-f9da834f63aa
  last_name: Bombari
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Rattana
  full_name: Pukdee, Rattana
  last_name: Pukdee
- first_name: Stefano
  full_name: Rini, Stefano
  last_name: Rini
citation:
  ama: Amani MH, Bombari S, Mondelli M, Pukdee R, Rini S. Sharp asymptotics on the
    compression of two-layer neural networks. <i>IEEE Information Theory Workshop</i>.
    2022:588-593. doi:<a href="https://doi.org/10.1109/ITW54588.2022.9965870">10.1109/ITW54588.2022.9965870</a>
  apa: 'Amani, M. H., Bombari, S., Mondelli, M., Pukdee, R., &#38; Rini, S. (2022).
    Sharp asymptotics on the compression of two-layer neural networks. <i>IEEE Information
    Theory Workshop</i>. Mumbai, India: IEEE. <a href="https://doi.org/10.1109/ITW54588.2022.9965870">https://doi.org/10.1109/ITW54588.2022.9965870</a>'
  chicago: Amani, Mohammad Hossein, Simone Bombari, Marco Mondelli, Rattana Pukdee,
    and Stefano Rini. “Sharp Asymptotics on the Compression of Two-Layer Neural Networks.”
    <i>IEEE Information Theory Workshop</i>. IEEE, 2022. <a href="https://doi.org/10.1109/ITW54588.2022.9965870">https://doi.org/10.1109/ITW54588.2022.9965870</a>.
  ieee: M. H. Amani, S. Bombari, M. Mondelli, R. Pukdee, and S. Rini, “Sharp asymptotics
    on the compression of two-layer neural networks,” <i>IEEE Information Theory Workshop</i>.
    IEEE, pp. 588–593, 2022.
  ista: Amani MH, Bombari S, Mondelli M, Pukdee R, Rini S. 2022. Sharp asymptotics
    on the compression of two-layer neural networks. IEEE Information Theory Workshop.,
    588–593.
  mla: Amani, Mohammad Hossein, et al. “Sharp Asymptotics on the Compression of Two-Layer
    Neural Networks.” <i>IEEE Information Theory Workshop</i>, IEEE, 2022, pp. 588–93,
    doi:<a href="https://doi.org/10.1109/ITW54588.2022.9965870">10.1109/ITW54588.2022.9965870</a>.
  short: M.H. Amani, S. Bombari, M. Mondelli, R. Pukdee, S. Rini, IEEE Information
    Theory Workshop (2022) 588–593.
conference:
  end_date: 2022-11-09
  location: Mumbai, India
  name: 'ITW: Information Theory Workshop'
  start_date: 2022-11-01
date_created: 2023-02-10T13:47:56Z
date_published: 2022-11-16T00:00:00Z
date_updated: 2025-09-10T09:53:31Z
day: '16'
department:
- _id: MaMo
doi: 10.1109/ITW54588.2022.9965870
external_id:
  arxiv:
  - '2205.08199'
  isi:
  - '000904341100099'
fulldoi: https://doi.org/10.1109/ITW54588.2022.9965870
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.2205.08199'
month: '11'
oa: 1
oa_version: Preprint
page: 588-593
publication: IEEE Information Theory Workshop
publication_identifier:
  isbn:
  - '9781665483414'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sharp asymptotics on the compression of two-layer neural networks
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2022'
...
---
_id: '12568'
abstract:
- lang: eng
  text: We treat the problem of risk-aware control for stochastic shortest path (SSP)
    on Markov decision processes (MDP). Typically, expectation is considered for SSP,
    which however is oblivious to the incurred risk. We present an alternative view,
    instead optimizing conditional value-at-risk (CVaR), an established risk measure.
    We treat both Markov chains as well as MDP and introduce, through novel insights,
    two algorithms, based on linear programming and value iteration, respectively.
    Both algorithms offer precise and provably correct solutions. Evaluation of our
    prototype implementation shows that risk-aware control is feasible on several
    moderately sized models.
article_processing_charge: No
arxiv: 1
author:
- first_name: Tobias
  full_name: Meggendorfer, Tobias
  id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
  last_name: Meggendorfer
  orcid: 0000-0002-1712-2165
citation:
  ama: 'Meggendorfer T. Risk-aware stochastic shortest path. In: <i>Proceedings of
    the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>. Vol 36. Association
    for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:<a href="https://doi.org/10.1609/aaai.v36i9.21222">10.1609/aaai.v36i9.21222</a>'
  apa: 'Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In <i>Proceedings
    of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i> (Vol. 36,
    pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence.
    <a href="https://doi.org/10.1609/aaai.v36i9.21222">https://doi.org/10.1609/aaai.v36i9.21222</a>'
  chicago: Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In <i>Proceedings
    of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, 36:9858–67.
    Association for the Advancement of Artificial Intelligence, 2022. <a href="https://doi.org/10.1609/aaai.v36i9.21222">https://doi.org/10.1609/aaai.v36i9.21222</a>.
  ieee: T. Meggendorfer, “Risk-aware stochastic shortest path,” in <i>Proceedings
    of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, Virtual,
    2022, vol. 36, no. 9, pp. 9858–9867.
  ista: Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of
    the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on
    Artificial Intelligence vol. 36, 9858–9867.
  mla: Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” <i>Proceedings
    of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, vol. 36,
    no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67,
    doi:<a href="https://doi.org/10.1609/aaai.v36i9.21222">10.1609/aaai.v36i9.21222</a>.
  short: T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial
    Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence,
    2022, pp. 9858–9867.
conference:
  end_date: 2022-03-01
  location: Virtual
  name: Conference on Artificial Intelligence
  start_date: 2022-02-22
corr_author: '1'
date_created: 2023-02-19T23:00:56Z
date_published: 2022-06-28T00:00:00Z
date_updated: 2024-10-09T21:04:32Z
day: '28'
department:
- _id: KrCh
doi: 10.1609/aaai.v36i9.21222
external_id:
  arxiv:
  - '2203.01640'
fulldoi: https://doi.org/10.1609/aaai.v36i9.21222
intvolume: '        36'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.2203.01640'
month: '06'
oa: 1
oa_version: Preprint
page: 9858-9867
publication: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI
  2022
publication_identifier:
  eissn:
  - 2374-3468
  isbn:
  - '1577358767'
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: Risk-aware stochastic shortest path
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2022'
...
---
_id: '12670'
abstract:
- lang: eng
  text: DNA methylation plays essential homeostatic functions in eukaryotic genomes.
    In animals, DNA methylation is also developmentally regulated and, in turn, regulates
    development. In the past two decades, huge research effort has endorsed the understanding
    that DNA methylation plays a similar role in plant development, especially during
    sexual reproduction. The power of whole-genome sequencing and cell isolation techniques,
    as well as bioinformatics tools, have enabled recent studies to reveal dynamic
    changes in DNA methylation during germline development. Furthermore, the combination
    of these technological advances with genetics, developmental biology and cell
    biology tools has revealed functional methylation reprogramming events that control
    gene and transposon activities in flowering plant germlines. In this review, we
    discuss the major advances in our knowledge of DNA methylation dynamics during
    male and female germline development in flowering plants.
article_processing_charge: No
article_type: review
author:
- first_name: Shengbo
  full_name: He, Shengbo
  last_name: He
- first_name: Xiaoqi
  full_name: Feng, Xiaoqi
  id: e0164712-22ee-11ed-b12a-d80fcdf35958
  last_name: Feng
  orcid: 0000-0002-4008-1234
citation:
  ama: He S, Feng X. DNA methylation dynamics during germline development. <i>Journal
    of Integrative Plant Biology</i>. 2022;64(12):2240-2251. doi:<a href="https://doi.org/10.1111/jipb.13422">10.1111/jipb.13422</a>
  apa: He, S., &#38; Feng, X. (2022). DNA methylation dynamics during germline development.
    <i>Journal of Integrative Plant Biology</i>. Wiley. <a href="https://doi.org/10.1111/jipb.13422">https://doi.org/10.1111/jipb.13422</a>
  chicago: He, Shengbo, and Xiaoqi Feng. “DNA Methylation Dynamics during Germline
    Development.” <i>Journal of Integrative Plant Biology</i>. Wiley, 2022. <a href="https://doi.org/10.1111/jipb.13422">https://doi.org/10.1111/jipb.13422</a>.
  ieee: S. He and X. Feng, “DNA methylation dynamics during germline development,”
    <i>Journal of Integrative Plant Biology</i>, vol. 64, no. 12. Wiley, pp. 2240–2251,
    2022.
  ista: He S, Feng X. 2022. DNA methylation dynamics during germline development.
    Journal of Integrative Plant Biology. 64(12), 2240–2251.
  mla: He, Shengbo, and Xiaoqi Feng. “DNA Methylation Dynamics during Germline Development.”
    <i>Journal of Integrative Plant Biology</i>, vol. 64, no. 12, Wiley, 2022, pp.
    2240–51, doi:<a href="https://doi.org/10.1111/jipb.13422">10.1111/jipb.13422</a>.
  short: S. He, X. Feng, Journal of Integrative Plant Biology 64 (2022) 2240–2251.
date_created: 2023-02-23T09:15:57Z
date_published: 2022-12-07T00:00:00Z
date_updated: 2024-10-14T12:03:14Z
day: '07'
department:
- _id: XiFe
doi: 10.1111/jipb.13422
extern: '1'
external_id:
  pmid:
  - '36478632'
fulldoi: https://doi.org/10.1111/jipb.13422
intvolume: '        64'
issue: '12'
keyword:
- Plant Science
- General Biochemistry
- Genetics and Molecular Biology
- Biochemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1111/jipb.13422
month: '12'
oa: 1
oa_version: Published Version
page: 2240-2251
pmid: 1
publication: Journal of Integrative Plant Biology
publication_identifier:
  eissn:
  - 1744-7909
  issn:
  - 1672-9072
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: DNA methylation dynamics during germline development
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 64
year: '2022'
...
---
_id: '12671'
abstract:
- lang: eng
  text: Sperm chromatin is typically transformed by protamines into a compact and
    transcriptionally inactive state1,2. Sperm cells of flowering plants lack protamines,
    yet they have small, transcriptionally active nuclei with chromatin condensed
    through an unknown mechanism3,4. Here we show that a histone variant, H2B.8, mediates
    sperm chromatin and nuclear condensation in Arabidopsis thaliana. Loss of H2B.8
    causes enlarged sperm nuclei with dispersed chromatin, whereas ectopic expression
    in somatic cells produces smaller nuclei with aggregated chromatin. This result
    demonstrates that H2B.8 is sufficient for chromatin condensation. H2B.8 aggregates
    transcriptionally inactive AT-rich chromatin into phase-separated condensates,
    which facilitates nuclear compaction without reducing transcription. Reciprocal
    crosses show that mutation of h2b.8 reduces male transmission, which suggests
    that H2B.8-mediated sperm compaction is important for fertility. Altogether, our
    results reveal a new mechanism of nuclear compaction through global aggregation
    of unexpressed chromatin. We propose that H2B.8 is an evolutionary innovation
    of flowering plants that achieves nuclear condensation compatible with active
    transcription.
article_processing_charge: No
article_type: original
author:
- first_name: Toby
  full_name: Buttress, Toby
  last_name: Buttress
- first_name: Shengbo
  full_name: He, Shengbo
  last_name: He
- first_name: Liang
  full_name: Wang, Liang
  last_name: Wang
- first_name: Shaoli
  full_name: Zhou, Shaoli
  last_name: Zhou
- first_name: Gerhard
  full_name: Saalbach, Gerhard
  last_name: Saalbach
- first_name: Martin
  full_name: Vickers, Martin
  last_name: Vickers
- first_name: Guohong
  full_name: Li, Guohong
  last_name: Li
- first_name: Pilong
  full_name: Li, Pilong
  last_name: Li
- first_name: Xiaoqi
  full_name: Feng, Xiaoqi
  id: e0164712-22ee-11ed-b12a-d80fcdf35958
  last_name: Feng
  orcid: 0000-0002-4008-1234
citation:
  ama: Buttress T, He S, Wang L, et al. Histone H2B.8 compacts flowering plant sperm
    through chromatin phase separation. <i>Nature</i>. 2022;611(7936):614-622. doi:<a
    href="https://doi.org/10.1038/s41586-022-05386-6">10.1038/s41586-022-05386-6</a>
  apa: Buttress, T., He, S., Wang, L., Zhou, S., Saalbach, G., Vickers, M., … Feng,
    X. (2022). Histone H2B.8 compacts flowering plant sperm through chromatin phase
    separation. <i>Nature</i>. Springer Nature. <a href="https://doi.org/10.1038/s41586-022-05386-6">https://doi.org/10.1038/s41586-022-05386-6</a>
  chicago: Buttress, Toby, Shengbo He, Liang Wang, Shaoli Zhou, Gerhard Saalbach,
    Martin Vickers, Guohong Li, Pilong Li, and Xiaoqi Feng. “Histone H2B.8 Compacts
    Flowering Plant Sperm through Chromatin Phase Separation.” <i>Nature</i>. Springer
    Nature, 2022. <a href="https://doi.org/10.1038/s41586-022-05386-6">https://doi.org/10.1038/s41586-022-05386-6</a>.
  ieee: T. Buttress <i>et al.</i>, “Histone H2B.8 compacts flowering plant sperm through
    chromatin phase separation,” <i>Nature</i>, vol. 611, no. 7936. Springer Nature,
    pp. 614–622, 2022.
  ista: Buttress T, He S, Wang L, Zhou S, Saalbach G, Vickers M, Li G, Li P, Feng
    X. 2022. Histone H2B.8 compacts flowering plant sperm through chromatin phase
    separation. Nature. 611(7936), 614–622.
  mla: Buttress, Toby, et al. “Histone H2B.8 Compacts Flowering Plant Sperm through
    Chromatin Phase Separation.” <i>Nature</i>, vol. 611, no. 7936, Springer Nature,
    2022, pp. 614–22, doi:<a href="https://doi.org/10.1038/s41586-022-05386-6">10.1038/s41586-022-05386-6</a>.
  short: T. Buttress, S. He, L. Wang, S. Zhou, G. Saalbach, M. Vickers, G. Li, P.
    Li, X. Feng, Nature 611 (2022) 614–622.
date_created: 2023-02-23T09:17:05Z
date_published: 2022-11-17T00:00:00Z
date_updated: 2024-10-14T12:03:36Z
day: '17'
department:
- _id: XiFe
doi: 10.1038/s41586-022-05386-6
extern: '1'
external_id:
  pmid:
  - '36323776'
fulldoi: https://doi.org/10.1038/s41586-022-05386-6
intvolume: '       611'
issue: '7936'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1038/s41586-022-05386-6
month: '11'
oa: 1
oa_version: Published Version
page: 614-622
pmid: 1
publication: Nature
publication_identifier:
  eissn:
  - 1476-4687
  issn:
  - 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Histone H2B.8 compacts flowering plant sperm through chromatin phase separation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 611
year: '2022'
...
---
_id: '12677'
abstract:
- lang: eng
  text: "In modern sample-driven Prophet Inequality, an adversary chooses a sequence
    of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The
    process follows in two phases. In the first phase (sampling phase), some items,
    possibly selected at random, are revealed to the DM, but she can never accept
    them. In the second phase, the DM is presented with the other items in a random
    order and online fashion. For each item, she must make an irrevocable decision
    to either accept the item and stop the process or reject the item forever and
    proceed to the next item. The goal of the DM is to maximize the expected value
    as compared to a Prophet (or offline algorithm) that has access to all information.
    In this setting, the sampling phase has no cost and is not part of the optimization
    process. However, in many scenarios, the samples are obtained as part of the decision-making
    process.\r\nWe model this aspect as a two-phase Prophet Inequality where an adversary
    chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly
    ordered. Finally, there are two phases of the Prophet Inequality problem with
    the first n-items and the rest of the items, respectively. We show that some basic
    algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves
    a ratio of at least 0.495. Finally, we show that for every algorithm the ratio
    it can achieve is at most 0.502. Hence our algorithm is near-optimal."
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
  grant.
article_number: '2209.14368'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Mona
  full_name: Mohammadi, Mona
  id: 4363614d-b686-11ed-a7d5-ac9e4a24bc2e
  last_name: Mohammadi
- first_name: Raimundo J
  full_name: Saona Urmeneta, Raimundo J
  id: BD1DF4C4-D767-11E9-B658-BC13E6697425
  last_name: Saona Urmeneta
  orcid: 0000-0001-5103-038X
citation:
  ama: Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with
    near-optimal bounds. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/ARXIV.2209.14368">10.48550/ARXIV.2209.14368</a>
  apa: Chatterjee, K., Mohammadi, M., &#38; Saona Urmeneta, R. J. (n.d.). Repeated
    prophet inequality with near-optimal bounds. <i>arXiv</i>. <a href="https://doi.org/10.48550/ARXIV.2209.14368">https://doi.org/10.48550/ARXIV.2209.14368</a>
  chicago: Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta.
    “Repeated Prophet Inequality with Near-Optimal Bounds.” <i>ArXiv</i>, n.d. <a
    href="https://doi.org/10.48550/ARXIV.2209.14368">https://doi.org/10.48550/ARXIV.2209.14368</a>.
  ieee: K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality
    with near-optimal bounds,” <i>arXiv</i>. .
  ista: Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality
    with near-optimal bounds. arXiv, 2209.14368.
  mla: Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal
    Bounds.” <i>ArXiv</i>, 2209.14368, doi:<a href="https://doi.org/10.48550/ARXIV.2209.14368">10.48550/ARXIV.2209.14368</a>.
  short: K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.).
corr_author: '1'
date_created: 2023-02-24T12:21:40Z
date_published: 2022-09-28T00:00:00Z
date_updated: 2025-04-14T07:52:48Z
day: '28'
department:
- _id: GradSch
- _id: KrCh
doi: 10.48550/ARXIV.2209.14368
ec_funded: 1
external_id:
  arxiv:
  - '2209.14368'
fulldoi: https://doi.org/10.48550/ARXIV.2209.14368
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.2209.14368'
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
  call_identifier: H2020
  grant_number: '863818'
  name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: arXiv
publication_status: submitted
status: public
title: Repeated prophet inequality with near-optimal bounds
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
OA_place: repository
_id: '12750'
abstract:
- lang: eng
  text: Quantum kinetically constrained models have recently attracted significant
    attention due to their anomalous dynamics and thermalization. In this work, we
    introduce a hitherto unexplored family of kinetically constrained models featuring
    a conserved particle number and strong inversion-symmetry breaking due to facilitated
    hopping. We demonstrate that these models provide a generic example of so-called
    quantum Hilbert space fragmentation, that is manifested in disconnected sectors
    in the Hilbert space that are not apparent in the computational basis. Quantum
    Hilbert space fragmentation leads to an exponential in system size number of eigenstates
    with exactly zero entanglement entropy across several bipartite cuts. These eigenstates
    can be probed dynamically using quenches from simple initial product states. In
    addition, we study the particle spreading under unitary dynamics launched from
    the domain wall state, and find faster than diffusive dynamics at high particle
    densities, that crosses over into logarithmically slow relaxation at smaller densities.
    Using a classically simulable cellular automaton, we reproduce the logarithmic
    dynamics observed in the quantum case. Our work suggests that particle conserving
    constrained models with inversion symmetry breaking realize so far unexplored
    universality classes of dynamics and invite their further theoretical and experimental
    studies.
article_number: '2210.15607'
article_processing_charge: No
arxiv: 1
author:
- first_name: Pietro
  full_name: Brighi, Pietro
  id: 4115AF5C-F248-11E8-B48F-1D18A9856A87
  last_name: Brighi
  orcid: 0000-0002-7969-2729
- first_name: Marko
  full_name: Ljubotina, Marko
  id: F75EE9BE-5C90-11EA-905D-16643DDC885E
  last_name: Ljubotina
  orcid: 0000-0003-0038-7068
- first_name: Maksym
  full_name: Serbyn, Maksym
  id: 47809E7E-F248-11E8-B48F-1D18A9856A87
  last_name: Serbyn
  orcid: 0000-0002-2399-5827
citation:
  ama: Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics
    in particle-conserving quantum East models. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/arXiv.2210.15607">10.48550/arXiv.2210.15607</a>
  apa: Brighi, P., Ljubotina, M., &#38; Serbyn, M. (n.d.). Hilbert space fragmentation
    and slow dynamics in particle-conserving quantum East models. <i>arXiv</i>. <a
    href="https://doi.org/10.48550/arXiv.2210.15607">https://doi.org/10.48550/arXiv.2210.15607</a>
  chicago: Brighi, Pietro, Marko Ljubotina, and Maksym Serbyn. “Hilbert Space Fragmentation
    and Slow Dynamics in Particle-Conserving Quantum East Models.” <i>ArXiv</i>, n.d.
    <a href="https://doi.org/10.48550/arXiv.2210.15607">https://doi.org/10.48550/arXiv.2210.15607</a>.
  ieee: P. Brighi, M. Ljubotina, and M. Serbyn, “Hilbert space fragmentation and slow
    dynamics in particle-conserving quantum East models,” <i>arXiv</i>. .
  ista: Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics
    in particle-conserving quantum East models. arXiv, 2210.15607.
  mla: Brighi, Pietro, et al. “Hilbert Space Fragmentation and Slow Dynamics in Particle-Conserving
    Quantum East Models.” <i>ArXiv</i>, 2210.15607, doi:<a href="https://doi.org/10.48550/arXiv.2210.15607">10.48550/arXiv.2210.15607</a>.
  short: P. Brighi, M. Ljubotina, M. Serbyn, ArXiv (n.d.).
corr_author: '1'
date_created: 2023-03-23T14:33:13Z
date_published: 2022-11-07T00:00:00Z
date_updated: 2026-04-07T13:26:31Z
day: '07'
department:
- _id: GradSch
- _id: MaSe
doi: 10.48550/arXiv.2210.15607
external_id:
  arxiv:
  - '2210.15607'
fulldoi: https://doi.org/10.48550/arXiv.2210.15607
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2210.15607
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
  record:
  - id: '14334'
    relation: later_version
    status: public
  - id: '12732'
    relation: dissertation_contains
    status: public
status: public
title: Hilbert space fragmentation and slow dynamics in particle-conserving quantum
  East models
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12776'
abstract:
- lang: eng
  text: An improved asymptotic formula is established for the number of rational points
    of bounded height on the split smooth del Pezzo surface of degree 5. The proof
    uses the five conic bundle structures on the surface.
acknowledgement: This work was begun while the author was participating in the programme
  on "Diophantine equations" at the Hausdorff Research Institute for Mathematics in
  Bonn in 2009. The hospitality and financial support of the institute is gratefully
  acknowledged. The idea of using conic bundles to study the split del Pezzo surface
  of degree 5 was explained to the author by Professor Salberger. The author is very
  grateful to him for his input into this project and also to Shuntaro Yamagishi for
  many useful comments on an earlier version of this manuscript. While working on
  this paper the author was supported by FWF grant P32428-N35.
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
citation:
  ama: Browning TD. Revisiting the Manin–Peyre conjecture for the split del Pezzo
    surface of degree 5. <i>New York Journal of Mathematics</i>. 2022;28:1193-1229.
  apa: Browning, T. D. (2022). Revisiting the Manin–Peyre conjecture for the split
    del Pezzo surface of degree 5. <i>New York Journal of Mathematics</i>. State University
    of New York.
  chicago: Browning, Timothy D. “Revisiting the Manin–Peyre Conjecture for the Split
    Del Pezzo Surface of Degree 5.” <i>New York Journal of Mathematics</i>. State
    University of New York, 2022.
  ieee: T. D. Browning, “Revisiting the Manin–Peyre conjecture for the split del Pezzo
    surface of degree 5,” <i>New York Journal of Mathematics</i>, vol. 28. State University
    of New York, pp. 1193–1229, 2022.
  ista: Browning TD. 2022. Revisiting the Manin–Peyre conjecture for the split del
    Pezzo surface of degree 5. New York Journal of Mathematics. 28, 1193–1229.
  mla: Browning, Timothy D. “Revisiting the Manin–Peyre Conjecture for the Split Del
    Pezzo Surface of Degree 5.” <i>New York Journal of Mathematics</i>, vol. 28, State
    University of New York, 2022, pp. 1193–229.
  short: T.D. Browning, New York Journal of Mathematics 28 (2022) 1193–1229.
corr_author: '1'
date_created: 2023-03-28T09:21:09Z
date_published: 2022-08-24T00:00:00Z
date_updated: 2025-04-15T07:39:01Z
day: '24'
ddc:
- '510'
department:
- _id: TiBr
file:
- access_level: open_access
  checksum: c01e8291794a1bdb7416aa103cb68ef8
  content_type: application/pdf
  creator: dernst
  date_created: 2023-03-30T07:09:35Z
  date_updated: 2023-03-30T07:09:35Z
  file_id: '12778'
  file_name: 2022_NYJM_Browning.pdf
  file_size: 897267
  relation: main_file
  success: 1
file_date_updated: 2023-03-30T07:09:35Z
has_accepted_license: '1'
intvolume: '        28'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 1193 - 1229
project:
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P32428
  name: New frontiers of the Manin conjecture
publication: New York Journal of Mathematics
publication_identifier:
  issn:
  - 1076-9803
publication_status: published
publisher: State University of New York
quality_controlled: '1'
status: public
title: Revisiting the Manin–Peyre conjecture for the split del Pezzo surface of degree
  5
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: 28
year: '2022'
...
---
_id: '12860'
abstract:
- lang: eng
  text: 'Memorization of the relation between entities in a dataset can lead to privacy
    issues when using a trained model for question answering. We introduce Relational
    Memorization (RM) to understand, quantify and control this phenomenon. While bounding
    general memorization can have detrimental effects on the performance of a trained
    model, bounding RM does not prevent effective learning. The difference is most
    pronounced when the data distribution is long-tailed, with many queries having
    only few training examples: Impeding general memorization prevents effective learning,
    while impeding only relational memorization still allows learning general properties
    of the underlying concepts. We formalize the notion of Relational Privacy (RP)
    and, inspired by Differential Privacy (DP), we provide a possible definition of
    Differential Relational Privacy (DrP). These notions can be used to describe and
    compute bounds on the amount of RM in a trained model. We illustrate Relational
    Privacy concepts in experiments with large-scale models for Question Answering.'
article_number: '2203.16701'
article_processing_charge: No
arxiv: 1
author:
- first_name: Simone
  full_name: Bombari, Simone
  id: ca726dda-de17-11ea-bc14-f9da834f63aa
  last_name: Bombari
- first_name: Alessandro
  full_name: Achille, Alessandro
  last_name: Achille
- first_name: Zijian
  full_name: Wang, Zijian
  last_name: Wang
- first_name: Yu-Xiang
  full_name: Wang, Yu-Xiang
  last_name: Wang
- first_name: Yusheng
  full_name: Xie, Yusheng
  last_name: Xie
- first_name: Kunwar Yashraj
  full_name: Singh, Kunwar Yashraj
  last_name: Singh
- first_name: Srikar
  full_name: Appalaraju, Srikar
  last_name: Appalaraju
- first_name: Vijay
  full_name: Mahadevan, Vijay
  last_name: Mahadevan
- first_name: Stefano
  full_name: Soatto, Stefano
  last_name: Soatto
citation:
  ama: Bombari S, Achille A, Wang Z, et al. Towards differential relational privacy
    and its use in question answering. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/arXiv.2203.16701">10.48550/arXiv.2203.16701</a>
  apa: Bombari, S., Achille, A., Wang, Z., Wang, Y.-X., Xie, Y., Singh, K. Y., … Soatto,
    S. (n.d.). Towards differential relational privacy and its use in question answering.
    <i>arXiv</i>. <a href="https://doi.org/10.48550/arXiv.2203.16701">https://doi.org/10.48550/arXiv.2203.16701</a>
  chicago: Bombari, Simone, Alessandro Achille, Zijian Wang, Yu-Xiang Wang, Yusheng
    Xie, Kunwar Yashraj Singh, Srikar Appalaraju, Vijay Mahadevan, and Stefano Soatto.
    “Towards Differential Relational Privacy and Its Use in Question Answering.” <i>ArXiv</i>,
    n.d. <a href="https://doi.org/10.48550/arXiv.2203.16701">https://doi.org/10.48550/arXiv.2203.16701</a>.
  ieee: S. Bombari <i>et al.</i>, “Towards differential relational privacy and its
    use in question answering,” <i>arXiv</i>. .
  ista: Bombari S, Achille A, Wang Z, Wang Y-X, Xie Y, Singh KY, Appalaraju S, Mahadevan
    V, Soatto S. Towards differential relational privacy and its use in question answering.
    arXiv, 2203.16701.
  mla: Bombari, Simone, et al. “Towards Differential Relational Privacy and Its Use
    in Question Answering.” <i>ArXiv</i>, 2203.16701, doi:<a href="https://doi.org/10.48550/arXiv.2203.16701">10.48550/arXiv.2203.16701</a>.
  short: S. Bombari, A. Achille, Z. Wang, Y.-X. Wang, Y. Xie, K.Y. Singh, S. Appalaraju,
    V. Mahadevan, S. Soatto, ArXiv (n.d.).
date_created: 2023-04-23T16:11:48Z
date_published: 2022-03-30T00:00:00Z
date_updated: 2023-04-25T07:34:49Z
day: '30'
department:
- _id: GradSch
- _id: MaMo
doi: 10.48550/arXiv.2203.16701
external_id:
  arxiv:
  - '2203.16701'
fulldoi: https://doi.org/10.48550/arXiv.2203.16701
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2203.16701
month: '03'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Towards differential relational privacy and its use in question answering
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
