---
_id: '15082'
abstract:
- lang: eng
text: "Two plane drawings of geometric graphs on the same set of points are called
disjoint compatible if their union is plane and they do not have an edge in common.
For a given set S of 2n points two plane drawings of perfect matchings M1 and
M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible
if there exists a plane drawing of a spanning tree T on S which is disjoint compatible
to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect
geometric matchings on 2n points in convex position is connected if and only if
2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5,
independent of n."
acknowledgement: Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish
Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week,
both held near Strobl, Austria. We are grateful to the participants for the inspiring
atmosphere. We especially thank Alexander Pilz for bringing this class of problems
to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially
supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and
Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466
Improvement of internationalization in the field of research and development at
Charles University, through the support of quality projects MSCA-IF. This project
has received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie grant agreement No 734922.
article_number: '56'
article_processing_charge: No
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Julia
full_name: Obmann, Julia
last_name: Obmann
- first_name: Pavel
full_name: Patak, Pavel
id: B593B804-1035-11EA-B4F1-947645A5BB83
last_name: Patak
- first_name: Daniel
full_name: Perz, Daniel
last_name: Perz
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
citation:
ama: 'Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible
plane perfect matchings. In: 36th European Workshop on Computational Geometry.
; 2020.'
apa: Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020).
Disjoint tree-compatible plane perfect matchings. In 36th European Workshop
on Computational Geometry. Würzburg, Germany, Virtual.
chicago: Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec.
“Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop
on Computational Geometry, 2020.
ieee: O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible
plane perfect matchings,” in 36th European Workshop on Computational Geometry,
Würzburg, Germany, Virtual, 2020.
ista: 'Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible
plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG:
European Workshop on Computational Geometry, 56.'
mla: Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.”
36th European Workshop on Computational Geometry, 56, 2020.
short: O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European
Workshop on Computational Geometry, 2020.
conference:
end_date: 2020-03-18
location: Würzburg, Germany, Virtual
name: 'EuroCG: European Workshop on Computational Geometry'
start_date: 2020-03-16
corr_author: '1'
date_created: 2024-03-05T08:57:17Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2026-06-18T17:45:52Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: UlWa
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf
month: '04'
oa: 1
oa_version: Published Version
publication: 36th European Workshop on Computational Geometry
publication_status: published
quality_controlled: '1'
status: public
title: Disjoint tree-compatible plane perfect matchings
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '15086'
abstract:
- lang: eng
text: "Many communication-efficient variants of SGD use gradient quantization schemes.
These schemes are often heuristic and fixed over the course of training. We empirically
observe that the statistics of gradients of deep models change during the training.
Motivated by this observation, we introduce two adaptive quantization schemes,
ALQ and AMQ. In both schemes, processors update their compression schemes in parallel
by efficiently computing sufficient statistics of a parametric distribution. We
improve the validation accuracy by almost 2% on CIFAR-10 and 1% on ImageNet in
challenging low-cost communication setups. Our adaptive methods are also significantly
more robust to the choice of hyperparameters.\r\n\r\n"
acknowledgement: "The authors would like to thank Blair Bilodeau, David Fleet, Mufan
Li, and Jeffrey Negrea for\r\nhelpful discussions. FF was supported by OGS Scholarship.
DA and IM were supported the\r\nEuropean Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation\r\nprogramme (grant agreement No 805223
ScaleML). DMR was supported by an NSERC Discovery\r\nGrant. ARK was supported by
NSERC Postdoctoral Fellowship. Resources used in preparing this research were provided,
in part, by the Province of Ontario, the Government of Canada through CIFAR, and
companies sponsoring the Vector Institute."
alternative_title:
- NeurIPS
article_processing_charge: No
arxiv: 1
author:
- first_name: 'Fartash '
full_name: 'Faghri, Fartash '
last_name: Faghri
- first_name: 'Iman '
full_name: 'Tabrizian, Iman '
last_name: Tabrizian
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: 'Daniel '
full_name: 'Roy, Daniel '
last_name: Roy
- first_name: 'Ali '
full_name: 'Ramezani-Kebrya, Ali '
last_name: Ramezani-Kebrya
citation:
ama: 'Faghri F, Tabrizian I, Markov I, Alistarh D-A, Roy D, Ramezani-Kebrya A. Adaptive
gradient quantization for data-parallel SGD. In: Advances in Neural Information
Processing Systems. Vol 33. Neural Information Processing Systems Foundation;
2020.'
apa: 'Faghri, F., Tabrizian, I., Markov, I., Alistarh, D.-A., Roy, D., & Ramezani-Kebrya,
A. (2020). Adaptive gradient quantization for data-parallel SGD. In Advances
in Neural Information Processing Systems (Vol. 33). Vancouver, Canada: Neural
Information Processing Systems Foundation.'
chicago: Faghri, Fartash , Iman Tabrizian, Ilia Markov, Dan-Adrian Alistarh, Daniel Roy,
and Ali Ramezani-Kebrya. “Adaptive Gradient Quantization for Data-Parallel SGD.”
In Advances in Neural Information Processing Systems, Vol. 33. Neural Information
Processing Systems Foundation, 2020.
ieee: F. Faghri, I. Tabrizian, I. Markov, D.-A. Alistarh, D. Roy, and A. Ramezani-Kebrya,
“Adaptive gradient quantization for data-parallel SGD,” in Advances in Neural
Information Processing Systems, Vancouver, Canada, 2020, vol. 33.
ista: 'Faghri F, Tabrizian I, Markov I, Alistarh D-A, Roy D, Ramezani-Kebrya A.
2020. Adaptive gradient quantization for data-parallel SGD. Advances in Neural
Information Processing Systems. NeurIPS: Neural Information Processing Systems,
NeurIPS, vol. 33.'
mla: Faghri, Fartash, et al. “Adaptive Gradient Quantization for Data-Parallel SGD.”
Advances in Neural Information Processing Systems, vol. 33, Neural Information
Processing Systems Foundation, 2020.
short: F. Faghri, I. Tabrizian, I. Markov, D.-A. Alistarh, D. Roy, A. Ramezani-Kebrya,
in:, Advances in Neural Information Processing Systems, Neural Information Processing
Systems Foundation, 2020.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2024-03-06T08:35:58Z
date_published: 2020-12-10T00:00:00Z
date_updated: 2025-04-14T07:49:16Z
day: '10'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2010.12460'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2010.12460
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713829546'
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: Adaptive gradient quantization for data-parallel SGD
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2020'
...
---
_id: '15286'
article_processing_charge: No
article_type: original
author:
- first_name: Florian
full_name: Fäßler, Florian
id: 404F5528-F248-11E8-B48F-1D18A9856A87
last_name: Fäßler
orcid: 0000-0001-7149-769X
- first_name: Georgi A
full_name: Dimchev, Georgi A
id: 38C393BE-F248-11E8-B48F-1D18A9856A87
last_name: Dimchev
orcid: 0000-0001-8370-6161
- first_name: Victor-Valentin
full_name: Hodirnau, Victor-Valentin
id: 3661B498-F248-11E8-B48F-1D18A9856A87
last_name: Hodirnau
orcid: 0000-0003-3904-947X
- first_name: Bettina
full_name: Zens, Bettina
id: 45FD126C-F248-11E8-B48F-1D18A9856A87
last_name: Zens
orcid: 0000-0002-9561-1239
- first_name: Christoph
full_name: Möhl, Christoph
last_name: Möhl
- first_name: Frank
full_name: Bradke, Frank
last_name: Bradke
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
citation:
ama: Fäßler F, Dimchev GA, Hodirnau V-V, et al. Cryo-electron tomography workflows
for quantitative analysis of actin networks involved in cell migration. Microscopy
and Microanalysis. 2020;26(S2):2518-2519. doi:10.1017/s1431927620021881
apa: Fäßler, F., Dimchev, G. A., Hodirnau, V.-V., Zens, B., Möhl, C., Bradke, F.,
& Schur, F. K. (2020). Cryo-electron tomography workflows for quantitative
analysis of actin networks involved in cell migration. Microscopy and Microanalysis.
Oxford University Press. https://doi.org/10.1017/s1431927620021881
chicago: Fäßler, Florian, Georgi A Dimchev, Victor-Valentin Hodirnau, Bettina Zens,
Christoph Möhl, Frank Bradke, and Florian KM Schur. “Cryo-Electron Tomography
Workflows for Quantitative Analysis of Actin Networks Involved in Cell Migration.”
Microscopy and Microanalysis. Oxford University Press, 2020. https://doi.org/10.1017/s1431927620021881.
ieee: F. Fäßler et al., “Cryo-electron tomography workflows for quantitative
analysis of actin networks involved in cell migration,” Microscopy and Microanalysis,
vol. 26, no. S2. Oxford University Press, pp. 2518–2519, 2020.
ista: Fäßler F, Dimchev GA, Hodirnau V-V, Zens B, Möhl C, Bradke F, Schur FK. 2020.
Cryo-electron tomography workflows for quantitative analysis of actin networks
involved in cell migration. Microscopy and Microanalysis. 26(S2), 2518–2519.
mla: Fäßler, Florian, et al. “Cryo-Electron Tomography Workflows for Quantitative
Analysis of Actin Networks Involved in Cell Migration.” Microscopy and Microanalysis,
vol. 26, no. S2, Oxford University Press, 2020, pp. 2518–19, doi:10.1017/s1431927620021881.
short: F. Fäßler, G.A. Dimchev, V.-V. Hodirnau, B. Zens, C. Möhl, F. Bradke, F.K.
Schur, Microscopy and Microanalysis 26 (2020) 2518–2519.
corr_author: '1'
date_created: 2024-04-03T09:40:11Z
date_published: 2020-08-01T00:00:00Z
date_updated: 2024-10-09T21:08:43Z
day: '01'
department:
- _id: FlSc
- _id: EM-Fac
doi: 10.1017/s1431927620021881
intvolume: ' 26'
issue: S2
keyword:
- Instrumentation
language:
- iso: eng
month: '08'
oa_version: None
page: 2518-2519
publication: Microscopy and Microanalysis
publication_identifier:
eissn:
- 1435-8115
issn:
- 1431-9276
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
status: public
title: Cryo-electron tomography workflows for quantitative analysis of actin networks
involved in cell migration
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2020'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19306'
acknowledgement: "We thank Maureen Barr, Martin Harterink, Max Heiman and Inna Nechipurenko
for reagents, the Caenorhabditis Genetics Center for strains, and the Sengupta lab
for comments and advice.\r\nThis work was funded in part by the NIH (R35 GM122463
– P.S., and F32 DC018453 – A.P.), and the EMBO (ALTF 302-2019 – N.A-W.)."
article_number: '303'
article_processing_charge: Yes
article_type: original
author:
- first_name: Anna
full_name: Kazatskaya, Anna
last_name: Kazatskaya
- first_name: Lisa
full_name: Yuan, Lisa
last_name: Yuan
- first_name: Niko Paresh
full_name: Amin-Wetzel, Niko Paresh
id: E95D3014-9D8C-11E9-9C80-D2F8E5697425
last_name: Amin-Wetzel
- first_name: Alison
full_name: Philbrook, Alison
last_name: Philbrook
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
- first_name: Piali
full_name: Sengupta, Piali
last_name: Sengupta
citation:
ama: Kazatskaya A, Yuan L, Amin-Wetzel NP, Philbrook A, de Bono M, Sengupta P. The
URX oxygen-sensing neurons in C. elegans are ciliated. microPublication Biology.
2020;2020(9). doi:10.17912/MICROPUB.BIOLOGY.000303
apa: Kazatskaya, A., Yuan, L., Amin-Wetzel, N. P., Philbrook, A., de Bono, M., &
Sengupta, P. (2020). The URX oxygen-sensing neurons in C. elegans are ciliated.
MicroPublication Biology. Caltech Library. https://doi.org/10.17912/MICROPUB.BIOLOGY.000303
chicago: Kazatskaya, Anna, Lisa Yuan, Niko Paresh Amin-Wetzel, Alison Philbrook,
Mario de Bono, and Piali Sengupta. “The URX Oxygen-Sensing Neurons in C. Elegans
Are Ciliated.” MicroPublication Biology. Caltech Library, 2020. https://doi.org/10.17912/MICROPUB.BIOLOGY.000303.
ieee: A. Kazatskaya, L. Yuan, N. P. Amin-Wetzel, A. Philbrook, M. de Bono, and P.
Sengupta, “The URX oxygen-sensing neurons in C. elegans are ciliated,” microPublication
Biology, vol. 2020, no. 9. Caltech Library, 2020.
ista: Kazatskaya A, Yuan L, Amin-Wetzel NP, Philbrook A, de Bono M, Sengupta P.
2020. The URX oxygen-sensing neurons in C. elegans are ciliated. microPublication
Biology. 2020(9), 303.
mla: Kazatskaya, Anna, et al. “The URX Oxygen-Sensing Neurons in C. Elegans Are
Ciliated.” MicroPublication Biology, vol. 2020, no. 9, 303, Caltech Library,
2020, doi:10.17912/MICROPUB.BIOLOGY.000303.
short: A. Kazatskaya, L. Yuan, N.P. Amin-Wetzel, A. Philbrook, M. de Bono, P. Sengupta,
MicroPublication Biology 2020 (2020).
date_created: 2025-03-07T08:21:51Z
date_published: 2020-09-20T00:00:00Z
date_updated: 2025-03-11T08:30:41Z
day: '20'
ddc:
- '570'
department:
- _id: MaDe
doi: 10.17912/MICROPUB.BIOLOGY.000303
external_id:
pmid:
- '33005885'
file:
- access_level: open_access
checksum: 14a7cad20775521ce85e0e3c77aa7936
content_type: application/pdf
creator: dernst
date_created: 2025-03-11T08:27:40Z
date_updated: 2025-03-11T08:27:40Z
file_id: '19383'
file_name: 2020_MicroPublBio_Kazatskaya.pdf
file_size: 1486239
relation: main_file
success: 1
file_date_updated: 2025-03-11T08:27:40Z
has_accepted_license: '1'
intvolume: ' 2020'
issue: '9'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: microPublication Biology
publication_identifier:
eissn:
- 2578-9430
publication_status: published
publisher: Caltech Library
quality_controlled: '1'
status: public
title: The URX oxygen-sensing neurons in C. elegans are ciliated
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2020
year: '2020'
...
---
_id: '5681'
abstract:
- lang: eng
text: 'We introduce dynamically warping grids for adaptive liquid simulation. Our
primary contributions are a strategy for dynamically deforming regular grids over
the course of a simulation and a method for efficiently utilizing these deforming
grids for liquid simulation. Prior work has shown that unstructured grids are
very effective for adaptive fluid simulations. However, unstructured grids often
lead to complicated implementations and a poor cache hit rate due to inconsistent
memory access. Regular grids, on the other hand, provide a fast, fixed memory
access pattern and straightforward implementation. Our method combines the advantages
of both: we leverage the simplicity of regular grids while still achieving practical
and controllable spatial adaptivity. We demonstrate that our method enables adaptive
simulations that are fast, flexible, and robust to null-space issues. At the same
time, our method is simple to implement and takes advantage of existing highly-tuned
algorithms.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: This work was partially supported by JSPS Grant-in-Aid forYoung Scientists
(Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176).
This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria
through resources providedby Scientific Computing. We would like to express my grati-tude
to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.
article_processing_charge: No
article_type: original
author:
- first_name: Ibayashi
full_name: Hikaru, Ibayashi
last_name: Hikaru
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Nils
full_name: Thuerey, Nils
last_name: Thuerey
- first_name: Takeo
full_name: Igarashi, Takeo
last_name: Igarashi
- first_name: Ryoichi
full_name: Ando, Ryoichi
last_name: Ando
citation:
ama: Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically
warping grids. IEEE Transactions on Visualization and Computer Graphics.
2020;26(6):2288-2302. doi:10.1109/TVCG.2018.2883628
apa: Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., & Ando, R. (2020). Simulating
liquids on dynamically warping grids. IEEE Transactions on Visualization and
Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2018.2883628
chicago: Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi
Ando. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions
on Visualization and Computer Graphics. IEEE, 2020. https://doi.org/10.1109/TVCG.2018.2883628.
ieee: I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids
on dynamically warping grids,” IEEE Transactions on Visualization and Computer
Graphics, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020.
ista: Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids
on dynamically warping grids. IEEE Transactions on Visualization and Computer
Graphics. 26(6), 2288–2302.
mla: Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.”
IEEE Transactions on Visualization and Computer Graphics, vol. 26, no.
6, IEEE, 2020, pp. 2288–302, doi:10.1109/TVCG.2018.2883628.
short: I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions
on Visualization and Computer Graphics 26 (2020) 2288–2302.
date_created: 2018-12-16T22:59:21Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2025-07-10T11:52:55Z
day: '01'
ddc:
- '006'
department:
- _id: ChWo
doi: 10.1109/TVCG.2018.2883628
external_id:
isi:
- '000532295600014'
pmid:
- '30507534'
file:
- access_level: open_access
checksum: 8d4c55443a0ee335bb5bb652de503042
content_type: application/pdf
creator: wojtan
date_created: 2020-10-08T08:34:53Z
date_updated: 2020-10-08T08:34:53Z
file_id: '8626'
file_name: preprint.pdf
file_size: 21910098
relation: main_file
success: 1
file_date_updated: 2020-10-08T08:34:53Z
has_accepted_license: '1'
intvolume: ' 26'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 2288-2302
pmid: 1
publication: IEEE Transactions on Visualization and Computer Graphics
publication_identifier:
eissn:
- 1941-0506
issn:
- 1077-2626
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simulating liquids on dynamically warping grids
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2020'
...
---
_id: '6184'
abstract:
- lang: eng
text: We prove edge universality for a general class of correlated real symmetric
or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also
applies to internal edges of the self-consistent density of states. In particular,
we establish a strong form of band rigidity which excludes mismatches between
location and label of eigenvalues close to internal edges in these general models.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: 'Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity
and edge universality. Annals of Probability. 2020;48(2):963-1001. doi:10.1214/19-AOP1379'
apa: 'Alt, J., Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Correlated
random matrices: Band rigidity and edge universality. Annals of Probability.
Institute of Mathematical Statistics. https://doi.org/10.1214/19-AOP1379'
chicago: 'Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder.
“Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of
Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/19-AOP1379.'
ieee: 'J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices:
Band rigidity and edge universality,” Annals of Probability, vol. 48, no.
2. Institute of Mathematical Statistics, pp. 963–1001, 2020.'
ista: 'Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices:
Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001.'
mla: 'Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge
Universality.” Annals of Probability, vol. 48, no. 2, Institute of Mathematical
Statistics, 2020, pp. 963–1001, doi:10.1214/19-AOP1379.'
short: J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020)
963–1001.
date_created: 2019-03-28T09:20:08Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2026-04-08T14:11:36Z
day: '01'
department:
- _id: LaEr
doi: 10.1214/19-AOP1379
ec_funded: 1
external_id:
arxiv:
- '1804.07744'
isi:
- '000528269100013'
intvolume: ' 48'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.07744
month: '03'
oa: 1
oa_version: Preprint
page: 963-1001
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Annals of Probability
publication_identifier:
issn:
- 0091-1798
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
- id: '149'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Correlated random matrices: Band rigidity and edge universality'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2020'
...
---
_id: '6185'
abstract:
- lang: eng
text: For complex Wigner-type matrices, i.e. Hermitian random matrices with independent,
not necessarily identically distributed entries above the diagonal, we show that
at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue
statistics are universal and form a Pearcey process. Since the density of states
typically exhibits only square root or cubic root cusp singularities, our work
complements previous results on the bulk and edge universality and it thus completes
the resolution of the Wigner–Dyson–Mehta universality conjecture for the last
remaining universality type in the complex Hermitian class. Our analysis holds
not only for exact cusps, but approximate cusps as well, where an extended Pearcey
process emerges. As a main technical ingredient we prove an optimal local law
at the cusp for both symmetry classes. This result is also the key input in the
companion paper (Cipolloni et al. in Pure Appl Anal, 2018. arXiv:1811.04055) where
the cusp universality for real symmetric Wigner-type matrices is proven. The novel
cusp fluctuation mechanism is also essential for the recent results on the spectral
radius of non-Hermitian random matrices (Alt et al. in Spectral radius of random
matrices with independent entries, 2019. arXiv:1907.13631), and the non-Hermitian
edge universality (Cipolloni et al. in Edge universality for non-Hermitian random
matrices, 2019. arXiv:1908.00969).
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). The authors are very grateful to Johannes Alt for numerous discussions
on the Dyson equation and for his invaluable help in adjusting [10] to the needs
of the present work.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: 'Erdös L, Krüger TH, Schröder DJ. Cusp universality for random matrices I:
Local law and the complex Hermitian case. Communications in Mathematical Physics.
2020;378:1203-1278. doi:10.1007/s00220-019-03657-4'
apa: 'Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Cusp universality
for random matrices I: Local law and the complex Hermitian case. Communications
in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03657-4'
chicago: 'Erdös, László, Torben H Krüger, and Dominik J Schröder. “Cusp Universality
for Random Matrices I: Local Law and the Complex Hermitian Case.” Communications
in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03657-4.'
ieee: 'L. Erdös, T. H. Krüger, and D. J. Schröder, “Cusp universality for random
matrices I: Local law and the complex Hermitian case,” Communications in Mathematical
Physics, vol. 378. Springer Nature, pp. 1203–1278, 2020.'
ista: 'Erdös L, Krüger TH, Schröder DJ. 2020. Cusp universality for random matrices
I: Local law and the complex Hermitian case. Communications in Mathematical Physics.
378, 1203–1278.'
mla: 'Erdös, László, et al. “Cusp Universality for Random Matrices I: Local Law
and the Complex Hermitian Case.” Communications in Mathematical Physics,
vol. 378, Springer Nature, 2020, pp. 1203–78, doi:10.1007/s00220-019-03657-4.'
short: L. Erdös, T.H. Krüger, D.J. Schröder, Communications in Mathematical Physics
378 (2020) 1203–1278.
date_created: 2019-03-28T10:21:15Z
date_published: 2020-09-01T00:00:00Z
date_updated: 2026-04-08T13:55:03Z
day: '01'
ddc:
- '530'
- '510'
department:
- _id: LaEr
doi: 10.1007/s00220-019-03657-4
ec_funded: 1
external_id:
arxiv:
- '1809.03971'
isi:
- '000529483000001'
file:
- access_level: open_access
checksum: c3a683e2afdcea27afa6880b01e53dc2
content_type: application/pdf
creator: dernst
date_created: 2020-11-18T11:14:37Z
date_updated: 2020-11-18T11:14:37Z
file_id: '8771'
file_name: 2020_CommMathPhysics_Erdoes.pdf
file_size: 2904574
relation: main_file
success: 1
file_date_updated: 2020-11-18T11:14:37Z
has_accepted_license: '1'
intvolume: ' 378'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1203-1278
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Cusp universality for random matrices I: Local law and the complex Hermitian
case'
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: 378
year: '2020'
...
---
_id: '6358'
abstract:
- lang: eng
text: We study dynamical optimal transport metrics between density matricesassociated
to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative
differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral
gap estimates.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Eric A.
full_name: Carlen, Eric A.
last_name: Carlen
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional
inequalities in dissipative quantum systems. Journal of Statistical Physics.
2020;178(2):319-378. doi:10.1007/s10955-019-02434-w
apa: Carlen, E. A., & Maas, J. (2020). Non-commutative calculus, optimal transport
and functional inequalities in dissipative quantum systems. Journal of Statistical
Physics. Springer Nature. https://doi.org/10.1007/s10955-019-02434-w
chicago: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport
and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical
Physics. Springer Nature, 2020. https://doi.org/10.1007/s10955-019-02434-w.
ieee: E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and
functional inequalities in dissipative quantum systems,” Journal of Statistical
Physics, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.
ista: Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional
inequalities in dissipative quantum systems. Journal of Statistical Physics.
178(2), 319–378.
mla: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport
and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical
Physics, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:10.1007/s10955-019-02434-w.
short: E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.
corr_author: '1'
date_created: 2019-04-30T07:34:18Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2025-06-12T07:27:20Z
day: '01'
ddc:
- '500'
department:
- _id: JaMa
doi: 10.1007/s10955-019-02434-w
ec_funded: 1
external_id:
arxiv:
- '1811.04572'
isi:
- '000498933300001'
pmid:
- '33223567'
file:
- access_level: open_access
checksum: 7b04befbdc0d4982c0ee945d25d19872
content_type: application/pdf
creator: dernst
date_created: 2019-12-23T12:03:09Z
date_updated: 2020-07-14T12:47:28Z
file_id: '7209'
file_name: 2019_JourStatistPhysics_Carlen.pdf
file_size: 905538
relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: ' 178'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 319-378
pmid: 1
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: 260482E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F06504
name: Taming Complexity in Partial Differential Systems
publication: Journal of Statistical Physics
publication_identifier:
eissn:
- 1572-9613
issn:
- 0022-4715
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/s10955-020-02671-4
scopus_import: '1'
status: public
title: Non-commutative calculus, optimal transport and functional inequalities in
dissipative quantum systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 178
year: '2020'
...
---
_id: '6359'
abstract:
- lang: eng
text: The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate
SDEs with irregular drift coefficients is considered. In the case of α-Hölder
drift in the recent literature the rate α/2 was proved in many related situations.
By exploiting the regularising effect of the noise more efficiently, we show that
the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to
Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients.
article_number: '82'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Konstantinos
full_name: Dareiotis, Konstantinos
last_name: Dareiotis
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
citation:
ama: Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama
scheme with irregular drift. Electronic Journal of Probability. 2020;25.
doi:10.1214/20-EJP479
apa: Dareiotis, K., & Gerencser, M. (2020). On the regularisation of the noise
for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability.
Institute of Mathematical Statistics. https://doi.org/10.1214/20-EJP479
chicago: Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of
the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal
of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-EJP479.
ieee: K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the
Euler-Maruyama scheme with irregular drift,” Electronic Journal of Probability,
vol. 25. Institute of Mathematical Statistics, 2020.
ista: Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the
Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability.
25, 82.
mla: Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the
Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal
of Probability, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:10.1214/20-EJP479.
short: K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020).
date_created: 2019-04-30T07:40:17Z
date_published: 2020-07-16T00:00:00Z
date_updated: 2023-10-16T09:22:50Z
day: '16'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1214/20-EJP479
external_id:
arxiv:
- '1812.04583'
isi:
- '000550150700001'
file:
- access_level: open_access
checksum: 8e7c42e72596f6889d786e8e8b89994f
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T13:15:02Z
date_updated: 2020-09-21T13:15:02Z
file_id: '8549'
file_name: 2020_EJournProbab_Dareiotis.pdf
file_size: 273042
relation: main_file
success: 1
file_date_updated: 2020-09-21T13:15:02Z
has_accepted_license: '1'
intvolume: ' 25'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Electronic Journal of Probability
publication_identifier:
eissn:
- 1083-6489
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the regularisation of the noise for the Euler-Maruyama scheme with irregular
drift
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2020'
...
---
OA_place: publisher
_id: '19986'
abstract:
- lang: eng
text: 'For non-probabilistic programs, a key question in static analysis is termination,
which asks whether a given program terminates under a given initial condition.
In the presence of probabilistic behaviour, there are two fundamental extensions
of the termination question: (a) the almost-sure termination question, which asks
whether the termination probability is 1; and (b) the bounded-time termination
question, which asks whether the expected termination time is bounded. There are
many active research directions to address these two questions; one important
such direction is the use of martingale theory for termination analysis. In this
chapter, we survey the main techniques of the martingale-based approach to the
termination analysis of probabilistic programs.'
acknowledgement: "Krishnendu Chatterjee is supported by the Austrian Science Fund
(FWF) NFN\r\nGrant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Hongfei
Fu\r\nis supported by the National Natural Science Foundation of China (NSFC) Grant\r\nNo.
61802254. Petr Novotný is supported by the Czech Science Foundation grant\r\nNo.
GJ19-15134Y."
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
citation:
ama: 'Chatterjee K, Fu H, Novotný P. Termination Analysis of Probabilistic Programs
with Martingales. In: Foundations of Probabilistic Programming. Cambridge
University Press; 2020:221-258. doi:10.1017/9781108770750.008'
apa: Chatterjee, K., Fu, H., & Novotný, P. (2020). Termination Analysis of Probabilistic
Programs with Martingales. In Foundations of Probabilistic Programming
(pp. 221–258). Cambridge University Press. https://doi.org/10.1017/9781108770750.008
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Petr Novotný. “Termination Analysis
of Probabilistic Programs with Martingales.” In Foundations of Probabilistic
Programming, 221–58. Cambridge University Press, 2020. https://doi.org/10.1017/9781108770750.008.
ieee: K. Chatterjee, H. Fu, and P. Novotný, “Termination Analysis of Probabilistic
Programs with Martingales,” in Foundations of Probabilistic Programming,
Cambridge University Press, 2020, pp. 221–258.
ista: 'Chatterjee K, Fu H, Novotný P. 2020.Termination Analysis of Probabilistic
Programs with Martingales. In: Foundations of Probabilistic Programming. , 221–258.'
mla: Chatterjee, Krishnendu, et al. “Termination Analysis of Probabilistic Programs
with Martingales.” Foundations of Probabilistic Programming, Cambridge
University Press, 2020, pp. 221–58, doi:10.1017/9781108770750.008.
short: K. Chatterjee, H. Fu, P. Novotný, in:, Foundations of Probabilistic Programming,
Cambridge University Press, 2020, pp. 221–258.
corr_author: '1'
date_created: 2025-07-10T13:28:51Z
date_published: 2020-11-18T00:00:00Z
date_updated: 2025-09-23T12:10:25Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1017/9781108770750.008
file:
- access_level: open_access
checksum: 28ece115e8d2d9263e253a598e7caef2
content_type: application/pdf
creator: dernst
date_created: 2025-09-23T12:03:09Z
date_updated: 2025-09-23T12:03:09Z
file_id: '20380'
file_name: 2020_ProbProgramming_Chatterjee.pdf
file_size: 316681
relation: main_file
success: 1
file_date_updated: 2025-09-23T12:03:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 221-258
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Foundations of Probabilistic Programming
publication_identifier:
eisbn:
- '9781108770750'
isbn:
- '9781108488518'
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
status: public
title: Termination Analysis of Probabilistic Programs with Martingales
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: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10012'
abstract:
- lang: eng
text: We prove that in the absence of topological changes, the notion of BV solutions
to planar multiphase mean curvature flow does not allow for a mechanism for (unphysical)
non-uniqueness. Our approach is based on the local structure of the energy landscape
near a classical evolution by mean curvature. Mean curvature flow being the gradient
flow of the surface energy functional, we develop a gradient-flow analogue of
the notion of calibrations. Just like the existence of a calibration guarantees
that one has reached a global minimum in the energy landscape, the existence of
a "gradient flow calibration" ensures that the route of steepest descent in the
energy landscape is unique and stable.
acknowledgement: Parts of the paper were written during the visit of the authors to
the Hausdorff Research Institute for Mathematics (HIM), University of Bonn, in the
framework of the trimester program “Evolution of Interfaces”. The support and the
hospitality of HIM are gratefully acknowledged. This project has received funding
from the European Union’s Horizon 2020 research and innovation programme under the
Marie Sklodowska-Curie Grant Agreement No. 665385.
article_number: '2003.05478'
article_processing_charge: No
arxiv: 1
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
- first_name: Tim
full_name: Laux, Tim
last_name: Laux
- first_name: Thilo
full_name: Simon, Thilo
last_name: Simon
citation:
ama: 'Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape
in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions.
arXiv. doi:10.48550/arXiv.2003.05478'
apa: 'Fischer, J. L., Hensel, S., Laux, T., & Simon, T. (n.d.). The local structure
of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness
and stability of evolutions. arXiv. https://doi.org/10.48550/arXiv.2003.05478'
chicago: 'Fischer, Julian L, Sebastian Hensel, Tim Laux, and Thilo Simon. “The Local
Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong
Uniqueness and Stability of Evolutions.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2003.05478.'
ieee: 'J. L. Fischer, S. Hensel, T. Laux, and T. Simon, “The local structure of
the energy landscape in multiphase mean curvature flow: weak-strong uniqueness
and stability of evolutions,” arXiv. .'
ista: 'Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy
landscape in multiphase mean curvature flow: weak-strong uniqueness and stability
of evolutions. arXiv, 2003.05478.'
mla: 'Fischer, Julian L., et al. “The Local Structure of the Energy Landscape in
Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.”
ArXiv, 2003.05478, doi:10.48550/arXiv.2003.05478.'
short: J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.).
date_created: 2021-09-13T12:17:11Z
date_published: 2020-03-11T00:00:00Z
date_updated: 2026-04-08T07:01:01Z
day: '11'
department:
- _id: JuFi
doi: 10.48550/arXiv.2003.05478
ec_funded: 1
external_id:
arxiv:
- '2003.05478'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2003.05478
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10007'
relation: dissertation_contains
status: public
status: public
title: 'The local structure of the energy landscape in multiphase mean curvature flow:
weak-strong uniqueness and stability of evolutions'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10022'
abstract:
- lang: eng
text: We consider finite-volume approximations of Fokker-Planck equations on bounded
convex domains in R^d and study the corresponding gradient flow structures. We
reprove the convergence of the discrete to continuous Fokker-Planck equation via
the method of Evolutionary Γ-convergence, i.e., we pass to the limit at the level
of the gradient flow structures, generalising the one-dimensional result obtained
by Disser and Liero. The proof is of variational nature and relies on a Mosco
convergence result for functionals in the discrete-to-continuum limit that is
of independent interest. Our results apply to arbitrary regular meshes, even though
the associated discrete transport distances may fail to converge to the Wasserstein
distance in this generality.
acknowledgement: This work is supported by the European Research Council (ERC) under
the European Union’s Horizon 2020 research and innovation programme (grant agreement
No 716117) and by the Austrian Science Fund (FWF), grants No F65 and W1245.
article_number: '2008.10962'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dominik L
full_name: Forkert, Dominik L
id: 35C79D68-F248-11E8-B48F-1D18A9856A87
last_name: Forkert
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient
flow structures for Fokker-Planck equations in multiple dimensions. arXiv.
doi:10.48550/arXiv.2008.10962
apa: Forkert, D. L., Maas, J., & Portinale, L. (n.d.). Evolutionary Γ-convergence
of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions.
arXiv. https://doi.org/10.48550/arXiv.2008.10962
chicago: Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary Γ-Convergence
of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.2008.10962.
ieee: D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary Γ-convergence of entropic
gradient flow structures for Fokker-Planck equations in multiple dimensions,”
arXiv. .
ista: Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient
flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962.
mla: Forkert, Dominik L., et al. “Evolutionary Γ-Convergence of Entropic Gradient
Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv,
2008.10962, doi:10.48550/arXiv.2008.10962.
short: D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.).
corr_author: '1'
date_created: 2021-09-17T10:57:27Z
date_published: 2020-08-25T00:00:00Z
date_updated: 2026-04-08T07:00:03Z
day: '25'
department:
- _id: JaMa
doi: 10.48550/arXiv.2008.10962
ec_funded: 1
external_id:
arxiv:
- '2008.10962'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2008.10962
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: arXiv
publication_status: draft
related_material:
record:
- id: '11739'
relation: later_version
status: public
- id: '10030'
relation: dissertation_contains
status: public
status: public
title: Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck
equations in multiple dimensions
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10328'
abstract:
- lang: eng
text: We discus noise channels in coherent electro-optic up-conversion between microwave
and optical fields, in particular due to optical heating. We also report on a
novel configuration, which promises to be flexible and highly efficient.
alternative_title:
- OSA Technical Digest
article_number: QTu8A.1
article_processing_charge: No
author:
- first_name: Nicholas J.
full_name: Lambert, Nicholas J.
last_name: Lambert
- first_name: Sonia
full_name: Mobassem, Sonia
last_name: Mobassem
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- first_name: Harald G.L.
full_name: Schwefel, Harald G.L.
last_name: Schwefel
citation:
ama: 'Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. New designs and noise
channels in electro-optic microwave to optical up-conversion. In: OSA Quantum
2.0 Conference. Optica Publishing Group; 2020. doi:10.1364/QUANTUM.2020.QTu8A.1'
apa: 'Lambert, N. J., Mobassem, S., Rueda Sanchez, A. R., & Schwefel, H. G.
L. (2020). New designs and noise channels in electro-optic microwave to optical
up-conversion. In OSA Quantum 2.0 Conference. Washington, DC, United States:
Optica Publishing Group. https://doi.org/10.1364/QUANTUM.2020.QTu8A.1'
chicago: Lambert, Nicholas J., Sonia Mobassem, Alfredo R Rueda Sanchez, and Harald
G.L. Schwefel. “New Designs and Noise Channels in Electro-Optic Microwave to Optical
up-Conversion.” In OSA Quantum 2.0 Conference. Optica Publishing Group,
2020. https://doi.org/10.1364/QUANTUM.2020.QTu8A.1.
ieee: N. J. Lambert, S. Mobassem, A. R. Rueda Sanchez, and H. G. L. Schwefel, “New
designs and noise channels in electro-optic microwave to optical up-conversion,”
in OSA Quantum 2.0 Conference, Washington, DC, United States, 2020.
ista: 'Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. 2020. New designs
and noise channels in electro-optic microwave to optical up-conversion. OSA Quantum
2.0 Conference. OSA: Optical Society of America, OSA Technical Digest, , QTu8A.1.'
mla: Lambert, Nicholas J., et al. “New Designs and Noise Channels in Electro-Optic
Microwave to Optical up-Conversion.” OSA Quantum 2.0 Conference, QTu8A.1,
Optica Publishing Group, 2020, doi:10.1364/QUANTUM.2020.QTu8A.1.
short: N.J. Lambert, S. Mobassem, A.R. Rueda Sanchez, H.G.L. Schwefel, in:, OSA
Quantum 2.0 Conference, Optica Publishing Group, 2020.
conference:
end_date: 2020-09-17
location: Washington, DC, United States
name: 'OSA: Optical Society of America'
start_date: 2020-09-14
date_created: 2021-11-21T23:01:31Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-10-18T08:32:34Z
day: '01'
department:
- _id: JoFi
doi: 10.1364/QUANTUM.2020.QTu8A.1
language:
- iso: eng
month: '01'
oa_version: None
publication: OSA Quantum 2.0 Conference
publication_identifier:
isbn:
- 9-781-5575-2820-9
publication_status: published
publisher: Optica Publishing Group
quality_controlled: '1'
scopus_import: '1'
status: public
title: New designs and noise channels in electro-optic microwave to optical up-conversion
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10556'
abstract:
- lang: eng
text: In this paper, we present the first Asynchronous Distributed Key Generation
(ADKG) algorithm which is also the first distributed key generation algorithm
that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is
the number of faulty parties). As a result, using our ADKG we remove the trusted
setup assumption that the most scalable consensus algorithms make. In order to
create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative
the open question posed by Cachin et al. [7] on how to create an Asynchronous
Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+1Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security. Association for Computing Machinery; 2020:1751–1767. doi:10.1145/3372297.3423364'
apa: 'Kokoris Kogias, E., Malkhi, D., & Spiegelman, A. (2020). Asynchronous
distributed key generation for computationally-secure randomness, consensus, and
threshold signatures. In Proceedings of the 2020 ACM SIGSAC Conference on Computer
and Communications Security (pp. 1751–1767). Virtual, United States: Association
for Computing Machinery. https://doi.org/10.1145/3372297.3423364'
chicago: Kokoris Kogias, Eleftherios, Dahlia Malkhi, and Alexander Spiegelman. “Asynchronous
Distributed Key Generation for Computationally-Secure Randomness, Consensus, and
Threshold Signatures.” In Proceedings of the 2020 ACM SIGSAC Conference on
Computer and Communications Security, 1751–1767. Association for Computing
Machinery, 2020. https://doi.org/10.1145/3372297.3423364.
ieee: E. Kokoris Kogias, D. Malkhi, and A. Spiegelman, “Asynchronous distributed
key generation for computationally-secure randomness, consensus, and threshold
signatures,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and
Communications Security, Virtual, United States, 2020, pp. 1751–1767.
ista: 'Kokoris Kogias E, Malkhi D, Spiegelman A. 2020. Asynchronous distributed
key generation for computationally-secure randomness, consensus, and threshold
signatures. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security. CCS: Conference on Computer and Communications Security, 1751–1767.'
mla: Kokoris Kogias, Eleftherios, et al. “Asynchronous Distributed Key Generation
for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” Proceedings
of the 2020 ACM SIGSAC Conference on Computer and Communications Security,
Association for Computing Machinery, 2020, pp. 1751–1767, doi:10.1145/3372297.3423364.
short: E. Kokoris Kogias, D. Malkhi, A. Spiegelman, in:, Proceedings of the 2020
ACM SIGSAC Conference on Computer and Communications Security, Association for
Computing Machinery, 2020, pp. 1751–1767.
conference:
end_date: 2020-11-13
location: Virtual, United States
name: 'CCS: Conference on Computer and Communications Security'
start_date: 2020-11-09
date_created: 2021-12-16T13:23:27Z
date_published: 2020-10-30T00:00:00Z
date_updated: 2025-07-10T11:49:52Z
day: '30'
department:
- _id: ElKo
doi: 10.1145/3372297.3423364
external_id:
isi:
- '000768470400104'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1015
month: '10'
oa: 1
oa_version: Preprint
page: 1751–1767
publication: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security
publication_identifier:
isbn:
- 978-1-4503-7089-9
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asynchronous distributed key generation for computationally-secure randomness,
consensus, and threshold signatures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10557'
abstract:
- lang: eng
text: Data storage and retrieval systems, methods, and computer-readable media utilize
a cryptographically verifiable data structure that facilitates verification of
a transaction in a decentralized peer-to-peer environment using multi-hop backwards
and forwards links. Backward links are cryptographic hashes of past records. Forward
links are cryptographic signatures of future records that are added retroactively
to records once the target block has been appended to the data structure.
applicant:
- Ecole Polytechnique Federale de Lausanne
application_date: 2017-06-09
article_processing_charge: No
author:
- first_name: Bryan
full_name: Ford, Bryan
last_name: Ford
- first_name: Linus
full_name: Gasse, Linus
last_name: Gasse
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
- first_name: Philipp
full_name: Jovanovic, Philipp
last_name: Jovanovic
citation:
ama: Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. Cryptographically verifiable
data structure having multi-hop forward and backwards links and associated systems
and methods. 2020.
apa: Ford, B., Gasse, L., Kokoris Kogias, E., & Jovanovic, P. (2020). Cryptographically
verifiable data structure having multi-hop forward and backwards links and associated
systems and methods.
chicago: Ford, Bryan, Linus Gasse, Eleftherios Kokoris Kogias, and Philipp Jovanovic.
“Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards
Links and Associated Systems and Methods,” 2020.
ieee: B. Ford, L. Gasse, E. Kokoris Kogias, and P. Jovanovic, “Cryptographically
verifiable data structure having multi-hop forward and backwards links and associated
systems and methods.” 2020.
ista: Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. 2020. Cryptographically verifiable
data structure having multi-hop forward and backwards links and associated systems
and methods.
mla: Ford, Bryan, et al. Cryptographically Verifiable Data Structure Having Multi-Hop
Forward and Backwards Links and Associated Systems and Methods. 2020.
short: B. Ford, L. Gasse, E. Kokoris Kogias, P. Jovanovic, (2020).
date_created: 2021-12-16T13:28:59Z
date_published: 2020-03-03T00:00:00Z
date_updated: 2021-12-21T10:04:50Z
day: '03'
department:
- _id: ElKo
extern: '1'
ipc: ' H04L9/3247 ; G06Q20/29 ; G06Q20/382 ; H04L9/3236'
ipn: '10581613'
main_file_link:
- open_access: '1'
url: https://patents.google.com/patent/US10581613B2/en
month: '03'
oa: 1
oa_version: Published Version
publication_date: 2020-03-03
related_material:
link:
- relation: earlier_version
url: https://patents.google.com/patent/US20180359096A1/en
status: public
title: Cryptographically verifiable data structure having multi-hop forward and backwards
links and associated systems and methods
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '10672'
abstract:
- lang: eng
text: The family of feedback alignment (FA) algorithms aims to provide a more biologically
motivated alternative to backpropagation (BP), by substituting the computations
that are unrealistic to be implemented in physical brains. While FA algorithms
have been shown to work well in practice, there is a lack of rigorous theory proofing
their learning capabilities. Here we introduce the first feedback alignment algorithm
with provable learning guarantees. In contrast to existing work, we do not require
any assumption about the size or depth of the network except that it has a single
output neuron, i.e., such as for binary classification tasks. We show that our
FA algorithm can deliver its theoretical promises in practice, surpassing the
learning performance of existing FA methods and matching backpropagation in binary
classification tasks. Finally, we demonstrate the limits of our FA variant when
the number of output neurons grows beyond a certain quantity.
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n"
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
citation:
ama: 'Lechner M. Learning representations for binary-classification without backpropagation.
In: 8th International Conference on Learning Representations. ICLR; 2020.'
apa: 'Lechner, M. (2020). Learning representations for binary-classification without
backpropagation. In 8th International Conference on Learning Representations.
Virtual ; Addis Ababa, Ethiopia: ICLR.'
chicago: Lechner, Mathias. “Learning Representations for Binary-Classification without
Backpropagation.” In 8th International Conference on Learning Representations.
ICLR, 2020.
ieee: M. Lechner, “Learning representations for binary-classification without backpropagation,”
in 8th International Conference on Learning Representations, Virtual ;
Addis Ababa, Ethiopia, 2020.
ista: 'Lechner M. 2020. Learning representations for binary-classification without
backpropagation. 8th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Lechner, Mathias. “Learning Representations for Binary-Classification without
Backpropagation.” 8th International Conference on Learning Representations,
ICLR, 2020.
short: M. Lechner, in:, 8th International Conference on Learning Representations,
ICLR, 2020.
conference:
end_date: 2020-05-01
location: Virtual ; Addis Ababa, Ethiopia
name: 'ICLR: International Conference on Learning Representations'
start_date: 2020-04-26
corr_author: '1'
date_created: 2022-01-25T15:50:00Z
date_published: 2020-03-11T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '11'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
checksum: ea13d42dd4541ddb239b6a75821fd6c9
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:35:17Z
date_updated: 2022-01-26T07:35:17Z
file_id: '10677'
file_name: iclr_2020.pdf
file_size: 249431
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:35:17Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
url: https://openreview.net/forum?id=Bke61krFvS
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: 8th International Conference on Learning Representations
publication_status: published
publisher: ICLR
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning representations for binary-classification without backpropagation
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10673'
abstract:
- lang: eng
text: We propose a neural information processing system obtained by re-purposing
the function of a biological neural circuit model to govern simulated and real-world
control tasks. Inspired by the structure of the nervous system of the soil-worm,
C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model
of biological neural circuits reparameterized for the control of alternative tasks.
We first demonstrate that ONCs realize networks with higher maximum flow compared
to arbitrary wired networks. We then learn instances of ONCs to control a series
of robotic tasks, including the autonomous parking of a real-world rover robot.
For reconfiguration of the purpose of the neural circuit, we adopt a search-based
optimization algorithm. Ordinary neural circuits perform on par and, in some cases,
significantly surpass the performance of contemporary deep learning models. ONC
networks are compact, 77% sparser than their counterpart neural controllers, and
their neural dynamics are fully interpretable at the cell-level.
acknowledgement: "RH and RG are partially supported by Horizon-2020 ECSEL Project
grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was
supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein
Award). AA is supported by the National Science Foundation (NSF) Graduate Research
Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and
JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation
of RH.\r\n"
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner:
Reinforcement learning with ordinary neural circuits. In: Proceedings of the
37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.'
apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural
lottery ticket winner: Reinforcement learning with ordinary neural circuits. In
Proceedings of the 37th International Conference on Machine Learning (pp.
4082–4093). Virtual.'
chicago: 'Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu
Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary
Neural Circuits.” In Proceedings of the 37th International Conference on Machine
Learning, 4082–93. PMLR, 2020.'
ieee: 'R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery
ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings
of the 37th International Conference on Machine Learning, Virtual, 2020, pp.
4082–4093.'
ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket
winner: Reinforcement learning with ordinary neural circuits. Proceedings of the
37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR,
, 4082–4093.'
mla: 'Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning
with Ordinary Neural Circuits.” Proceedings of the 37th International Conference
on Machine Learning, 2020, pp. 4082–93.'
short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the
37th International Conference on Machine Learning, 2020, pp. 4082–4093.
conference:
end_date: 2020-07-18
location: Virtual
name: 'ML: Machine Learning'
start_date: 2020-07-12
date_created: 2022-01-25T15:50:34Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
checksum: c9a4a29161777fc1a89ef451c040e3b1
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-26T11:08:51Z
date_updated: 2022-01-26T11:08:51Z
file_id: '10691'
file_name: 2020_PMLR_Hasani.pdf
file_size: 2329798
relation: main_file
success: 1
file_date_updated: 2022-01-26T11:08:51Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://proceedings.mlr.press/v119/hasani20a.html
oa: 1
oa_version: Published Version
page: 4082-4093
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the 37th International Conference on Machine Learning
publication_identifier:
issn:
- 2640-3498
publication_status: published
quality_controlled: '1'
scopus_import: '1'
series_title: PMLR
status: public
title: 'A natural lottery ticket winner: Reinforcement learning with ordinary neural
circuits'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '17444'
abstract:
- lang: eng
text: The first wafer-scale growth of site-controlled Ge/Si nanowires is reported
by Georgios Katsaros, Jian-Jun Zhang, and co-workers in article number 1906523.
They are highly uniform and their position, distance, length, and even square-
or L-shaped structures can all be precisely controlled. The electrically tunable
spin-orbit coupling demonstrated by transport measurements and the charge sensing
between quantum dots in closely spaced wires open a path toward scalable qubit
devices using nanowires on silicon.
article_number: '2070122'
article_processing_charge: No
author:
- first_name: Fei
full_name: Gao, Fei
last_name: Gao
- first_name: Jian‐Huan
full_name: Wang, Jian‐Huan
last_name: Wang
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
- first_name: Hao
full_name: Hu, Hao
last_name: Hu
- first_name: Marko J.
full_name: Rančić, Marko J.
last_name: Rančić
- first_name: Jie‐Yin
full_name: Zhang, Jie‐Yin
last_name: Zhang
- first_name: Ting
full_name: Wang, Ting
last_name: Wang
- first_name: Yuan
full_name: Yao, Yuan
last_name: Yao
- first_name: Gui‐Lei
full_name: Wang, Gui‐Lei
last_name: Wang
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
- first_name: Christoph
full_name: Kloeffel, Christoph
last_name: Kloeffel
- first_name: Daniel
full_name: Loss, Daniel
last_name: Loss
- first_name: Feng
full_name: Liu, Feng
last_name: Liu
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
- first_name: Jian‐Jun
full_name: Zhang, Jian‐Jun
last_name: Zhang
citation:
ama: 'Gao F, Wang J, Watzinger H, et al. Nanowires: Site‐controlled Uniform Ge/Si
Hut Wires with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020).
Vol 32. Wiley; 2020. doi:10.1002/adma.202070122'
apa: 'Gao, F., Wang, J., Watzinger, H., Hu, H., Rančić, M. J., Zhang, J., … Zhang,
J. (2020). Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically
tunable spin–orbit coupling (Adv. Mater. 16/2020). Advanced Materials
(Vol. 32). Wiley. https://doi.org/10.1002/adma.202070122'
chicago: 'Gao, Fei, Jian‐Huan Wang, Hannes Watzinger, Hao Hu, Marko J. Rančić, Jie‐Yin
Zhang, Ting Wang, et al. Nanowires: Site‐controlled Uniform Ge/Si Hut Wires
with Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020). Advanced
Materials. Vol. 32. Wiley, 2020. https://doi.org/10.1002/adma.202070122.'
ieee: 'F. Gao et al., Nanowires: Site‐controlled uniform Ge/Si Hut wires
with electrically tunable spin–orbit coupling (Adv. Mater. 16/2020), vol.
32, no. 16. Wiley, 2020.'
ista: 'Gao F, Wang J, Watzinger H, Hu H, Rančić MJ, Zhang J, Wang T, Yao Y, Wang
G, Kukucka J, Vukušić L, Kloeffel C, Loss D, Liu F, Katsaros G, Zhang J. 2020.
Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit
coupling (Adv. Mater. 16/2020), Wiley,p.'
mla: 'Gao, Fei, et al. “Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with
Electrically Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020).” Advanced Materials,
vol. 32, no. 16, 2070122, Wiley, 2020, doi:10.1002/adma.202070122.'
short: 'F. Gao, J. Wang, H. Watzinger, H. Hu, M.J. Rančić, J. Zhang, T. Wang, Y.
Yao, G. Wang, J. Kukucka, L. Vukušić, C. Kloeffel, D. Loss, F. Liu, G. Katsaros,
J. Zhang, Nanowires: Site‐controlled Uniform Ge/Si Hut Wires with Electrically
Tunable Spin–Orbit Coupling (Adv. Mater. 16/2020), Wiley, 2020.'
date_created: 2024-08-20T08:22:42Z
date_published: 2020-04-23T00:00:00Z
date_updated: 2026-06-18T17:54:47Z
day: '23'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.1002/adma.202070122
intvolume: ' 32'
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/adma.202070122
month: '04'
oa: 1
oa_version: Published Version
publication: Advanced Materials
publication_identifier:
eissn:
- 1521-4095
issn:
- 0935-9648
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '7541'
relation: other
status: public
status: public
title: 'Nanowires: Site‐controlled uniform Ge/Si Hut wires with electrically tunable
spin–orbit coupling (Adv. Mater. 16/2020)'
type: other_academic_publication
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2020'
...
---
_id: '177'
abstract:
- lang: eng
text: We develop a geometric version of the circle method and use it to compute
the compactly supported cohomology of the space of rational curves through a point
on a smooth affine hypersurface of sufficiently low degree.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Will
full_name: Sawin, Will
last_name: Sawin
citation:
ama: Browning TD, Sawin W. A geometric version of the circle method. Annals of
Mathematics. 2020;191(3):893-948. doi:10.4007/annals.2020.191.3.4
apa: Browning, T. D., & Sawin, W. (2020). A geometric version of the circle
method. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2020.191.3.4
chicago: Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle
Method.” Annals of Mathematics. Princeton University, 2020. https://doi.org/10.4007/annals.2020.191.3.4.
ieee: T. D. Browning and W. Sawin, “A geometric version of the circle method,” Annals
of Mathematics, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.
ista: Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals
of Mathematics. 191(3), 893–948.
mla: Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.”
Annals of Mathematics, vol. 191, no. 3, Princeton University, 2020, pp.
893–948, doi:10.4007/annals.2020.191.3.4.
short: T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948.
date_created: 2018-12-11T11:45:02Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2024-10-21T06:02:25Z
day: '01'
department:
- _id: TiBr
doi: 10.4007/annals.2020.191.3.4
external_id:
arxiv:
- '1711.10451'
isi:
- '000526986300004'
intvolume: ' 191'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.10451
month: '05'
oa: 1
oa_version: Preprint
page: 893-948
publication: Annals of Mathematics
publication_status: published
publisher: Princeton University
publist_id: '7744'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A geometric version of the circle method
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 191
year: '2020'
...
---
_id: '179'
abstract:
- lang: eng
text: An asymptotic formula is established for the number of rational points of
bounded anticanonical height which lie on a certain Zariski dense subset of the
biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified
Manin conjecture for this variety, in which the removal of a thin set of rational
points is allowed.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Roger
full_name: Heath Brown, Roger
last_name: Heath Brown
citation:
ama: Browning TD, Heath Brown R. Density of rational points on a quadric bundle
in ℙ3×ℙ3. Duke Mathematical Journal. 2020;169(16):3099-3165. doi:10.1215/00127094-2020-0031
apa: Browning, T. D., & Heath Brown, R. (2020). Density of rational points on
a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. Duke University Press.
https://doi.org/10.1215/00127094-2020-0031
chicago: Browning, Timothy D, and Roger Heath Brown. “Density of Rational Points
on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal. Duke University
Press, 2020. https://doi.org/10.1215/00127094-2020-0031.
ieee: T. D. Browning and R. Heath Brown, “Density of rational points on a quadric
bundle in ℙ3×ℙ3,” Duke Mathematical Journal, vol. 169, no. 16. Duke University
Press, pp. 3099–3165, 2020.
ista: Browning TD, Heath Brown R. 2020. Density of rational points on a quadric
bundle in ℙ3×ℙ3. Duke Mathematical Journal. 169(16), 3099–3165.
mla: Browning, Timothy D., and Roger Heath Brown. “Density of Rational Points on
a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal, vol. 169, no. 16,
Duke University Press, 2020, pp. 3099–165, doi:10.1215/00127094-2020-0031.
short: T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165.
date_created: 2018-12-11T11:45:02Z
date_published: 2020-09-10T00:00:00Z
date_updated: 2024-10-21T06:02:33Z
day: '10'
department:
- _id: TiBr
doi: 10.1215/00127094-2020-0031
external_id:
arxiv:
- '1805.10715'
isi:
- '000582676300002'
intvolume: ' 169'
isi: 1
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1805.10715
month: '09'
oa: 1
oa_version: Preprint
page: 3099-3165
publication: Duke Mathematical Journal
publication_identifier:
issn:
- 0012-7094
publication_status: published
publisher: Duke University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Density of rational points on a quadric bundle in ℙ3×ℙ3
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 169
year: '2020'
...