---
_id: '10574'
abstract:
- lang: eng
text: 'The understanding of material appearance perception is a complex problem
due to interactions between material reflectance, surface geometry, and illumination.
Recently, Serrano et al. collected the largest dataset to date with subjective
ratings of material appearance attributes, including glossiness, metallicness,
sharpness and contrast of reflections. In this work, we make use of their dataset
to investigate for the first time the impact of the interactions between illumination,
geometry, and eight different material categories in perceived appearance attributes.
After an initial analysis, we select for further analysis the four material categories
that cover the largest range for all perceptual attributes: fabric, plastic, ceramic,
and metal. Using a cumulative link mixed model (CLMM) for robust regression, we
discover interactions between these material categories and four representative
illuminations and object geometries. We believe that our findings contribute to
expanding the knowledge on material appearance perception and can be useful for
many applications, such as scene design, where any particular material in a given
shape can be aligned with dominant classes of illumination, so that a desired
strength of appearance attributes can be achieved.'
acknowledgement: This project has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Sklodowska-Curie, grant agreement
N∘ 765911 (RealVision) and from the European Research Council (ERC), grant agreement
N∘ 804226 (PERDY). Open Access funding enabled and organized by Projekt DEAL.
article_processing_charge: Yes
article_type: original
author:
- first_name: Bin
full_name: Chen, Bin
last_name: Chen
- first_name: Chao
full_name: Wang, Chao
last_name: Wang
- first_name: Michael
full_name: Piovarci, Michael
id: 62E473F4-5C99-11EA-A40E-AF823DDC885E
last_name: Piovarci
orcid: 0000-0002-5062-4474
- first_name: Hans Peter
full_name: Seidel, Hans Peter
last_name: Seidel
- first_name: Piotr
full_name: Didyk, Piotr
last_name: Didyk
- first_name: Karol
full_name: Myszkowski, Karol
last_name: Myszkowski
- first_name: Ana
full_name: Serrano, Ana
last_name: Serrano
citation:
ama: Chen B, Wang C, Piovarci M, et al. The effect of geometry and illumination
on appearance perception of different material categories. Visual Computer.
2021;37(12):2975-2987. doi:10.1007/s00371-021-02227-x
apa: Chen, B., Wang, C., Piovarci, M., Seidel, H. P., Didyk, P., Myszkowski, K.,
& Serrano, A. (2021). The effect of geometry and illumination on appearance
perception of different material categories. Visual Computer. Springer
Nature. https://doi.org/10.1007/s00371-021-02227-x
chicago: Chen, Bin, Chao Wang, Michael Piovarci, Hans Peter Seidel, Piotr Didyk,
Karol Myszkowski, and Ana Serrano. “The Effect of Geometry and Illumination on
Appearance Perception of Different Material Categories.” Visual Computer.
Springer Nature, 2021. https://doi.org/10.1007/s00371-021-02227-x.
ieee: B. Chen et al., “The effect of geometry and illumination on appearance
perception of different material categories,” Visual Computer, vol. 37,
no. 12. Springer Nature, pp. 2975–2987, 2021.
ista: Chen B, Wang C, Piovarci M, Seidel HP, Didyk P, Myszkowski K, Serrano A. 2021.
The effect of geometry and illumination on appearance perception of different
material categories. Visual Computer. 37(12), 2975–2987.
mla: Chen, Bin, et al. “The Effect of Geometry and Illumination on Appearance Perception
of Different Material Categories.” Visual Computer, vol. 37, no. 12, Springer
Nature, 2021, pp. 2975–87, doi:10.1007/s00371-021-02227-x.
short: B. Chen, C. Wang, M. Piovarci, H.P. Seidel, P. Didyk, K. Myszkowski, A. Serrano,
Visual Computer 37 (2021) 2975–2987.
date_created: 2021-12-26T23:01:26Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2023-08-17T06:29:34Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1007/s00371-021-02227-x
external_id:
isi:
- '000673536600003'
file:
- access_level: open_access
checksum: 244cfcac0479ca6e3444c098ab2860a1
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-27T13:51:08Z
date_updated: 2021-12-27T13:51:08Z
file_id: '10578'
file_name: 2021_VisComput_Chen.pdf
file_size: 5741094
relation: main_file
success: 1
file_date_updated: 2021-12-27T13:51:08Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '12'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 2975-2987
publication: Visual Computer
publication_identifier:
eissn:
- 1432-2315
issn:
- 0178-2789
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The effect of geometry and illumination on appearance perception of different
material categories
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: 37
year: '2021'
...
---
_id: '10575'
abstract:
- lang: eng
text: The choice of the boundary conditions in mechanical problems has to reflect
the interaction of the considered material with the surface. Still the assumption
of the no-slip condition is preferred in order to avoid boundary terms in the
analysis and slipping effects are usually overlooked. Besides the “static slip
models”, there are phenomena that are not accurately described by them, e.g. at
the moment when the slip changes rapidly, the wall shear stress and the slip can
exhibit a sudden overshoot and subsequent relaxation. When these effects become
significant, the so-called dynamic slip phenomenon occurs. We develop a mathematical
analysis of Navier–Stokes-like problems with a dynamic slip boundary condition,
which requires a proper generalization of the Gelfand triplet and the corresponding
function space setting.
acknowledgement: The research of A. Abbatiello is supported by Einstein Foundation,
Berlin. A. Abbatiello is also member of the Italian National Group for the Mathematical
Physics (GNFM) of INdAM. M. Bulíček acknowledges the support of the project No.
20-11027X financed by Czech Science Foundation (GACR). M. Bulíček is member of the
Jindřich Nečas Center for Mathematical Modelling. E. Maringová acknowledges support
from Charles University Research program UNCE/SCI/023, the grant SVV-2020-260583
by the Ministry of Education, Youth and Sports, Czech Republic and from the Austrian
Science Fund (FWF), grants P30000, W1245, and F65.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Anna
full_name: Abbatiello, Anna
last_name: Abbatiello
- first_name: Miroslav
full_name: Bulíček, Miroslav
last_name: Bulíček
- first_name: Erika
full_name: Maringová, Erika
id: dbabca31-66eb-11eb-963a-fb9c22c880b4
last_name: Maringová
citation:
ama: Abbatiello A, Bulíček M, Maringová E. On the dynamic slip boundary condition
for Navier-Stokes-like problems. Mathematical Models and Methods in Applied
Sciences. 2021;31(11):2165-2212. doi:10.1142/S0218202521500470
apa: Abbatiello, A., Bulíček, M., & Maringová, E. (2021). On the dynamic slip
boundary condition for Navier-Stokes-like problems. Mathematical Models and
Methods in Applied Sciences. World Scientific Publishing. https://doi.org/10.1142/S0218202521500470
chicago: Abbatiello, Anna, Miroslav Bulíček, and Erika Maringová. “On the Dynamic
Slip Boundary Condition for Navier-Stokes-like Problems.” Mathematical Models
and Methods in Applied Sciences. World Scientific Publishing, 2021. https://doi.org/10.1142/S0218202521500470.
ieee: A. Abbatiello, M. Bulíček, and E. Maringová, “On the dynamic slip boundary
condition for Navier-Stokes-like problems,” Mathematical Models and Methods
in Applied Sciences, vol. 31, no. 11. World Scientific Publishing, pp. 2165–2212,
2021.
ista: Abbatiello A, Bulíček M, Maringová E. 2021. On the dynamic slip boundary condition
for Navier-Stokes-like problems. Mathematical Models and Methods in Applied Sciences.
31(11), 2165–2212.
mla: Abbatiello, Anna, et al. “On the Dynamic Slip Boundary Condition for Navier-Stokes-like
Problems.” Mathematical Models and Methods in Applied Sciences, vol. 31,
no. 11, World Scientific Publishing, 2021, pp. 2165–212, doi:10.1142/S0218202521500470.
short: A. Abbatiello, M. Bulíček, E. Maringová, Mathematical Models and Methods
in Applied Sciences 31 (2021) 2165–2212.
date_created: 2021-12-26T23:01:27Z
date_published: 2021-10-13T00:00:00Z
date_updated: 2023-08-17T06:29:01Z
day: '13'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1142/S0218202521500470
external_id:
arxiv:
- '2009.09057'
isi:
- '000722309400001'
file:
- access_level: open_access
checksum: 8c0a9396335f0b70e1f5cbfe450a987a
content_type: application/pdf
creator: dernst
date_created: 2022-05-16T10:55:45Z
date_updated: 2022-05-16T10:55:45Z
file_id: '11385'
file_name: 2021_MathModelsMethods_Abbatiello.pdf
file_size: 795483
relation: main_file
success: 1
file_date_updated: 2022-05-16T10:55:45Z
has_accepted_license: '1'
intvolume: ' 31'
isi: 1
issue: '11'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 2165-2212
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
- _id: 260788DE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
name: Dissipation and Dispersion in Nonlinear Partial Differential Equations
publication: Mathematical Models and Methods in Applied Sciences
publication_identifier:
eissn:
- 1793-6314
issn:
- 0218-2025
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the dynamic slip boundary condition for Navier-Stokes-like problems
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 31
year: '2021'
...
---
_id: '10579'
abstract:
- lang: eng
text: 'We consider a totally asymmetric simple exclusion process (TASEP) consisting
of particles on a lattice that require binding by a "token" to move. Using a combination
of theory and simulations, we address the following questions: (i) How token binding
kinetics affects the current-density relation; (ii) How the current-density relation
depends on the scarcity of tokens; (iii) How tokens propagate the effects of the
locally-imposed disorder (such a slow site) over the entire lattice; (iv) How
a shared pool of tokens couples concurrent TASEPs running on multiple lattices;
(v) How our results translate to TASEPs with open boundaries that exchange particles
with the reservoir. Since real particle motion (including in systems that inspired
the standard TASEP model, e.g., protein synthesis or movement of molecular motors)
is often catalyzed, regulated, actuated, or otherwise mediated, the token-driven
TASEP dynamics analyzed in this paper should allow for a better understanding
of real systems and enable a closer match between TASEP theory and experimental
observations.'
acknowledgement: B.K. thanks Stefano Elefante, Simon Rella, and Michal Hledík for
their help with the usage of the cluster. B.K. additionally thanks Călin Guet and
his group for help and advice. We thank M. Hennessey-Wesen for constructive comments
on the manuscript. We thank Ankita Gupta (Indian Institute of Technology) for spotting
a typographical error in Eq. (49) in the preprint version of this paper.
article_number: '2112.13558'
article_processing_charge: No
arxiv: 1
author:
- first_name: Bor
full_name: Kavcic, Bor
id: 350F91D2-F248-11E8-B48F-1D18A9856A87
last_name: Kavcic
orcid: 0000-0001-6041-254X
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Kavcic B, Tkačik G. Token-driven totally asymmetric simple exclusion process.
arXiv. doi:10.48550/arXiv.2112.13558
apa: Kavcic, B., & Tkačik, G. (n.d.). Token-driven totally asymmetric simple
exclusion process. arXiv. https://doi.org/10.48550/arXiv.2112.13558
chicago: Kavcic, Bor, and Gašper Tkačik. “Token-Driven Totally Asymmetric Simple
Exclusion Process.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2112.13558.
ieee: B. Kavcic and G. Tkačik, “Token-driven totally asymmetric simple exclusion
process,” arXiv. .
ista: Kavcic B, Tkačik G. Token-driven totally asymmetric simple exclusion process.
arXiv, 2112.13558.
mla: Kavcic, Bor, and Gašper Tkačik. “Token-Driven Totally Asymmetric Simple Exclusion
Process.” ArXiv, 2112.13558, doi:10.48550/arXiv.2112.13558.
short: B. Kavcic, G. Tkačik, ArXiv (n.d.).
date_created: 2021-12-28T06:52:09Z
date_published: 2021-12-27T00:00:00Z
date_updated: 2023-05-03T10:54:05Z
day: '27'
ddc:
- '530'
department:
- _id: GaTk
doi: 10.48550/arXiv.2112.13558
external_id:
arxiv:
- '2112.13558'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2112.13558
month: '12'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Token-driven totally asymmetric simple exclusion process
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10585'
abstract:
- lang: eng
text: Recently it was shown that anyons on the two-sphere naturally arise from a
system of molecular impurities exchanging angular momentum with a many-particle
bath (Phys. Rev. Lett. 126, 015301 (2021)). Here we further advance this approach
and rigorously demonstrate that in the experimentally realized regime the lowest
spectrum of two linear molecules immersed in superfluid helium corresponds to
the spectrum of two anyons on the sphere. We develop the formalism within the
framework of the recently experimentally observed angulon quasiparticle
acknowledgement: D. Lundholm acknowledges financial support from the Göran Gustafsson
Foundation (grant no. 1804).
article_number: '106'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Morris
full_name: Brooks, Morris
id: B7ECF9FC-AA38-11E9-AC9A-0930E6697425
last_name: Brooks
orcid: 0000-0002-6249-0928
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Douglas
full_name: Lundholm, Douglas
last_name: Lundholm
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
citation:
ama: Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. Emergence of anyons on the two-sphere
in molecular impurities. Atoms. 2021;9(4). doi:10.3390/atoms9040106
apa: Brooks, M., Lemeshko, M., Lundholm, D., & Yakaboylu, E. (2021). Emergence
of anyons on the two-sphere in molecular impurities. Atoms. MDPI. https://doi.org/10.3390/atoms9040106
chicago: Brooks, Morris, Mikhail Lemeshko, Douglas Lundholm, and Enderalp Yakaboylu.
“Emergence of Anyons on the Two-Sphere in Molecular Impurities.” Atoms.
MDPI, 2021. https://doi.org/10.3390/atoms9040106.
ieee: M. Brooks, M. Lemeshko, D. Lundholm, and E. Yakaboylu, “Emergence of anyons
on the two-sphere in molecular impurities,” Atoms, vol. 9, no. 4. MDPI,
2021.
ista: Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. 2021. Emergence of anyons on
the two-sphere in molecular impurities. Atoms. 9(4), 106.
mla: Brooks, Morris, et al. “Emergence of Anyons on the Two-Sphere in Molecular
Impurities.” Atoms, vol. 9, no. 4, 106, MDPI, 2021, doi:10.3390/atoms9040106.
short: M. Brooks, M. Lemeshko, D. Lundholm, E. Yakaboylu, Atoms 9 (2021).
date_created: 2022-01-02T23:01:33Z
date_published: 2021-12-02T00:00:00Z
date_updated: 2023-06-15T14:51:49Z
day: '02'
ddc:
- '530'
department:
- _id: MiLe
- _id: RoSe
doi: 10.3390/atoms9040106
external_id:
arxiv:
- '2108.06966'
file:
- access_level: open_access
checksum: d0e44b95f36c9e06724f66832af0f8c3
content_type: application/pdf
creator: alisjak
date_created: 2022-01-03T10:15:05Z
date_updated: 2022-01-03T10:15:05Z
file_id: '10592'
file_name: 2021_Atoms_Brooks.pdf
file_size: 303070
relation: main_file
success: 1
file_date_updated: 2022-01-03T10:15:05Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '4'
keyword:
- anyons
- quasiparticles
- Quantum Hall Effect
- topological states of matter
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: Atoms
publication_identifier:
eissn:
- 2218-2004
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Emergence of anyons on the two-sphere in molecular impurities
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2021'
...
---
_id: '10586'
abstract:
- lang: eng
text: A facile approach for developing an interfacial solar evaporator by heat localization
of solar-thermal energy conversion at water-air liquid composed by in-situ polymerization
of Fe2O3 nanoparticles (Fe2O3@PPy) deposited over a facial sponge is proposed.
The demonstrated system consists of a floating solar receiver having a vertically
cross-linked microchannel for wicking up saline water. The in situ polymerized
Fe2O3@PPy interfacial layer promotes diffuse reflection and its rough black surface
allows Omni-directional solar absorption (94%) and facilitates efficient thermal
localization at the water/air interface and offers a defect-rich surface to promote
heat localization (41.9 °C) and excellent thermal management due to cellulosic
content. The self-floating composite foam reveals continuous vapors generation
at a rate of 1.52 kg m−2 h−1 under one 1 kW m−2 and profound evaporating efficiency
(95%) without heat losses that dissipates in its surroundings. Indeed, long-term
evaporation experiments reveal the negligible disparity in continuous evaporation
rate (33.84 kg m−2/8.3 h) receiving two sun solar intensity, and ensures the stability
of the device under intense seawater conditions synchronized with excellent salt
rejection potential. More importantly, Raman spectroscopy investigation validates
the orange dye rejection via Fe2O3@PPy solar evaporator. The combined advantages
of high efficiency, self-floating capability, multimedia rejection, low cost,
and this configuration are promising for producing large-scale solar steam generating
systems appropriate for commercial clean water yield due to their scalable fabrication.
acknowledgement: The authors extend their appreciation to King Saud University for
funding this work through Researchers Supporting Project number (RSP-2021/387),
King Saud University, Riyadh, Saudi Arabia.
alternative_title:
- Hybrid and Composite Crystalline Materials
article_number: '1509'
article_processing_charge: No
article_type: original
author:
- first_name: Yuzheng
full_name: Lu, Yuzheng
last_name: Lu
- first_name: Naila
full_name: Arshad, Naila
last_name: Arshad
- first_name: Muhammad Sultan
full_name: Irshad, Muhammad Sultan
last_name: Irshad
- first_name: Iftikhar
full_name: Ahmed, Iftikhar
last_name: Ahmed
- first_name: Shafiq
full_name: Ahmad, Shafiq
last_name: Ahmad
- first_name: Lina Abdullah
full_name: Alshahrani, Lina Abdullah
last_name: Alshahrani
- first_name: Muhammad
full_name: Yousaf, Muhammad
last_name: Yousaf
- first_name: Abdelaty Edrees
full_name: Sayed, Abdelaty Edrees
last_name: Sayed
- first_name: Muhammad
full_name: Nauman, Muhammad
id: 32c21954-2022-11eb-9d5f-af9f93c24e71
last_name: Nauman
orcid: 0000-0002-2111-4846
citation:
ama: Lu Y, Arshad N, Irshad MS, et al. Fe2O3 nanoparticles deposited over self-floating
facial sponge for facile interfacial seawater solar desalination. Crystals.
2021;11(12). doi:10.3390/cryst11121509
apa: Lu, Y., Arshad, N., Irshad, M. S., Ahmed, I., Ahmad, S., Alshahrani, L. A.,
… Nauman, M. (2021). Fe2O3 nanoparticles deposited over self-floating facial sponge
for facile interfacial seawater solar desalination. Crystals. MDPI. https://doi.org/10.3390/cryst11121509
chicago: Lu, Yuzheng, Naila Arshad, Muhammad Sultan Irshad, Iftikhar Ahmed, Shafiq
Ahmad, Lina Abdullah Alshahrani, Muhammad Yousaf, Abdelaty Edrees Sayed, and Muhammad
Nauman. “Fe2O3 Nanoparticles Deposited over Self-Floating Facial Sponge for Facile
Interfacial Seawater Solar Desalination.” Crystals. MDPI, 2021. https://doi.org/10.3390/cryst11121509.
ieee: Y. Lu et al., “Fe2O3 nanoparticles deposited over self-floating facial
sponge for facile interfacial seawater solar desalination,” Crystals, vol.
11, no. 12. MDPI, 2021.
ista: Lu Y, Arshad N, Irshad MS, Ahmed I, Ahmad S, Alshahrani LA, Yousaf M, Sayed
AE, Nauman M. 2021. Fe2O3 nanoparticles deposited over self-floating facial sponge
for facile interfacial seawater solar desalination. Crystals. 11(12), 1509.
mla: Lu, Yuzheng, et al. “Fe2O3 Nanoparticles Deposited over Self-Floating Facial
Sponge for Facile Interfacial Seawater Solar Desalination.” Crystals, vol.
11, no. 12, 1509, MDPI, 2021, doi:10.3390/cryst11121509.
short: Y. Lu, N. Arshad, M.S. Irshad, I. Ahmed, S. Ahmad, L.A. Alshahrani, M. Yousaf,
A.E. Sayed, M. Nauman, Crystals 11 (2021).
date_created: 2022-01-02T23:01:34Z
date_published: 2021-12-03T00:00:00Z
date_updated: 2023-08-17T06:31:20Z
day: '03'
ddc:
- '620'
department:
- _id: KiMo
doi: 10.3390/cryst11121509
external_id:
isi:
- '000736602200001'
file:
- access_level: open_access
checksum: 668e9d777608ce0a3bc2e305133bd06b
content_type: application/pdf
creator: alisjak
date_created: 2022-01-03T09:46:53Z
date_updated: 2022-01-03T09:46:53Z
file_id: '10591'
file_name: 2021_Crystals_Yuzheng.pdf
file_size: 4569639
relation: main_file
success: 1
file_date_updated: 2022-01-03T09:46:53Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: Crystals
publication_identifier:
eissn:
- 2073-4352
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fe2O3 nanoparticles deposited over self-floating facial sponge for facile interfacial
seawater solar desalination
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: 11
year: '2021'
...
---
_id: '10593'
abstract:
- lang: eng
text: 'We study the problem of estimating a rank-$1$ signal in the presence of rotationally
invariant noise-a class of perturbations more general than Gaussian noise. Principal
Component Analysis (PCA) provides a natural estimator, and sharp results on its
performance have been obtained in the high-dimensional regime. Recently, an Approximate
Message Passing (AMP) algorithm has been proposed as an alternative estimator
with the potential to improve the accuracy of PCA. However, the existing analysis
of AMP requires an initialization that is both correlated with the signal and
independent of the noise, which is often unrealistic in practice. In this work,
we combine the two methods, and propose to initialize AMP with PCA. Our main result
is a rigorous asymptotic characterization of the performance of this estimator.
Both the AMP algorithm and its analysis differ from those previously derived in
the Gaussian setting: at every iteration, our AMP algorithm requires a specific
term to account for PCA initialization, while in the Gaussian case, PCA initialization
affects only the first iteration of AMP. The proof is based on a two-phase artificial
AMP that first approximates the PCA estimator and then mimics the true AMP. Our
numerical simulations show an excellent agreement between AMP results and theoretical
predictions, and suggest an interesting open direction on achieving Bayes-optimal
performance.'
acknowledgement: "M. Mondelli would like to thank László Erdős for helpful discussions.
M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan
was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Ramji
full_name: Venkataramanan, Ramji
last_name: Venkataramanan
citation:
ama: 'Mondelli M, Venkataramanan R. PCA initialization for approximate message passing
in rotationally invariant models. In: 35th Conference on Neural Information
Processing Systems. Vol 35. Neural Information Processing Systems Foundation;
2021:29616-29629.'
apa: 'Mondelli, M., & Venkataramanan, R. (2021). PCA initialization for approximate
message passing in rotationally invariant models. In 35th Conference on Neural
Information Processing Systems (Vol. 35, pp. 29616–29629). Virtual: Neural
Information Processing Systems Foundation.'
chicago: Mondelli, Marco, and Ramji Venkataramanan. “PCA Initialization for Approximate
Message Passing in Rotationally Invariant Models.” In 35th Conference on Neural
Information Processing Systems, 35:29616–29. Neural Information Processing
Systems Foundation, 2021.
ieee: M. Mondelli and R. Venkataramanan, “PCA initialization for approximate message
passing in rotationally invariant models,” in 35th Conference on Neural Information
Processing Systems, Virtual, 2021, vol. 35, pp. 29616–29629.
ista: 'Mondelli M, Venkataramanan R. 2021. PCA initialization for approximate message
passing in rotationally invariant models. 35th Conference on Neural Information
Processing Systems. NeurIPS: Neural Information Processing Systems vol. 35, 29616–29629.'
mla: Mondelli, Marco, and Ramji Venkataramanan. “PCA Initialization for Approximate
Message Passing in Rotationally Invariant Models.” 35th Conference on Neural
Information Processing Systems, vol. 35, Neural Information Processing Systems
Foundation, 2021, pp. 29616–29.
short: M. Mondelli, R. Venkataramanan, in:, 35th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2021, pp.
29616–29629.
conference:
end_date: 2021-12-14
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
date_created: 2022-01-03T10:50:02Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2024-09-10T13:03:19Z
day: '01'
department:
- _id: MaMo
external_id:
arxiv:
- '2106.02356'
intvolume: ' 35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2106.02356
month: '12'
oa: 1
oa_version: Preprint
page: 29616-29629
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: PCA initialization for approximate message passing in rotationally invariant
models
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10594'
abstract:
- lang: eng
text: 'The question of how and why the phenomenon of mode connectivity occurs in
training deep neural networks has gained remarkable attention in the research
community. From a theoretical perspective, two possible explanations have been
proposed: (i) the loss function has connected sublevel sets, and (ii) the solutions
found by stochastic gradient descent are dropout stable. While these explanations
provide insights into the phenomenon, their assumptions are not always satisfied
in practice. In particular, the first approach requires the network to have one
layer with order of N neurons (N being the number of training samples), while
the second one requires the loss to be almost invariant after removing half of
the neurons at each layer (up to some rescaling of the remaining ones). In this
work, we improve both conditions by exploiting the quality of the features at
every intermediate layer together with a milder over-parameterization condition.
More specifically, we show that: (i) under generic assumptions on the features
of intermediate layers, it suffices that the last two hidden layers have order
of N−−√ neurons, and (ii) if subsets of features at each layer are linearly separable,
then no over-parameterization is needed to show the connectivity. Our experiments
confirm that the proposed condition ensures the connectivity of solutions found
by stochastic gradient descent, even in settings where the previous requirements
do not hold.'
acknowledgement: MM was partially supported by the 2019 Lopez-Loreta Prize. QN and
PB acknowledge support from the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme (grant agreement no 757983).
article_processing_charge: No
arxiv: 1
author:
- first_name: Quynh
full_name: Nguyen, Quynh
last_name: Nguyen
- first_name: Pierre
full_name: Bréchet, Pierre
last_name: Bréchet
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Nguyen Q, Bréchet P, Mondelli M. When are solutions connected in deep networks?
In: 35th Conference on Neural Information Processing Systems. Vol 35. Neural
Information Processing Systems Foundation; 2021.'
apa: 'Nguyen, Q., Bréchet, P., & Mondelli, M. (2021). When are solutions connected
in deep networks? In 35th Conference on Neural Information Processing Systems
(Vol. 35). Virtual: Neural Information Processing Systems Foundation.'
chicago: Nguyen, Quynh, Pierre Bréchet, and Marco Mondelli. “When Are Solutions
Connected in Deep Networks?” In 35th Conference on Neural Information Processing
Systems, Vol. 35. Neural Information Processing Systems Foundation, 2021.
ieee: Q. Nguyen, P. Bréchet, and M. Mondelli, “When are solutions connected in deep
networks?,” in 35th Conference on Neural Information Processing Systems,
Virtual, 2021, vol. 35.
ista: Nguyen Q, Bréchet P, Mondelli M. 2021. When are solutions connected in deep
networks? 35th Conference on Neural Information Processing Systems. 35th Conference
on Neural Information Processing Systems vol. 35.
mla: Nguyen, Quynh, et al. “When Are Solutions Connected in Deep Networks?” 35th
Conference on Neural Information Processing Systems, vol. 35, Neural Information
Processing Systems Foundation, 2021.
short: Q. Nguyen, P. Bréchet, M. Mondelli, in:, 35th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2021.
conference:
end_date: 2021-12-14
location: Virtual
name: 35th Conference on Neural Information Processing Systems
start_date: 2021-12-06
date_created: 2022-01-03T10:56:20Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2024-09-10T13:03:19Z
day: '01'
department:
- _id: MaMo
external_id:
arxiv:
- '2102.09671'
intvolume: ' 35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.09671
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: When are solutions connected in deep networks?
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10595'
abstract:
- lang: eng
text: 'A recent line of work has analyzed the theoretical properties of deep neural
networks via the Neural Tangent Kernel (NTK). In particular, the smallest eigenvalue
of the NTK has been related to the memorization capacity, the global convergence
of gradient descent algorithms and the generalization of deep nets. However, existing
results either provide bounds in the two-layer setting or assume that the spectrum
of the NTK matrices is bounded away from 0 for multi-layer networks. In this paper,
we provide tight bounds on the smallest eigenvalue of NTK matrices for deep ReLU
nets, both in the limiting case of infinite widths and for finite widths. In the
finite-width setting, the network architectures we consider are fairly general:
we require the existence of a wide layer with roughly order of $N$ neurons, $N$
being the number of data samples; and the scaling of the remaining layer widths
is arbitrary (up to logarithmic factors). To obtain our results, we analyze various
quantities of independent interest: we give lower bounds on the smallest singular
value of hidden feature matrices, and upper bounds on the Lipschitz constant of
input-output feature maps.'
acknowledgement: "The authors would like to thank the anonymous reviewers for their
helpful comments. MM was partially supported\r\nby the 2019 Lopez-Loreta Prize.
QN and GM acknowledge support from the European Research Council (ERC) under\r\nthe
European Union’s Horizon 2020 research and innovation programme (grant agreement
no 757983)."
alternative_title:
- Proceedings of Machine Learning Research
article_processing_charge: No
arxiv: 1
author:
- first_name: Quynh
full_name: Nguyen, Quynh
last_name: Nguyen
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Guido F
full_name: Montufar, Guido F
last_name: Montufar
citation:
ama: 'Nguyen Q, Mondelli M, Montufar GF. Tight bounds on the smallest eigenvalue
of the neural tangent kernel for deep ReLU networks. In: Meila M, Zhang T, eds.
Proceedings of the 38th International Conference on Machine Learning. Vol
139. ML Research Press; 2021:8119-8129.'
apa: 'Nguyen, Q., Mondelli, M., & Montufar, G. F. (2021). Tight bounds on the
smallest eigenvalue of the neural tangent kernel for deep ReLU networks. In M.
Meila & T. Zhang (Eds.), Proceedings of the 38th International Conference
on Machine Learning (Vol. 139, pp. 8119–8129). Virtual: ML Research Press.'
chicago: Nguyen, Quynh, Marco Mondelli, and Guido F Montufar. “Tight Bounds on the
Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks.” In Proceedings
of the 38th International Conference on Machine Learning, edited by Marina
Meila and Tong Zhang, 139:8119–29. ML Research Press, 2021.
ieee: Q. Nguyen, M. Mondelli, and G. F. Montufar, “Tight bounds on the smallest
eigenvalue of the neural tangent kernel for deep ReLU networks,” in Proceedings
of the 38th International Conference on Machine Learning, Virtual, 2021, vol.
139, pp. 8119–8129.
ista: 'Nguyen Q, Mondelli M, Montufar GF. 2021. Tight bounds on the smallest eigenvalue
of the neural tangent kernel for deep ReLU networks. Proceedings of the 38th International
Conference on Machine Learning. ICML: International Conference on Machine Learning,
Proceedings of Machine Learning Research, vol. 139, 8119–8129.'
mla: Nguyen, Quynh, et al. “Tight Bounds on the Smallest Eigenvalue of the Neural
Tangent Kernel for Deep ReLU Networks.” Proceedings of the 38th International
Conference on Machine Learning, edited by Marina Meila and Tong Zhang, vol.
139, ML Research Press, 2021, pp. 8119–29.
short: Q. Nguyen, M. Mondelli, G.F. Montufar, in:, M. Meila, T. Zhang (Eds.), Proceedings
of the 38th International Conference on Machine Learning, ML Research Press, 2021,
pp. 8119–8129.
conference:
end_date: 2021-07-24
location: Virtual
name: 'ICML: International Conference on Machine Learning'
start_date: 2021-07-18
date_created: 2022-01-03T10:57:49Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2024-09-10T13:03:17Z
department:
- _id: MaMo
editor:
- first_name: Marina
full_name: Meila, Marina
last_name: Meila
- first_name: Tong
full_name: Zhang, Tong
last_name: Zhang
external_id:
arxiv:
- '2012.11654'
intvolume: ' 139'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://proceedings.mlr.press/v139/nguyen21g.html
oa: 1
oa_version: Published Version
page: 8119-8129
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of the 38th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep
ReLU networks
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 139
year: '2021'
...
---
_id: '10597'
abstract:
- lang: eng
text: We thank Emmanuel Abbe and Min Ye for providing us the implementation of RPA
decoding. D. Fathollahi and M. Mondelli are partially supported by the 2019 Lopez-Loreta
Prize. N. Farsad is supported by Discovery Grant from the Natural Sciences and
Engineering Research Council of Canada (NSERC) and Canada Foundation for Innovation
(CFI), John R. Evans Leader Fund. S. A. Hashemi is supported by a Postdoctoral
Fellowship from NSERC.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorsa
full_name: Fathollahi, Dorsa
last_name: Fathollahi
- first_name: Nariman
full_name: Farsad, Nariman
last_name: Farsad
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Fathollahi D, Farsad N, Hashemi SA, Mondelli M. Sparse multi-decoder recursive
projection aggregation for Reed-Muller codes. In: 2021 IEEE International Symposium
on Information Theory. Institute of Electrical and Electronics Engineers;
2021:1082-1087. doi:10.1109/isit45174.2021.9517887'
apa: 'Fathollahi, D., Farsad, N., Hashemi, S. A., & Mondelli, M. (2021). Sparse
multi-decoder recursive projection aggregation for Reed-Muller codes. In 2021
IEEE International Symposium on Information Theory (pp. 1082–1087). Virtual,
Melbourne, Australia: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/isit45174.2021.9517887'
chicago: Fathollahi, Dorsa, Nariman Farsad, Seyyed Ali Hashemi, and Marco Mondelli.
“Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.”
In 2021 IEEE International Symposium on Information Theory, 1082–87. Institute
of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/isit45174.2021.9517887.
ieee: D. Fathollahi, N. Farsad, S. A. Hashemi, and M. Mondelli, “Sparse multi-decoder
recursive projection aggregation for Reed-Muller codes,” in 2021 IEEE International
Symposium on Information Theory, Virtual, Melbourne, Australia, 2021, pp.
1082–1087.
ista: 'Fathollahi D, Farsad N, Hashemi SA, Mondelli M. 2021. Sparse multi-decoder
recursive projection aggregation for Reed-Muller codes. 2021 IEEE International
Symposium on Information Theory. ISIT: International Symposium on Information
Theory, 1082–1087.'
mla: Fathollahi, Dorsa, et al. “Sparse Multi-Decoder Recursive Projection Aggregation
for Reed-Muller Codes.” 2021 IEEE International Symposium on Information Theory,
Institute of Electrical and Electronics Engineers, 2021, pp. 1082–87, doi:10.1109/isit45174.2021.9517887.
short: D. Fathollahi, N. Farsad, S.A. Hashemi, M. Mondelli, in:, 2021 IEEE International
Symposium on Information Theory, Institute of Electrical and Electronics Engineers,
2021, pp. 1082–1087.
conference:
end_date: 2021-07-20
location: Virtual, Melbourne, Australia
name: 'ISIT: International Symposium on Information Theory'
start_date: 2021-07-12
date_created: 2022-01-03T11:31:26Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-09-10T13:03:18Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/isit45174.2021.9517887
external_id:
arxiv:
- '2011.12882'
isi:
- '000701502201029'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2011.12882
month: '09'
oa: 1
oa_version: Preprint
page: 1082-1087
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 2021 IEEE International Symposium on Information Theory
publication_identifier:
eisbn:
- 978-1-5386-8209-8
isbn:
- 978-1-5386-8210-4
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sparse multi-decoder recursive projection aggregation for Reed-Muller codes
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10598'
abstract:
- lang: eng
text: ' We consider the problem of estimating a signal from measurements obtained
via a generalized linear model. We focus on estimators based on approximate message
passing (AMP), a family of iterative algorithms with many appealing features:
the performance of AMP in the high-dimensional limit can be succinctly characterized
under suitable model assumptions; AMP can also be tailored to the empirical distribution
of the signal entries, and for a wide class of estimation problems, AMP is conjectured
to be optimal among all polynomial-time algorithms. However, a major issue of
AMP is that in many models (such as phase retrieval), it requires an initialization
correlated with the ground-truth signal and independent from the measurement matrix.
Assuming that such an initialization is available is typically not realistic.
In this paper, we solve this problem by proposing an AMP algorithm initialized
with a spectral estimator. With such an initialization, the standard AMP analysis
fails since the spectral estimator depends in a complicated way on the design
matrix. Our main contribution is a rigorous characterization of the performance
of AMP with spectral initialization in the high-dimensional limit. The key technical
idea is to define and analyze a two-phase artificial AMP algorithm that first
produces the spectral estimator, and then closely approximates the iterates of
the true AMP. We also provide numerical results that demonstrate the validity
of the proposed approach. '
acknowledgement: The authors would like to thank Andrea Montanari for helpful discussions.
M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan
was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1.
alternative_title:
- Proceedings of Machine Learning Research
article_processing_charge: Yes (via OA deal)
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Ramji
full_name: Venkataramanan, Ramji
last_name: Venkataramanan
citation:
ama: 'Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization
for generalized linear models. In: Banerjee A, Fukumizu K, eds. Proceedings
of The 24th International Conference on Artificial Intelligence and Statistics.
Vol 130. ML Research Press; 2021:397-405.'
apa: 'Mondelli, M., & Venkataramanan, R. (2021). Approximate message passing
with spectral initialization for generalized linear models. In A. Banerjee &
K. Fukumizu (Eds.), Proceedings of The 24th International Conference on Artificial
Intelligence and Statistics (Vol. 130, pp. 397–405). Virtual, San Diego, CA,
United States: ML Research Press.'
chicago: Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing
with Spectral Initialization for Generalized Linear Models.” In Proceedings
of The 24th International Conference on Artificial Intelligence and Statistics,
edited by Arindam Banerjee and Kenji Fukumizu, 130:397–405. ML Research Press,
2021.
ieee: M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral
initialization for generalized linear models,” in Proceedings of The 24th International
Conference on Artificial Intelligence and Statistics, Virtual, San Diego,
CA, United States, 2021, vol. 130, pp. 397–405.
ista: 'Mondelli M, Venkataramanan R. 2021. Approximate message passing with spectral
initialization for generalized linear models. Proceedings of The 24th International
Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence
and Statistics, Proceedings of Machine Learning Research, vol. 130, 397–405.'
mla: Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with
Spectral Initialization for Generalized Linear Models.” Proceedings of The
24th International Conference on Artificial Intelligence and Statistics, edited
by Arindam Banerjee and Kenji Fukumizu, vol. 130, ML Research Press, 2021, pp.
397–405.
short: M. Mondelli, R. Venkataramanan, in:, A. Banerjee, K. Fukumizu (Eds.), Proceedings
of The 24th International Conference on Artificial Intelligence and Statistics,
ML Research Press, 2021, pp. 397–405.
conference:
end_date: 2021-04-15
location: Virtual, San Diego, CA, United States
name: 'AISTATS: Artificial Intelligence and Statistics'
start_date: 2021-04-13
date_created: 2022-01-03T11:34:22Z
date_published: 2021-04-01T00:00:00Z
date_updated: 2024-03-07T10:36:53Z
day: '01'
department:
- _id: MaMo
editor:
- first_name: Arindam
full_name: Banerjee, Arindam
last_name: Banerjee
- first_name: Kenji
full_name: Fukumizu, Kenji
last_name: Fukumizu
external_id:
arxiv:
- '2010.03460'
intvolume: ' 130'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.mlr.press/v130/mondelli21a.html
month: '04'
oa: 1
oa_version: Preprint
page: 397-405
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of The 24th International Conference on Artificial Intelligence
and Statistics
publication_identifier:
issn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
record:
- id: '12480'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Approximate message passing with spectral initialization for generalized linear
models
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 130
year: '2021'
...
---
_id: '10599'
abstract:
- lang: eng
text: A two-part successive syndrome-check decoding of polar codes is proposed with
the first part successively refining the received codeword and the second part
checking its syndrome. A new formulation of the successive-cancellation (SC) decoding
algorithm is presented that allows for successively refining the received codeword
by comparing the log-likelihood ratio value of a frozen bit with its predefined
value. The syndrome of the refined received codeword is then checked for possible
errors. In case there are no errors, the decoding process is terminated. Otherwise,
the decoder continues to refine the received codeword. The proposed method is
extended to the case of SC list (SCL) decoding by terminating the decoding process
when the syndrome of the best candidate in the list indicates no errors. Simulation
results show that the proposed method reduces the time-complexity of SC and SCL
decoders and their fast variants, especially at high signal-to-noise ratios.
acknowledgement: This work is supported in part by ONR grant N00014-18-1-2191. S.
A. Hashemi was supported by a Postdoctoral Fellowship from the Natural Sciences
and Engineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli was
partially supported by the 2019 Lopez-Loreta Prize.
article_processing_charge: No
arxiv: 1
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: John
full_name: Cioffi, John
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: 'Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. Successive syndrome-check decoding
of polar codes. In: Proceedings of the 55th Asilomar Conference on Signals,
Systems, and Computers. Vol 2021-October. Institute of Electrical and Electronics
Engineers; 2021:943-947. doi:10.1109/IEEECONF53345.2021.9723394'
apa: 'Hashemi, S. A., Mondelli, M., Cioffi, J., & Goldsmith, A. (2021). Successive
syndrome-check decoding of polar codes. In Proceedings of the 55th Asilomar
Conference on Signals, Systems, and Computers (Vol. 2021–October, pp. 943–947).
Virtual, Pacific Grove, CA, United States: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/IEEECONF53345.2021.9723394'
chicago: Hashemi, Seyyed Ali, Marco Mondelli, John Cioffi, and Andrea Goldsmith.
“Successive Syndrome-Check Decoding of Polar Codes.” In Proceedings of the
55th Asilomar Conference on Signals, Systems, and Computers, 2021–October:943–47.
Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/IEEECONF53345.2021.9723394.
ieee: S. A. Hashemi, M. Mondelli, J. Cioffi, and A. Goldsmith, “Successive syndrome-check
decoding of polar codes,” in Proceedings of the 55th Asilomar Conference on
Signals, Systems, and Computers, Virtual, Pacific Grove, CA, United States,
2021, vol. 2021–October, pp. 943–947.
ista: 'Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. 2021. Successive syndrome-check
decoding of polar codes. Proceedings of the 55th Asilomar Conference on Signals,
Systems, and Computers. ACSSC: Asilomar Conference on Signals, Systems, and Computers
vol. 2021–October, 943–947.'
mla: Hashemi, Seyyed Ali, et al. “Successive Syndrome-Check Decoding of Polar Codes.”
Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers,
vol. 2021–October, Institute of Electrical and Electronics Engineers, 2021, pp.
943–47, doi:10.1109/IEEECONF53345.2021.9723394.
short: S.A. Hashemi, M. Mondelli, J. Cioffi, A. Goldsmith, in:, Proceedings of the
55th Asilomar Conference on Signals, Systems, and Computers, Institute of Electrical
and Electronics Engineers, 2021, pp. 943–947.
conference:
end_date: 2021-11-03
location: Virtual, Pacific Grove, CA, United States
name: 'ACSSC: Asilomar Conference on Signals, Systems, and Computers'
start_date: 2021-10-31
date_created: 2022-01-03T11:39:51Z
date_published: 2021-11-01T00:00:00Z
date_updated: 2024-09-10T13:03:17Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/IEEECONF53345.2021.9723394
external_id:
arxiv:
- '2112.00057'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2112.00057'
month: '11'
oa: 1
oa_version: Preprint
page: 943-947
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of the 55th Asilomar Conference on Signals, Systems, and
Computers
publication_identifier:
isbn:
- '9781665458283'
issn:
- 1058-6393
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Successive syndrome-check decoding of polar codes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2021-October
year: '2021'
...
---
_id: '10606'
abstract:
- lang: eng
text: Cell division orientation is thought to result from a competition between
cell geometry and polarity domains controlling the position of the mitotic spindle
during mitosis. Depending on the level of cell shape anisotropy or the strength
of the polarity domain, one dominates the other and determines the orientation
of the spindle. Whether and how such competition is also at work to determine
unequal cell division (UCD), producing daughter cells of different size, remains
unclear. Here, we show that cell geometry and polarity domains cooperate, rather
than compete, in positioning the cleavage plane during UCDs in early ascidian
embryos. We found that the UCDs and their orientation at the ascidian third cleavage
rely on the spindle tilting in an anisotropic cell shape, and cortical polarity
domains exerting different effects on spindle astral microtubules. By systematically
varying mitotic cell shape, we could modulate the effect of attractive and repulsive
polarity domains and consequently generate predicted daughter cell size asymmetries
and position. We therefore propose that the spindle position during UCD is set
by the combined activities of cell geometry and polarity domains, where cell geometry
modulates the effect of cortical polarity domain(s).
acknowledged_ssus:
- _id: NanoFab
- _id: Bio
acknowledgement: 'We thank members of the Heisenberg and McDougall groups for technical
advice and discussion. We are grateful to the Bioimaging and Nanofabrication facilities
of IST Austria and the Imaging Platform (PIM) and animal facility (CRB) of Institut
de la Mer de Villefranche (IMEV), which is supported by EMBRC-France, whose French
state funds are managed by the ANR within the Investments of the Future program
under reference ANR-10-INBS-0, for continuous support. This work was supported by
a collaborative grant from the French Government funding agency Agence National
de la Recherche to McDougall (ANR ''MorCell'': ANR-17-CE 13-0028) and the Austrian
Science Fund to Heisenberg (FWF: I 3601-B27).'
article_number: e75639
article_processing_charge: No
article_type: original
author:
- first_name: Benoit G
full_name: Godard, Benoit G
id: 33280250-F248-11E8-B48F-1D18A9856A87
last_name: Godard
- first_name: Remi
full_name: Dumollard, Remi
last_name: Dumollard
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Alex
full_name: Mcdougall, Alex
last_name: Mcdougall
citation:
ama: Godard BG, Dumollard R, Heisenberg C-PJ, Mcdougall A. Combined effect of cell
geometry and polarity domains determines the orientation of unequal division.
eLife. 2021;10. doi:10.7554/eLife.75639
apa: Godard, B. G., Dumollard, R., Heisenberg, C.-P. J., & Mcdougall, A. (2021).
Combined effect of cell geometry and polarity domains determines the orientation
of unequal division. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.75639
chicago: Godard, Benoit G, Remi Dumollard, Carl-Philipp J Heisenberg, and Alex Mcdougall.
“Combined Effect of Cell Geometry and Polarity Domains Determines the Orientation
of Unequal Division.” ELife. eLife Sciences Publications, 2021. https://doi.org/10.7554/eLife.75639.
ieee: B. G. Godard, R. Dumollard, C.-P. J. Heisenberg, and A. Mcdougall, “Combined
effect of cell geometry and polarity domains determines the orientation of unequal
division,” eLife, vol. 10. eLife Sciences Publications, 2021.
ista: Godard BG, Dumollard R, Heisenberg C-PJ, Mcdougall A. 2021. Combined effect
of cell geometry and polarity domains determines the orientation of unequal division.
eLife. 10, e75639.
mla: Godard, Benoit G., et al. “Combined Effect of Cell Geometry and Polarity Domains
Determines the Orientation of Unequal Division.” ELife, vol. 10, e75639,
eLife Sciences Publications, 2021, doi:10.7554/eLife.75639.
short: B.G. Godard, R. Dumollard, C.-P.J. Heisenberg, A. Mcdougall, ELife 10 (2021).
date_created: 2022-01-09T23:01:26Z
date_published: 2021-12-21T00:00:00Z
date_updated: 2023-08-17T06:32:44Z
day: '21'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.7554/eLife.75639
external_id:
isi:
- '000733610100001'
file:
- access_level: open_access
checksum: 759c7a873d554c48a6639e6350746ca6
content_type: application/pdf
creator: alisjak
date_created: 2022-01-10T09:40:37Z
date_updated: 2022-01-10T09:40:37Z
file_id: '10611'
file_name: 2021_eLife_Godard.pdf
file_size: 7769934
relation: main_file
success: 1
file_date_updated: 2022-01-10T09:40:37Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2646861A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03601
name: Control of embryonic cleavage pattern
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Combined effect of cell geometry and polarity domains determines the orientation
of unequal division
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: 10
year: '2021'
...
---
_id: '10608'
abstract:
- lang: eng
text: We consider infinite-dimensional properties in coarse geometry for hyperspaces
consisting of finite subsets of metric spaces with the Hausdorff metric. We see
that several infinite-dimensional properties are preserved by taking the hyperspace
of subsets with at most n points. On the other hand, we prove that, if a metric
space contains a sequence of long intervals coarsely, then its hyperspace of finite
subsets is not coarsely embeddable into any uniformly convex Banach space. As
a corollary, the hyperspace of finite subsets of the real line is not coarsely
embeddable into any uniformly convex Banach space. It is also shown that every
(not necessarily bounded geometry) metric space with straight finite decomposition
complexity has metric sparsification property.
acknowledgement: We would like to thank the referees for their careful reading and
the comments that improved our work. The third named author would like to thank
the Division of Mathematics, Physics and Earth Sciences of the Graduate School of
Science and Engineering of Ehime University and the second named author for hosting
his visit in June 2018. Open access funding provided by Institute of Science and
Technology (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Thomas
full_name: Weighill, Thomas
last_name: Weighill
- first_name: Takamitsu
full_name: Yamauchi, Takamitsu
last_name: Yamauchi
- first_name: Nicolò
full_name: Zava, Nicolò
id: c8b3499c-7a77-11eb-b046-aa368cbbf2ad
last_name: Zava
citation:
ama: Weighill T, Yamauchi T, Zava N. Coarse infinite-dimensionality of hyperspaces
of finite subsets. European Journal of Mathematics. 2021. doi:10.1007/s40879-021-00515-3
apa: Weighill, T., Yamauchi, T., & Zava, N. (2021). Coarse infinite-dimensionality
of hyperspaces of finite subsets. European Journal of Mathematics. Springer
Nature. https://doi.org/10.1007/s40879-021-00515-3
chicago: Weighill, Thomas, Takamitsu Yamauchi, and Nicolò Zava. “Coarse Infinite-Dimensionality
of Hyperspaces of Finite Subsets.” European Journal of Mathematics. Springer
Nature, 2021. https://doi.org/10.1007/s40879-021-00515-3.
ieee: T. Weighill, T. Yamauchi, and N. Zava, “Coarse infinite-dimensionality of
hyperspaces of finite subsets,” European Journal of Mathematics. Springer
Nature, 2021.
ista: Weighill T, Yamauchi T, Zava N. 2021. Coarse infinite-dimensionality of hyperspaces
of finite subsets. European Journal of Mathematics.
mla: Weighill, Thomas, et al. “Coarse Infinite-Dimensionality of Hyperspaces of
Finite Subsets.” European Journal of Mathematics, Springer Nature, 2021,
doi:10.1007/s40879-021-00515-3.
short: T. Weighill, T. Yamauchi, N. Zava, European Journal of Mathematics (2021).
date_created: 2022-01-09T23:01:27Z
date_published: 2021-12-30T00:00:00Z
date_updated: 2022-01-10T08:36:55Z
day: '30'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1007/s40879-021-00515-3
file:
- access_level: open_access
checksum: c435dcfa1ad3aadc5cdd7366bc7f4e98
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-10T08:33:22Z
date_updated: 2022-01-10T08:33:22Z
file_id: '10610'
file_name: 2021_EuJournalMath_Weighill.pdf
file_size: 384908
relation: main_file
success: 1
file_date_updated: 2022-01-10T08:33:22Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coarse infinite-dimensionality of hyperspaces of finite subsets
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10609'
abstract:
- lang: eng
text: "We study Multi-party computation (MPC) in the setting of subversion, where
the adversary tampers with the machines of honest parties. Our goal is to construct
actively secure MPC protocols where parties are corrupted adaptively by an adversary
(as in the standard adaptive security setting), and in addition, honest parties’
machines are compromised.\r\nThe idea of reverse firewalls (RF) was introduced
at EUROCRYPT’15 by Mironov and Stephens-Davidowitz as an approach to protecting
protocols against corruption of honest parties’ devices. Intuitively, an RF for
a party P is an external entity that sits between P and the outside world
and whose scope is to sanitize P ’s incoming and outgoing messages in the face
of subversion of their computer. Mironov and Stephens-Davidowitz constructed a
protocol for passively-secure two-party computation. At CRYPTO’20, Chakraborty,
Dziembowski and Nielsen constructed a protocol for secure computation with firewalls
that improved on this result, both by extending it to multi-party computation
protocol, and considering active security in the presence of static corruptions.
In this paper, we initiate the study of RF for MPC in the adaptive setting. We
put forward a definition for adaptively secure MPC in the reverse firewall setting,
explore relationships among the security notions, and then construct reverse firewalls
for MPC in this stronger setting of adaptive security. We also resolve the open
question of Chakraborty, Dziembowski and Nielsen by removing the need for a trusted
setup in constructing RF for MPC. Towards this end, we construct reverse firewalls
for adaptively secure augmented coin tossing and adaptively secure zero-knowledge
protocols and obtain a constant round adaptively secure MPC protocol in the reverse
firewall setting without setup. Along the way, we propose a new multi-party adaptively
secure coin tossing protocol in the plain model, that is of independent interest."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Suvradip
full_name: Chakraborty, Suvradip
id: B9CD0494-D033-11E9-B219-A439E6697425
last_name: Chakraborty
- first_name: Chaya
full_name: Ganesh, Chaya
last_name: Ganesh
- first_name: Mahak
full_name: Pancholi, Mahak
last_name: Pancholi
- first_name: Pratik
full_name: Sarkar, Pratik
last_name: Sarkar
citation:
ama: 'Chakraborty S, Ganesh C, Pancholi M, Sarkar P. Reverse firewalls for adaptively
secure MPC without setup. In: 27th International Conference on the Theory and
Application of Cryptology and Information Security. Vol 13091. Springer Nature;
2021:335-364. doi:10.1007/978-3-030-92075-3_12'
apa: 'Chakraborty, S., Ganesh, C., Pancholi, M., & Sarkar, P. (2021). Reverse
firewalls for adaptively secure MPC without setup. In 27th International Conference
on the Theory and Application of Cryptology and Information Security (Vol.
13091, pp. 335–364). Virtual, Singapore: Springer Nature. https://doi.org/10.1007/978-3-030-92075-3_12'
chicago: Chakraborty, Suvradip, Chaya Ganesh, Mahak Pancholi, and Pratik Sarkar.
“Reverse Firewalls for Adaptively Secure MPC without Setup.” In 27th International
Conference on the Theory and Application of Cryptology and Information Security,
13091:335–64. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-92075-3_12.
ieee: S. Chakraborty, C. Ganesh, M. Pancholi, and P. Sarkar, “Reverse firewalls
for adaptively secure MPC without setup,” in 27th International Conference
on the Theory and Application of Cryptology and Information Security, Virtual,
Singapore, 2021, vol. 13091, pp. 335–364.
ista: 'Chakraborty S, Ganesh C, Pancholi M, Sarkar P. 2021. Reverse firewalls for
adaptively secure MPC without setup. 27th International Conference on the Theory
and Application of Cryptology and Information Security. ASIACRYPT: International
Conference on Cryptology in Asia, LNCS, vol. 13091, 335–364.'
mla: Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC
without Setup.” 27th International Conference on the Theory and Application
of Cryptology and Information Security, vol. 13091, Springer Nature, 2021,
pp. 335–64, doi:10.1007/978-3-030-92075-3_12.
short: S. Chakraborty, C. Ganesh, M. Pancholi, P. Sarkar, in:, 27th International
Conference on the Theory and Application of Cryptology and Information Security,
Springer Nature, 2021, pp. 335–364.
conference:
end_date: 2021-12-10
location: Virtual, Singapore
name: 'ASIACRYPT: International Conference on Cryptology in Asia'
start_date: 2021-12-06
date_created: 2022-01-09T23:01:27Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2023-08-17T06:34:41Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-030-92075-3_12
ec_funded: 1
external_id:
isi:
- '000927876200012'
intvolume: ' 13091'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1262
month: '12'
oa: 1
oa_version: Preprint
page: 335-364
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 27th International Conference on the Theory and Application of Cryptology
and Information Security
publication_identifier:
eisbn:
- 978-3-030-92075-3
eissn:
- 1611-3349
isbn:
- 978-3-030-92074-6
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reverse firewalls for adaptively secure MPC without setup
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13091
year: '2021'
...
---
_id: '10613'
abstract:
- lang: eng
text: Motivated by the recent preprint [\emph{arXiv:2004.08412}] by Ayala, Carinci,
and Redig, we first provide a general framework for the study of scaling limits
of higher-order fields. Then, by considering the same class of infinite interacting
particle systems as in [\emph{arXiv:2004.08412}], namely symmetric simple exclusion
and inclusion processes in the d-dimensional Euclidean lattice, we prove the hydrodynamic
limit, and convergence for the equilibrium fluctuations, of higher-order fields.
In particular, the limit fields exhibit a tensor structure. Our fluctuation result
differs from that in [\emph{arXiv:2004.08412}], since we considered-dimensional
Euclidean lattice, we prove the hydrodynamic limit, and convergence for the equilibrium
fluctuations, of higher-order fields. In particular, the limit fields exhibit
a tensor structure. Our fluctuation result differs from that in [\emph{arXiv:2004.08412}],
since we consider a different notion of higher-order fluctuation fields.
acknowledgement: "F.S. would like to thank Mario Ayala and Frank Redig for useful
discussions. J.P.C. acknowledges partial financial support from the US National
Science Foundation (DMS-1855604). F.S. was financially supported by the European
Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie
grant agreement No. 754411.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Joe P.
full_name: Chen, Joe P.
last_name: Chen
- first_name: Federico
full_name: Sau, Federico
id: E1836206-9F16-11E9-8814-AEFDE5697425
last_name: Sau
citation:
ama: Chen JP, Sau F. Higher-order hydrodynamics and equilibrium fluctuations of
interacting particle systems. Markov Processes And Related Fields. 2021;27(3):339-380.
apa: Chen, J. P., & Sau, F. (2021). Higher-order hydrodynamics and equilibrium
fluctuations of interacting particle systems. Markov Processes And Related
Fields. Polymat Publishing.
chicago: Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium
Fluctuations of Interacting Particle Systems.” Markov Processes And Related
Fields. Polymat Publishing, 2021.
ieee: J. P. Chen and F. Sau, “Higher-order hydrodynamics and equilibrium fluctuations
of interacting particle systems,” Markov Processes And Related Fields,
vol. 27, no. 3. Polymat Publishing, pp. 339–380, 2021.
ista: Chen JP, Sau F. 2021. Higher-order hydrodynamics and equilibrium fluctuations
of interacting particle systems. Markov Processes And Related Fields. 27(3), 339–380.
mla: Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium
Fluctuations of Interacting Particle Systems.” Markov Processes And Related
Fields, vol. 27, no. 3, Polymat Publishing, 2021, pp. 339–80.
short: J.P. Chen, F. Sau, Markov Processes And Related Fields 27 (2021) 339–380.
date_created: 2022-01-10T14:02:31Z
date_published: 2021-03-16T00:00:00Z
date_updated: 2022-01-10T15:29:08Z
day: '16'
department:
- _id: JaMa
ec_funded: 1
external_id:
arxiv:
- '2008.13403'
intvolume: ' 27'
issue: '3'
keyword:
- interacting particle systems
- higher-order fields
- hydrodynamic limit
- equilibrium fluctuations
- duality
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2008.13403
month: '03'
oa: 1
oa_version: Preprint
page: 339-380
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Markov Processes And Related Fields
publication_identifier:
issn:
- 1024-2953
publication_status: published
publisher: Polymat Publishing
quality_controlled: '1'
related_material:
link:
- description: Link to Abstract on publisher's website
relation: other
url: http://math-mprf.org/journal/articles/id1614/
- description: Referred to in Abstract
relation: used_for_analysis_in
url: https://arxiv.org/abs/2004.08412
status: public
title: Higher-order hydrodynamics and equilibrium fluctuations of interacting particle
systems
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 27
year: '2021'
...
---
_id: '10628'
abstract:
- lang: eng
text: The surface states of 3D topological insulators in general have negligible
quantum oscillations (QOs) when the chemical potential is tuned to the Dirac points.
In contrast, we find that topological Kondo insulators (TKIs) can support surface
states with an arbitrarily large Fermi surface (FS) when the chemical potential
is pinned to the Dirac point. We illustrate that these FSs give rise to finite-frequency
QOs, which can become comparable to the extremal area of the unhybridized bulk
bands. We show that this occurs when the crystal symmetry is lowered from cubic
to tetragonal in a minimal two-orbital model. We label such surface modes as 'shadow
surface states'. Moreover, we show that the sufficient next-nearest neighbor out-of-plane
hybridization leading to shadow surface states can be self-consistently stabilized
for tetragonal TKIs. Consequently, shadow surface states provide an important
example of high-frequency QOs beyond the context of cubic TKIs.
acknowledgement: PG acknowledges support from National Science Foundation Awards No.
DMR-1824265 for this work. AG acknowledges support from the European Union's Horizon
2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement
No. 754411. EMN is supported by ASU startup grant. OE is in part supported by NSF-DMR-1904716.
article_number: '123042'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Emilian M.
full_name: Nica, Emilian M.
last_name: Nica
- first_name: Onur
full_name: Erten, Onur
last_name: Erten
- first_name: Pouyan
full_name: Ghaemi, Pouyan
last_name: Ghaemi
citation:
ama: Ghazaryan A, Nica EM, Erten O, Ghaemi P. Shadow surface states in topological
Kondo insulators. New Journal of Physics. 2021;23(12). doi:10.1088/1367-2630/ac4124
apa: Ghazaryan, A., Nica, E. M., Erten, O., & Ghaemi, P. (2021). Shadow surface
states in topological Kondo insulators. New Journal of Physics. IOP Publishing.
https://doi.org/10.1088/1367-2630/ac4124
chicago: Ghazaryan, Areg, Emilian M. Nica, Onur Erten, and Pouyan Ghaemi. “Shadow
Surface States in Topological Kondo Insulators.” New Journal of Physics.
IOP Publishing, 2021. https://doi.org/10.1088/1367-2630/ac4124.
ieee: A. Ghazaryan, E. M. Nica, O. Erten, and P. Ghaemi, “Shadow surface states
in topological Kondo insulators,” New Journal of Physics, vol. 23, no.
12. IOP Publishing, 2021.
ista: Ghazaryan A, Nica EM, Erten O, Ghaemi P. 2021. Shadow surface states in topological
Kondo insulators. New Journal of Physics. 23(12), 123042.
mla: Ghazaryan, Areg, et al. “Shadow Surface States in Topological Kondo Insulators.”
New Journal of Physics, vol. 23, no. 12, 123042, IOP Publishing, 2021,
doi:10.1088/1367-2630/ac4124.
short: A. Ghazaryan, E.M. Nica, O. Erten, P. Ghaemi, New Journal of Physics 23 (2021).
date_created: 2022-01-16T23:01:28Z
date_published: 2021-12-23T00:00:00Z
date_updated: 2023-08-17T06:54:54Z
day: '23'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1088/1367-2630/ac4124
ec_funded: 1
external_id:
arxiv:
- '2012.11625'
isi:
- '000734063700001'
file:
- access_level: open_access
checksum: 0c3cb6816242fa8afd1cc87a5fe77821
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-17T10:01:58Z
date_updated: 2022-01-17T10:01:58Z
file_id: '10632'
file_name: 2021_NewJourPhys_Ghazaryan.pdf
file_size: 2533102
relation: main_file
success: 1
file_date_updated: 2022-01-17T10:01:58Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: New Journal of Physics
publication_identifier:
issn:
- 1367-2630
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shadow surface states in topological Kondo insulators
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: 23
year: '2021'
...
---
_id: '10629'
abstract:
- lang: eng
text: "Product graphs arise naturally in formal verification and program analysis.
For example, the analysis of two concurrent threads requires the product of two
component control-flow graphs, and for language inclusion of deterministic automata
the product of two automata is constructed. In many cases, the component graphs
have constant treewidth, e.g., when the input contains control-flow graphs of
programs. We consider the algorithmic analysis of products of two constant-treewidth
graphs with respect to three classic specification languages, namely, (a) algebraic
properties, (b) mean-payoff properties, and (c) initial credit for energy properties.\r\nOur
main contributions are as follows. Consider a graph G that is the product of two
constant-treewidth graphs of size n each. First, given an idempotent semiring,
we present an algorithm that computes the semiring transitive closure of G in
time Õ(n⁴). Since the output has size Θ(n⁴), our algorithm is optimal (up to
polylog factors). Second, given a mean-payoff objective, we present an O(n³)-time
algorithm for deciding whether the value of a starting state is non-negative,
improving the previously known O(n⁴) bound. Third, given an initial credit for
energy objective, we present an O(n⁵)-time algorithm for computing the minimum
initial credit for all nodes of G, improving the previously known O(n⁸) bound.
At the heart of our approach lies an algorithm for the efficient construction
of strongly-balanced tree decompositions of constant-treewidth graphs. Given a
constant-treewidth graph G' of n nodes and a positive integer λ, our algorithm
constructs a binary tree decomposition of G' of width O(λ) with the property that
the size of each subtree decreases geometrically with rate (1/2 + 2^{-λ})."
alternative_title:
- LIPIcs
article_number: '42'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on
product graphs of small treewidth. In: 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science. Vol 213. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.42'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative
verification on product graphs of small treewidth. In 41st IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science (Vol.
213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Quantitative Verification on Product Graphs of Small Treewidth.” In 41st IARCS
Annual Conference on Foundations of Software Technology and Theoretical Computer
Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification
on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science, Virtual, 2021, vol.
213.
ista: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification
on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of
Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.'
mla: Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs
of Small Treewidth.” 41st IARCS Annual Conference on Foundations of Software
Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
conference:
end_date: 2021-12-17
location: Virtual
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2021-12-15
date_created: 2022-01-16T23:01:28Z
date_published: 2021-11-29T00:00:00Z
date_updated: 2022-01-17T10:39:40Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.FSTTCS.2021.42
file:
- access_level: open_access
checksum: 71141acdeffa9056f24d6dbef952d254
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-17T10:36:08Z
date_updated: 2022-01-17T10:36:08Z
file_id: '10633'
file_name: 2021_LIPIcs_Chatterjee.pdf
file_size: 891566
relation: main_file
success: 1
file_date_updated: 2022-01-17T10:36:08Z
has_accepted_license: '1'
intvolume: ' 213'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: 41st IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science
publication_identifier:
isbn:
- 978-3-9597-7215-0
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative verification on product graphs of small treewidth
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 213
year: '2021'
...
---
_id: '10630'
abstract:
- lang: eng
text: In the Intersection Non-emptiness problem, we are given a list of finite automata
A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine
whether some string w ∈ Σ^* lies in the intersection of the languages accepted
by the automata in the list. We analyze the complexity of the Intersection Non-emptiness
problem under the promise that all input automata accept a language in some level
of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy.
Automata accepting languages from the lowest levels of these hierarchies arise
naturally in the context of model checking. We identify a dichotomy in the dot-depth
hierarchy by showing that the problem is already NP-complete when all input automata
accept languages of the levels B_0 or B_{1/2} and already PSPACE-hard when all
automata accept a language from the level B_1. Conversely, we identify a tetrachotomy
in the Straubing-Thérien hierarchy. More precisely, we show that the problem is
in AC^0 when restricted to level L_0; complete for L or NL, depending on the input
representation, when restricted to languages in the level L_{1/2}; NP-complete
when the input is given as DFAs accepting a language in L_1 or L_{3/2}; and finally,
PSPACE-complete when the input automata accept languages in level L_2 or higher.
Moreover, we show that the proof technique used to show containment in NP for
DFAs accepting languages in L_1 or L_{3/2} does not generalize to the context
of NFAs. To prove this, we identify a family of languages that provide an exponential
separation between the state complexity of general NFAs and that of partially
ordered NFAs. To the best of our knowledge, this is the first superpolynomial
separation between these two models of computation.
acknowledgement: "We like to thank Lukas Fleischer and Michael Wehar for our discussions.
This work started at the Schloss Dagstuhl Event 20483 Moderne Aspekte der Komplexitätstheorie
in der Automatentheorie https://www.dagstuhl.de/20483.\r\n"
alternative_title:
- LIPIcs
article_number: '34'
article_processing_charge: No
arxiv: 1
author:
- first_name: Emmanuel
full_name: Arrighi, Emmanuel
last_name: Arrighi
- first_name: Henning
full_name: Fernau, Henning
last_name: Fernau
- first_name: Stefan
full_name: Hoffmann, Stefan
last_name: Hoffmann
- first_name: Markus
full_name: Holzer, Markus
last_name: Holzer
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Mateus
full_name: De Oliveira Oliveira, Mateus
last_name: De Oliveira Oliveira
- first_name: Petra
full_name: Wolf, Petra
last_name: Wolf
citation:
ama: 'Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection
non-emptiness for star-free language classes. In: 41st IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science. Vol
213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.34'
apa: 'Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira
Oliveira, M., & Wolf, P. (2021). On the complexity of intersection non-emptiness
for star-free language classes. In 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science (Vol. 213). Virtual:
Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34'
chicago: Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael
R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection
Non-Emptiness for Star-Free Language Classes.” In 41st IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science, Vol.
213. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34.
ieee: E. Arrighi et al., “On the complexity of intersection non-emptiness
for star-free language classes,” in 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science, Virtual, 2021, vol.
213.
ista: 'Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira
M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free
language classes. 41st IARCS Annual Conference on Foundations of Software Technology
and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and
Theoretical Computer Science, LIPIcs, vol. 213, 34.'
mla: Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness
for Star-Free Language Classes.” 41st IARCS Annual Conference on Foundations
of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss
Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.
short: E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira
Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software
Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum
für Informatik, 2021.
conference:
end_date: 2021-12-17
location: Virtual
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2021-12-15
date_created: 2022-01-16T23:01:29Z
date_published: 2021-11-29T00:00:00Z
date_updated: 2022-01-17T10:56:19Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.FSTTCS.2021.34
ec_funded: 1
external_id:
arxiv:
- '2110.01279'
file:
- access_level: open_access
checksum: d5a82ba893c3bc5da5914edbb3efb92b
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-17T10:49:03Z
date_updated: 2022-01-17T10:49:03Z
file_id: '10634'
file_name: 2021_LIPIcs_Arrighi.pdf
file_size: 844224
relation: main_file
success: 1
file_date_updated: 2022-01-17T10:49:03Z
has_accepted_license: '1'
intvolume: ' 213'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 41st IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science
publication_identifier:
isbn:
- 978-3-9597-7215-0
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the complexity of intersection non-emptiness for star-free language classes
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 213
year: '2021'
...
---
_id: '10631'
abstract:
- lang: eng
text: We combine experimental and theoretical approaches to explore excited rotational
states of molecules embedded in helium nanodroplets using CS2 and I2 as examples.
Laser-induced nonadiabatic molecular alignment is employed to measure spectral
lines for rotational states extending beyond those initially populated at the
0.37 K droplet temperature. We construct a simple quantum-mechanical model, based
on a linear rotor coupled to a single-mode bosonic bath, to determine the rotational
energy structure in its entirety. The calculated and measured spectral lines are
in good agreement. We show that the effect of the surrounding superfluid on molecular
rotation can be rationalized by a single quantity, the angular momentum, transferred
from the molecule to the droplet.
acknowledgement: I.C. acknowledges the support by the European Union’s Horizon 2020
research and innovation programme under the Marie Sklodowska-Curie Grant Agreement
No. 665385. G.B. acknowledges support from the Austrian Science Fund (FWF), under
project No. M2461-N27. M.L. acknowledges support by the Austrian Science Fund (FWF),
under project No. P29902-N27, and by the European Research Council (ERC) Starting
Grant No. 801770 (ANGULON). H.S acknowledges support from the European Research
Council-AdG (Project No. 320459, DropletControl) and from The Villum Foundation
through a Villum Investigator grant no. 25886.
article_number: L061303
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Igor
full_name: Cherepanov, Igor
id: 339C7E5A-F248-11E8-B48F-1D18A9856A87
last_name: Cherepanov
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Constant A.
full_name: Schouder, Constant A.
last_name: Schouder
- first_name: Adam S.
full_name: Chatterley, Adam S.
last_name: Chatterley
- first_name: Simon H.
full_name: Albrechtsen, Simon H.
last_name: Albrechtsen
- first_name: Alberto Viñas
full_name: Muñoz, Alberto Viñas
last_name: Muñoz
- first_name: Lars
full_name: Christiansen, Lars
last_name: Christiansen
- first_name: Henrik
full_name: Stapelfeldt, Henrik
last_name: Stapelfeldt
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Cherepanov I, Bighin G, Schouder CA, et al. Excited rotational states of molecules
in a superfluid. Physical Review A. 2021;104(6). doi:10.1103/PhysRevA.104.L061303
apa: Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Albrechtsen,
S. H., Muñoz, A. V., … Lemeshko, M. (2021). Excited rotational states of molecules
in a superfluid. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.104.L061303
chicago: Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley,
Simon H. Albrechtsen, Alberto Viñas Muñoz, Lars Christiansen, Henrik Stapelfeldt,
and Mikhail Lemeshko. “Excited Rotational States of Molecules in a Superfluid.”
Physical Review A. American Physical Society, 2021. https://doi.org/10.1103/PhysRevA.104.L061303.
ieee: I. Cherepanov et al., “Excited rotational states of molecules in a
superfluid,” Physical Review A, vol. 104, no. 6. American Physical Society,
2021.
ista: Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Albrechtsen SH, Muñoz
AV, Christiansen L, Stapelfeldt H, Lemeshko M. 2021. Excited rotational states
of molecules in a superfluid. Physical Review A. 104(6), L061303.
mla: Cherepanov, Igor, et al. “Excited Rotational States of Molecules in a Superfluid.”
Physical Review A, vol. 104, no. 6, L061303, American Physical Society,
2021, doi:10.1103/PhysRevA.104.L061303.
short: I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, S.H. Albrechtsen,
A.V. Muñoz, L. Christiansen, H. Stapelfeldt, M. Lemeshko, Physical Review A 104
(2021).
date_created: 2022-01-16T23:01:29Z
date_published: 2021-12-30T00:00:00Z
date_updated: 2024-08-07T07:16:52Z
day: '30'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.104.L061303
ec_funded: 1
external_id:
arxiv:
- '2107.00468'
isi:
- '000739618300001'
intvolume: ' 104'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://128.84.4.18/abs/2107.00468
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 26986C82-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02641
name: A path-integral approach to composite impurities
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Excited rotational states of molecules in a superfluid
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 104
year: '2021'
...
---
_id: '10635'
abstract:
- lang: eng
text: The brain efficiently performs nonlinear computations through its intricate
networks of spiking neurons, but how this is done remains elusive. While nonlinear
computations can be implemented successfully in spiking neural networks, this
requires supervised training and the resulting connectivity can be hard to interpret.
In contrast, the required connectivity for any computation in the form of a linear
dynamical system can be directly derived and understood with the spike coding
network (SCN) framework. These networks also have biologically realistic activity
patterns and are highly robust to cell death. Here we extend the SCN framework
to directly implement any polynomial dynamical system, without the need for training.
This results in networks requiring a mix of synapse types (fast, slow, and multiplicative),
which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate
how to directly derive the required connectivity for several nonlinear dynamical
systems. We also show how to carry out higher-order polynomials with coupled networks
that use only pair-wise multiplicative synapses, and provide expected numbers
of connections for each synapse type. Overall, our work demonstrates a novel method
for implementing nonlinear computations in spiking neural networks, while keeping
the attractive features of standard SCNs (robustness, realistic activity patterns,
and interpretable connectivity). Finally, we discuss the biological plausibility
of our approach, and how the high accuracy and robustness of the approach may
be of interest for neuromorphic computing.
acknowledgement: "A preprint version of this article has been peer-reviewed and recommended
by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe
thank Christian Machens and Nuno Calaim for useful discussions on the project. This
report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience
Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during
the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers,
and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration
on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported
by European Union Horizon 2020 (665385).\r\n"
article_number: e68
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Michele
full_name: Nardin, Michele
id: 30BD0376-F248-11E8-B48F-1D18A9856A87
last_name: Nardin
orcid: 0000-0001-8849-6570
- first_name: James W.
full_name: Phillips, James W.
last_name: Phillips
- first_name: William F.
full_name: Podlaski, William F.
last_name: Podlaski
- first_name: Sander W.
full_name: Keemink, Sander W.
last_name: Keemink
citation:
ama: Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking
neural networks through multiplicative synapses. Peer Community Journal.
2021;1. doi:10.24072/pcjournal.69
apa: Nardin, M., Phillips, J. W., Podlaski, W. F., & Keemink, S. W. (2021).
Nonlinear computations in spiking neural networks through multiplicative synapses.
Peer Community Journal. Centre Mersenne ; Peer Community In. https://doi.org/10.24072/pcjournal.69
chicago: Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W.
Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative
Synapses.” Peer Community Journal. Centre Mersenne ; Peer Community In,
2021. https://doi.org/10.24072/pcjournal.69.
ieee: M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations
in spiking neural networks through multiplicative synapses,” Peer Community
Journal, vol. 1. Centre Mersenne ; Peer Community In, 2021.
ista: Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations
in spiking neural networks through multiplicative synapses. Peer Community Journal.
1, e68.
mla: Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks
through Multiplicative Synapses.” Peer Community Journal, vol. 1, e68,
Centre Mersenne ; Peer Community In, 2021, doi:10.24072/pcjournal.69.
short: M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal
1 (2021).
date_created: 2022-01-17T11:12:40Z
date_published: 2021-12-15T00:00:00Z
date_updated: 2022-01-17T13:30:01Z
day: '15'
ddc:
- '519'
department:
- _id: GradSch
- _id: JoCs
doi: 10.24072/pcjournal.69
ec_funded: 1
external_id:
arxiv:
- '2009.03857'
file:
- access_level: open_access
checksum: cd9af6b331918608f2e3d1c7940cbf4f
content_type: application/pdf
creator: mnardin
date_created: 2022-01-17T11:15:26Z
date_updated: 2022-01-17T11:15:26Z
file_id: '10636'
file_name: 10_24072_pcjournal_69.pdf
file_size: 3311494
relation: main_file
success: 1
file_date_updated: 2022-01-17T11:15:26Z
has_accepted_license: '1'
intvolume: ' 1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Peer Community Journal
publication_identifier:
eissn:
- 2804-3871
publication_status: published
publisher: Centre Mersenne ; Peer Community In
quality_controlled: '1'
status: public
title: Nonlinear computations in spiking neural networks through multiplicative synapses
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 1
year: '2021'
...