---
_id: '12432'
abstract:
- lang: eng
text: "We present CertifyHAM, a deterministic algorithm that takes a graph G as
input and either finds a Hamilton cycle of G or outputs that such a cycle does
not exist. If G ∼ G(n, p) and p ≥\r\n100 log n/n then the expected running time
of CertifyHAM is O(n/p) which is best possible. This improves upon previous results
due to Gurevich and Shelah, Thomason and Alon, and\r\nKrivelevich, who proved
analogous results for p being constant, p ≥ 12n −1/3 and p ≥ 70n\r\n−1/2 respectively."
acknowledgement: "This project has received funding from the European Union’s Horizon
2020\r\nresearch and innovation programme under the Marie Skłodowska-Curie grant\r\nagreement
No 101034413"
article_processing_charge: No
author:
- first_name: Michael
full_name: Anastos, Michael
id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb
last_name: Anastos
citation:
ama: 'Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd
Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October.
Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091'
apa: 'Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In
63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October,
pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/FOCS54457.2022.00091'
chicago: Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.”
In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30.
Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/FOCS54457.2022.00091.
ieee: M. Anastos, “Solving the Hamilton cycle problem fast on average,” in 63rd
Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United
States, 2022, vol. 2022–October, pp. 919–930.
ista: 'Anastos M. 2022. Solving the Hamilton cycle problem fast on average. 63rd
Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of
Computer Science vol. 2022–October, 919–930.'
mla: Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 63rd
Annual IEEE Symposium on Foundations of Computer Science, vol. 2022–October,
Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:10.1109/FOCS54457.2022.00091.
short: M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science,
Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.
conference:
end_date: 2022-11-03
location: Denver, CO, United States
name: 'FOCS: Foundations of Computer Science'
start_date: 2022-10-31
corr_author: '1'
date_created: 2023-01-29T23:00:59Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-07-10T11:50:26Z
day: '01'
department:
- _id: MaKw
doi: 10.1109/FOCS54457.2022.00091
ec_funded: 1
external_id:
isi:
- '000909382900084'
isi: 1
language:
- iso: eng
month: '12'
oa_version: None
page: 919-930
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 63rd Annual IEEE Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '9781665455190'
issn:
- 0272-5428
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Solving the Hamilton cycle problem fast on average
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022-October
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: 33rd
British Machine Vision Conference. 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 33rd British Machine Vision
Conference. 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 33rd
British Machine Vision Conference. British Machine Vision Association and
Society for Pattern Recognition, 2022.'
ieee: 'P. Rao et al., “VoRF: Volumetric Relightable Faces,” in 33rd British
Machine Vision Conference, 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.” 33rd British
Machine Vision Conference, 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. Journal of Statistical Mechanics: Theory and
Experiment. 2022;2022(11). doi:10.1088/1742-5468/ac9828'
apa: 'Mondelli, M., & Venkataramanan, R. (2022). Approximate message passing
with spectral initialization for generalized linear models. Journal of Statistical
Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ac9828'
chicago: 'Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing
with Spectral Initialization for Generalized Linear Models.” Journal of Statistical
Mechanics: Theory and Experiment. IOP Publishing, 2022. https://doi.org/10.1088/1742-5468/ac9828.'
ieee: 'M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral
initialization for generalized linear models,” Journal of Statistical Mechanics:
Theory and Experiment, 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.” Journal of Statistical
Mechanics: Theory and Experiment, vol. 2022, no. 11, 114003, IOP Publishing,
2022, doi:10.1088/1742-5468/ac9828.'
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
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. Transactions on Machine Learning Research.
2022.'
apa: 'Iofinova, E. B., Konstantinov, N. H., & Lampert, C. (2022). FLEA: Provably
robust fair multisource learning from unreliable training data. Transactions
on Machine Learning Research. ML Research Press.'
chicago: 'Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA:
Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions
on Machine Learning Research. ML Research Press, 2022.'
ieee: 'E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust
fair multisource learning from unreliable training data,” Transactions on Machine
Learning Research. 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.” Transactions on Machine Learning Research,
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: '12508'
abstract:
- lang: eng
text: "We explore the notion of history-determinism in the context of timed automata
(TA). History-deterministic automata are those in which nondeterminism can be
resolved on the fly, based on the run constructed thus far. History-determinism
is a robust property that admits different game-based characterisations, and history-deterministic
specifications allow for game-based verification without an expensive determinization
step.\r\nWe show yet another characterisation of history-determinism in terms
of fair simulation, at the general level of labelled transition systems: a system
is history-deterministic precisely if and only if it fairly simulates all language
smaller systems.\r\nFor timed automata over infinite timed words it is known that
universality is undecidable for Büchi TA. We show that for history-deterministic
TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis
all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with
safety or reachability acceptance, we show that checking whether such an automaton
is history-deterministic is decidable (in ExpTime), and history-deterministic
TA with safety acceptance are effectively determinizable without introducing new
automata states."
acknowledgement: "Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG
101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n"
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Karoliina
full_name: Lehtinen, Karoliina
last_name: Lehtinen
- first_name: Patrick
full_name: Totzke, Patrick
last_name: Totzke
citation:
ama: 'Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata.
In: 33rd International Conference on Concurrency Theory. Vol 243. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:10.4230/LIPIcs.CONCUR.2022.14'
apa: 'Henzinger, T. A., Lehtinen, K., & Totzke, P. (2022). History-deterministic
timed automata. In 33rd International Conference on Concurrency Theory
(Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14'
chicago: Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic
Timed Automata.” In 33rd International Conference on Concurrency Theory,
243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14.
ieee: T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed
automata,” in 33rd International Conference on Concurrency Theory, Warsaw,
Poland, 2022, vol. 243, p. 14:1-14:21.
ista: 'Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata.
33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency
Theory, LIPIcs, vol. 243, 14:1-14:21.'
mla: Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” 33rd
International Conference on Concurrency Theory, vol. 243, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:10.4230/LIPIcs.CONCUR.2022.14.
short: T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference
on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022,
p. 14:1-14:21.
conference:
end_date: 2022-09-16
location: Warsaw, Poland
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2022-09-13
corr_author: '1'
date_created: 2023-02-05T17:24:23Z
date_published: 2022-09-06T00:00:00Z
date_updated: 2025-09-08T14:35:16Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2022.14
ec_funded: 1
file:
- access_level: open_access
checksum: 9e97e15628f66b2ad77f535bb0327dee
content_type: application/pdf
creator: dernst
date_created: 2023-02-06T09:21:09Z
date_updated: 2023-02-06T09:21:09Z
file_id: '12520'
file_name: 2022_LIPICs_Henzinger2.pdf
file_size: 717940
relation: main_file
success: 1
file_date_updated: 2023-02-06T09:21:09Z
has_accepted_license: '1'
intvolume: ' 243'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 14:1-14:21
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 33rd International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959772464'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '18530'
relation: later_version
status: public
scopus_import: '1'
status: public
title: History-deterministic timed automata
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: 243
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: 47th
International Symposium on Mathematical Foundations of Computer Science. Vol
241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3'
apa: 'Avni, G., & Henzinger, T. A. (2022). An updated survey of bidding games
on graphs. In 47th International Symposium on Mathematical Foundations of Computer
Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.3'
chicago: 'Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games
on Graphs.” In 47th International Symposium on Mathematical Foundations of
Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.MFCS.2022.3.'
ieee: G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,”
in 47th International Symposium on Mathematical Foundations of Computer Science,
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.” 47th International Symposium on Mathematical Foundations of Computer
Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022,
p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3.
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
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. Proceedings of the AAAI Conference on Artificial
Intelligence. 2022;36(6):6755-6764. doi:10.1609/aaai.v36i6.20631'
apa: 'Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka,
S. A., & Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth
models. Proceedings of the AAAI Conference on Artificial Intelligence.
Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i6.20631'
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.” Proceedings of the AAAI Conference on Artificial
Intelligence. Association for the Advancement of Artificial Intelligence,
2022. https://doi.org/10.1609/aaai.v36i6.20631.'
ieee: 'S. A. Gruenbacher et al., “GoTube: Scalable statistical verification
of continuous-depth models,” Proceedings of the AAAI Conference on Artificial
Intelligence, 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.” Proceedings of the AAAI Conference on Artificial
Intelligence, vol. 36, no. 6, Association for the Advancement of Artificial
Intelligence, 2022, pp. 6755–64, doi:10.1609/aaai.v36i6.20631.'
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'
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: '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: Theory of Cryptography. Vol 13748. Springer Nature; 2022:565-592.
doi:10.1007/978-3-031-22365-5_20'
apa: 'Bogdanov, A., Cueto Noval, M., Hoffmann, C., & Rosen, A. (2022). Public-Key
Encryption from Homogeneous CLWE. In Theory of Cryptography (Vol. 13748,
pp. 565–592). Chicago, IL, United States: Springer Nature. https://doi.org/10.1007/978-3-031-22365-5_20'
chicago: Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen.
“Public-Key Encryption from Homogeneous CLWE.” In Theory of Cryptography,
13748:565–92. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-22365-5_20.
ieee: A. Bogdanov, M. Cueto Noval, C. Hoffmann, and A. Rosen, “Public-Key Encryption
from Homogeneous CLWE,” in Theory of Cryptography, 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.” Theory
of Cryptography, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:10.1007/978-3-031-22365-5_20.
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'
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: '12529'
abstract:
- lang: eng
text: "We consider turn-based stochastic 2-player games on graphs with ω-regular
winning conditions. We provide a direct symbolic algorithm for solving such games
when the winning condition is formulated as a Rabin condition. For a stochastic
Rabin game with k pairs over a game graph with n vertices, our algorithm runs
in O(nk+2k!) symbolic steps, which improves the state of the art.\r\nWe have implemented
our symbolic algorithm, along with performance optimizations including parallellization
and acceleration, in a BDD-based synthesis tool called Fairsyn. We demonstrate
the superiority of Fairsyn compared to the state of the art on a set of synthetic
benchmarks derived from the VLTS benchmark suite and on a control system benchmark
from the literature. In our experiments, Fairsyn performed significantly faster
with up to two orders of magnitude improvement in computation time."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tamajit
full_name: Banerjee, Tamajit
last_name: Banerjee
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
- first_name: Anne-Kathrin
full_name: Schmuck, Anne-Kathrin
last_name: Schmuck
- first_name: Sadegh
full_name: Soudjani, Sadegh
last_name: Soudjani
citation:
ama: 'Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. A direct symbolic
algorithm for solving stochastic rabin games. In: 28th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems. Vol
13244. Springer Nature; 2022:81-98. doi:10.1007/978-3-030-99527-0_5'
apa: 'Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., & Soudjani, S.
(2022). A direct symbolic algorithm for solving stochastic rabin games. In 28th
International Conference on Tools and Algorithms for the Construction and Analysis
of Systems (Vol. 13244, pp. 81–98). Munich, Germany: Springer Nature. https://doi.org/10.1007/978-3-030-99527-0_5'
chicago: Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck,
and Sadegh Soudjani. “A Direct Symbolic Algorithm for Solving Stochastic Rabin
Games.” In 28th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, 13244:81–98. Springer Nature, 2022. https://doi.org/10.1007/978-3-030-99527-0_5.
ieee: T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “A direct
symbolic algorithm for solving stochastic rabin games,” in 28th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems,
Munich, Germany, 2022, vol. 13244, pp. 81–98.
ista: 'Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2022. A direct
symbolic algorithm for solving stochastic rabin games. 28th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13244,
81–98.'
mla: Banerjee, Tamajit, et al. “A Direct Symbolic Algorithm for Solving Stochastic
Rabin Games.” 28th International Conference on Tools and Algorithms for the
Construction and Analysis of Systems, vol. 13244, Springer Nature, 2022, pp.
81–98, doi:10.1007/978-3-030-99527-0_5.
short: T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, in:, 28th
International Conference on Tools and Algorithms for the Construction and Analysis
of Systems, Springer Nature, 2022, pp. 81–98.
conference:
end_date: 2022-04-07
location: Munich, Germany
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2022-04-02
corr_author: '1'
date_created: 2023-02-08T11:43:34Z
date_published: 2022-03-29T00:00:00Z
date_updated: 2024-10-09T21:04:10Z
day: '29'
doi: 10.1007/978-3-030-99527-0_5
extern: '1'
intvolume: ' 13244'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-3-030-99527-0_5
month: '03'
oa: 1
oa_version: Published Version
page: 81-98
publication: 28th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eisbn:
- '9783030995270'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A direct symbolic algorithm for solving stochastic rabin games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13244
year: '2022'
...
---
_id: '12530'
abstract:
- lang: eng
text: We present BOCoSy, a tool for Bounded symbolic Output-feedback Controller
Synthesis. Given a specification, BOCoSy synthesizes symbolic output-feedback
controllers which interact with a given plant via a pre-defined finite symbolic
interface. BOCoSy solves this problem by a new lazy abstraction-refinement technique
which starts with a very coarse abstraction of the external trace semantics of
the given plant and iteratively removes non-admissible behavior from this abstract
model until a controller is found. BOCoSy steers the search for controllers towards
small and concise state space representations by utilizing ideas from bounded
synthesis. As a result, BOCoSy returns small and explainable controllers that
are still powerful enough to solve the given synthesis problem. We show that BOCoSy
is able to synthesize small, human readable symbolic controllers quickly on a
set of benchmarks.
article_processing_charge: No
author:
- first_name: Bernd
full_name: Finkbeiner, Bernd
last_name: Finkbeiner
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
- first_name: Noemi
full_name: Passing, Noemi
last_name: Passing
- first_name: Malte
full_name: Schledjewski, Malte
last_name: Schledjewski
- first_name: Anne-Kathrin
full_name: Schmuck, Anne-Kathrin
last_name: Schmuck
citation:
ama: 'Finkbeiner B, Mallik K, Passing N, Schledjewski M, Schmuck A-K. BOCoSy: Small
but powerful symbolic output-feedback control. In: 25th ACM International Conference
on Hybrid Systems: Computation and Control. ACM; 2022:24:1-24:11. doi:10.1145/3501710.3519535'
apa: 'Finkbeiner, B., Mallik, K., Passing, N., Schledjewski, M., & Schmuck,
A.-K. (2022). BOCoSy: Small but powerful symbolic output-feedback control. In
25th ACM International Conference on Hybrid Systems: Computation and Control
(p. 24:1-24:11). Milan, Italy: ACM. https://doi.org/10.1145/3501710.3519535'
chicago: 'Finkbeiner, Bernd, Kaushik Mallik, Noemi Passing, Malte Schledjewski,
and Anne-Kathrin Schmuck. “BOCoSy: Small but Powerful Symbolic Output-Feedback
Control.” In 25th ACM International Conference on Hybrid Systems: Computation
and Control, 24:1-24:11. ACM, 2022. https://doi.org/10.1145/3501710.3519535.'
ieee: 'B. Finkbeiner, K. Mallik, N. Passing, M. Schledjewski, and A.-K. Schmuck,
“BOCoSy: Small but powerful symbolic output-feedback control,” in 25th ACM
International Conference on Hybrid Systems: Computation and Control, Milan,
Italy, 2022, p. 24:1-24:11.'
ista: 'Finkbeiner B, Mallik K, Passing N, Schledjewski M, Schmuck A-K. 2022. BOCoSy:
Small but powerful symbolic output-feedback control. 25th ACM International Conference
on Hybrid Systems: Computation and Control. HSCC: International Conference on
Hybrid Systems Computation and Control, 24:1-24:11.'
mla: 'Finkbeiner, Bernd, et al. “BOCoSy: Small but Powerful Symbolic Output-Feedback
Control.” 25th ACM International Conference on Hybrid Systems: Computation
and Control, ACM, 2022, p. 24:1-24:11, doi:10.1145/3501710.3519535.'
short: 'B. Finkbeiner, K. Mallik, N. Passing, M. Schledjewski, A.-K. Schmuck, in:,
25th ACM International Conference on Hybrid Systems: Computation and Control,
ACM, 2022, p. 24:1-24:11.'
conference:
end_date: 2022-05-06
location: Milan, Italy
name: 'HSCC: International Conference on Hybrid Systems Computation and Control'
start_date: 2022-05-04
date_created: 2023-02-08T11:43:50Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2023-02-09T08:53:13Z
day: '01'
doi: 10.1145/3501710.3519535
extern: '1'
language:
- iso: eng
month: '05'
oa_version: None
page: 24:1-24:11
publication: '25th ACM International Conference on Hybrid Systems: Computation and
Control'
publication_identifier:
isbn:
- '9781450391962'
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'BOCoSy: Small but powerful symbolic output-feedback control'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12536'
abstract:
- lang: eng
text: 'We consider the problem of estimating a rank-1 signal corrupted by structured
rotationally invariant noise, and address the following question: how well do
inference algorithms perform when the noise statistics is unknown and hence Gaussian
noise is assumed? While the matched Bayes-optimal setting with unstructured noise
is well understood, the analysis of this mismatched problem is only at its premises.
In this paper, we make a step towards understanding the effect of the strong source
of mismatch which is the noise statistics. Our main technical contribution is
the rigorous analysis of a Bayes estimator and of an approximate message passing
(AMP) algorithm, both of which incorrectly assume a Gaussian setup. The first
result exploits the theory of spherical integrals and of low-rank matrix perturbations;
the idea behind the second one is to design and analyze an artificial AMP which,
by taking advantage of the flexibility in the denoisers, is able to "correct"
the mismatch. Armed with these sharp asymptotic characterizations, we unveil a
rich and often unexpected phenomenology. For example, despite AMP is in principle
designed to efficiently compute the Bayes estimator, the former is outperformed
by the latter in terms of mean-square error. We show that this performance gap
is due to an incorrect estimation of the signal norm. In fact, when the SNR is
large enough, the overlaps of the AMP and the Bayes estimator coincide, and they
even match those of optimal estimators taking into account the structure of the
noise.'
acknowledgement: "M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize.
The authors acknowledge\r\ndiscussions with A. Krajenbrink, M. Robinson, A. Depope,
N. Macris and F. Pourkamali.\r\n"
alternative_title:
- NeurIPS
article_processing_charge: No
arxiv: 1
author:
- first_name: Jean
full_name: Barbier, Jean
last_name: Barbier
- first_name: TianQi
full_name: Hou, TianQi
last_name: Hou
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Manuel
full_name: Saenz, Manuel
last_name: Saenz
citation:
ama: 'Barbier J, Hou T, Mondelli M, Saenz M. The price of ignorance: How much does
it cost to forget noise structure in low-rank matrix estimation? In: 36th Annual
Conference on Neural Information Processing Systems. Vol 35. ; 2022.'
apa: 'Barbier, J., Hou, T., Mondelli, M., & Saenz, M. (2022). The price of ignorance:
How much does it cost to forget noise structure in low-rank matrix estimation?
In 36th Annual Conference on Neural Information Processing Systems (Vol.
35). New Orleans, LA, United States.'
chicago: 'Barbier, Jean, TianQi Hou, Marco Mondelli, and Manuel Saenz. “The Price
of Ignorance: How Much Does It Cost to Forget Noise Structure in Low-Rank Matrix
Estimation?” In 36th Annual Conference on Neural Information Processing Systems,
Vol. 35, 2022.'
ieee: 'J. Barbier, T. Hou, M. Mondelli, and M. Saenz, “The price of ignorance: How
much does it cost to forget noise structure in low-rank matrix estimation?,” in
36th Annual Conference on Neural Information Processing Systems, New Orleans,
LA, United States, 2022, vol. 35.'
ista: 'Barbier J, Hou T, Mondelli M, Saenz M. 2022. The price of ignorance: How
much does it cost to forget noise structure in low-rank matrix estimation? 36th
Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information
Processing Systems, NeurIPS, vol. 35.'
mla: 'Barbier, Jean, et al. “The Price of Ignorance: How Much Does It Cost to Forget
Noise Structure in Low-Rank Matrix Estimation?” 36th Annual Conference on Neural
Information Processing Systems, vol. 35, 2022.'
short: J. Barbier, T. Hou, M. Mondelli, M. Saenz, in:, 36th Annual Conference on
Neural Information Processing Systems, 2022.
conference:
end_date: 2022-12-09
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2022-11-28
corr_author: '1'
date_created: 2023-02-10T13:45:41Z
date_published: 2022-11-20T00:00:00Z
date_updated: 2024-10-09T21:04:25Z
day: '20'
department:
- _id: MaMo
external_id:
arxiv:
- '2205.10009'
intvolume: ' 35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2205.10009
month: '11'
oa: 1
oa_version: Preprint
publication: 36th Annual Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713871088'
publication_status: published
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The price of ignorance: How much does it cost to forget noise structure in
low-rank matrix estimation?'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2022'
...
---
OA_place: repository
OA_type: green
_id: '12537'
abstract:
- lang: eng
text: 'The Neural Tangent Kernel (NTK) has emerged as a powerful tool to provide
memorization, optimization and generalization guarantees in deep neural networks.
A line of work has studied the NTK spectrum for two-layer and deep networks with
at least a layer with Ω(N) neurons, N being the number of training samples. Furthermore,
there is increasing evidence suggesting that deep networks with sub-linear layer
widths are powerful memorizers and optimizers, as long as the number of parameters
exceeds the number of samples. Thus, a natural open question is whether the NTK
is well conditioned in such a challenging sub-linear setup. In this paper, we
answer this question in the affirmative. Our key technical contribution is a lower
bound on the smallest NTK eigenvalue for deep networks with the minimum possible
over-parameterization: the number of parameters is roughly Ω(N) and, hence, the
number of neurons is as little as Ω(N−−√). To showcase the applicability of our
NTK bounds, we provide two results concerning memorization capacity and optimization
guarantees for gradient descent training.'
acknowledgement: "The authors were partially supported by the 2019 Lopez-Loreta prize,
and they would like to thank\r\nQuynh Nguyen, Mahdi Soltanolkotabi and Adel Javanmard
for helpful discussions.\r\n"
alternative_title:
- Advances in Neural Information Processing Systems
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: Mohammad Hossein
full_name: Amani, Mohammad Hossein
last_name: Amani
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Bombari S, Amani MH, Mondelli M. Memorization and optimization in deep neural
networks with minimum over-parameterization. In: 36th Conference on Neural
Information Processing Systems. Vol 35. Neural Information Processing Systems
Foundation; 2022:7628-7640.'
apa: 'Bombari, S., Amani, M. H., & Mondelli, M. (2022). Memorization and optimization
in deep neural networks with minimum over-parameterization. In 36th Conference
on Neural Information Processing Systems (Vol. 35, pp. 7628–7640). New Orleans,
LA, United States: Neural Information Processing Systems Foundation.'
chicago: Bombari, Simone, Mohammad Hossein Amani, and Marco Mondelli. “Memorization
and Optimization in Deep Neural Networks with Minimum Over-Parameterization.”
In 36th Conference on Neural Information Processing Systems, 35:7628–40.
Neural Information Processing Systems Foundation, 2022.
ieee: S. Bombari, M. H. Amani, and M. Mondelli, “Memorization and optimization in
deep neural networks with minimum over-parameterization,” in 36th Conference
on Neural Information Processing Systems, New Orleans, LA, United States,
2022, vol. 35, pp. 7628–7640.
ista: 'Bombari S, Amani MH, Mondelli M. 2022. Memorization and optimization in deep
neural networks with minimum over-parameterization. 36th Conference on Neural
Information Processing Systems. NeurIPS: Neural Information Processing Systems,
Advances in Neural Information Processing Systems, vol. 35, 7628–7640.'
mla: Bombari, Simone, et al. “Memorization and Optimization in Deep Neural Networks
with Minimum Over-Parameterization.” 36th Conference on Neural Information
Processing Systems, vol. 35, Neural Information Processing Systems Foundation,
2022, pp. 7628–40.
short: S. Bombari, M.H. Amani, M. Mondelli, in:, 36th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2022, pp.
7628–7640.
conference:
end_date: 2022-12-09
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2022-11-28
corr_author: '1'
date_created: 2023-02-10T13:46:37Z
date_published: 2022-07-24T00:00:00Z
date_updated: 2025-05-14T11:28:22Z
day: '24'
department:
- _id: MaMo
external_id:
arxiv:
- '2205.10217'
intvolume: ' 35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2205.10217'
month: '07'
oa: 1
oa_version: Preprint
page: 7628-7640
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 36th Conference on Neural Information Processing Systems
publication_identifier:
eissn:
- 1049-5258
isbn:
- '9781713871088'
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: Memorization and optimization in deep neural networks with minimum over-parameterization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
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 MIEEE Information Theory Workshop.
2022:588-593. doi:10.1109/ITW54588.2022.9965870
apa: 'Amani, M. H., Bombari, S., Mondelli, M., Pukdee, R., & Rini, S. (2022).
Sharp asymptotics on the compression of two-layer neural networks. IEEE Information
Theory Workshop. Mumbai, India: IEEE. https://doi.org/10.1109/ITW54588.2022.9965870'
chicago: Amani, Mohammad Hossein, Simone Bombari, Marco Mondelli, Rattana Pukdee,
and Stefano Rini. “Sharp Asymptotics on the Compression of Two-Layer Neural Networks.”
IEEE Information Theory Workshop. IEEE, 2022. https://doi.org/10.1109/ITW54588.2022.9965870.
ieee: M. H. Amani, S. Bombari, M. Mondelli, R. Pukdee, and S. Rini, “Sharp asymptotics
on the compression of two-layer neural networks,” IEEE Information Theory Workshop.
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.” IEEE Information Theory Workshop, IEEE, 2022, pp. 588–93,
doi:10.1109/ITW54588.2022.9965870.
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'
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: '12540'
abstract:
- lang: eng
text: We consider the problem of signal estimation in generalized linear models
defined via rotationally invariant design matrices. Since these matrices can have
an arbitrary spectral distribution, this model is well suited for capturing complex
correlation structures which often arise in applications. We propose a novel family
of approximate message passing (AMP) algorithms for signal estimation, and rigorously
characterize their performance in the high-dimensional limit via a state evolution
recursion. Our rotationally invariant AMP has complexity of the same order as
the existing AMP derived under the restrictive assumption of a Gaussian design;
our algorithm also recovers this existing AMP as a special case. Numerical results
showcase a performance close to Vector AMP (which is conjectured to be Bayes-optimal
in some settings), but obtained with a much lower complexity, as the proposed
algorithm does not require a computationally expensive singular value decomposition.
acknowledgement: The authors would like to thank the anonymous reviewers for their
helpful comments. KK and MM were partially supported by the 2019 Lopez-Loreta Prize.
article_number: '22'
article_processing_charge: No
author:
- first_name: Ramji
full_name: Venkataramanan, Ramji
last_name: Venkataramanan
- first_name: Kevin
full_name: Kögler, Kevin
id: 94ec913c-dc85-11ea-9058-e5051ab2428b
last_name: Kögler
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Venkataramanan R, Kögler K, Mondelli M. Estimation in rotationally invariant
generalized linear models via approximate message passing. In: Proceedings
of the 39th International Conference on Machine Learning. Vol 162. ML Research
Press; 2022.'
apa: 'Venkataramanan, R., Kögler, K., & Mondelli, M. (2022). Estimation in rotationally
invariant generalized linear models via approximate message passing. In Proceedings
of the 39th International Conference on Machine Learning (Vol. 162). Baltimore,
MD, United States: ML Research Press.'
chicago: Venkataramanan, Ramji, Kevin Kögler, and Marco Mondelli. “Estimation in
Rotationally Invariant Generalized Linear Models via Approximate Message Passing.”
In Proceedings of the 39th International Conference on Machine Learning,
Vol. 162. ML Research Press, 2022.
ieee: R. Venkataramanan, K. Kögler, and M. Mondelli, “Estimation in rotationally
invariant generalized linear models via approximate message passing,” in Proceedings
of the 39th International Conference on Machine Learning, Baltimore, MD, United
States, 2022, vol. 162.
ista: 'Venkataramanan R, Kögler K, Mondelli M. 2022. Estimation in rotationally
invariant generalized linear models via approximate message passing. Proceedings
of the 39th International Conference on Machine Learning. ICML: International
Conference on Machine Learning vol. 162, 22.'
mla: Venkataramanan, Ramji, et al. “Estimation in Rotationally Invariant Generalized
Linear Models via Approximate Message Passing.” Proceedings of the 39th International
Conference on Machine Learning, vol. 162, 22, ML Research Press, 2022.
short: R. Venkataramanan, K. Kögler, M. Mondelli, in:, Proceedings of the 39th International
Conference on Machine Learning, ML Research Press, 2022.
conference:
end_date: 2022-07-23
location: Baltimore, MD, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2022-07-17
corr_author: '1'
date_created: 2023-02-10T13:49:04Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2025-04-15T07:50:16Z
ddc:
- '000'
department:
- _id: MaMo
file:
- access_level: open_access
checksum: 67436eb0a660789514cdf9db79e84683
content_type: application/pdf
creator: dernst
date_created: 2023-02-13T10:53:11Z
date_updated: 2023-02-13T10:53:11Z
file_id: '12547'
file_name: 2022_PMLR_Venkataramanan.pdf
file_size: 2341343
relation: main_file
success: 1
file_date_updated: 2023-02-13T10:53:11Z
has_accepted_license: '1'
intvolume: ' 162'
language:
- iso: eng
oa: 1
oa_version: Published Version
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of the 39th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: Estimation in rotationally invariant generalized linear models via approximate
message passing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 162
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: Proceedings of
the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Vol 36. Association
for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:10.1609/aaai.v36i9.21222'
apa: 'Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings
of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36,
pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence.
https://doi.org/10.1609/aaai.v36i9.21222'
chicago: Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In Proceedings
of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, 36:9858–67.
Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i9.21222.
ieee: T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings
of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, 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.” Proceedings
of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36,
no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67,
doi:10.1609/aaai.v36i9.21222.
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'
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: '12573'
abstract:
- lang: eng
text: Supraglacial debris strongly modulates glacier melt rates and can be decisive
for ice dynamics and mountain hydrology. It is ubiquitous in High-Mountain Asia,
yet because its thickness and supply rate from local topography are poorly known,
our ability to forecast regional glacier change and streamflow is limited. Here
we combined remote sensing and numerical modelling to resolve supraglacial debris
thickness by altitude for 4689 glaciers in High-Mountain Asia, and debris-supply
rate to 4141 of those glaciers. Our results reveal extensively thin supraglacial
debris and high spatial variability in both debris thickness and supply rate.
Debris-supply rate increases with the temperature and slope of debris-supply slopes
regionally, and debris thickness increases as ice flow decreases locally. Our
centennial-scale estimates of debris-supply rate are typically an order of magnitude
or more lower than millennial-scale estimates of headwall-erosion rate from Beryllium-10
cosmogenic nuclides, potentially reflecting episodic debris supply to the region’s
glaciers.
article_number: '269'
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: McCarthy, Michael
last_name: McCarthy
- first_name: Evan
full_name: Miles, Evan
last_name: Miles
- first_name: Marin
full_name: Kneib, Marin
last_name: Kneib
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Stefan
full_name: Fugger, Stefan
last_name: Fugger
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: McCarthy M, Miles E, Kneib M, Buri P, Fugger S, Pellicciotti F. Supraglacial
debris thickness and supply rate in High-Mountain Asia. Communications Earth
& Environment. 2022;3. doi:10.1038/s43247-022-00588-2
apa: McCarthy, M., Miles, E., Kneib, M., Buri, P., Fugger, S., & Pellicciotti,
F. (2022). Supraglacial debris thickness and supply rate in High-Mountain Asia.
Communications Earth & Environment. Springer Nature. https://doi.org/10.1038/s43247-022-00588-2
chicago: McCarthy, Michael, Evan Miles, Marin Kneib, Pascal Buri, Stefan Fugger,
and Francesca Pellicciotti. “Supraglacial Debris Thickness and Supply Rate in
High-Mountain Asia.” Communications Earth & Environment. Springer Nature,
2022. https://doi.org/10.1038/s43247-022-00588-2.
ieee: M. McCarthy, E. Miles, M. Kneib, P. Buri, S. Fugger, and F. Pellicciotti,
“Supraglacial debris thickness and supply rate in High-Mountain Asia,” Communications
Earth & Environment, vol. 3. Springer Nature, 2022.
ista: McCarthy M, Miles E, Kneib M, Buri P, Fugger S, Pellicciotti F. 2022. Supraglacial
debris thickness and supply rate in High-Mountain Asia. Communications Earth &
Environment. 3, 269.
mla: McCarthy, Michael, et al. “Supraglacial Debris Thickness and Supply Rate in
High-Mountain Asia.” Communications Earth & Environment, vol. 3, 269,
Springer Nature, 2022, doi:10.1038/s43247-022-00588-2.
short: M. McCarthy, E. Miles, M. Kneib, P. Buri, S. Fugger, F. Pellicciotti, Communications
Earth & Environment 3 (2022).
date_created: 2023-02-20T08:09:27Z
date_published: 2022-11-05T00:00:00Z
date_updated: 2023-02-28T14:02:22Z
day: '05'
doi: 10.1038/s43247-022-00588-2
extern: '1'
intvolume: ' 3'
keyword:
- General Earth and Planetary Sciences
- General Environmental Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/s43247-022-00588-2
month: '11'
oa: 1
oa_version: Published Version
publication: Communications Earth & Environment
publication_identifier:
issn:
- 2662-4435
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Supraglacial debris thickness and supply rate in High-Mountain Asia
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2022'
...
---
_id: '12574'
abstract:
- lang: eng
text: Melt from supraglacial ice cliffs is an important contributor to the mass
loss of debris-covered glaciers. However, ice cliff contribution is difficult
to quantify as they are highly dynamic features, and the paucity of observations
of melt rates and their variability leads to large modelling uncertainties. We
quantify monsoon season melt and 3D evolution of four ice cliffs over two debris-covered
glaciers in High Mountain Asia (Langtang Glacier, Nepal, and 24K Glacier, China)
at very high resolution using terrestrial photogrammetry applied to imagery captured
from time-lapse cameras installed on lateral moraines. We derive weekly flow-corrected
digital elevation models (DEMs) of the glacier surface with a maximum vertical
bias of ±0.2 m for Langtang Glacier and ±0.05 m for 24K Glacier and use change
detection to determine distributed melt rates at the surfaces of the ice cliffs
throughout the study period. We compare the measured melt patterns with those
derived from a 3D energy balance model to derive the contribution of the main
energy fluxes. We find that ice cliff melt varies considerably throughout the
melt season, with maximum melt rates of 5 to 8 cm d−1, and their average melt
rates are 11–14 (Langtang) and 4.5 (24K) times higher than the surrounding debris-covered
ice. Our results highlight the influence of redistributed supraglacial debris
on cliff melt. At both sites, ice cliff albedo is influenced by the presence of
thin debris at the ice cliff surface, which is largely controlled on 24K Glacier
by liquid precipitation events that wash away this debris. Slightly thicker or
patchy debris reduces melt by 1–3 cm d−1 at all sites. Ultimately, our observations
show a strong spatio-temporal variability in cliff area at each site, which is
controlled by supraglacial streams and ponds and englacial cavities that promote
debris slope destabilisation and the lateral expansion of the cliffs. These findings
highlight the need to better represent processes of debris redistribution in ice
cliff models, to in turn improve estimates of ice cliff contribution to glacier
melt and the long-term geomorphological evolution of debris-covered glacier surfaces.
article_processing_charge: No
article_type: original
author:
- first_name: Marin
full_name: Kneib, Marin
last_name: Kneib
- first_name: Evan S.
full_name: Miles, Evan S.
last_name: Miles
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Stefan
full_name: Fugger, Stefan
last_name: Fugger
- first_name: Michael
full_name: McCarthy, Michael
last_name: McCarthy
- first_name: Thomas E.
full_name: Shaw, Thomas E.
last_name: Shaw
- first_name: Zhao
full_name: Chuanxi, Zhao
last_name: Chuanxi
- first_name: Martin
full_name: Truffer, Martin
last_name: Truffer
- first_name: Matthew J.
full_name: Westoby, Matthew J.
last_name: Westoby
- first_name: Wei
full_name: Yang, Wei
last_name: Yang
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Kneib M, Miles ES, Buri P, et al. Sub-seasonal variability of supraglacial
ice cliff melt rates and associated processes from time-lapse photogrammetry.
The Cryosphere. 2022;16(11):4701-4725. doi:10.5194/tc-16-4701-2022
apa: Kneib, M., Miles, E. S., Buri, P., Fugger, S., McCarthy, M., Shaw, T. E., …
Pellicciotti, F. (2022). Sub-seasonal variability of supraglacial ice cliff melt
rates and associated processes from time-lapse photogrammetry. The Cryosphere.
Copernicus Publications. https://doi.org/10.5194/tc-16-4701-2022
chicago: Kneib, Marin, Evan S. Miles, Pascal Buri, Stefan Fugger, Michael McCarthy,
Thomas E. Shaw, Zhao Chuanxi, et al. “Sub-Seasonal Variability of Supraglacial
Ice Cliff Melt Rates and Associated Processes from Time-Lapse Photogrammetry.”
The Cryosphere. Copernicus Publications, 2022. https://doi.org/10.5194/tc-16-4701-2022.
ieee: M. Kneib et al., “Sub-seasonal variability of supraglacial ice cliff
melt rates and associated processes from time-lapse photogrammetry,” The Cryosphere,
vol. 16, no. 11. Copernicus Publications, pp. 4701–4725, 2022.
ista: Kneib M, Miles ES, Buri P, Fugger S, McCarthy M, Shaw TE, Chuanxi Z, Truffer
M, Westoby MJ, Yang W, Pellicciotti F. 2022. Sub-seasonal variability of supraglacial
ice cliff melt rates and associated processes from time-lapse photogrammetry.
The Cryosphere. 16(11), 4701–4725.
mla: Kneib, Marin, et al. “Sub-Seasonal Variability of Supraglacial Ice Cliff Melt
Rates and Associated Processes from Time-Lapse Photogrammetry.” The Cryosphere,
vol. 16, no. 11, Copernicus Publications, 2022, pp. 4701–25, doi:10.5194/tc-16-4701-2022.
short: M. Kneib, E.S. Miles, P. Buri, S. Fugger, M. McCarthy, T.E. Shaw, Z. Chuanxi,
M. Truffer, M.J. Westoby, W. Yang, F. Pellicciotti, The Cryosphere 16 (2022) 4701–4725.
date_created: 2023-02-20T08:09:42Z
date_published: 2022-11-11T00:00:00Z
date_updated: 2023-02-28T13:59:22Z
day: '11'
doi: 10.5194/tc-16-4701-2022
extern: '1'
intvolume: ' 16'
issue: '11'
keyword:
- Earth-Surface Processes
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.5194/tc-16-4701-2022
month: '11'
oa: 1
oa_version: Published Version
page: 4701-4725
publication: The Cryosphere
publication_identifier:
issn:
- 1994-0424
publication_status: published
publisher: Copernicus Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sub-seasonal variability of supraglacial ice cliff melt rates and associated
processes from time-lapse photogrammetry
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2022'
...
---
_id: '12575'
abstract:
- lang: eng
text: The current Chilean megadrought has led to acute water shortages in central
Chile since 2010. Glaciers have provided vital fresh water to the region's rivers,
but the quantity, timing and sustainability of that provision remain unclear.
Here we combine in-situ, remote sensing and climate reanalysis data to show that
from 2010 to 2018 during the megadrought, unsustainable imbalance ablation of
glaciers (ablation not balanced by new snowfall) strongly buffered the late-summer
discharge of the Maipo River, a primary source of water to Santiago. If there
had been no glaciers, water availability would have been reduced from December
through May, with a 31 ± 19% decrease during March. Our results indicate that
while the annual contributions of imbalance ablation to river discharge during
the megadrought have been small compared to those from precipitation and sustainable
balance ablation, they have nevertheless been a substantial input to a hydrological
system that was already experiencing high water stress. The water-equivalent volume
of imbalance ablation generated in the Maipo Basin between 2010 and 2018 was 740
× 106 m3 (19 ± 12 mm yr−1), approximately 3.4 times the capacity of the basin's
El Yeso Reservoir. This is equivalent to 14% of Santiago's potable water use in
that time, while total glacier ablation was equivalent to 59%. We show that glacier
retreat will exacerbate river discharge deficits and further jeopardize water
availability in central Chile if precipitation deficits endure, and conjecture
that these effects will be amplified by climatic warming.
article_number: e2022EF002852
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: McCarthy, Michael
last_name: McCarthy
- first_name: Fabienne
full_name: Meier, Fabienne
last_name: Meier
- first_name: Simone
full_name: Fatichi, Simone
last_name: Fatichi
- first_name: Benjamin D.
full_name: Stocker, Benjamin D.
last_name: Stocker
- first_name: Thomas E.
full_name: Shaw, Thomas E.
last_name: Shaw
- first_name: Evan
full_name: Miles, Evan
last_name: Miles
- first_name: Inés
full_name: Dussaillant, Inés
last_name: Dussaillant
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: McCarthy M, Meier F, Fatichi S, et al. Glacier contributions to river discharge
during the current Chilean megadrought. Earth’s Future. 2022;10(10). doi:10.1029/2022ef002852
apa: McCarthy, M., Meier, F., Fatichi, S., Stocker, B. D., Shaw, T. E., Miles, E.,
… Pellicciotti, F. (2022). Glacier contributions to river discharge during the
current Chilean megadrought. Earth’s Future. American Geophysical Union.
https://doi.org/10.1029/2022ef002852
chicago: McCarthy, Michael, Fabienne Meier, Simone Fatichi, Benjamin D. Stocker,
Thomas E. Shaw, Evan Miles, Inés Dussaillant, and Francesca Pellicciotti. “Glacier
Contributions to River Discharge during the Current Chilean Megadrought.” Earth’s
Future. American Geophysical Union, 2022. https://doi.org/10.1029/2022ef002852.
ieee: M. McCarthy et al., “Glacier contributions to river discharge during
the current Chilean megadrought,” Earth’s Future, vol. 10, no. 10. American
Geophysical Union, 2022.
ista: McCarthy M, Meier F, Fatichi S, Stocker BD, Shaw TE, Miles E, Dussaillant
I, Pellicciotti F. 2022. Glacier contributions to river discharge during the current
Chilean megadrought. Earth’s Future. 10(10), e2022EF002852.
mla: McCarthy, Michael, et al. “Glacier Contributions to River Discharge during
the Current Chilean Megadrought.” Earth’s Future, vol. 10, no. 10, e2022EF002852,
American Geophysical Union, 2022, doi:10.1029/2022ef002852.
short: M. McCarthy, F. Meier, S. Fatichi, B.D. Stocker, T.E. Shaw, E. Miles, I.
Dussaillant, F. Pellicciotti, Earth’s Future 10 (2022).
date_created: 2023-02-20T08:09:49Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2023-02-28T13:55:32Z
day: '01'
doi: 10.1029/2022ef002852
extern: '1'
intvolume: ' 10'
issue: '10'
keyword:
- Earth and Planetary Sciences (miscellaneous)
- General Environmental Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1029/2022EF002852
month: '10'
oa: 1
oa_version: Published Version
publication: Earth's Future
publication_identifier:
issn:
- 2328-4277
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: Glacier contributions to river discharge during the current Chilean megadrought
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2022'
...
---
_id: '12576'
abstract:
- lang: eng
text: Glacier health across High Mountain Asia (HMA) is highly heterogeneous and
strongly governed by regional climate, which is variably influenced by monsoon
dynamics and the westerlies. We explore four decades of glacier energy and mass
balance at three climatically distinct sites across HMA by utilising a detailed
land surface model driven by bias-corrected Weather Research and Forecasting meteorological
forcing. All three glaciers have experienced long-term mass losses (ranging from
−0.04 ± 0.09 to −0.59 ± 0.20 m w.e. a−1) consistent with
widespread warming across the region. However, complex and contrasting responses
of glacier energy and mass balance to the patterns of the Indian Summer Monsoon
were evident, largely driven by the role snowfall timing, amount and phase. A
later monsoon onset generates less total snowfall to the glacier in the southeastern
Tibetan Plateau during May–June, augmenting net shortwave radiation and affecting
annual mass balance (−0.5 m w.e. on average compared to early onset years). Conversely,
timing of the monsoon’s arrival has limited impact for the Nepalese Himalaya which
is more strongly governed by the temperature and snowfall amount during the core
monsoon season. In the arid central Tibetan Plateau, a later monsoon arrival results
in a 40 mm (58%) increase of May–June snowfall on average compared to early onset
years, likely driven by the greater interaction of westerly storm events. Meanwhile,
a late monsoon cessation at this site sees an average 200 mm (192%) increase in
late summer precipitation due to monsoonal storms. A trend towards weaker intensity
monsoon conditions in recent decades, combined with long-term warming patterns,
has produced predominantly negative glacier mass balances for all sites (up to
1 m w.e. more mass loss in the Nepalese Himalaya compared to strong monsoon intensity
years) but sub-regional variability in monsoon timing can additionally complicate
this response.
article_number: '104001'
article_processing_charge: No
article_type: letter_note
author:
- first_name: T E
full_name: Shaw, T E
last_name: Shaw
- first_name: E S
full_name: Miles, E S
last_name: Miles
- first_name: D
full_name: Chen, D
last_name: Chen
- first_name: A
full_name: Jouberton, A
last_name: Jouberton
- first_name: M
full_name: Kneib, M
last_name: Kneib
- first_name: S
full_name: Fugger, S
last_name: Fugger
- first_name: T
full_name: Ou, T
last_name: Ou
- first_name: H-W
full_name: Lai, H-W
last_name: Lai
- first_name: K
full_name: Fujita, K
last_name: Fujita
- first_name: W
full_name: Yang, W
last_name: Yang
- first_name: S
full_name: Fatichi, S
last_name: Fatichi
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Shaw TE, Miles ES, Chen D, et al. Multi-decadal monsoon characteristics and
glacier response in High Mountain Asia. Environmental Research Letters.
2022;17(10). doi:10.1088/1748-9326/ac9008
apa: Shaw, T. E., Miles, E. S., Chen, D., Jouberton, A., Kneib, M., Fugger, S.,
… Pellicciotti, F. (2022). Multi-decadal monsoon characteristics and glacier response
in High Mountain Asia. Environmental Research Letters. IOP Publishing.
https://doi.org/10.1088/1748-9326/ac9008
chicago: Shaw, T E, E S Miles, D Chen, A Jouberton, M Kneib, S Fugger, T Ou, et
al. “Multi-Decadal Monsoon Characteristics and Glacier Response in High Mountain
Asia.” Environmental Research Letters. IOP Publishing, 2022. https://doi.org/10.1088/1748-9326/ac9008.
ieee: T. E. Shaw et al., “Multi-decadal monsoon characteristics and glacier
response in High Mountain Asia,” Environmental Research Letters, vol. 17,
no. 10. IOP Publishing, 2022.
ista: Shaw TE, Miles ES, Chen D, Jouberton A, Kneib M, Fugger S, Ou T, Lai H-W,
Fujita K, Yang W, Fatichi S, Pellicciotti F. 2022. Multi-decadal monsoon characteristics
and glacier response in High Mountain Asia. Environmental Research Letters. 17(10),
104001.
mla: Shaw, T. E., et al. “Multi-Decadal Monsoon Characteristics and Glacier Response
in High Mountain Asia.” Environmental Research Letters, vol. 17, no. 10,
104001, IOP Publishing, 2022, doi:10.1088/1748-9326/ac9008.
short: T.E. Shaw, E.S. Miles, D. Chen, A. Jouberton, M. Kneib, S. Fugger, T. Ou,
H.-W. Lai, K. Fujita, W. Yang, S. Fatichi, F. Pellicciotti, Environmental Research
Letters 17 (2022).
date_created: 2023-02-20T08:09:56Z
date_published: 2022-09-16T00:00:00Z
date_updated: 2023-02-28T13:53:16Z
day: '16'
doi: 10.1088/1748-9326/ac9008
extern: '1'
intvolume: ' 17'
issue: '10'
keyword:
- Public Health
- Environmental and Occupational Health
- General Environmental Science
- Renewable Energy
- Sustainability and the Environment
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1088/1748-9326/ac9008
month: '09'
oa: 1
oa_version: Published Version
publication: Environmental Research Letters
publication_identifier:
issn:
- 1748-9326
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multi-decadal monsoon characteristics and glacier response in High Mountain
Asia
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2022'
...
---
_id: '12577'
abstract:
- lang: eng
text: Glaciers are key components of the mountain water towers of Asia and are vital
for downstream domestic, agricultural, and industrial uses. The glacier mass loss
rate over the southeastern Tibetan Plateau is among the highest in Asia and has
accelerated in recent decades. This acceleration has been attributed to increased
warming, but the mechanisms behind these glaciers’ high sensitivity to warming
remain unclear, while the influence of changes in precipitation over the past
decades is poorly quantified. Here, we reconstruct glacier mass changes and catchment
runoff since 1975 at a benchmark glacier, Parlung No. 4, to shed light on the
drivers of recent mass losses for the monsoonal, spring-accumulation glaciers
of the Tibetan Plateau. Our modeling demonstrates how a temperature increase (mean
of 0.39∘C ⋅dec−1since 1990) has accelerated
mass loss rates by altering both the ablation and accumulation regimes in a complex
manner. The majority of the post-2000 mass loss occurred during the monsoon months,
caused by simultaneous decreases in the solid precipitation ratio (from 0.70 to
0.56) and precipitation amount (–10%), leading to reduced monsoon accumulation
(–26%). Higher solid precipitation in spring (+18%) during the last two decades
was increasingly important in mitigating glacier mass loss by providing mass to
the glacier and protecting it from melting in the early monsoon. With bare ice
exposed to warmer temperatures for longer periods, icemelt and catchment discharge
have unsustainably intensified since the start of the 21st century, raising concerns
for long-term water supply and hazard occurrence in the region.
article_number: e2109796119
article_processing_charge: No
article_type: original
author:
- first_name: Achille
full_name: Jouberton, Achille
last_name: Jouberton
- first_name: Thomas E.
full_name: Shaw, Thomas E.
last_name: Shaw
- first_name: Evan
full_name: Miles, Evan
last_name: Miles
- first_name: Michael
full_name: McCarthy, Michael
last_name: McCarthy
- first_name: Stefan
full_name: Fugger, Stefan
last_name: Fugger
- first_name: Shaoting
full_name: Ren, Shaoting
last_name: Ren
- first_name: Amaury
full_name: Dehecq, Amaury
last_name: Dehecq
- first_name: Wei
full_name: Yang, Wei
last_name: Yang
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Jouberton A, Shaw TE, Miles E, et al. Warming-induced monsoon precipitation
phase change intensifies glacier mass loss in the southeastern Tibetan Plateau.
PNAS. 2022;119(37). doi:10.1073/pnas.2109796119
apa: Jouberton, A., Shaw, T. E., Miles, E., McCarthy, M., Fugger, S., Ren, S., …
Pellicciotti, F. (2022). Warming-induced monsoon precipitation phase change intensifies
glacier mass loss in the southeastern Tibetan Plateau. PNAS. Proceedings
of the National Academy of Sciences. https://doi.org/10.1073/pnas.2109796119
chicago: Jouberton, Achille, Thomas E. Shaw, Evan Miles, Michael McCarthy, Stefan
Fugger, Shaoting Ren, Amaury Dehecq, Wei Yang, and Francesca Pellicciotti. “Warming-Induced
Monsoon Precipitation Phase Change Intensifies Glacier Mass Loss in the Southeastern
Tibetan Plateau.” PNAS. Proceedings of the National Academy of Sciences,
2022. https://doi.org/10.1073/pnas.2109796119.
ieee: A. Jouberton et al., “Warming-induced monsoon precipitation phase change
intensifies glacier mass loss in the southeastern Tibetan Plateau,” PNAS,
vol. 119, no. 37. Proceedings of the National Academy of Sciences, 2022.
ista: Jouberton A, Shaw TE, Miles E, McCarthy M, Fugger S, Ren S, Dehecq A, Yang
W, Pellicciotti F. 2022. Warming-induced monsoon precipitation phase change intensifies
glacier mass loss in the southeastern Tibetan Plateau. PNAS. 119(37), e2109796119.
mla: Jouberton, Achille, et al. “Warming-Induced Monsoon Precipitation Phase Change
Intensifies Glacier Mass Loss in the Southeastern Tibetan Plateau.” PNAS,
vol. 119, no. 37, e2109796119, Proceedings of the National Academy of Sciences,
2022, doi:10.1073/pnas.2109796119.
short: A. Jouberton, T.E. Shaw, E. Miles, M. McCarthy, S. Fugger, S. Ren, A. Dehecq,
W. Yang, F. Pellicciotti, PNAS 119 (2022).
date_created: 2023-02-20T08:10:02Z
date_published: 2022-09-06T00:00:00Z
date_updated: 2023-02-28T13:50:37Z
day: '06'
doi: 10.1073/pnas.2109796119
extern: '1'
intvolume: ' 119'
issue: '37'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '09'
oa_version: None
publication: PNAS
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Warming-induced monsoon precipitation phase change intensifies glacier mass
loss in the southeastern Tibetan Plateau
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2022'
...