---
_id: '326'
abstract:
- lang: eng
text: Three-dimensional (3D) super-resolution microscopy technique structured illumination
microscopy (SIM) imaging of dendritic spines along the dendrite has not been previously
performed in fixed tissues, mainly due to deterioration of the stripe pattern
of the excitation laser induced by light scattering and optical aberrations. To
address this issue and solve these optical problems, we applied a novel clearing
reagent, LUCID, to fixed brains. In SIM imaging, the penetration depth and the
spatial resolution were improved in LUCID-treated slices, and 160-nm spatial resolution
was obtained in a large portion of the imaging volume on a single apical dendrite.
Furthermore, in a morphological analysis of spine heads of layer V pyramidal neurons
(L5PNs) in the medial prefrontal cortex (mPFC) of chronic dexamethasone (Dex)-treated
mice, SIM imaging revealed an altered distribution of spine forms that could not
be detected by high-NA confocal imaging. Thus, super-resolution SIM imaging represents
a promising high-throughput method for revealing spine morphologies in single
dendrites.
acknowledged_ssus:
- _id: EM-Fac
article_processing_charge: No
author:
- first_name: Kazuaki
full_name: Sawada, Kazuaki
last_name: Sawada
- first_name: Ryosuke
full_name: Kawakami, Ryosuke
last_name: Kawakami
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Tomomi
full_name: Nemoto, Tomomi
last_name: Nemoto
citation:
ama: Sawada K, Kawakami R, Shigemoto R, Nemoto T. Super resolution structural analysis
of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices. European Journal of Neuroscience. 2018;47(9):1033-1042.
doi:10.1111/ejn.13901
apa: Sawada, K., Kawakami, R., Shigemoto, R., & Nemoto, T. (2018). Super resolution
structural analysis of dendritic spines using three-dimensional structured illumination
microscopy in cleared mouse brain slices. European Journal of Neuroscience.
Wiley. https://doi.org/10.1111/ejn.13901
chicago: Sawada, Kazuaki, Ryosuke Kawakami, Ryuichi Shigemoto, and Tomomi Nemoto.
“Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional
Structured Illumination Microscopy in Cleared Mouse Brain Slices.” European
Journal of Neuroscience. Wiley, 2018. https://doi.org/10.1111/ejn.13901.
ieee: K. Sawada, R. Kawakami, R. Shigemoto, and T. Nemoto, “Super resolution structural
analysis of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices,” European Journal of Neuroscience, vol.
47, no. 9. Wiley, pp. 1033–1042, 2018.
ista: Sawada K, Kawakami R, Shigemoto R, Nemoto T. 2018. Super resolution structural
analysis of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices. European Journal of Neuroscience. 47(9), 1033–1042.
mla: Sawada, Kazuaki, et al. “Super Resolution Structural Analysis of Dendritic
Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse
Brain Slices.” European Journal of Neuroscience, vol. 47, no. 9, Wiley,
2018, pp. 1033–42, doi:10.1111/ejn.13901.
short: K. Sawada, R. Kawakami, R. Shigemoto, T. Nemoto, European Journal of Neuroscience
47 (2018) 1033–1042.
date_created: 2018-12-11T11:45:50Z
date_published: 2018-03-07T00:00:00Z
date_updated: 2023-09-19T09:58:40Z
day: '07'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1111/ejn.13901
external_id:
isi:
- '000431496400001'
file:
- access_level: open_access
checksum: 98e901d8229e44aa8f3b51d248dedd09
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:16:50Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5721'
file_name: 2018_EJN_Sawada.pdf
file_size: 4850261
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 47'
isi: 1
issue: '9'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 1033 - 1042
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley
publist_id: '7539'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Super resolution structural analysis of dendritic spines using three-dimensional
structured illumination microscopy in cleared mouse brain slices
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 47
year: '2018'
...
---
_id: '327'
abstract:
- lang: eng
text: Many-body quantum systems typically display fast dynamics and ballistic spreading
of information. Here we address the open problem of how slow the dynamics can
be after a generic breaking of integrability by local interactions. We develop
a method based on degenerate perturbation theory that reveals slow dynamical regimes
and delocalization processes in general translation invariant models, along with
accurate estimates of their delocalization time scales. Our results shed light
on the fundamental questions of the robustness of quantum integrable systems and
the possibility of many-body localization without disorder. As an example, we
construct a large class of one-dimensional lattice models where, despite the absence
of asymptotic localization, the transient dynamics is exceptionally slow, i.e.,
the dynamics is indistinguishable from that of many-body localized systems for
the system sizes and time scales accessible in experiments and numerical simulations.
acknowledgement: 'We thank F. Huveneers for useful discussions. Z.P. and A.M. acknowledge
support by EPSRC Grant No. EP/P009409/1 and and the Royal Society Research Grant
No. RG160635. Statement of compliance with EPSRC policy framework on research data:
This publication is theoretical work that does not require supporting research data.
D.A. acknowledges support by the Swiss National Science Foundation. M.Z., M.M. and
T.P. acknowledge Grants J1-7279 (M.Z.) and N1-0025 (M.M. and T.P.) of Slovenian
Research Agency, and Advanced Grant of European Research Council, Grant No. 694544
- OMNES (T.P.).'
article_number: '104307'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
orcid: 0000-0002-8443-1064
- first_name: Marko
full_name: Žnidarič, Marko
last_name: Žnidarič
- first_name: Mariya
full_name: Medvedyeva, Mariya
last_name: Medvedyeva
- first_name: Dmitry
full_name: Abanin, Dmitry
last_name: Abanin
- first_name: Tomaž
full_name: Prosen, Tomaž
last_name: Prosen
- first_name: Zlatko
full_name: Papić, Zlatko
last_name: Papić
citation:
ama: Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. Slow
dynamics in translation-invariant quantum lattice models. Physical Review B.
2018;97(10). doi:10.1103/PhysRevB.97.104307
apa: Michailidis, A., Žnidarič, M., Medvedyeva, M., Abanin, D., Prosen, T., &
Papić, Z. (2018). Slow dynamics in translation-invariant quantum lattice models.
Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.97.104307
chicago: Michailidis, Alexios, Marko Žnidarič, Mariya Medvedyeva, Dmitry Abanin,
Tomaž Prosen, and Zlatko Papić. “Slow Dynamics in Translation-Invariant Quantum
Lattice Models.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.97.104307.
ieee: A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, and Z. Papić,
“Slow dynamics in translation-invariant quantum lattice models,” Physical Review
B, vol. 97, no. 10. American Physical Society, 2018.
ista: Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. 2018.
Slow dynamics in translation-invariant quantum lattice models. Physical Review
B. 97(10), 104307.
mla: Michailidis, Alexios, et al. “Slow Dynamics in Translation-Invariant Quantum
Lattice Models.” Physical Review B, vol. 97, no. 10, 104307, American Physical
Society, 2018, doi:10.1103/PhysRevB.97.104307.
short: A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, Z. Papić,
Physical Review B 97 (2018).
date_created: 2018-12-11T11:45:50Z
date_published: 2018-03-19T00:00:00Z
date_updated: 2025-06-04T07:50:22Z
day: '19'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.97.104307
external_id:
arxiv:
- '1706.05026'
isi:
- '000427798800005'
intvolume: ' 97'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.05026
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '7538'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Slow dynamics in translation-invariant quantum lattice models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2018'
...
---
_id: '328'
abstract:
- lang: eng
text: The drag of turbulent flows can be drastically decreased by adding small amounts
of high molecular weight polymers. While drag reduction initially increases with
polymer concentration, it eventually saturates to what is known as the maximum
drag reduction (MDR) asymptote; this asymptote is generally attributed to the
dynamics being reduced to a marginal yet persistent state of subdued turbulent
motion. Contrary to this accepted view, we show that, for an appropriate choice
of parameters, polymers can reduce the drag beyond the suggested asymptotic limit,
eliminating turbulence and giving way to laminar flow. At higher polymer concentrations,
however, the laminar state becomes unstable, resulting in a fluctuating flow with
the characteristic drag of the MDR asymptote. Our findings indicate that the asymptotic
state is hence dynamically disconnected from ordinary turbulence. © 2018 American
Physical Society.
acknowledged_ssus:
- _id: SSU
acknowledgement: The authors thank Philipp Maier and the IST Austria workshop for
their dedicated technical support.
article_number: '124501'
article_processing_charge: No
arxiv: 1
author:
- first_name: George H
full_name: Choueiri, George H
id: 448BD5BC-F248-11E8-B48F-1D18A9856A87
last_name: Choueiri
- first_name: Jose M
full_name: Lopez Alonso, Jose M
id: 40770848-F248-11E8-B48F-1D18A9856A87
last_name: Lopez Alonso
orcid: 0000-0002-0384-2022
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Choueiri GH, Lopez Alonso JM, Hof B. Exceeding the asymptotic limit of polymer
drag reduction. Physical Review Letters. 2018;120(12). doi:10.1103/PhysRevLett.120.124501
apa: Choueiri, G. H., Lopez Alonso, J. M., & Hof, B. (2018). Exceeding the asymptotic
limit of polymer drag reduction. Physical Review Letters. American Physical
Society. https://doi.org/10.1103/PhysRevLett.120.124501
chicago: Choueiri, George H, Jose M Lopez Alonso, and Björn Hof. “Exceeding the
Asymptotic Limit of Polymer Drag Reduction.” Physical Review Letters. American
Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.120.124501.
ieee: G. H. Choueiri, J. M. Lopez Alonso, and B. Hof, “Exceeding the asymptotic
limit of polymer drag reduction,” Physical Review Letters, vol. 120, no.
12. American Physical Society, 2018.
ista: Choueiri GH, Lopez Alonso JM, Hof B. 2018. Exceeding the asymptotic limit
of polymer drag reduction. Physical Review Letters. 120(12), 124501.
mla: Choueiri, George H., et al. “Exceeding the Asymptotic Limit of Polymer Drag
Reduction.” Physical Review Letters, vol. 120, no. 12, 124501, American
Physical Society, 2018, doi:10.1103/PhysRevLett.120.124501.
short: G.H. Choueiri, J.M. Lopez Alonso, B. Hof, Physical Review Letters 120 (2018).
corr_author: '1'
date_created: 2018-12-11T11:45:51Z
date_published: 2018-03-19T00:00:00Z
date_updated: 2025-06-04T07:52:00Z
day: '19'
department:
- _id: BjHo
doi: 10.1103/PhysRevLett.120.124501
ec_funded: 1
external_id:
arxiv:
- '1703.06271'
isi:
- '000427804000005'
intvolume: ' 120'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.06271
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '7537'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Exceeding the asymptotic limit of polymer drag reduction
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 120
year: '2018'
...
---
_id: '33'
abstract:
- lang: eng
text: Secondary contact is the reestablishment of gene flow between sister populations
that have diverged. For instance, at the end of the Quaternary glaciations in
Europe, secondary contact occurred during the northward expansion of the populations
which had found refugia in the southern peninsulas. With the advent of multi-locus
markers, secondary contact can be investigated using various molecular signatures
including gradients of allele frequency, admixture clines, and local increase
of genetic differentiation. We use coalescent simulations to investigate if molecular
data provide enough information to distinguish between secondary contact following
range expansion and an alternative evolutionary scenario consisting of a barrier
to gene flow in an isolation-by-distance model. We find that an excess of linkage
disequilibrium and of genetic diversity at the suture zone is a unique signature
of secondary contact. We also find that the directionality index ψ, which was
proposed to study range expansion, is informative to distinguish between the two
hypotheses. However, although evidence for secondary contact is usually conveyed
by statistics related to admixture coefficients, we find that they can be confounded
by isolation-by-distance. We recommend to account for the spatial repartition
of individuals when investigating secondary contact in order to better reflect
the complex spatio-temporal evolution of populations and species.
acknowledgement: 'Johanna Bertl was supported by the Vienna Graduate School of Population
Genetics (Austrian Science Fund (FWF): W1225-B20) and worked on this project while
employed at the Department of Statistics and Operations Research, University of
Vienna, Austria. This article was developed in the framework of the Grenoble Alpes
Data Institute, which is supported by the French National Research Agency under
the “Investissments d’avenir” program (ANR-15-IDEX-02).'
article_number: e5325
article_processing_charge: No
author:
- first_name: Johanna
full_name: Bertl, Johanna
last_name: Bertl
- first_name: Harald
full_name: Ringbauer, Harald
id: 417FCFF4-F248-11E8-B48F-1D18A9856A87
last_name: Ringbauer
orcid: 0000-0002-4884-9682
- first_name: Michaël
full_name: Blum, Michaël
last_name: Blum
citation:
ama: Bertl J, Ringbauer H, Blum M. Can secondary contact following range expansion
be distinguished from barriers to gene flow? PeerJ. 2018;2018(10). doi:10.7717/peerj.5325
apa: Bertl, J., Ringbauer, H., & Blum, M. (2018). Can secondary contact following
range expansion be distinguished from barriers to gene flow? PeerJ. PeerJ.
https://doi.org/10.7717/peerj.5325
chicago: Bertl, Johanna, Harald Ringbauer, and Michaël Blum. “Can Secondary Contact
Following Range Expansion Be Distinguished from Barriers to Gene Flow?” PeerJ.
PeerJ, 2018. https://doi.org/10.7717/peerj.5325.
ieee: J. Bertl, H. Ringbauer, and M. Blum, “Can secondary contact following range
expansion be distinguished from barriers to gene flow?,” PeerJ, vol. 2018,
no. 10. PeerJ, 2018.
ista: Bertl J, Ringbauer H, Blum M. 2018. Can secondary contact following range
expansion be distinguished from barriers to gene flow? PeerJ. 2018(10), e5325.
mla: Bertl, Johanna, et al. “Can Secondary Contact Following Range Expansion Be
Distinguished from Barriers to Gene Flow?” PeerJ, vol. 2018, no. 10, e5325,
PeerJ, 2018, doi:10.7717/peerj.5325.
short: J. Bertl, H. Ringbauer, M. Blum, PeerJ 2018 (2018).
date_created: 2018-12-11T11:44:16Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2023-10-17T12:24:43Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.7717/peerj.5325
external_id:
isi:
- '000447204400001'
pmid:
- '30294507'
file:
- access_level: open_access
checksum: 3334886c4b39678db4c4b74299ca14ba
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:46:06Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5692'
file_name: 2018_PeerJ_Bertl.pdf
file_size: 1328344
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 2018'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: PeerJ
publication_status: published
publisher: PeerJ
publist_id: '8022'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Can secondary contact following range expansion be distinguished from barriers
to gene flow?
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: 2018
year: '2018'
...
---
_id: '3300'
abstract:
- lang: eng
text: "This book first explores the origins of this idea, grounded in theoretical
work on temporal logic and automata. The editors and authors are among the world's
leading researchers in this domain, and they contributed 32 chapters representing
a thorough view of the development and application of the technique. Topics covered
include binary decision diagrams, symbolic model checking, satisfiability modulo
theories, partial-order reduction, abstraction, interpolation, concurrency, security
protocols, games, probabilistic model checking, and process algebra, and chapters
on the transfer of theory to industrial practice, property specification languages
for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe
book will be valuable for researchers and graduate students engaged with the development
of formal methods and verification tools."
article_processing_charge: No
author:
- first_name: Edmund M.
full_name: Clarke, Edmund M.
last_name: Clarke
- 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: Helmut
full_name: Veith, Helmut
last_name: Veith
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
citation:
ama: 'Clarke EM, Henzinger TA, Veith H, Bloem R. Handbook of Model Checking.
1st ed. Cham: Springer Nature; 2018. doi:10.1007/978-3-319-10575-8'
apa: 'Clarke, E. M., Henzinger, T. A., Veith, H., & Bloem, R. (2018). Handbook
of Model Checking (1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-10575-8'
chicago: 'Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem.
Handbook of Model Checking. 1st ed. Cham: Springer Nature, 2018. https://doi.org/10.1007/978-3-319-10575-8.'
ieee: 'E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, Handbook of Model
Checking, 1st ed. Cham: Springer Nature, 2018.'
ista: 'Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking
1st ed., Cham: Springer Nature, XLVIII, 1212p.'
mla: Clarke, Edmund M., et al. Handbook of Model Checking. 1st ed., Springer
Nature, 2018, doi:10.1007/978-3-319-10575-8.
short: E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking,
1st ed., Springer Nature, Cham, 2018.
date_created: 2018-12-11T12:02:32Z
date_published: 2018-06-08T00:00:00Z
date_updated: 2021-12-21T10:49:36Z
day: '08'
department:
- _id: ToHe
doi: 10.1007/978-3-319-10575-8
edition: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: XLVIII, 1212
place: Cham
publication_identifier:
eisbn:
- 978-3-319-10575-8
isbn:
- 978-3-319-10574-1
publication_status: published
publisher: Springer Nature
publist_id: '3340'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Handbook of Model Checking
type: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2018'
...
---
_id: '34'
abstract:
- lang: eng
text: Partially observable Markov decision processes (POMDPs) are widely used in
probabilistic planning problems in which an agent interacts with an environment
using noisy and imprecise sensors. We study a setting in which the sensors are
only partially defined and the goal is to synthesize “weakest” additional sensors,
such that in the resulting POMDP, there is a small-memory policy for the agent
that almost-surely (with probability 1) satisfies a reachability objective. We
show that the problem is NP-complete, and present a symbolic algorithm by encoding
the problem into SAT instances. We illustrate trade-offs between the amount of
memory of the policy and the number of additional sensors on a simple example.
We have implemented our approach and consider three classical POMDP examples from
the literature, and show that in all the examples the number of sensors can be
significantly decreased (as compared to the existing solutions in the literature)
without increasing the complexity of the policies.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chemlík, Martin
last_name: Chemlík
- first_name: Ufuk
full_name: Topcu, Ufuk
last_name: Topcu
citation:
ama: 'Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability
objectives. In: 28th International Conference on Automated Planning and Scheduling.
Vol 2018. AAAI Press; 2018:47-55. doi:10.1609/icaps.v28i1.13875'
apa: 'Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for
POMDPs with reachability objectives. In 28th International Conference on Automated
Planning and Scheduling (Vol. 2018, pp. 47–55). Delft, Netherlands: AAAI Press.
https://doi.org/10.1609/icaps.v28i1.13875'
chicago: Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis
for POMDPs with Reachability Objectives.” In 28th International Conference
on Automated Planning and Scheduling, 2018:47–55. AAAI Press, 2018. https://doi.org/10.1609/icaps.v28i1.13875.
ieee: K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with
reachability objectives,” in 28th International Conference on Automated Planning
and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.
ista: 'Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with
reachability objectives. 28th International Conference on Automated Planning and
Scheduling. ICAPS: International Conference on Automated Planning and Scheduling
vol. 2018, 47–55.'
mla: Chatterjee, Krishnendu, et al. “Sensor Synthesis for POMDPs with Reachability
Objectives.” 28th International Conference on Automated Planning and Scheduling,
vol. 2018, AAAI Press, 2018, pp. 47–55, doi:10.1609/icaps.v28i1.13875.
short: K. Chatterjee, M. Chemlík, U. Topcu, in:, 28th International Conference on
Automated Planning and Scheduling, AAAI Press, 2018, pp. 47–55.
conference:
end_date: 2018-06-29
location: Delft, Netherlands
name: 'ICAPS: International Conference on Automated Planning and Scheduling'
start_date: 2018-06-24
date_created: 2018-12-11T11:44:16Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2025-04-15T07:23:29Z
day: '01'
department:
- _id: KrCh
doi: 10.1609/icaps.v28i1.13875
ec_funded: 1
external_id:
arxiv:
- '1710.00675'
isi:
- '000492986200006'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1710.00675
month: '06'
oa: 1
oa_version: Preprint
page: 47 - 55
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 28th International Conference on Automated Planning and Scheduling
publication_status: published
publisher: AAAI Press
publist_id: '8021'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sensor synthesis for POMDPs with reachability objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2018
year: '2018'
...
---
_id: '134'
abstract:
- lang: eng
text: "The current state of the art in real-time two-dimensional water wave simulation
requires developers to choose between efficient Fourier-based methods, which lack
interactions with moving obstacles, and finite-difference or finite element methods,
which handle environmental interactions but are significantly more expensive.
This paper attempts to bridge this long-standing gap between complexity and performance,
by proposing a new wave simulation method that can faithfully simulate wave interactions
with moving obstacles in real time while simultaneously preserving minute details
and accommodating very large simulation domains.\r\n\r\nPrevious methods for simulating
2D water waves directly compute the change in height of the water surface, a strategy
which imposes limitations based on the CFL condition (fast moving waves require
small time steps) and Nyquist's limit (small wave details require closely-spaced
simulation variables). This paper proposes a novel wavelet transformation that
discretizes the liquid motion in terms of amplitude-like functions that vary over
space, frequency, and direction, effectively generalizing Fourier-based methods
to handle local interactions. Because these new variables change much more slowly
over space than the original water height function, our change of variables drastically
reduces the limitations of the CFL condition and Nyquist limit, allowing us to
simulate highly detailed water waves at very large visual resolutions. Our discretization
is amenable to fast summation and easy to parallelize. We also present basic extensions
like pre-computed wave paths and two-way solid fluid coupling. Finally, we argue
that our discretization provides a convenient set of variables for artistic manipulation,
which we illustrate with a novel wave-painting interface."
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- SIGGRAPH
article_number: '94'
article_processing_charge: No
author:
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Tomas
full_name: Skrivan, Tomas
id: 486A5A46-F248-11E8-B48F-1D18A9856A87
last_name: Skrivan
- first_name: Matthias
full_name: Mueller Fischer, Matthias
last_name: Mueller Fischer
- first_name: Nuttapong
full_name: Chentanez, Nuttapong
last_name: Chentanez
- first_name: Miles
full_name: Macklin, Miles
last_name: Macklin
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C.
Water surface wavelets. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201336
apa: Jeschke, S., Skrivan, T., Mueller Fischer, M., Chentanez, N., Macklin, M.,
& Wojtan, C. (2018). Water surface wavelets. ACM Transactions on Graphics.
ACM. https://doi.org/10.1145/3197517.3201336
chicago: Jeschke, Stefan, Tomas Skrivan, Matthias Mueller Fischer, Nuttapong Chentanez,
Miles Macklin, and Chris Wojtan. “Water Surface Wavelets.” ACM Transactions
on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201336.
ieee: S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, and
C. Wojtan, “Water surface wavelets,” ACM Transactions on Graphics, vol.
37, no. 4. ACM, 2018.
ista: Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C.
2018. Water surface wavelets. ACM Transactions on Graphics. 37(4), 94.
mla: Jeschke, Stefan, et al. “Water Surface Wavelets.” ACM Transactions on Graphics,
vol. 37, no. 4, 94, ACM, 2018, doi:10.1145/3197517.3201336.
short: S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, C.
Wojtan, ACM Transactions on Graphics 37 (2018).
date_created: 2018-12-11T11:44:48Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2024-10-22T09:58:20Z
day: '30'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3197517.3201336
ec_funded: 1
external_id:
isi:
- '000448185000055'
file:
- access_level: open_access
checksum: db75ebabe2ec432bf41389e614d6ef62
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:59:23Z
date_updated: 2020-07-14T12:44:45Z
file_id: '5744'
file_name: 2018_ACM_Jeschke.pdf
file_size: 22185016
relation: main_file
file_date_updated: 2020-07-14T12:44:45Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '7789'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-water-simulation-captures-small-details-even-in-large-scenes/
scopus_import: '1'
status: public
title: Water surface wavelets
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2018'
...
---
_id: '135'
abstract:
- lang: eng
text: The Fluid Implicit Particle method (FLIP) reduces numerical dissipation by
combining particles with grids. To improve performance, the subsequent narrow
band FLIP method (NB‐FLIP) uses a FLIP‐based fluid simulation only near the liquid
surface and a traditional grid‐based fluid simulation away from the surface. This
spatially‐limited FLIP simulation significantly reduces the number of particles
and alleviates a computational bottleneck. In this paper, we extend the NB‐FLIP
idea even further, by allowing a simulation to transition between a FLIP‐like
fluid simulation and a grid‐based simulation in arbitrary locations, not just
near the surface. This approach leads to even more savings in memory and computation,
because we can concentrate the particles only in areas where they are needed.
More importantly, this new method allows us to seamlessly transition to smooth
implicit surface geometry wherever the particle‐based simulation is unnecessary.
Consequently, our method leads to a practical algorithm for avoiding the noisy
surface artifacts associated with particle‐based liquid simulations, while simultaneously
maintaining the benefits of a FLIP simulation in regions of dynamic motion.
alternative_title:
- Eurographics
article_processing_charge: No
article_type: original
author:
- first_name: Takahiro
full_name: Sato, Takahiro
last_name: Sato
- 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: Sato T, Wojtan C, Thuerey N, Igarashi T, Ando R. Extended narrow band FLIP
for liquid simulations. Computer Graphics Forum. 2018;37(2):169-177. doi:10.1111/cgf.13351
apa: Sato, T., Wojtan, C., Thuerey, N., Igarashi, T., & Ando, R. (2018). Extended
narrow band FLIP for liquid simulations. Computer Graphics Forum. Wiley.
https://doi.org/10.1111/cgf.13351
chicago: Sato, Takahiro, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi
Ando. “Extended Narrow Band FLIP for Liquid Simulations.” Computer Graphics
Forum. Wiley, 2018. https://doi.org/10.1111/cgf.13351.
ieee: T. Sato, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Extended narrow
band FLIP for liquid simulations,” Computer Graphics Forum, vol. 37, no.
2. Wiley, pp. 169–177, 2018.
ista: Sato T, Wojtan C, Thuerey N, Igarashi T, Ando R. 2018. Extended narrow band
FLIP for liquid simulations. Computer Graphics Forum. 37(2), 169–177.
mla: Sato, Takahiro, et al. “Extended Narrow Band FLIP for Liquid Simulations.”
Computer Graphics Forum, vol. 37, no. 2, Wiley, 2018, pp. 169–77, doi:10.1111/cgf.13351.
short: T. Sato, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, Computer Graphics Forum
37 (2018) 169–177.
date_created: 2018-12-11T11:44:49Z
date_published: 2018-05-22T00:00:00Z
date_updated: 2024-10-22T09:58:20Z
day: '22'
ddc:
- '006'
department:
- _id: ChWo
doi: 10.1111/cgf.13351
ec_funded: 1
external_id:
isi:
- '000434085600016'
file:
- access_level: open_access
checksum: 8edb90da8a72395eb5d970580e0925b6
content_type: application/pdf
creator: wojtan
date_created: 2020-10-08T08:38:23Z
date_updated: 2020-10-08T08:38:23Z
file_id: '8627'
file_name: exnbflip.pdf
file_size: 54309947
relation: main_file
success: 1
file_date_updated: 2020-10-08T08:38:23Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 169 - 177
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extended narrow band FLIP for liquid simulations
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '136'
abstract:
- lang: eng
text: Recent studies suggest that unstable, nonchaotic solutions of the Navier-Stokes
equation may provide deep insights into fluid turbulence. In this article, we
present a combined experimental and numerical study exploring the dynamical role
of unstable equilibrium solutions and their invariant manifolds in a weakly turbulent,
electromagnetically driven, shallow fluid layer. Identifying instants when turbulent
evolution slows down, we compute 31 unstable equilibria of a realistic two-dimensional
model of the flow. We establish the dynamical relevance of these unstable equilibria
by showing that they are closely visited by the turbulent flow. We also establish
the dynamical relevance of unstable manifolds by verifying that they are shadowed
by turbulent trajectories departing from the neighborhoods of unstable equilibria
over large distances in state space.
article_processing_charge: No
arxiv: 1
author:
- first_name: Balachandra
full_name: Suri, Balachandra
id: 47A5E706-F248-11E8-B48F-1D18A9856A87
last_name: Suri
- first_name: Jeffrey
full_name: Tithof, Jeffrey
last_name: Tithof
- first_name: Roman
full_name: Grigoriev, Roman
last_name: Grigoriev
- first_name: Michael
full_name: Schatz, Michael
last_name: Schatz
citation:
ama: Suri B, Tithof J, Grigoriev R, Schatz M. Unstable equilibria and invariant
manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E.
2018;98(2). doi:10.1103/PhysRevE.98.023105
apa: Suri, B., Tithof, J., Grigoriev, R., & Schatz, M. (2018). Unstable equilibria
and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical
Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.98.023105
chicago: Suri, Balachandra, Jeffrey Tithof, Roman Grigoriev, and Michael Schatz.
“Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional Kolmogorov-like
Flow.” Physical Review E. American Physical Society, 2018. https://doi.org/10.1103/PhysRevE.98.023105.
ieee: B. Suri, J. Tithof, R. Grigoriev, and M. Schatz, “Unstable equilibria and
invariant manifolds in quasi-two-dimensional Kolmogorov-like flow,” Physical
Review E, vol. 98, no. 2. American Physical Society, 2018.
ista: Suri B, Tithof J, Grigoriev R, Schatz M. 2018. Unstable equilibria and invariant
manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. 98(2).
mla: Suri, Balachandra, et al. “Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional
Kolmogorov-like Flow.” Physical Review E, vol. 98, no. 2, American Physical
Society, 2018, doi:10.1103/PhysRevE.98.023105.
short: B. Suri, J. Tithof, R. Grigoriev, M. Schatz, Physical Review E 98 (2018).
date_created: 2018-12-11T11:44:49Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2023-10-10T13:29:10Z
day: '13'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.98.023105
external_id:
arxiv:
- '1808.02088'
isi:
- '000441466800010'
intvolume: ' 98'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.02088
month: '08'
oa: 1
oa_version: Submitted Version
publication: Physical Review E
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like
flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 98
year: '2018'
...
---
_id: '137'
abstract:
- lang: eng
text: Fluorescent sensors are an essential part of the experimental toolbox of the
life sciences, where they are used ubiquitously to visualize intra- and extracellular
signaling. In the brain, optical neurotransmitter sensors can shed light on temporal
and spatial aspects of signal transmission by directly observing, for instance,
neurotransmitter release and spread. Here we report the development and application
of the first optical sensor for the amino acid glycine, which is both an inhibitory
neurotransmitter and a co-agonist of the N-methyl-d-aspartate receptors (NMDARs)
involved in synaptic plasticity. Computational design of a glycine-specific binding
protein allowed us to produce the optical glycine FRET sensor (GlyFS), which can
be used with single and two-photon excitation fluorescence microscopy. We took
advantage of this newly developed sensor to test predictions about the uneven
spatial distribution of glycine in extracellular space and to demonstrate that
extracellular glycine levels are controlled by plasticity-inducing stimuli.
article_processing_charge: No
article_type: original
author:
- first_name: William
full_name: Zhang, William
last_name: Zhang
- first_name: Michel
full_name: Herde, Michel
last_name: Herde
- first_name: Joshua
full_name: Mitchell, Joshua
last_name: Mitchell
- first_name: Jason
full_name: Whitfield, Jason
last_name: Whitfield
- first_name: Andreas
full_name: Wulff, Andreas
last_name: Wulff
- first_name: Vanessa
full_name: Vongsouthi, Vanessa
last_name: Vongsouthi
- first_name: Inmaculada
full_name: Sanchez Romero, Inmaculada
id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87
last_name: Sanchez Romero
- first_name: Polina
full_name: Gulakova, Polina
last_name: Gulakova
- first_name: Daniel
full_name: Minge, Daniel
last_name: Minge
- first_name: Björn
full_name: Breithausen, Björn
last_name: Breithausen
- first_name: Susanne
full_name: Schoch, Susanne
last_name: Schoch
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Colin
full_name: Jackson, Colin
last_name: Jackson
- first_name: Christian
full_name: Henneberger, Christian
last_name: Henneberger
citation:
ama: Zhang W, Herde M, Mitchell J, et al. Monitoring hippocampal glycine with the
computationally designed optical sensor GlyFS. Nature Chemical Biology.
2018;14(9):861-869. doi:10.1038/s41589-018-0108-2
apa: Zhang, W., Herde, M., Mitchell, J., Whitfield, J., Wulff, A., Vongsouthi, V.,
… Henneberger, C. (2018). Monitoring hippocampal glycine with the computationally
designed optical sensor GlyFS. Nature Chemical Biology. Nature Publishing
Group. https://doi.org/10.1038/s41589-018-0108-2
chicago: Zhang, William, Michel Herde, Joshua Mitchell, Jason Whitfield, Andreas
Wulff, Vanessa Vongsouthi, Inmaculada Sanchez-Romero, et al. “Monitoring Hippocampal
Glycine with the Computationally Designed Optical Sensor GlyFS.” Nature Chemical
Biology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41589-018-0108-2.
ieee: W. Zhang et al., “Monitoring hippocampal glycine with the computationally
designed optical sensor GlyFS,” Nature Chemical Biology, vol. 14, no. 9.
Nature Publishing Group, pp. 861–869, 2018.
ista: Zhang W, Herde M, Mitchell J, Whitfield J, Wulff A, Vongsouthi V, Sanchez-Romero
I, Gulakova P, Minge D, Breithausen B, Schoch S, Janovjak HL, Jackson C, Henneberger
C. 2018. Monitoring hippocampal glycine with the computationally designed optical
sensor GlyFS. Nature Chemical Biology. 14(9), 861–869.
mla: Zhang, William, et al. “Monitoring Hippocampal Glycine with the Computationally
Designed Optical Sensor GlyFS.” Nature Chemical Biology, vol. 14, no. 9,
Nature Publishing Group, 2018, pp. 861–69, doi:10.1038/s41589-018-0108-2.
short: W. Zhang, M. Herde, J. Mitchell, J. Whitfield, A. Wulff, V. Vongsouthi, I.
Sanchez-Romero, P. Gulakova, D. Minge, B. Breithausen, S. Schoch, H.L. Janovjak,
C. Jackson, C. Henneberger, Nature Chemical Biology 14 (2018) 861–869.
date_created: 2018-12-11T11:44:49Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2025-04-15T06:43:11Z
day: '30'
department:
- _id: HaJa
doi: 10.1038/s41589-018-0108-2
external_id:
isi:
- '000442174500013'
pmid:
- '30061718 '
intvolume: ' 14'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30061718
month: '07'
oa: 1
oa_version: Submitted Version
page: 861 - 869
pmid: 1
project:
- _id: 255BFFFA-B435-11E9-9278-68D0E5697425
grant_number: RGY0084/2012
name: In situ real-time imaging of neurotransmitter signaling using designer optical
sensors
publication: Nature Chemical Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '7786'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitoring hippocampal glycine with the computationally designed optical sensor
GlyFS
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 14
year: '2018'
...
---
_id: '139'
abstract:
- lang: eng
text: 'Genome-scale diversity data are increasingly available in a variety of biological
systems, and can be used to reconstruct the past evolutionary history of species
divergence. However, extracting the full demographic information from these data
is not trivial, and requires inferential methods that account for the diversity
of coalescent histories throughout the genome. Here, we evaluate the potential
and limitations of one such approach. We reexamine a well-known system of mussel
sister species, using the joint site frequency spectrum (jSFS) of synonymousmutations
computed either fromexome capture or RNA-seq, in an Approximate Bayesian Computation
(ABC) framework. We first assess the best sampling strategy (number of: individuals,
loci, and bins in the jSFS), and show that model selection is robust to variation
in the number of individuals and loci. In contrast, different binning choices
when summarizing the jSFS, strongly affect the results: including classes of low
and high frequency shared polymorphisms can more effectively reveal recent migration
events. We then take advantage of the flexibility of ABC to compare more realistic
models of speciation, including variation in migration rates through time (i.e.,
periodic connectivity) and across genes (i.e., genome-wide heterogeneity in migration
rates). We show that these models were consistently selected as the most probable,
suggesting that mussels have experienced a complex history of gene flow during
divergence and that the species boundary is semi-permeable. Our work provides
a comprehensive evaluation of ABC demographic inference in mussels based on the
coding jSFS, and supplies guidelines for employing different sequencing techniques
and sampling strategies. We emphasize, perhaps surprisingly, that inferences are
less limited by the volume of data, than by the way in which they are analyzed.'
article_number: '30083438'
article_processing_charge: No
author:
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Camille
full_name: Roux, Camille
last_name: Roux
- first_name: Pierre
full_name: Gagnaire, Pierre
last_name: Gagnaire
- first_name: Jonathan
full_name: Romiguier, Jonathan
last_name: Romiguier
- first_name: Nicolas
full_name: Faivre, Nicolas
last_name: Faivre
- first_name: John
full_name: Welch, John
last_name: Welch
- first_name: Nicolas
full_name: Bierne, Nicolas
last_name: Bierne
citation:
ama: 'Fraisse C, Roux C, Gagnaire P, et al. The divergence history of European blue
mussel species reconstructed from Approximate Bayesian Computation: The effects
of sequencing techniques and sampling strategies. PeerJ. 2018;2018(7).
doi:10.7717/peerj.5198'
apa: 'Fraisse, C., Roux, C., Gagnaire, P., Romiguier, J., Faivre, N., Welch, J.,
& Bierne, N. (2018). The divergence history of European blue mussel species
reconstructed from Approximate Bayesian Computation: The effects of sequencing
techniques and sampling strategies. PeerJ. PeerJ. https://doi.org/10.7717/peerj.5198'
chicago: 'Fraisse, Christelle, Camille Roux, Pierre Gagnaire, Jonathan Romiguier,
Nicolas Faivre, John Welch, and Nicolas Bierne. “The Divergence History of European
Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects
of Sequencing Techniques and Sampling Strategies.” PeerJ. PeerJ, 2018.
https://doi.org/10.7717/peerj.5198.'
ieee: 'C. Fraisse et al., “The divergence history of European blue mussel
species reconstructed from Approximate Bayesian Computation: The effects of sequencing
techniques and sampling strategies,” PeerJ, vol. 2018, no. 7. PeerJ, 2018.'
ista: 'Fraisse C, Roux C, Gagnaire P, Romiguier J, Faivre N, Welch J, Bierne N.
2018. The divergence history of European blue mussel species reconstructed from
Approximate Bayesian Computation: The effects of sequencing techniques and sampling
strategies. PeerJ. 2018(7), 30083438.'
mla: 'Fraisse, Christelle, et al. “The Divergence History of European Blue Mussel
Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing
Techniques and Sampling Strategies.” PeerJ, vol. 2018, no. 7, 30083438,
PeerJ, 2018, doi:10.7717/peerj.5198.'
short: C. Fraisse, C. Roux, P. Gagnaire, J. Romiguier, N. Faivre, J. Welch, N. Bierne,
PeerJ 2018 (2018).
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-10-17T12:25:28Z
day: '30'
ddc:
- '576'
department:
- _id: BeVi
- _id: NiBa
doi: 10.7717/peerj.5198
external_id:
isi:
- '000440484800002'
file:
- access_level: open_access
checksum: 7d55ae22598a1c70759cd671600cff53
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:42:11Z
date_updated: 2020-07-14T12:44:48Z
file_id: '5739'
file_name: 2018_PeerJ_Fraisse.pdf
file_size: 1480792
relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
has_accepted_license: '1'
intvolume: ' 2018'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: PeerJ
publication_status: published
publisher: PeerJ
publist_id: '7784'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The divergence history of European blue mussel species reconstructed from
Approximate Bayesian Computation: The effects of sequencing techniques and sampling
strategies'
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: 2018
year: '2018'
...
---
_id: '14'
abstract:
- lang: eng
text: The intercellular transport of auxin is driven by PIN-formed (PIN) auxin efflux
carriers. PINs are localized at the plasma membrane (PM) and on constitutively
recycling endomembrane vesicles. Therefore, PINs can mediate auxin transport either
by direct translocation across the PM or by pumping auxin into secretory vesicles
(SVs), leading to its secretory release upon fusion with the PM. Which of these
two mechanisms dominates is a matter of debate. Here, we addressed the issue with
a mathematical modeling approach. We demonstrate that the efficiency of secretory
transport depends on SV size, half-life of PINs on the PM, pH, exocytosis frequency
and PIN density. 3D structured illumination microscopy (SIM) was used to determine
PIN density on the PM. Combining this data with published values of the other
parameters, we show that the transport activity of PINs in SVs would have to be
at least 1000× greater than on the PM in order to produce a comparable macroscopic
auxin transport. If both transport mechanisms operated simultaneously and PINs
were equally active on SVs and PM, the contribution of secretion to the total
auxin flux would be negligible. In conclusion, while secretory vesicle-mediated
transport of auxin is an intriguing and theoretically possible model, it is unlikely
to be a major mechanism of auxin transport inplanta.
acknowledgement: 'European Research Council (ERC): 742985 to Jiri Friml; M.A. was
supported by the Austrian Science Fund (FWF) (M2379-B28); AJ was supported by the
Austria Science Fund (FWF): I03630 to Jiri Friml.'
article_processing_charge: No
article_type: original
author:
- first_name: Sander
full_name: Hille, Sander
last_name: Hille
- first_name: Maria
full_name: Akhmanova, Maria
id: 3425EC26-F248-11E8-B48F-1D18A9856A87
last_name: Akhmanova
orcid: 0000-0003-1522-3162
- first_name: Matous
full_name: Glanc, Matous
id: 1AE1EA24-02D0-11E9-9BAA-DAF4881429F2
last_name: Glanc
orcid: 0000-0003-0619-7783
- first_name: Alexander J
full_name: Johnson, Alexander J
id: 46A62C3A-F248-11E8-B48F-1D18A9856A87
last_name: Johnson
orcid: 0000-0002-2739-8843
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. Relative contribution
of PIN-containing secretory vesicles and plasma membrane PINs to the directed
auxin transport: Theoretical estimation. International Journal of Molecular
Sciences. 2018;19(11). doi:10.3390/ijms19113566'
apa: 'Hille, S., Akhmanova, M., Glanc, M., Johnson, A. J., & Friml, J. (2018).
Relative contribution of PIN-containing secretory vesicles and plasma membrane
PINs to the directed auxin transport: Theoretical estimation. International
Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms19113566'
chicago: 'Hille, Sander, Maria Akhmanova, Matous Glanc, Alexander J Johnson, and
Jiří Friml. “Relative Contribution of PIN-Containing Secretory Vesicles and Plasma
Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.” International
Journal of Molecular Sciences. MDPI, 2018. https://doi.org/10.3390/ijms19113566.'
ieee: 'S. Hille, M. Akhmanova, M. Glanc, A. J. Johnson, and J. Friml, “Relative
contribution of PIN-containing secretory vesicles and plasma membrane PINs to
the directed auxin transport: Theoretical estimation,” International Journal
of Molecular Sciences, vol. 19, no. 11. MDPI, 2018.'
ista: 'Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. 2018. Relative contribution
of PIN-containing secretory vesicles and plasma membrane PINs to the directed
auxin transport: Theoretical estimation. International Journal of Molecular Sciences.
19(11).'
mla: 'Hille, Sander, et al. “Relative Contribution of PIN-Containing Secretory Vesicles
and Plasma Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.”
International Journal of Molecular Sciences, vol. 19, no. 11, MDPI, 2018,
doi:10.3390/ijms19113566.'
short: S. Hille, M. Akhmanova, M. Glanc, A.J. Johnson, J. Friml, International Journal
of Molecular Sciences 19 (2018).
date_created: 2018-12-11T11:44:09Z
date_published: 2018-11-12T00:00:00Z
date_updated: 2025-04-14T07:45:00Z
day: '12'
ddc:
- '580'
department:
- _id: DaSi
- _id: JiFr
doi: 10.3390/ijms19113566
ec_funded: 1
external_id:
isi:
- '000451528500282'
file:
- access_level: open_access
checksum: e4b59c2599b0ca26ebf5b8434bcde94a
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:04:11Z
date_updated: 2020-07-14T12:44:50Z
file_id: '5719'
file_name: 2018_IJMS_Hille.pdf
file_size: 2200593
relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
publication: International Journal of Molecular Sciences
publication_identifier:
eissn:
- 1422-0067
publication_status: published
publisher: MDPI
publist_id: '8042'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Relative contribution of PIN-containing secretory vesicles and plasma membrane
PINs to the directed auxin transport: Theoretical estimation'
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 19
year: '2018'
...
---
_id: '14198'
abstract:
- lang: eng
text: "High-dimensional time series are common in many domains. Since human\r\ncognition
is not optimized to work well in high-dimensional spaces, these areas\r\ncould
benefit from interpretable low-dimensional representations. However, most\r\nrepresentation
learning algorithms for time series data are difficult to\r\ninterpret. This is
due to non-intuitive mappings from data features to salient\r\nproperties of the
representation and non-smoothness over time. To address this\r\nproblem, we propose
a new representation learning framework building on ideas\r\nfrom interpretable
discrete dimensionality reduction and deep generative\r\nmodeling. This framework
allows us to learn discrete representations of time\r\nseries, which give rise
to smooth and interpretable embeddings with superior\r\nclustering performance.
We introduce a new way to overcome the\r\nnon-differentiability in discrete representation
learning and present a\r\ngradient-based version of the traditional self-organizing
map algorithm that is\r\nmore performant than the original. Furthermore, to allow
for a probabilistic\r\ninterpretation of our method, we integrate a Markov model
in the representation\r\nspace. This model uncovers the temporal transition structure,
improves\r\nclustering performance even further and provides additional explanatory\r\ninsights
as well as a natural representation of uncertainty. We evaluate our\r\nmodel in
terms of clustering performance and interpretability on static\r\n(Fashion-)MNIST
data, a time series of linearly interpolated (Fashion-)MNIST\r\nimages, a chaotic
Lorenz attractor system with two macro states, as well as on\r\na challenging
real world medical time series application on the eICU data set.\r\nOur learned
representations compare favorably with competitor methods and\r\nfacilitate downstream
tasks on the real world data."
article_processing_charge: No
arxiv: 1
author:
- first_name: Vincent
full_name: Fortuin, Vincent
last_name: Fortuin
- first_name: Matthias
full_name: Hüser, Matthias
last_name: Hüser
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Heiko
full_name: Strathmann, Heiko
last_name: Strathmann
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
citation:
ama: 'Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. SOM-VAE: Interpretable
discrete representation learning on time series. In: International Conference
on Learning Representations. ; 2018.'
apa: 'Fortuin, V., Hüser, M., Locatello, F., Strathmann, H., & Rätsch, G. (2018).
SOM-VAE: Interpretable discrete representation learning on time series. In International
Conference on Learning Representations. New Orleans, LA, United States.'
chicago: 'Fortuin, Vincent, Matthias Hüser, Francesco Locatello, Heiko Strathmann,
and Gunnar Rätsch. “SOM-VAE: Interpretable Discrete Representation Learning on
Time Series.” In International Conference on Learning Representations,
2018.'
ieee: 'V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, and G. Rätsch, “SOM-VAE:
Interpretable discrete representation learning on time series,” in International
Conference on Learning Representations, New Orleans, LA, United States, 2018.'
ista: 'Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. 2018. SOM-VAE: Interpretable
discrete representation learning on time series. International Conference on Learning
Representations. ICLR: International Conference on Learning Representations.'
mla: 'Fortuin, Vincent, et al. “SOM-VAE: Interpretable Discrete Representation Learning
on Time Series.” International Conference on Learning Representations,
2018.'
short: V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, G. Rätsch, in:, International
Conference on Learning Representations, 2018.
conference:
end_date: 2019-05-09
location: New Orleans, LA, United States
name: 'ICLR: International Conference on Learning Representations'
start_date: 2019-05-06
date_created: 2023-08-22T14:12:48Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-13T06:35:12Z
day: '06'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1806.02199'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.02199
month: '06'
oa: 1
oa_version: Preprint
publication: International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
status: public
title: 'SOM-VAE: Interpretable discrete representation learning on time series'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '142'
abstract:
- lang: eng
text: We address the problem of analyzing the reachable set of a polynomial nonlinear
continuous system by over-approximating the flowpipe of its dynamics. The common
approach to tackle this problem is to perform a numerical integration over a given
time horizon based on Taylor expansion and interval arithmetic. However, this
method results to be very conservative when there is a large difference in speed
between trajectories as time progresses. In this paper, we propose to use combinations
of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate
flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse
box which is big enough to contain the segment is constructed using sampled simulation
and then in the box we compute by linear programming a set of barrier functions
(called barrier tube or BT for short) which work together to form a tube surrounding
the flowpipe. The benefit of using PBT is that (1) BT is independent of time and
hence can avoid being stretched and deformed by time; and (2) a small number of
BTs can form a tight over-approximation for the flowpipe, which means that the
computation required to decide whether the BTs intersect the unsafe set can be
reduced significantly. We implemented a prototype called PBTS in C++. Experiments
on some benchmark systems show that our approach is effective.
acknowledgement: 'Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kong H, Bartocci E, Henzinger TA. Reachable set over-approximation for nonlinear
systems using piecewise barrier tubes. In: Vol 10981. Springer; 2018:449-467.
doi:10.1007/978-3-319-96145-3_24'
apa: 'Kong, H., Bartocci, E., & Henzinger, T. A. (2018). Reachable set over-approximation
for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467).
Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer.
https://doi.org/10.1007/978-3-319-96145-3_24'
chicago: Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation
for Nonlinear Systems Using Piecewise Barrier Tubes,” 10981:449–67. Springer,
2018. https://doi.org/10.1007/978-3-319-96145-3_24.
ieee: 'H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation
for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer
Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.'
ista: 'Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation
for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification,
LNCS, vol. 10981, 449–467.'
mla: Kong, Hui, et al. Reachable Set Over-Approximation for Nonlinear Systems
Using Piecewise Barrier Tubes. Vol. 10981, Springer, 2018, pp. 449–67, doi:10.1007/978-3-319-96145-3_24.
short: H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2025-04-15T06:25:58Z
day: '18'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_24
external_id:
isi:
- '000491481600024'
file:
- access_level: open_access
checksum: fd95e8026deacef3dc752a733bb9355f
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:57:06Z
date_updated: 2020-07-14T12:44:53Z
file_id: '5718'
file_name: 2018_LNCS_Kong.pdf
file_size: 5591566
relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: ' 10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 449 - 467
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_status: published
publisher: Springer
publist_id: '7781'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reachable set over-approximation for nonlinear systems using piecewise barrier
tubes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10981
year: '2018'
...
---
_id: '14201'
abstract:
- lang: eng
text: "Variational inference is a popular technique to approximate a possibly\r\nintractable
Bayesian posterior with a more tractable one. Recently, boosting\r\nvariational
inference has been proposed as a new paradigm to approximate the\r\nposterior
by a mixture of densities by greedily adding components to the\r\nmixture. However,
as is the case with many other variational inference\r\nalgorithms, its theoretical
properties have not been studied. In the present\r\nwork, we study the convergence
properties of this approach from a modern\r\noptimization viewpoint by establishing
connections to the classic Frank-Wolfe\r\nalgorithm. Our analyses yields novel
theoretical insights regarding the\r\nsufficient conditions for convergence, explicit
rates, and algorithmic\r\nsimplifications. Since a lot of focus in previous works
for variational\r\ninference has been on tractability, our work is especially
important as a much\r\nneeded attempt to bridge the gap between probabilistic
models and their\r\ncorresponding theoretical properties."
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: Rajiv
full_name: Khanna, Rajiv
last_name: Khanna
- first_name: Joydeep
full_name: Ghosh, Joydeep
last_name: Ghosh
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
citation:
ama: 'Locatello F, Khanna R, Ghosh J, Rätsch G. Boosting variational inference:
An optimization perspective. In: Proceedings of the 21st International Conference
on Artificial Intelligence and Statistics. Vol 84. ML Research Press; 2018:464-472.'
apa: 'Locatello, F., Khanna, R., Ghosh, J., & Rätsch, G. (2018). Boosting variational
inference: An optimization perspective. In Proceedings of the 21st International
Conference on Artificial Intelligence and Statistics (Vol. 84, pp. 464–472).
Playa Blanca, Lanzarote: ML Research Press.'
chicago: 'Locatello, Francesco, Rajiv Khanna, Joydeep Ghosh, and Gunnar Rätsch.
“Boosting Variational Inference: An Optimization Perspective.” In Proceedings
of the 21st International Conference on Artificial Intelligence and Statistics,
84:464–72. ML Research Press, 2018.'
ieee: 'F. Locatello, R. Khanna, J. Ghosh, and G. Rätsch, “Boosting variational inference:
An optimization perspective,” in Proceedings of the 21st International Conference
on Artificial Intelligence and Statistics, Playa Blanca, Lanzarote, 2018,
vol. 84, pp. 464–472.'
ista: 'Locatello F, Khanna R, Ghosh J, Rätsch G. 2018. Boosting variational inference:
An optimization perspective. Proceedings of the 21st International Conference
on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence
and Statistics, PMLR, vol. 84, 464–472.'
mla: 'Locatello, Francesco, et al. “Boosting Variational Inference: An Optimization
Perspective.” Proceedings of the 21st International Conference on Artificial
Intelligence and Statistics, vol. 84, ML Research Press, 2018, pp. 464–72.'
short: F. Locatello, R. Khanna, J. Ghosh, G. Rätsch, in:, Proceedings of the 21st
International Conference on Artificial Intelligence and Statistics, ML Research
Press, 2018, pp. 464–472.
conference:
end_date: 2018-04-11
location: Playa Blanca, Lanzarote
name: 'AISTATS: Conference on Artificial Intelligence and Statistics'
start_date: 2018-04-09
date_created: 2023-08-22T14:15:20Z
date_published: 2018-04-15T00:00:00Z
date_updated: 2024-10-14T12:29:27Z
day: '15'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1708.01733'
intvolume: ' 84'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.01733
month: '04'
oa: 1
oa_version: Preprint
page: 464-472
publication: Proceedings of the 21st International Conference on Artificial Intelligence
and Statistics
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Boosting variational inference: An optimization perspective'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 84
year: '2018'
...
---
_id: '14202'
abstract:
- lang: eng
text: "Approximating a probability density in a tractable manner is a central task\r\nin
Bayesian statistics. Variational Inference (VI) is a popular technique that\r\nachieves
tractability by choosing a relatively simple variational family.\r\nBorrowing
ideas from the classic boosting framework, recent approaches attempt\r\nto \\emph{boost}
VI by replacing the selection of a single density with a\r\ngreedily constructed
mixture of densities. In order to guarantee convergence,\r\nprevious works impose
stringent assumptions that require significant effort for\r\npractitioners. Specifically,
they require a custom implementation of the greedy\r\nstep (called the LMO) for
every probabilistic model with respect to an\r\nunnatural variational family of
truncated distributions. Our work fixes these\r\nissues with novel theoretical
and algorithmic insights. On the theoretical\r\nside, we show that boosting VI
satisfies a relaxed smoothness assumption which\r\nis sufficient for the convergence
of the functional Frank-Wolfe (FW) algorithm.\r\nFurthermore, we rephrase the
LMO problem and propose to maximize the Residual\r\nELBO (RELBO) which replaces
the standard ELBO optimization in VI. These\r\ntheoretical enhancements allow
for black box implementation of the boosting\r\nsubroutine. Finally, we present
a stopping criterion drawn from the duality gap\r\nin the classic FW analyses
and exhaustive experiments to illustrate the\r\nusefulness of our theoretical
and algorithmic contributions."
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: Gideon
full_name: Dresdner, Gideon
last_name: Dresdner
- first_name: Rajiv
full_name: Khanna, Rajiv
last_name: Khanna
- first_name: Isabel
full_name: Valera, Isabel
last_name: Valera
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
citation:
ama: 'Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. Boosting black box
variational inference. In: Advances in Neural Information Processing Systems.
Vol 31. Neural Information Processing Systems Foundation; 2018.'
apa: 'Locatello, F., Dresdner, G., Khanna, R., Valera, I., & Rätsch, G. (2018).
Boosting black box variational inference. In Advances in Neural Information
Processing Systems (Vol. 31). Montreal, Canada: Neural Information Processing
Systems Foundation.'
chicago: Locatello, Francesco, Gideon Dresdner, Rajiv Khanna, Isabel Valera, and
Gunnar Rätsch. “Boosting Black Box Variational Inference.” In Advances in Neural
Information Processing Systems, Vol. 31. Neural Information Processing Systems
Foundation, 2018.
ieee: F. Locatello, G. Dresdner, R. Khanna, I. Valera, and G. Rätsch, “Boosting
black box variational inference,” in Advances in Neural Information Processing
Systems, Montreal, Canada, 2018, vol. 31.
ista: 'Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. 2018. Boosting black
box variational inference. Advances in Neural Information Processing Systems.
NeurIPS: Neural Information Processing Systems vol. 31.'
mla: Locatello, Francesco, et al. “Boosting Black Box Variational Inference.” Advances
in Neural Information Processing Systems, vol. 31, Neural Information Processing
Systems Foundation, 2018.
short: F. Locatello, G. Dresdner, R. Khanna, I. Valera, G. Rätsch, in:, Advances
in Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2018.
conference:
end_date: 2018-12-08
location: Montreal, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2018-12-03
date_created: 2023-08-22T14:15:40Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-13T07:38:24Z
day: '06'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1806.02185'
intvolume: ' 31'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.02185
month: '06'
oa: 1
oa_version: Preprint
publication: Advances in Neural Information Processing Systems
publication_identifier:
eissn:
- 1049-5258
isbn:
- '9781510884472'
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Boosting black box variational inference
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2018'
...
---
_id: '14203'
abstract:
- lang: eng
text: We propose a conditional gradient framework for a composite convex minimization
template with broad applications. Our approach combines smoothing and homotopy
techniques under the CGM framework, and provably achieves the optimal O(1/k−−√)
convergence rate. We demonstrate that the same rate holds if the linear subproblems
are solved approximately with additive or multiplicative error. In contrast with
the relevant work, we are able to characterize the convergence when the non-smooth
term is an indicator function. Specific applications of our framework include
the non-smooth minimization, semidefinite programming, and minimization with linear
inclusion constraints over a compact domain. Numerical evidence demonstrates the
benefits of our framework.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Alp
full_name: Yurtsever, Alp
last_name: Yurtsever
- first_name: Olivier
full_name: Fercoq, Olivier
last_name: Fercoq
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Volkan
full_name: Cevher, Volkan
last_name: Cevher
citation:
ama: 'Yurtsever A, Fercoq O, Locatello F, Cevher V. A conditional gradient framework
for composite convex minimization with applications to semidefinite programming.
In: Proceedings of the 35th International Conference on Machine Learning.
Vol 80. ML Research Press; 2018:5727-5736.'
apa: 'Yurtsever, A., Fercoq, O., Locatello, F., & Cevher, V. (2018). A conditional
gradient framework for composite convex minimization with applications to semidefinite
programming. In Proceedings of the 35th International Conference on Machine
Learning (Vol. 80, pp. 5727–5736). Stockholm, Sweden: ML Research Press.'
chicago: Yurtsever, Alp, Olivier Fercoq, Francesco Locatello, and Volkan Cevher.
“A Conditional Gradient Framework for Composite Convex Minimization with Applications
to Semidefinite Programming.” In Proceedings of the 35th International Conference
on Machine Learning, 80:5727–36. ML Research Press, 2018.
ieee: A. Yurtsever, O. Fercoq, F. Locatello, and V. Cevher, “A conditional gradient
framework for composite convex minimization with applications to semidefinite
programming,” in Proceedings of the 35th International Conference on Machine
Learning, Stockholm, Sweden, 2018, vol. 80, pp. 5727–5736.
ista: 'Yurtsever A, Fercoq O, Locatello F, Cevher V. 2018. A conditional gradient
framework for composite convex minimization with applications to semidefinite
programming. Proceedings of the 35th International Conference on Machine Learning.
ICML: International Conference on Machine Learning, PMLR, vol. 80, 5727–5736.'
mla: Yurtsever, Alp, et al. “A Conditional Gradient Framework for Composite Convex
Minimization with Applications to Semidefinite Programming.” Proceedings of
the 35th International Conference on Machine Learning, vol. 80, ML Research
Press, 2018, pp. 5727–36.
short: A. Yurtsever, O. Fercoq, F. Locatello, V. Cevher, in:, Proceedings of the
35th International Conference on Machine Learning, ML Research Press, 2018, pp.
5727–5736.
conference:
end_date: 2018-07-15
location: Stockholm, Sweden
name: 'ICML: International Conference on Machine Learning'
start_date: 2018-07-10
date_created: 2023-08-22T14:16:01Z
date_published: 2018-07-15T00:00:00Z
date_updated: 2023-09-13T08:13:39Z
day: '15'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1804.08544'
intvolume: ' 80'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.08544
month: '07'
oa: 1
oa_version: Preprint
page: 5727-5736
publication: Proceedings of the 35th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: A conditional gradient framework for composite convex minimization with applications
to semidefinite programming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2018'
...
---
_id: '14204'
abstract:
- lang: eng
text: Two popular examples of first-order optimization methods over linear spaces
are coordinate descent and matching pursuit algorithms, with their randomized
variants. While the former targets the optimization by moving along coordinates,
the latter considers a generalized notion of directions. Exploiting the connection
between the two algorithms, we present a unified analysis of both, providing affine
invariant sublinear O(1/t) rates on smooth objectives and linear convergence on
strongly convex objectives. As a byproduct of our affine invariant analysis of
matching pursuit, our rates for steepest coordinate descent are the tightest known.
Furthermore, we show the first accelerated convergence rate O(1/t2) for matching
pursuit and steepest coordinate descent on convex objectives.
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: Anant
full_name: Raj, Anant
last_name: Raj
- first_name: Sai Praneeth
full_name: Karimireddy, Sai Praneeth
last_name: Karimireddy
- 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: Sebastian U.
full_name: Stich, Sebastian U.
last_name: Stich
- first_name: Martin
full_name: Jaggi, Martin
last_name: Jaggi
citation:
ama: 'Locatello F, Raj A, Karimireddy SP, et al. On matching pursuit and coordinate
descent. In: Proceedings of the 35th International Conference on Machine Learning.
Vol 80. ML Research Press; 2018:3198-3207.'
apa: Locatello, F., Raj, A., Karimireddy, S. P., Rätsch, G., Schölkopf, B., Stich,
S. U., & Jaggi, M. (2018). On matching pursuit and coordinate descent. In
Proceedings of the 35th International Conference on Machine Learning (Vol.
80, pp. 3198–3207). ML Research Press.
chicago: Locatello, Francesco, Anant Raj, Sai Praneeth Karimireddy, Gunnar Rätsch,
Bernhard Schölkopf, Sebastian U. Stich, and Martin Jaggi. “On Matching Pursuit
and Coordinate Descent.” In Proceedings of the 35th International Conference
on Machine Learning, 80:3198–3207. ML Research Press, 2018.
ieee: F. Locatello et al., “On matching pursuit and coordinate descent,”
in Proceedings of the 35th International Conference on Machine Learning,
2018, vol. 80, pp. 3198–3207.
ista: Locatello F, Raj A, Karimireddy SP, Rätsch G, Schölkopf B, Stich SU, Jaggi
M. 2018. On matching pursuit and coordinate descent. Proceedings of the 35th International
Conference on Machine Learning. , PMLR, vol. 80, 3198–3207.
mla: Locatello, Francesco, et al. “On Matching Pursuit and Coordinate Descent.”
Proceedings of the 35th International Conference on Machine Learning, vol.
80, ML Research Press, 2018, pp. 3198–207.
short: F. Locatello, A. Raj, S.P. Karimireddy, G. Rätsch, B. Schölkopf, S.U. Stich,
M. Jaggi, in:, Proceedings of the 35th International Conference on Machine Learning,
ML Research Press, 2018, pp. 3198–3207.
date_created: 2023-08-22T14:16:25Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2024-10-14T12:29:40Z
day: '01'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1803.09539'
intvolume: ' 80'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.09539
month: '07'
oa: 1
oa_version: Preprint
page: 3198-3207
publication: Proceedings of the 35th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On matching pursuit and coordinate descent
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2018'
...
---
_id: '14224'
abstract:
- lang: eng
text: Clustering is a cornerstone of unsupervised learning which can be thought
as disentangling multiple generative mechanisms underlying the data. In this paper
we introduce an algorithmic framework to train mixtures of implicit generative
models which we particularize for variational autoencoders. Relying on an additional
set of discriminators, we propose a competitive procedure in which the models
only need to approximate the portion of the data distribution from which they
can produce realistic samples. As a byproduct, each model is simpler to train,
and a clustering interpretation arises naturally from the partitioning of the
training points among the models. We empirically show that our approach splits
the training distribution in a reasonable way and increases the quality of the
generated samples.
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: Damien
full_name: Vincent, Damien
last_name: Vincent
- first_name: Ilya
full_name: Tolstikhin, Ilya
last_name: Tolstikhin
- first_name: Gunnar
full_name: Ratsch, Gunnar
last_name: Ratsch
- first_name: Sylvain
full_name: Gelly, Sylvain
last_name: Gelly
- first_name: Bernhard
full_name: Scholkopf, Bernhard
last_name: Scholkopf
citation:
ama: 'Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. Clustering
meets implicit generative models. In: 6th International Conference on Learning
Representations. ; 2018.'
apa: Locatello, F., Vincent, D., Tolstikhin, I., Ratsch, G., Gelly, S., & Scholkopf,
B. (2018). Clustering meets implicit generative models. In 6th International
Conference on Learning Representations. Vancouver, Canada.
chicago: Locatello, Francesco, Damien Vincent, Ilya Tolstikhin, Gunnar Ratsch, Sylvain
Gelly, and Bernhard Scholkopf. “Clustering Meets Implicit Generative Models.”
In 6th International Conference on Learning Representations, 2018.
ieee: F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, and B. Scholkopf,
“Clustering meets implicit generative models,” in 6th International Conference
on Learning Representations, Vancouver, Canada, 2018.
ista: Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. 2018.
Clustering meets implicit generative models. 6th International Conference on Learning
Representations. International Conference on Machine Learning.
mla: Locatello, Francesco, et al. “Clustering Meets Implicit Generative Models.”
6th International Conference on Learning Representations, 2018.
short: F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, B. Scholkopf,
in:, 6th International Conference on Learning Representations, 2018.
conference:
end_date: 2018-05-03
location: Vancouver, Canada
name: International Conference on Machine Learning
start_date: 2018-04-30
date_created: 2023-08-22T14:25:34Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2024-10-14T12:30:32Z
day: '01'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1804.11130'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.11130
month: '05'
oa: 1
oa_version: Preprint
publication: 6th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
scopus_import: '1'
status: public
title: Clustering meets implicit generative models
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '143'
abstract:
- lang: eng
text: 'Vector Addition Systems with States (VASS) provide a well-known and fundamental
model for the analysis of concurrent processes, parameterized systems, and are
also used as abstract models of programs in resource bound analysis. In this paper
we study the problem of obtaining asymptotic bounds on the termination time of
a given VASS. In particular, we focus on the practically important case of obtaining
polynomial bounds on termination time. Our main contributions are as follows:
First, we present a polynomial-time algorithm for deciding whether a given VASS
has a linear asymptotic complexity. We also show that if the complexity of a VASS
is not linear, it is at least quadratic. Second, we classify VASS according to
quantitative properties of their cycles. We show that certain singularities in
these properties are the key reason for non-polynomial asymptotic complexity of
VASS. In absence of singularities, we show that the asymptotic complexity is always
polynomial and of the form Θ(nk), for some integer k d, where d is the dimension
of the VASS. We present a polynomial-time algorithm computing the optimal k. For
general VASS, the same algorithm, which is based on a complete technique for the
construction of ranking functions in VASS, produces a valid lower bound, i.e.,
a k such that the termination complexity is (nk). Our results are based on new
insights into the geometry of VASS dynamics, which hold the potential for further
applicability to VASS analysis.'
alternative_title:
- ACM/IEEE Symposium on Logic in Computer Science
article_processing_charge: No
arxiv: 1
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Dominik
full_name: Velan, Dominik
last_name: Velan
- first_name: Florian
full_name: Zuleger, Florian
last_name: Zuleger
citation:
ama: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. Efficient
algorithms for asymptotic bounds on termination time in VASS. In: Vol F138033.
IEEE; 2018:185-194. doi:10.1145/3209108.3209191'
apa: 'Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger,
F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS
(Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science,
Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik
Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination
Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191.
ieee: 'T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger,
“Efficient algorithms for asymptotic bounds on termination time in VASS,” presented
at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033,
pp. 185–194.'
ista: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient
algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer
Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.'
mla: Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination
Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
short: T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:,
IEEE, 2018, pp. 185–194.
conference:
end_date: 2018-07-12
location: Oxford, United Kingdom
name: 'LICS: Logic in Computer Science'
start_date: 2018-07-09
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-09T00:00:00Z
date_updated: 2025-06-04T08:04:55Z
day: '09'
department:
- _id: KrCh
doi: 10.1145/3209108.3209191
ec_funded: 1
external_id:
arxiv:
- '1804.10985'
isi:
- '000545262800020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.10985
month: '07'
oa: 1
oa_version: Preprint
page: 185 - 194
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_identifier:
isbn:
- 978-1-4503-5583-4
publication_status: published
publisher: IEEE
publist_id: '7780'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient algorithms for asymptotic bounds on termination time in VASS
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: F138033
year: '2018'
...