---
_id: '14187'
abstract:
- lang: eng
text: "We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient)\r\nalgorithm
for constrained smooth finite-sum minimization with a generalized\r\nlinear prediction/structure.
This class of problems includes empirical risk\r\nminimization with sparse, low-rank,
or other structured constraints. The\r\nproposed method is simple to implement,
does not require step-size tuning, and\r\nhas a constant per-iteration cost that
is independent of the dataset size.\r\nFurthermore, as a byproduct of the method
we obtain a stochastic estimator of\r\nthe Frank-Wolfe gap that can be used as
a stopping criterion. Depending on the\r\nsetting, the proposed method matches
or improves on the best computational\r\nguarantees for Stochastic Frank-Wolfe
algorithms. Benchmarks on several\r\ndatasets highlight different regimes in which
the proposed method exhibits a\r\nfaster empirical convergence than related methods.
Finally, we provide an\r\nimplementation of all considered methods in an open-source
package."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Geoffrey
full_name: Négiar, Geoffrey
last_name: Négiar
- first_name: Gideon
full_name: Dresdner, Gideon
last_name: Dresdner
- first_name: Alicia
full_name: Tsai, Alicia
last_name: Tsai
- first_name: Laurent El
full_name: Ghaoui, Laurent El
last_name: Ghaoui
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Robert M.
full_name: Freund, Robert M.
last_name: Freund
- first_name: Fabian
full_name: Pedregosa, Fabian
last_name: Pedregosa
citation:
ama: 'Négiar G, Dresdner G, Tsai A, et al. Stochastic Frank-Wolfe for constrained
finite-sum minimization. In: Proceedings of the 37th International Conference
on Machine Learning. Vol 119. ; 2020:7253-7262.'
apa: Négiar, G., Dresdner, G., Tsai, A., Ghaoui, L. E., Locatello, F., Freund, R.
M., & Pedregosa, F. (2020). Stochastic Frank-Wolfe for constrained finite-sum
minimization. In Proceedings of the 37th International Conference on Machine
Learning (Vol. 119, pp. 7253–7262). Virtual.
chicago: Négiar, Geoffrey, Gideon Dresdner, Alicia Tsai, Laurent El Ghaoui, Francesco
Locatello, Robert M. Freund, and Fabian Pedregosa. “Stochastic Frank-Wolfe for
Constrained Finite-Sum Minimization.” In Proceedings of the 37th International
Conference on Machine Learning, 119:7253–62, 2020.
ieee: G. Négiar et al., “Stochastic Frank-Wolfe for constrained finite-sum
minimization,” in Proceedings of the 37th International Conference on Machine
Learning, Virtual, 2020, vol. 119, pp. 7253–7262.
ista: Négiar G, Dresdner G, Tsai A, Ghaoui LE, Locatello F, Freund RM, Pedregosa
F. 2020. Stochastic Frank-Wolfe for constrained finite-sum minimization. Proceedings
of the 37th International Conference on Machine Learning. International Conference
on Machine Learning, PMLR, vol. 119, 7253–7262.
mla: Négiar, Geoffrey, et al. “Stochastic Frank-Wolfe for Constrained Finite-Sum
Minimization.” Proceedings of the 37th International Conference on Machine
Learning, vol. 119, 2020, pp. 7253–62.
short: G. Négiar, G. Dresdner, A. Tsai, L.E. Ghaoui, F. Locatello, R.M. Freund,
F. Pedregosa, in:, Proceedings of the 37th International Conference on Machine
Learning, 2020, pp. 7253–7262.
conference:
end_date: 2020-07-18
location: Virtual
name: International Conference on Machine Learning
start_date: 2020-07-13
date_created: 2023-08-22T14:07:52Z
date_published: 2020-07-27T00:00:00Z
date_updated: 2023-09-12T08:03:40Z
day: '27'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2002.11860'
intvolume: ' 119'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.11860
month: '07'
oa: 1
oa_version: Preprint
page: 7253-7262
publication: Proceedings of the 37th International Conference on Machine Learning
publication_status: published
quality_controlled: '1'
status: public
title: Stochastic Frank-Wolfe for constrained finite-sum minimization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2020'
...
---
_id: '14188'
abstract:
- lang: eng
text: "Intelligent agents should be able to learn useful representations by\r\nobserving
changes in their environment. We model such observations as pairs of\r\nnon-i.i.d.
images sharing at least one of the underlying factors of variation.\r\nFirst,
we theoretically show that only knowing how many factors have changed,\r\nbut
not which ones, is sufficient to learn disentangled representations.\r\nSecond,
we provide practical algorithms that learn disentangled representations\r\nfrom
pairs of images without requiring annotation of groups, individual\r\nfactors,
or the number of factors that have changed. Third, we perform a\r\nlarge-scale
empirical study and show that such pairs of observations are\r\nsufficient to
reliably learn disentangled representations on several benchmark\r\ndata sets.
Finally, we evaluate our learned representations and find that they\r\nare simultaneously
useful on a diverse suite of tasks, including generalization\r\nunder covariate
shifts, fairness, and abstract reasoning. Overall, our results\r\ndemonstrate
that weak supervision enables learning of useful disentangled\r\nrepresentations
in realistic scenarios."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Ben
full_name: Poole, Ben
last_name: Poole
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Olivier
full_name: Bachem, Olivier
last_name: Bachem
- first_name: Michael
full_name: Tschannen, Michael
last_name: Tschannen
citation:
ama: 'Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. Weakly-supervised
disentanglement without compromises. In: Proceedings of the 37th International
Conference on Machine Learning. Vol 119. ; 2020:6348–6359.'
apa: Locatello, F., Poole, B., Rätsch, G., Schölkopf, B., Bachem, O., & Tschannen,
M. (2020). Weakly-supervised disentanglement without compromises. In Proceedings
of the 37th International Conference on Machine Learning (Vol. 119, pp. 6348–6359).
Virtual.
chicago: Locatello, Francesco, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf, Olivier
Bachem, and Michael Tschannen. “Weakly-Supervised Disentanglement without Compromises.”
In Proceedings of the 37th International Conference on Machine Learning,
119:6348–6359, 2020.
ieee: F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, and M. Tschannen,
“Weakly-supervised disentanglement without compromises,” in Proceedings of
the 37th International Conference on Machine Learning, Virtual, 2020, vol.
119, pp. 6348–6359.
ista: Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. 2020.
Weakly-supervised disentanglement without compromises. Proceedings of the 37th
International Conference on Machine Learning. International Conference on Machine
Learning, PMLR, vol. 119, 6348–6359.
mla: Locatello, Francesco, et al. “Weakly-Supervised Disentanglement without Compromises.”
Proceedings of the 37th International Conference on Machine Learning, vol.
119, 2020, pp. 6348–6359.
short: F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, M. Tschannen,
in:, Proceedings of the 37th International Conference on Machine Learning, 2020,
pp. 6348–6359.
conference:
end_date: 2020-07-18
location: Virtual
name: International Conference on Machine Learning
start_date: 2020-07-13
date_created: 2023-08-22T14:08:14Z
date_published: 2020-07-07T00:00:00Z
date_updated: 2023-09-12T07:59:29Z
day: '07'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2002.02886'
intvolume: ' 119'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.02886
month: '07'
oa: 1
oa_version: Preprint
page: 6348–6359
publication: Proceedings of the 37th International Conference on Machine Learning
publication_status: published
quality_controlled: '1'
scopus_import: '1'
status: public
title: Weakly-supervised disentanglement without compromises
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2020'
...
---
_id: '14195'
abstract:
- lang: eng
text: "The idea behind the unsupervised learning of disentangled representations
is that real-world data is generated by a few explanatory factors of variation
which can be recovered by unsupervised learning algorithms. In this paper, we
provide a sober look at recent progress in the field and challenge some common
assumptions. We first theoretically show that the unsupervised learning of disentangled
representations is fundamentally impossible without inductive biases on both the
models and the data. Then, we train over 14000\r\n models covering most prominent
methods and evaluation metrics in a reproducible large-scale experimental study
on eight data sets. We observe that while the different methods successfully enforce
properties “encouraged” by the corresponding losses, well-disentangled models
seemingly cannot be identified without supervision. Furthermore, different evaluation
metrics do not always agree on what should be considered “disentangled” and exhibit
systematic differences in the estimation. Finally, increased disentanglement does
not seem to necessarily lead to a decreased sample complexity of learning for
downstream tasks. Our results suggest that future work on disentanglement learning
should be explicit about the role of inductive biases and (implicit) supervision,
investigate concrete benefits of enforcing disentanglement of the learned representations,
and consider a reproducible experimental setup covering several data sets."
article_number: '209'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Stefan
full_name: Bauer, Stefan
last_name: Bauer
- first_name: Mario
full_name: Lucic, Mario
last_name: Lucic
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Sylvain
full_name: Gelly, Sylvain
last_name: Gelly
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Olivier
full_name: Bachem, Olivier
last_name: Bachem
citation:
ama: Locatello F, Bauer S, Lucic M, et al. A sober look at the unsupervised learning
of disentangled representations and their evaluation. Journal of Machine Learning
Research. 2020;21.
apa: Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B.,
& Bachem, O. (2020). A sober look at the unsupervised learning of disentangled
representations and their evaluation. Journal of Machine Learning Research.
MIT Press.
chicago: Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain
Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Sober Look at the Unsupervised
Learning of Disentangled Representations and Their Evaluation.” Journal of
Machine Learning Research. MIT Press, 2020.
ieee: F. Locatello et al., “A sober look at the unsupervised learning of
disentangled representations and their evaluation,” Journal of Machine Learning
Research, vol. 21. MIT Press, 2020.
ista: Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020.
A sober look at the unsupervised learning of disentangled representations and
their evaluation. Journal of Machine Learning Research. 21, 209.
mla: Locatello, Francesco, et al. “A Sober Look at the Unsupervised Learning of
Disentangled Representations and Their Evaluation.” Journal of Machine Learning
Research, vol. 21, 209, MIT Press, 2020.
short: F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem,
Journal of Machine Learning Research 21 (2020).
date_created: 2023-08-22T14:10:34Z
date_published: 2020-09-01T00:00:00Z
date_updated: 2023-09-12T09:23:56Z
day: '01'
ddc:
- '000'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2010.14766'
has_accepted_license: '1'
intvolume: ' 21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://jmlr.csail.mit.edu/papers/v21/19-976.html
month: '09'
oa: 1
oa_version: Published Version
publication: Journal of Machine Learning Research
publication_status: published
publisher: MIT Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A sober look at the unsupervised learning of disentangled representations and
their evaluation
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: 21
year: '2020'
...
---
_id: '14326'
abstract:
- lang: eng
text: "Learning object-centric representations of complex scenes is a promising
step towards enabling efficient abstract reasoning from low-level perceptual features.
Yet, most deep learning approaches learn distributed representations that do not
capture the compositional properties of natural scenes. In this paper, we present
the Slot Attention module, an architectural component that interfaces with perceptual
representations such as the output of a convolutional neural network and produces
a set of task-dependent abstract representations which we call slots. These slots
are exchangeable and can bind to any object in the input by specializing through
a competitive procedure over multiple rounds of attention. We empirically demonstrate
that Slot Attention can extract object-centric representations that enable generalization
to unseen compositions when trained on unsupervised object discovery and supervised
property prediction tasks.\r\n\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Dirk
full_name: Weissenborn, Dirk
last_name: Weissenborn
- first_name: Thomas
full_name: Unterthiner, Thomas
last_name: Unterthiner
- first_name: Aravindh
full_name: Mahendran, Aravindh
last_name: Mahendran
- first_name: Georg
full_name: Heigold, Georg
last_name: Heigold
- first_name: Jakob
full_name: Uszkoreit, Jakob
last_name: Uszkoreit
- first_name: Alexey
full_name: Dosovitskiy, Alexey
last_name: Dosovitskiy
- first_name: Thomas
full_name: Kipf, Thomas
last_name: Kipf
citation:
ama: 'Locatello F, Weissenborn D, Unterthiner T, et al. Object-centric learning
with slot attention. In: Advances in Neural Information Processing Systems.
Vol 33. Curran Associates; 2020:11525-11538.'
apa: 'Locatello, F., Weissenborn, D., Unterthiner, T., Mahendran, A., Heigold, G.,
Uszkoreit, J., … Kipf, T. (2020). Object-centric learning with slot attention.
In Advances in Neural Information Processing Systems (Vol. 33, pp. 11525–11538).
Virtual: Curran Associates.'
chicago: Locatello, Francesco, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran,
Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. “Object-Centric
Learning with Slot Attention.” In Advances in Neural Information Processing
Systems, 33:11525–38. Curran Associates, 2020.
ieee: F. Locatello et al., “Object-centric learning with slot attention,”
in Advances in Neural Information Processing Systems, Virtual, 2020, vol.
33, pp. 11525–11538.
ista: 'Locatello F, Weissenborn D, Unterthiner T, Mahendran A, Heigold G, Uszkoreit
J, Dosovitskiy A, Kipf T. 2020. Object-centric learning with slot attention. Advances
in Neural Information Processing Systems. NeurIPS: Neural Information Processing
Systems vol. 33, 11525–11538.'
mla: Locatello, Francesco, et al. “Object-Centric Learning with Slot Attention.”
Advances in Neural Information Processing Systems, vol. 33, Curran Associates,
2020, pp. 11525–38.
short: F. Locatello, D. Weissenborn, T. Unterthiner, A. Mahendran, G. Heigold, J.
Uszkoreit, A. Dosovitskiy, T. Kipf, in:, Advances in Neural Information Processing
Systems, Curran Associates, 2020, pp. 11525–11538.
conference:
end_date: 2020-12-12
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2023-09-13T12:03:46Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-09-13T12:19:19Z
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2006.15055'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2006.15055
oa: 1
oa_version: Preprint
page: 11525-11538
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713829546'
publication_status: published
publisher: Curran Associates
quality_controlled: '1'
status: public
title: Object-centric learning with slot attention
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2020'
...
---
_id: '14592'
abstract:
- lang: eng
text: Cryo-electron microscopy (cryo-EM) of cellular specimens provides insights
into biological processes and structures within a native context. However, a major
challenge still lies in the efficient and reproducible preparation of adherent
cells for subsequent cryo-EM analysis. This is due to the sensitivity of many
cellular specimens to the varying seeding and culturing conditions required for
EM experiments, the often limited amount of cellular material and also the fragility
of EM grids and their substrate. Here, we present low-cost and reusable 3D printed
grid holders, designed to improve specimen preparation when culturing challenging
cellular samples directly on grids. The described grid holders increase cell culture
reproducibility and throughput, and reduce the resources required for cell culturing.
We show that grid holders can be integrated into various cryo-EM workflows, including
micro-patterning approaches to control cell seeding on grids, and for generating
samples for cryo-focused ion beam milling and cryo-electron tomography experiments.
Their adaptable design allows for the generation of specialized grid holders customized
to a large variety of applications.
article_processing_charge: No
author:
- 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: Schur FK. STL-files for 3D-printed grid holders described in Fäßler F, Zens
B, et al.; 3D printed cell culture grid holders for improved cellular specimen
preparation in cryo-electron microscopy. 2020. doi:10.15479/AT:ISTA:14592
apa: Schur, F. K. (2020). STL-files for 3D-printed grid holders described in Fäßler
F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular
specimen preparation in cryo-electron microscopy. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:14592
chicago: Schur, Florian KM. “STL-Files for 3D-Printed Grid Holders Described in
Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular
Specimen Preparation in Cryo-Electron Microscopy.” Institute of Science and Technology
Austria, 2020. https://doi.org/10.15479/AT:ISTA:14592.
ieee: F. K. Schur, “STL-files for 3D-printed grid holders described in Fäßler F,
Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen
preparation in cryo-electron microscopy.” Institute of Science and Technology
Austria, 2020.
ista: Schur FK. 2020. STL-files for 3D-printed grid holders described in Fäßler
F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular
specimen preparation in cryo-electron microscopy, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:14592.
mla: Schur, Florian KM. STL-Files for 3D-Printed Grid Holders Described in Fäßler
F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular
Specimen Preparation in Cryo-Electron Microscopy. Institute of Science and
Technology Austria, 2020, doi:10.15479/AT:ISTA:14592.
short: F.K. Schur, (2020).
contributor:
- contributor_type: researcher
first_name: Florian
id: 404F5528-F248-11E8-B48F-1D18A9856A87
last_name: Fäßler
orcid: 0000-0001-7149-769X
- contributor_type: researcher
first_name: Bettina
id: 45FD126C-F248-11E8-B48F-1D18A9856A87
last_name: Zens
- contributor_type: researcher
first_name: Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
- contributor_type: researcher
first_name: Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
date_created: 2023-11-22T15:00:57Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2024-02-21T12:44:48Z
day: '01'
ddc:
- '570'
department:
- _id: FlSc
doi: 10.15479/AT:ISTA:14592
file:
- access_level: open_access
checksum: 0108616e2a59e51879ea51299a29b091
content_type: application/zip
creator: fschur
date_created: 2023-11-22T14:58:44Z
date_updated: 2023-11-22T14:58:44Z
file_id: '14593'
file_name: 3Dprint-files_download_v2.zip
file_size: 49297
relation: main_file
success: 1
- access_level: open_access
checksum: 4c66ddedee4d01c1c4a7978208350cfc
content_type: text/plain
creator: cchlebak
date_created: 2023-12-01T10:39:59Z
date_updated: 2023-12-01T10:39:59Z
file_id: '14637'
file_name: readme.txt
file_size: 641
relation: main_file
success: 1
file_date_updated: 2023-12-01T10:39:59Z
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A
grant_number: P33367
name: Structure and isoform diversity of the Arp2/3 complex
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8586'
relation: research_data
status: public
status: public
title: STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.;
3D printed cell culture grid holders for improved cellular specimen preparation
in cryo-electron microscopy
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '14694'
abstract:
- lang: eng
text: We study the unique solution m of the Dyson equation \( -m(z)^{-1} = z\1 -
a + S[m(z)] \) on a von Neumann algebra A with the constraint Imm≥0. Here, z lies
in the complex upper half-plane, a is a self-adjoint element of A and S is a positivity-preserving
linear operator on A. We show that m is the Stieltjes transform of a compactly
supported A-valued measure on R. Under suitable assumptions, we establish that
this measure has a uniformly 1/3-Hölder continuous density with respect to the
Lebesgue measure, which is supported on finitely many intervals, called bands.
In fact, the density is analytic inside the bands with a square-root growth at
the edges and internal cubic root cusps whenever the gap between two bands vanishes.
The shape of these singularities is universal and no other singularity may occur.
We give a precise asymptotic description of m near the singular points. These
asymptotics generalize the analysis at the regular edges given in the companion
paper on the Tracy-Widom universality for the edge eigenvalue statistics for correlated
random matrices [the first author et al., Ann. Probab. 48, No. 2, 963--1001 (2020;
Zbl 1434.60017)] and they play a key role in the proof of the Pearcey universality
at the cusp for Wigner-type matrices [G. Cipolloni et al., Pure Appl. Anal. 1,
No. 4, 615--707 (2019; Zbl 07142203); the second author et al., Commun. Math.
Phys. 378, No. 2, 1203--1278 (2020; Zbl 07236118)]. We also extend the finite
dimensional band mass formula from [the first author et al., loc. cit.] to the
von Neumann algebra setting by showing that the spectral mass of the bands is
topologically rigid under deformations and we conclude that these masses are quantized
in some important cases.
article_processing_charge: Yes
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
citation:
ama: 'Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral
bands, edges and cusps. Documenta Mathematica. 2020;25:1421-1539. doi:10.4171/dm/780'
apa: 'Alt, J., Erdös, L., & Krüger, T. H. (2020). The Dyson equation with linear
self-energy: Spectral bands, edges and cusps. Documenta Mathematica. EMS
Press. https://doi.org/10.4171/dm/780'
chicago: 'Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation
with Linear Self-Energy: Spectral Bands, Edges and Cusps.” Documenta Mathematica.
EMS Press, 2020. https://doi.org/10.4171/dm/780.'
ieee: 'J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy:
Spectral bands, edges and cusps,” Documenta Mathematica, vol. 25. EMS Press,
pp. 1421–1539, 2020.'
ista: 'Alt J, Erdös L, Krüger TH. 2020. The Dyson equation with linear self-energy:
Spectral bands, edges and cusps. Documenta Mathematica. 25, 1421–1539.'
mla: 'Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral
Bands, Edges and Cusps.” Documenta Mathematica, vol. 25, EMS Press, 2020,
pp. 1421–539, doi:10.4171/dm/780.'
short: J. Alt, L. Erdös, T.H. Krüger, Documenta Mathematica 25 (2020) 1421–1539.
date_created: 2023-12-18T10:37:43Z
date_published: 2020-09-01T00:00:00Z
date_updated: 2023-12-18T10:46:09Z
day: '01'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.4171/dm/780
external_id:
arxiv:
- '1804.07752'
file:
- access_level: open_access
checksum: 12aacc1d63b852ff9a51c1f6b218d4a6
content_type: application/pdf
creator: dernst
date_created: 2023-12-18T10:42:32Z
date_updated: 2023-12-18T10:42:32Z
file_id: '14695'
file_name: 2020_DocumentaMathematica_Alt.pdf
file_size: 1374708
relation: main_file
success: 1
file_date_updated: 2023-12-18T10:42:32Z
has_accepted_license: '1'
intvolume: ' 25'
keyword:
- General Mathematics
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1421-1539
publication: Documenta Mathematica
publication_identifier:
eissn:
- 1431-0643
issn:
- 1431-0635
publication_status: published
publisher: EMS Press
quality_controlled: '1'
related_material:
record:
- id: '6183'
relation: earlier_version
status: public
status: public
title: 'The Dyson equation with linear self-energy: Spectral bands, edges and cusps'
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'
...
---
_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: 2023-09-18T09:30:01Z
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:
- '19410506'
issn:
- '10772626'
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
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: 2024-02-22T14:34:33Z
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: '149'
relation: dissertation_contains
status: public
- id: '6179'
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: 2023-09-07T12:54:12Z
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.
date_created: 2019-04-30T07:34:18Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-08-17T13:49:40Z
day: '01'
ddc:
- '500'
department:
- _id: JaMa
doi: 10.1007/s10955-019-02434-w
ec_funded: 1
external_id:
arxiv:
- '1811.04572'
isi:
- '000498933300001'
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
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 Di erential Systems
publication: Journal of Statistical Physics
publication_identifier:
eissn:
- '15729613'
issn:
- '00224715'
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
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'
...
---
_id: '6488'
abstract:
- lang: eng
text: We prove a central limit theorem for the difference of linear eigenvalue statistics
of a sample covariance matrix W˜ and its minor W. We find that the fluctuation
of this difference is much smaller than those of the individual linear statistics,
as a consequence of the strong correlation between the eigenvalues of W˜ and W.
Our result identifies the fluctuation of the spatial derivative of the approximate
Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar
result for Wigner matrices, for sample covariance matrices, the fluctuation may
entirely vanish.
article_number: '2050006'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- 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
citation:
ama: 'Cipolloni G, Erdös L. Fluctuations for differences of linear eigenvalue statistics
for sample covariance matrices. Random Matrices: Theory and Application.
2020;9(3). doi:10.1142/S2010326320500069'
apa: 'Cipolloni, G., & Erdös, L. (2020). Fluctuations for differences of linear
eigenvalue statistics for sample covariance matrices. Random Matrices: Theory
and Application. World Scientific Publishing. https://doi.org/10.1142/S2010326320500069'
chicago: 'Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of
Linear Eigenvalue Statistics for Sample Covariance Matrices.” Random Matrices:
Theory and Application. World Scientific Publishing, 2020. https://doi.org/10.1142/S2010326320500069.'
ieee: 'G. Cipolloni and L. Erdös, “Fluctuations for differences of linear eigenvalue
statistics for sample covariance matrices,” Random Matrices: Theory and Application,
vol. 9, no. 3. World Scientific Publishing, 2020.'
ista: 'Cipolloni G, Erdös L. 2020. Fluctuations for differences of linear eigenvalue
statistics for sample covariance matrices. Random Matrices: Theory and Application.
9(3), 2050006.'
mla: 'Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear
Eigenvalue Statistics for Sample Covariance Matrices.” Random Matrices: Theory
and Application, vol. 9, no. 3, 2050006, World Scientific Publishing, 2020,
doi:10.1142/S2010326320500069.'
short: 'G. Cipolloni, L. Erdös, Random Matrices: Theory and Application 9 (2020).'
date_created: 2019-05-26T21:59:14Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2023-08-28T08:38:48Z
day: '01'
department:
- _id: LaEr
doi: 10.1142/S2010326320500069
ec_funded: 1
external_id:
arxiv:
- '1806.08751'
isi:
- '000547464400001'
intvolume: ' 9'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.08751
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 'Random Matrices: Theory and Application'
publication_identifier:
eissn:
- '20103271'
issn:
- '20103263'
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fluctuations for differences of linear eigenvalue statistics for sample covariance
matrices
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 9
year: '2020'
...
---
_id: '6563'
abstract:
- lang: eng
text: "This paper presents two algorithms. The first decides the existence of a
pointed homotopy between given simplicial maps \U0001D453,\U0001D454:\U0001D44B→\U0001D44C,
and the second computes the group [\U0001D6F4\U0001D44B,\U0001D44C]∗ of pointed
homotopy classes of maps from a suspension; in both cases, the target Y is assumed
simply connected. More generally, these algorithms work relative to \U0001D434⊆\U0001D44B."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Lukas
full_name: Vokřínek, Lukas
last_name: Vokřínek
citation:
ama: Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint.
Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x
apa: Filakovský, M., & Vokřínek, L. (2020). Are two given maps homotopic? An
algorithmic viewpoint. Foundations of Computational Mathematics. Springer
Nature. https://doi.org/10.1007/s10208-019-09419-x
chicago: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An
Algorithmic Viewpoint.” Foundations of Computational Mathematics. Springer
Nature, 2020. https://doi.org/10.1007/s10208-019-09419-x.
ieee: M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic
viewpoint,” Foundations of Computational Mathematics, vol. 20. Springer
Nature, pp. 311–330, 2020.
ista: Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic
viewpoint. Foundations of Computational Mathematics. 20, 311–330.
mla: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic
Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer
Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.
short: M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020)
311–330.
date_created: 2019-06-16T21:59:14Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-08-17T13:50:44Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s10208-019-09419-x
external_id:
arxiv:
- '1312.2337'
isi:
- '000522437400004'
intvolume: ' 20'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1312.2337
month: '04'
oa: 1
oa_version: Preprint
page: 311-330
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
publication: Foundations of Computational Mathematics
publication_identifier:
eissn:
- '16153383'
issn:
- '16153375'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Are two given maps homotopic? An algorithmic viewpoint
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2020'
...
---
_id: '6593'
abstract:
- lang: eng
text: 'We consider the monotone variational inequality problem in a Hilbert space
and describe a projection-type method with inertial terms under the following
properties: (a) The method generates a strongly convergent iteration sequence;
(b) The method requires, at each iteration, only one projection onto the feasible
set and two evaluations of the operator; (c) The method is designed for variational
inequality for which the underline operator is monotone and uniformly continuous;
(d) The method includes an inertial term. The latter is also shown to speed up
the convergence in our numerical results. A comparison with some related methods
is given and indicates that the new method is promising.'
acknowledgement: The research of this author is supported by the ERC grant at the
IST.
article_processing_charge: No
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Xiao-Huan
full_name: Li, Xiao-Huan
last_name: Li
- first_name: Qiao-Li
full_name: Dong, Qiao-Li
last_name: Dong
citation:
ama: Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone
variational inequalities in Hilbert spaces. Numerical Algorithms. 2020;84:365-388.
doi:10.1007/s11075-019-00758-y
apa: Shehu, Y., Li, X.-H., & Dong, Q.-L. (2020). An efficient projection-type
method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms.
Springer Nature. https://doi.org/10.1007/s11075-019-00758-y
chicago: Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type
Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical
Algorithms. Springer Nature, 2020. https://doi.org/10.1007/s11075-019-00758-y.
ieee: Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for
monotone variational inequalities in Hilbert spaces,” Numerical Algorithms,
vol. 84. Springer Nature, pp. 365–388, 2020.
ista: Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone
variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.
mla: Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational
Inequalities in Hilbert Spaces.” Numerical Algorithms, vol. 84, Springer
Nature, 2020, pp. 365–88, doi:10.1007/s11075-019-00758-y.
short: Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388.
date_created: 2019-06-27T20:09:33Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2023-08-17T13:51:18Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1007/s11075-019-00758-y
ec_funded: 1
external_id:
isi:
- '000528979000015'
file:
- access_level: open_access
checksum: bb1a1eb3ebb2df380863d0db594673ba
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T13:14:10Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6927'
file_name: ExtragradientMethodPaper.pdf
file_size: 359654
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 84'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 365-388
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Numerical Algorithms
publication_identifier:
eissn:
- 1572-9265
issn:
- 1017-1398
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: An efficient projection-type method for monotone variational inequalities in
Hilbert spaces
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 84
year: '2020'
...
---
_id: '6649'
abstract:
- lang: eng
text: "While Hartree–Fock theory is well established as a fundamental approximation
for interacting fermions, it has been unclear how to describe corrections to it
due to many-body correlations. In this paper we start from the Hartree–Fock state
given by plane waves and introduce collective particle–hole pair excitations.
These pairs can be approximately described by a bosonic quadratic Hamiltonian.
We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type
upper bound to the ground state energy. Our result justifies the random-phase
approximation in the mean-field scaling regime, for repulsive, regular interaction
potentials.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
- first_name: Phan Thành
full_name: Nam, Phan Thành
last_name: Nam
- first_name: Marcello
full_name: Porta, Marcello
last_name: Porta
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Optimal upper bound
for the correlation energy of a Fermi gas in the mean-field regime. Communications
in Mathematical Physics. 2020;374:2097–2150. doi:10.1007/s00220-019-03505-5
apa: Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R.
(2020). Optimal upper bound for the correlation energy of a Fermi gas in the mean-field
regime. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03505-5
chicago: Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein,
and Robert Seiringer. “Optimal Upper Bound for the Correlation Energy of a Fermi
Gas in the Mean-Field Regime.” Communications in Mathematical Physics.
Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03505-5.
ieee: N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Optimal
upper bound for the correlation energy of a Fermi gas in the mean-field regime,”
Communications in Mathematical Physics, vol. 374. Springer Nature, pp.
2097–2150, 2020.
ista: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2020. Optimal upper
bound for the correlation energy of a Fermi gas in the mean-field regime. Communications
in Mathematical Physics. 374, 2097–2150.
mla: Benedikter, Niels P., et al. “Optimal Upper Bound for the Correlation Energy
of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics,
vol. 374, Springer Nature, 2020, pp. 2097–2150, doi:10.1007/s00220-019-03505-5.
short: N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Communications
in Mathematical Physics 374 (2020) 2097–2150.
date_created: 2019-07-18T13:30:04Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-08-17T13:51:50Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s00220-019-03505-5
ec_funded: 1
external_id:
arxiv:
- '1809.01902'
isi:
- '000527910700019'
file:
- access_level: open_access
checksum: f9dd6dd615a698f1d3636c4a092fed23
content_type: application/pdf
creator: dernst
date_created: 2019-07-24T07:19:10Z
date_updated: 2020-07-14T12:47:35Z
file_id: '6668'
file_name: 2019_CommMathPhysics_Benedikter.pdf
file_size: 853289
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
has_accepted_license: '1'
intvolume: ' 374'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 2097–2150
project:
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal upper bound for the correlation energy of a Fermi gas in the mean-field
regime
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: 374
year: '2020'
...
---
_id: '6748'
abstract:
- lang: eng
text: "Fitting a function by using linear combinations of a large number N of `simple'
components is one of the most fruitful ideas in statistical learning. This idea
lies at the core of a variety of methods, from two-layer neural networks to kernel
regression, to boosting. In general, the resulting risk minimization problem is
non-convex and is solved by gradient descent or its variants. Unfortunately, little
is known about global convergence properties of these approaches.\r\nHere we consider
the problem of learning a concave function f on a compact convex domain Ω⊆ℝd,
using linear combinations of `bump-like' components (neurons). The parameters
to be fitted are the centers of N bumps, and the resulting empirical risk minimization
problem is highly non-convex. We prove that, in the limit in which the number
of neurons diverges, the evolution of gradient descent converges to a Wasserstein
gradient flow in the space of probability distributions over Ω. Further, when
the bump width δ tends to 0, this gradient flow has a limit which is a viscous
porous medium equation. Remarkably, the cost function optimized by this gradient
flow exhibits a special property known as displacement convexity, which implies
exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory
appears to capture well the behavior for moderate values of δ,N. Explaining this
phenomenon, and understanding the dependence on δ,N in a quantitative manner remains
an outstanding challenge."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Adel
full_name: Javanmard, Adel
last_name: Javanmard
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Andrea
full_name: Montanari, Andrea
last_name: Montanari
citation:
ama: Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network
via displacement convexity. Annals of Statistics. 2020;48(6):3619-3642.
doi:10.1214/20-AOS1945
apa: Javanmard, A., Mondelli, M., & Montanari, A. (2020). Analysis of a two-layer
neural network via displacement convexity. Annals of Statistics. Institute
of Mathematical Statistics. https://doi.org/10.1214/20-AOS1945
chicago: Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer
Neural Network via Displacement Convexity.” Annals of Statistics. Institute
of Mathematical Statistics, 2020. https://doi.org/10.1214/20-AOS1945.
ieee: A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural
network via displacement convexity,” Annals of Statistics, vol. 48, no.
6. Institute of Mathematical Statistics, pp. 3619–3642, 2020.
ista: Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural
network via displacement convexity. Annals of Statistics. 48(6), 3619–3642.
mla: Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement
Convexity.” Annals of Statistics, vol. 48, no. 6, Institute of Mathematical
Statistics, 2020, pp. 3619–42, doi:10.1214/20-AOS1945.
short: A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642.
date_created: 2019-07-31T09:39:42Z
date_published: 2020-12-11T00:00:00Z
date_updated: 2024-03-06T08:28:50Z
day: '11'
department:
- _id: MaMo
doi: 10.1214/20-AOS1945
external_id:
arxiv:
- '1901.01375'
isi:
- '000598369200021'
intvolume: ' 48'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1901.01375
month: '12'
oa: 1
oa_version: Preprint
page: 3619-3642
publication: Annals of Statistics
publication_identifier:
eissn:
- 1941-7330
issn:
- 1932-6157
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
status: public
title: Analysis of a two-layer neural network via displacement convexity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2020'
...
---
_id: '6761'
abstract:
- lang: eng
text: In resource allocation games, selfish players share resources that are needed
in order to fulfill their objectives. The cost of using a resource depends on
the load on it. In the traditional setting, the players make their choices concurrently
and in one-shot. That is, a strategy for a player is a subset of the resources.
We introduce and study dynamic resource allocation games. In this setting, the
game proceeds in phases. In each phase each player chooses one resource. A scheduler
dictates the order in which the players proceed in a phase, possibly scheduling
several players to proceed concurrently. The game ends when each player has collected
a set of resources that fulfills his objective. The cost for each player then
depends on this set as well as on the load on the resources in it – we consider
both congestion and cost-sharing games. We argue that the dynamic setting is the
suitable setting for many applications in practice. We study the stability of
dynamic resource allocation games, where the appropriate notion of stability is
that of subgame perfect equilibrium, study the inefficiency incurred due to selfish
behavior, and also study problems that are particular to the dynamic setting,
like constraints on the order in which resources can be chosen or the problem
of finding a scheduler that achieves stability.
article_processing_charge: No
article_type: original
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
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical
Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031
apa: Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation
games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031
chicago: Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation
Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.
ieee: G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,”
Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.
ista: Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games.
Theoretical Computer Science. 807, 42–55.
mla: Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer
Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.
short: G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020)
42–55.
date_created: 2019-08-04T21:59:20Z
date_published: 2020-02-06T00:00:00Z
date_updated: 2023-08-17T13:52:49Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2019.06.031
external_id:
isi:
- '000512219400004'
file:
- access_level: open_access
checksum: e86635417f45eb2cd75778f91382f737
content_type: application/pdf
creator: dernst
date_created: 2020-10-09T06:31:22Z
date_updated: 2020-10-09T06:31:22Z
file_id: '8639'
file_name: 2020_TheoreticalCS_Avni.pdf
file_size: 1413001
relation: main_file
success: 1
file_date_updated: 2020-10-09T06:31:22Z
has_accepted_license: '1'
intvolume: ' 807'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 42-55
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication: Theoretical Computer Science
publication_identifier:
issn:
- '03043975'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '1341'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Dynamic resource allocation games
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 807
year: '2020'
...
---
_id: '6796'
abstract:
- lang: eng
text: Nearby grid cells have been observed to express a remarkable degree of long-rangeorder,
which is often idealized as extending potentially to infinity. Yet their strict
peri-odic firing and ensemble coherence are theoretically possible only in flat
environments, much unlike the burrows which rodents usually live in. Are the symmetrical,
coherent grid maps inferred in the lab relevant to chart their way in their natural
habitat? We consider spheres as simple models of curved environments and waiting
for the appropriate experiments to be performed, we use our adaptation model to
predict what grid maps would emerge in a network with the same type of recurrent
connections, which on the plane produce coherence among the units. We find that
on the sphere such connections distort the maps that single grid units would express
on their own, and aggregate them into clusters. When remapping to a different
spherical environment, units in each cluster maintain only partial coherence,
similar to what is observed in disordered materials, such as spin glasses.
article_processing_charge: No
article_type: original
author:
- first_name: Federico
full_name: Stella, Federico
id: 39AF1E74-F248-11E8-B48F-1D18A9856A87
last_name: Stella
orcid: 0000-0001-9439-3148
- first_name: Eugenio
full_name: Urdapilleta, Eugenio
last_name: Urdapilleta
- first_name: Yifan
full_name: Luo, Yifan
last_name: Luo
- first_name: Alessandro
full_name: Treves, Alessandro
last_name: Treves
citation:
ama: Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration
in self-organizing spherical grids. Hippocampus. 2020;30(4):302-313. doi:10.1002/hipo.23144
apa: Stella, F., Urdapilleta, E., Luo, Y., & Treves, A. (2020). Partial coherence
and frustration in self-organizing spherical grids. Hippocampus. Wiley.
https://doi.org/10.1002/hipo.23144
chicago: Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves.
“Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus.
Wiley, 2020. https://doi.org/10.1002/hipo.23144.
ieee: F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration
in self-organizing spherical grids,” Hippocampus, vol. 30, no. 4. Wiley,
pp. 302–313, 2020.
ista: Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration
in self-organizing spherical grids. Hippocampus. 30(4), 302–313.
mla: Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing
Spherical Grids.” Hippocampus, vol. 30, no. 4, Wiley, 2020, pp. 302–13,
doi:10.1002/hipo.23144.
short: F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.
date_created: 2019-08-11T21:59:24Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-08-17T13:53:14Z
day: '01'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1002/hipo.23144
external_id:
isi:
- '000477299600001'
pmid:
- '31339190'
file:
- access_level: open_access
checksum: 7b54d22bfbfc0d1188a9ea24d985bfb2
content_type: application/pdf
creator: dernst
date_created: 2019-08-12T07:53:33Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6800'
file_name: 2019_Hippocampus_Stella.pdf
file_size: 2370658
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 30'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 302-313
pmid: 1
publication: Hippocampus
publication_identifier:
eissn:
- '10981063'
issn:
- '10509631'
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial coherence and frustration in self-organizing spherical grids
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: 30
year: '2020'
...
---
_id: '6808'
abstract:
- lang: eng
text: Super-resolution fluorescence microscopy has become an important catalyst
for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy,
a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling
off-state. Only emitters residing in a sub-diffraction volume around an intensity
minimum are allowed to fluoresce, rendering them distinguishable from the nearby,
but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers
range in biological samples and is suitable for live imaging. Here, we review
the working principle of STED and provide general guidelines for successful STED
imaging. The strive for ever higher resolution comes at the cost of increased
light burden. We discuss techniques to reduce light exposure and mitigate its
detrimental effects on the specimen. These include specialized illumination strategies
as well as protecting fluorophores from photobleaching mediated by high-intensity
STED light. This opens up the prospect of volumetric imaging in living cells and
tissues with diffraction-unlimited resolution in all three spatial dimensions.
article_processing_charge: No
article_type: original
author:
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated
Emission Depletion (STED) nanoscopy of biological specimens. Methods. 2020;174(3):27-41.
doi:10.1016/j.ymeth.2019.07.019
apa: Jahr, W., Velicky, P., & Danzl, J. G. (2020). Strategies to maximize performance
in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods.
Elsevier. https://doi.org/10.1016/j.ymeth.2019.07.019
chicago: Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize
Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.”
Methods. Elsevier, 2020. https://doi.org/10.1016/j.ymeth.2019.07.019.
ieee: W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance
in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” Methods,
vol. 174, no. 3. Elsevier, pp. 27–41, 2020.
ista: Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated
Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3),
27–41.
mla: Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission
Depletion (STED) Nanoscopy of Biological Specimens.” Methods, vol. 174,
no. 3, Elsevier, 2020, pp. 27–41, doi:10.1016/j.ymeth.2019.07.019.
short: W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.
date_created: 2019-08-12T16:36:32Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-08-17T13:59:57Z
day: '01'
department:
- _id: JoDa
doi: 10.1016/j.ymeth.2019.07.019
external_id:
isi:
- '000525860400005'
pmid:
- '31344404'
intvolume: ' 174'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/
month: '03'
oa: 1
oa_version: Submitted Version
page: 27-41
pmid: 1
project:
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03600
name: Optical control of synaptic function via adhesion molecules
- _id: 2668BFA0-B435-11E9-9278-68D0E5697425
grant_number: LT00057
name: High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration
publication: Methods
publication_identifier:
issn:
- 1046-2023
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategies to maximize performance in STimulated Emission Depletion (STED)
nanoscopy of biological specimens
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 174
year: '2020'
...
---
_id: '6906'
abstract:
- lang: eng
text: We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime.
We show that low-energy states exhibit complete Bose–Einstein condensation with
an optimal bound on the number of orthogonal excitations. This extends recent
results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing
the assumption of small interaction potential.
acknowledgement: "We would like to thank P. T. Nam and R. Seiringer for several useful
discussions and\r\nfor suggesting us to use the localization techniques from [9].
C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under
the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges
support from the NCCR SwissMAP and from the Swiss National Foundation of Science
(Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties
of Bose–Einstein condensates”."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chiara
full_name: Boccato, Chiara
id: 342E7E22-F248-11E8-B48F-1D18A9856A87
last_name: Boccato
- first_name: Christian
full_name: Brennecke, Christian
last_name: Brennecke
- first_name: Serena
full_name: Cenatiempo, Serena
last_name: Cenatiempo
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
citation:
ama: Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein
condensation in the Gross-Pitaevskii regime. Communications in Mathematical
Physics. 2020;376:1311-1395. doi:10.1007/s00220-019-03555-9
apa: Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2020). Optimal
rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications
in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-019-03555-9
chicago: Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein.
“Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.”
Communications in Mathematical Physics. Springer, 2020. https://doi.org/10.1007/s00220-019-03555-9.
ieee: C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for
Bose-Einstein condensation in the Gross-Pitaevskii regime,” Communications
in Mathematical Physics, vol. 376. Springer, pp. 1311–1395, 2020.
ista: Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein
condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics.
376, 1311–1395.
mla: Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the
Gross-Pitaevskii Regime.” Communications in Mathematical Physics, vol.
376, Springer, 2020, pp. 1311–95, doi:10.1007/s00220-019-03555-9.
short: C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical
Physics 376 (2020) 1311–1395.
date_created: 2019-09-24T17:30:59Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2024-02-22T13:33:02Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00220-019-03555-9
ec_funded: 1
external_id:
arxiv:
- '1812.03086'
isi:
- '000536053300012'
intvolume: ' 376'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1812.03086
month: '06'
oa: 1
oa_version: Preprint
page: 1311-1395
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 376
year: '2020'
...