The Information Causality principle was proposed to re-derive the Tsirelson bound, an upper limit on the strength of quantum correlations, and has been suggested as a candidate law of nature. The principle states that the Shannon information about Alice’s distant database gained by Bob after receiving an m bit message cannot exceed m bits, even when Alice and Bob share non-local resources. As originally formulated, it can be shown that the principle is violated exactly when the strength of the shared correlations exceeds the Tsirelson bound. However, we demonstrate here that when an alternative measure of information, one of the Renyi measures, is chosen, the Information Causality principle no longer arrives at the correct value for the Tsirelson bound. We argue that neither the assumption of particular `intuitive’ properties of uncertainties measures, nor pragmatic choices about how to optimise costs associated with communication, are sufficient to motivate uniquely the choice of the Shannon measure from amongst the more general Renyi measures. We conclude that the dependence of the success of Information Causality on mere convention undermines its claimed significance as a foundational principle.
信息因果关系原理的提出是为了重新推导出齐雷尔森约束（量子相关性强度的上限），并被认为是一种候选的自然法则。该原理指出，即使爱丽丝和鲍勃共享非本地资源，鲍勃在接收到 m 位信息后获得的关于爱丽丝远方数据库的香农信息也不能超过 m 位。按照最初的表述，可以证明当共享相关性的强度超过齐雷尔森约束时，就违反了这一原则。然而，我们在此证明，当选择另一种信息度量方法，即 Renyi 度量方法之一时，信息因果关系原理不再能得出正确的 Tsirelson 约束值。我们认为，无论是对不确定性度量的特定 "直觉 "属性的假设，还是对如何优化通信相关成本的实用选择，都不足以唯一地促使我们从更一般的任义度量中选择香农度量。我们的结论是，信息因果关系的成功仅仅依赖于约定俗成，这有损于它作为基本原则所宣称的意义。
{"title":"Bounding Quantum Correlations: The Role of the Shannon Information in the Information Causality Principle","authors":"Natasha Oughton, Christopher G. Timpson","doi":"10.3390/e26070562","DOIUrl":"https://doi.org/10.3390/e26070562","url":null,"abstract":"The Information Causality principle was proposed to re-derive the Tsirelson bound, an upper limit on the strength of quantum correlations, and has been suggested as a candidate law of nature. The principle states that the Shannon information about Alice’s distant database gained by Bob after receiving an m bit message cannot exceed m bits, even when Alice and Bob share non-local resources. As originally formulated, it can be shown that the principle is violated exactly when the strength of the shared correlations exceeds the Tsirelson bound. However, we demonstrate here that when an alternative measure of information, one of the Renyi measures, is chosen, the Information Causality principle no longer arrives at the correct value for the Tsirelson bound. We argue that neither the assumption of particular `intuitive’ properties of uncertainties measures, nor pragmatic choices about how to optimise costs associated with communication, are sufficient to motivate uniquely the choice of the Shannon measure from amongst the more general Renyi measures. We conclude that the dependence of the success of Information Causality on mere convention undermines its claimed significance as a foundational principle.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141521917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract: The existing segmentation-based scene text detection methods mostly need complicated post-processing, and the post-processing operation is separated from the training process, which greatly reduces the detection performance. The previous method, DBNet, successfully simplified post-processing and integrated post-processing into a segmentation network. However, the training process of the model took a long time for 1200 epochs and the sensitivity to texts of various scales was lacking, leading to some text instances being missed. Considering the above two problems, we design the text detection Network with Binarization of Hyperbolic Tangent (HTBNet). First of all, we propose the Binarization of Hyperbolic Tangent (HTB), optimized along with which the segmentation network can expedite the initial convergent speed by reducing the number of epochs from 1200 to 600. Because features of different channels in the same scale feature map focus on the information of different regions in the image, to better represent the important features of all objects in the image, we devise the Multi-Scale Channel Attention (MSCA). Meanwhile, considering that multi-scale objects in the image cannot be simultaneously detected, we propose a novel module named Fused Module with Channel and Spatial (FMCS), which can fuse the multi-scale feature maps from channel and spatial dimensions. Finally, we adopt cross-entropy as the loss function, which measures the difference between predicted values and ground truths. The experimental results show that HTBNet, compared with lightweight models, has achieved competitive performance and speed on Total-Text (F-measure:86.0%, FPS:30) and MSRA-TD500 (F-measure:87.5%, FPS:30).
摘要：现有的基于分割的场景文本检测方法大多需要复杂的后处理，且后处理操作与训练过程分离，大大降低了检测性能。之前的方法 DBNet 成功地简化了后处理，并将后处理集成到分割网络中。但是，该模型的训练过程需要1200个epoch，耗时较长，而且对不同尺度文本的灵敏度不够，导致一些文本实例被遗漏。考虑到上述两个问题，我们设计了双曲切线二值化文本检测网络（HTBNet）。首先，我们提出了双曲切线二值化方法（HTB），经过优化后的分割网络可以加快初始收敛速度，将历时次数从 1200 次减少到 600 次。由于同一尺度特征图中不同通道的特征侧重于图像中不同区域的信息，为了更好地表示图像中所有物体的重要特征，我们设计了多尺度通道关注（MSCA）。同时，考虑到无法同时检测图像中的多尺度物体，我们提出了一种名为 "通道与空间融合模块"（Fused Module with Channel and Spatial，FMCS）的新模块，它可以融合通道和空间维度的多尺度特征图。最后，我们采用交叉熵作为损失函数，衡量预测值与地面实况之间的差异。实验结果表明，与轻量级模型相比，HTBNet 在 Total-Text （F-measure:86.0%，FPS:30）和 MSRA-TD500 （F-measure:87.5%，FPS:30）上的性能和速度都很有竞争力。
{"title":"(HTBNet)Arbitrary Shape Scene Text Detection with Binarization of Hyperbolic Tangent and Cross-Entropy","authors":"Zhao Chen","doi":"10.3390/e26070560","DOIUrl":"https://doi.org/10.3390/e26070560","url":null,"abstract":"Abstract: The existing segmentation-based scene text detection methods mostly need complicated post-processing, and the post-processing operation is separated from the training process, which greatly reduces the detection performance. The previous method, DBNet, successfully simplified post-processing and integrated post-processing into a segmentation network. However, the training process of the model took a long time for 1200 epochs and the sensitivity to texts of various scales was lacking, leading to some text instances being missed. Considering the above two problems, we design the text detection Network with Binarization of Hyperbolic Tangent (HTBNet). First of all, we propose the Binarization of Hyperbolic Tangent (HTB), optimized along with which the segmentation network can expedite the initial convergent speed by reducing the number of epochs from 1200 to 600. Because features of different channels in the same scale feature map focus on the information of different regions in the image, to better represent the important features of all objects in the image, we devise the Multi-Scale Channel Attention (MSCA). Meanwhile, considering that multi-scale objects in the image cannot be simultaneously detected, we propose a novel module named Fused Module with Channel and Spatial (FMCS), which can fuse the multi-scale feature maps from channel and spatial dimensions. Finally, we adopt cross-entropy as the loss function, which measures the difference between predicted values and ground truths. The experimental results show that HTBNet, compared with lightweight models, has achieved competitive performance and speed on Total-Text (F-measure:86.0%, FPS:30) and MSRA-TD500 (F-measure:87.5%, FPS:30).","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141521915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kai-Chih Chang, Haoran Niu, Brian Kim, Suzanne Barber
A user’s devices such as their phone and computer are constantly bombarded by IoT devices and associated applications seeking connection to the user’s devices. These IoT devices may or may not seek explicit user consent, thus leaving the users completely unaware the IoT device is collecting, using, and/or sharing their personal data or, only marginal informed, if the user consented to the connecting IoT device but did not read the associated privacy policies. Privacy policies are intended to inform users of what personally identifiable information (PII) data will be collected about them and the policies about how those PII data will be used and shared. This paper presents novel tools and the underlying algorithms employed by the Personal Privacy Assistant app (UTCID PPA) developed by the University of Texas at Austin Center for Identity to inform users of IoT devices seeking to connect to their devices and to notify those users of potential privacy risks posed by the respective IoT device. The assessment of these privacy risks must deal with the uncertainty associated with sharing the user’s personal data. If privacy risk (R) equals the consequences (C) of an incident (i.e., personal data exposure) multiplied by the probability (P) of those consequences occurring (C × P), then efforts to control risks must seek to reduce the possible consequences of an incident as well as reduce the uncertainty of the incident and its consequences occurring. This research classifies risk according to two parameters: expected value of the incident’s consequences and uncertainty (entropy) of those consequences. This research calculates the entropy of the privacy incident consequences by evaluating: (1) the data sharing policies governing the IoT resource and (2) the type of personal data exposed. The data sharing policies of an IoT resource are scored by the UTCID PrivacyCheck™, which uses machine learning to read and score the IoT resource privacy policies against metrics set forth by best practices and international regulations. The UTCID Identity Ecosystem uses empirical identity theft and fraud cases to assess the entropy of privacy incident consequences involving a specific type of personal data, such as name, address, Social Security number, fingerprint, and user location. By understanding the entropy of a privacy incident posed by a given IoT resource seeking to connect to a user’s device, UTCID PPA offers actionable recommendations enhancing the user’s control over IoT connections, interactions, their personal data, and, ultimately, user-centric privacy control.
{"title":"IoT Privacy Risks Revealed","authors":"Kai-Chih Chang, Haoran Niu, Brian Kim, Suzanne Barber","doi":"10.3390/e26070561","DOIUrl":"https://doi.org/10.3390/e26070561","url":null,"abstract":"A user’s devices such as their phone and computer are constantly bombarded by IoT devices and associated applications seeking connection to the user’s devices. These IoT devices may or may not seek explicit user consent, thus leaving the users completely unaware the IoT device is collecting, using, and/or sharing their personal data or, only marginal informed, if the user consented to the connecting IoT device but did not read the associated privacy policies. Privacy policies are intended to inform users of what personally identifiable information (PII) data will be collected about them and the policies about how those PII data will be used and shared. This paper presents novel tools and the underlying algorithms employed by the Personal Privacy Assistant app (UTCID PPA) developed by the University of Texas at Austin Center for Identity to inform users of IoT devices seeking to connect to their devices and to notify those users of potential privacy risks posed by the respective IoT device. The assessment of these privacy risks must deal with the uncertainty associated with sharing the user’s personal data. If privacy risk (R) equals the consequences (C) of an incident (i.e., personal data exposure) multiplied by the probability (P) of those consequences occurring (C × P), then efforts to control risks must seek to reduce the possible consequences of an incident as well as reduce the uncertainty of the incident and its consequences occurring. This research classifies risk according to two parameters: expected value of the incident’s consequences and uncertainty (entropy) of those consequences. This research calculates the entropy of the privacy incident consequences by evaluating: (1) the data sharing policies governing the IoT resource and (2) the type of personal data exposed. The data sharing policies of an IoT resource are scored by the UTCID PrivacyCheck™, which uses machine learning to read and score the IoT resource privacy policies against metrics set forth by best practices and international regulations. The UTCID Identity Ecosystem uses empirical identity theft and fraud cases to assess the entropy of privacy incident consequences involving a specific type of personal data, such as name, address, Social Security number, fingerprint, and user location. By understanding the entropy of a privacy incident posed by a given IoT resource seeking to connect to a user’s device, UTCID PPA offers actionable recommendations enhancing the user’s control over IoT connections, interactions, their personal data, and, ultimately, user-centric privacy control.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Amir Mohammad Karimi Mamaghan, Andrea Dittadi, Stefan Bauer, Karl Henrik Johansson, Francesco Quinzan
Causal reasoning can be considered a cornerstone of intelligent systems. Having access to an underlying causal graph comes with the promise of cause–effect estimation and the identification of efficient and safe interventions. However, learning causal representations remains a major challenge, due to the complexity of many real-world systems. Previous works on causal representation learning have mostly focused on Variational Auto-Encoders (VAEs). These methods only provide representations from a point estimate, and they are less effective at handling high dimensions. To overcome these problems, we propose a Diffusion-based Causal Representation Learning (DCRL) framework which uses diffusion-based representations for causal discovery in the latent space. DCRL provides access to both single-dimensional and infinite-dimensional latent codes, which encode different levels of information. In a first proof of principle, we investigate the use of DCRL for causal representation learning in a weakly supervised setting. We further demonstrate experimentally that this approach performs comparably well in identifying the latent causal structure and causal variables.
{"title":"Diffusion-Based Causal Representation Learning","authors":"Amir Mohammad Karimi Mamaghan, Andrea Dittadi, Stefan Bauer, Karl Henrik Johansson, Francesco Quinzan","doi":"10.3390/e26070556","DOIUrl":"https://doi.org/10.3390/e26070556","url":null,"abstract":"Causal reasoning can be considered a cornerstone of intelligent systems. Having access to an underlying causal graph comes with the promise of cause–effect estimation and the identification of efficient and safe interventions. However, learning causal representations remains a major challenge, due to the complexity of many real-world systems. Previous works on causal representation learning have mostly focused on Variational Auto-Encoders (VAEs). These methods only provide representations from a point estimate, and they are less effective at handling high dimensions. To overcome these problems, we propose a Diffusion-based Causal Representation Learning (DCRL) framework which uses diffusion-based representations for causal discovery in the latent space. DCRL provides access to both single-dimensional and infinite-dimensional latent codes, which encode different levels of information. In a first proof of principle, we investigate the use of DCRL for causal representation learning in a weakly supervised setting. We further demonstrate experimentally that this approach performs comparably well in identifying the latent causal structure and causal variables.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this work, we present a novel methodology for performing the supervised classification of time-ordered noisy data; we call this methodology Entropic Sparse Probabilistic Approximation with Markov regularization (eSPA-Markov). It is an extension of entropic learning methodologies, allowing the simultaneous learning of segmentation patterns, entropy-optimal feature space discretizations, and Bayesian classification rules. We prove the conditions for the existence and uniqueness of the learning problem solution and propose a one-shot numerical learning algorithm that—in the leading order—scales linearly in dimension. We show how this technique can be used for the computationally scalable identification of persistent (metastable) regime affiliations and regime switches from high-dimensional non-stationary and noisy time series, i.e., when the size of the data statistics is small compared to their dimensionality and when the noise variance is larger than the variance in the signal. We demonstrate its performance on a set of toy learning problems, comparing eSPA-Markov to state-of-the-art techniques, including deep learning and random forests. We show how this technique can be used for the analysis of noisy time series from DNA and RNA Nanopore sequencing.
在这项工作中，我们提出了一种新方法，用于对有时间顺序的噪声数据进行监督分类；我们称这种方法为带马尔科夫正则化的熵稀疏概率逼近法（eSPA-Markov）。它是熵学习方法的扩展，允许同时学习分割模式、熵优化特征空间离散化和贝叶斯分类规则。我们证明了学习问题解的存在性和唯一性条件，并提出了一种单次数值学习算法，该算法在前序维度上呈线性扩展。我们展示了这种技术如何用于从高维非平稳和高噪声时间序列中，即当数据统计量的大小与维度相比较小时，以及当噪声方差大于信号方差时，以可计算扩展的方式识别持续（可转移）的制度隶属关系和制度转换。我们在一组玩具学习问题上展示了 eSPA-Markov 的性能，并将其与深度学习和随机森林等最先进的技术进行了比较。我们展示了该技术如何用于分析来自 DNA 和 RNA Nanopore 测序的噪声时间序列。
{"title":"On Entropic Learning from Noisy Time Series in the Small Data Regime","authors":"Davide Bassetti, Lukáš Pospíšil, Illia Horenko","doi":"10.3390/e26070553","DOIUrl":"https://doi.org/10.3390/e26070553","url":null,"abstract":"In this work, we present a novel methodology for performing the supervised classification of time-ordered noisy data; we call this methodology Entropic Sparse Probabilistic Approximation with Markov regularization (eSPA-Markov). It is an extension of entropic learning methodologies, allowing the simultaneous learning of segmentation patterns, entropy-optimal feature space discretizations, and Bayesian classification rules. We prove the conditions for the existence and uniqueness of the learning problem solution and propose a one-shot numerical learning algorithm that—in the leading order—scales linearly in dimension. We show how this technique can be used for the computationally scalable identification of persistent (metastable) regime affiliations and regime switches from high-dimensional non-stationary and noisy time series, i.e., when the size of the data statistics is small compared to their dimensionality and when the noise variance is larger than the variance in the signal. We demonstrate its performance on a set of toy learning problems, comparing eSPA-Markov to state-of-the-art techniques, including deep learning and random forests. We show how this technique can be used for the analysis of noisy time series from DNA and RNA Nanopore sequencing.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Understandings of how visual hallucinations appear have been highly influenced by generative approaches, in particular Friston’s Active Inference conceptualization. Their core proposition is that these phenomena occur when hallucinatory expectations outweigh actual sensory data. This imbalance occurs as the brain seeks to minimize informational free energy, a measure of the distance between predicted and actual sensory data in a stationary open system. We review this approach in the light of old and new information on the role of environmental factors in episodic hallucinations. In particular, we highlight the possible relationship of specific visual triggers to the onset and offset of some episodes. We use an analogy from phase transitions in physics to explore factors which might account for intermittent shifts between veridical and hallucinatory vision. In these triggered forms of hallucinations, we suggest that there is a transient disturbance in the normal one-to-one correspondence between a real object and the counterpart perception such that this correspondence becomes between the real object and a hallucination. Generative models propose that a lack of information transfer from the environment to the brain is one of the key features of hallucinations. In contrast, we submit that specific information transfer is required at onset and offset in these cases. We propose that this transient one-to-one correspondence between environment and hallucination is mediated more by aberrant discriminative than by generative inference. Discriminative inference can be conceptualized as a process for maximizing shared information between the environment and perception within a self-organizing nonstationary system. We suggest that generative inference plays the greater role in established hallucinations and in the persistence of individual hallucinatory episodes. We further explore whether thermodynamic free energy may be an additional factor in why hallucinations are temporary. Future empirical research could productively concentrate on three areas. Firstly, subjective perceptual changes and parallel variations in brain function during specific transitions between veridical and hallucinatory vision to inform models of how episodes occur. Secondly, systematic investigation of the links between environment and hallucination episodes to probe the role of information transfer in triggering transitions between veridical and hallucinatory vision. Finally, changes in hallucinatory episodes over time to elucidate the role of learning on phenomenology. These empirical data will allow the potential roles of different forms of inference in the stages of hallucinatory episodes to be elucidated.
{"title":"Episodic Visual Hallucinations, Inference and Free Energy","authors":"Daniel Collerton, Ichiro Tsuda, Shigetoshi Nara","doi":"10.3390/e26070557","DOIUrl":"https://doi.org/10.3390/e26070557","url":null,"abstract":"Understandings of how visual hallucinations appear have been highly influenced by generative approaches, in particular Friston’s Active Inference conceptualization. Their core proposition is that these phenomena occur when hallucinatory expectations outweigh actual sensory data. This imbalance occurs as the brain seeks to minimize informational free energy, a measure of the distance between predicted and actual sensory data in a stationary open system. We review this approach in the light of old and new information on the role of environmental factors in episodic hallucinations. In particular, we highlight the possible relationship of specific visual triggers to the onset and offset of some episodes. We use an analogy from phase transitions in physics to explore factors which might account for intermittent shifts between veridical and hallucinatory vision. In these triggered forms of hallucinations, we suggest that there is a transient disturbance in the normal one-to-one correspondence between a real object and the counterpart perception such that this correspondence becomes between the real object and a hallucination. Generative models propose that a lack of information transfer from the environment to the brain is one of the key features of hallucinations. In contrast, we submit that specific information transfer is required at onset and offset in these cases. We propose that this transient one-to-one correspondence between environment and hallucination is mediated more by aberrant discriminative than by generative inference. Discriminative inference can be conceptualized as a process for maximizing shared information between the environment and perception within a self-organizing nonstationary system. We suggest that generative inference plays the greater role in established hallucinations and in the persistence of individual hallucinatory episodes. We further explore whether thermodynamic free energy may be an additional factor in why hallucinations are temporary. Future empirical research could productively concentrate on three areas. Firstly, subjective perceptual changes and parallel variations in brain function during specific transitions between veridical and hallucinatory vision to inform models of how episodes occur. Secondly, systematic investigation of the links between environment and hallucination episodes to probe the role of information transfer in triggering transitions between veridical and hallucinatory vision. Finally, changes in hallucinatory episodes over time to elucidate the role of learning on phenomenology. These empirical data will allow the potential roles of different forms of inference in the stages of hallucinatory episodes to be elucidated.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141531586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yoel Zimmermann, Joonas Keski-Rahkonen, Anton M. Graf, Eric J. Heller
The intricate relationship between electrons and the crystal lattice is a linchpin in condensed matter, traditionally described by the Fröhlich model encompassing the lowest-order lattice-electron coupling. Recently developed quantum acoustics, emphasizing the wave nature of lattice vibrations, hasenabled the exploration of previously uncharted territories of electron–lattice interaction not accessible with conventional tools such as perturbation theory. In this context, our agenda here is two-fold. First, we showcase the application of machine learning methods to categorize various interaction regimes within the subtle interplay of electrons and the dynamical lattice landscape. Second, we shed light on a nebulous region of electron dynamics identified by the machine learning approach and then attribute it to transient localization, where strong lattice vibrations result in a momentary Anderson prison for electronic wavepackets, which are later released by the evolution of the lattice. Overall, our research illuminates the spectrum of dynamics within the Fröhlich model, such as transient localization, which has been suggested as a pivotal factor contributing to the mysteries surrounding strange metals. Furthermore, this paves the way for utilizing time-dependent perspectives in machine learning techniques for designing materials with tailored electron–lattice properties.
{"title":"Rise and Fall of Anderson Localization by Lattice Vibrations: A Time-Dependent Machine Learning Approach","authors":"Yoel Zimmermann, Joonas Keski-Rahkonen, Anton M. Graf, Eric J. Heller","doi":"10.3390/e26070552","DOIUrl":"https://doi.org/10.3390/e26070552","url":null,"abstract":"The intricate relationship between electrons and the crystal lattice is a linchpin in condensed matter, traditionally described by the Fröhlich model encompassing the lowest-order lattice-electron coupling. Recently developed quantum acoustics, emphasizing the wave nature of lattice vibrations, hasenabled the exploration of previously uncharted territories of electron–lattice interaction not accessible with conventional tools such as perturbation theory. In this context, our agenda here is two-fold. First, we showcase the application of machine learning methods to categorize various interaction regimes within the subtle interplay of electrons and the dynamical lattice landscape. Second, we shed light on a nebulous region of electron dynamics identified by the machine learning approach and then attribute it to transient localization, where strong lattice vibrations result in a momentary Anderson prison for electronic wavepackets, which are later released by the evolution of the lattice. Overall, our research illuminates the spectrum of dynamics within the Fröhlich model, such as transient localization, which has been suggested as a pivotal factor contributing to the mysteries surrounding strange metals. Furthermore, this paves the way for utilizing time-dependent perspectives in machine learning techniques for designing materials with tailored electron–lattice properties.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141521918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Deniz Eroglu, Bruce M. Boghosian , Ernesto P. Borges , Ugur Tirnakli
Almost two decades ago, Ernesto P. Borges and Bruce M. Boghosian embarked on the intricate task of composing a manuscript to honor the profound contributions of Constantino Tsallis to the realm of statistical physics, coupled with a concise exploration of q-Statistics. Fast-forward to Constantino Tsallis’ illustrious 80th birthday celebration in 2023, where Deniz Eroglu and Ugur Tirnakli delved into Constantino’s collaborative network, injecting renewed vitality into the project. With hearts brimming with appreciation for Tsallis’ enduring inspiration, Eroglu, Boghosian, Borges, and Tirnakli proudly present this meticulously crafted manuscript as a token of their gratitude.
将近二十年前，埃内斯托-博尔热斯（Ernesto P. Borges）和布鲁斯-博格霍西安（Bruce M. Boghosian）开始了一项复杂的任务：撰写一份手稿，以纪念康斯坦丁诺-查里斯（Constantino Tsallis）在统计物理学领域的深远贡献，并对q-统计学进行简明的探讨。2023 年，Constantino Tsallis 将迎来他辉煌的 80 岁生日，Deniz Eroglu 和 Ugur Tirnakli 深入研究了 Constantino 的合作网络，为项目注入了新的活力。埃罗格鲁、博格霍西安、博尔赫斯和蒂尔纳克利满怀对查利斯持久灵感的感激之情，隆重推出这份精心制作的手稿，以表达他们的谢意。
{"title":"The Statistics of q-Statistics","authors":"Deniz Eroglu, Bruce M. Boghosian , Ernesto P. Borges , Ugur Tirnakli","doi":"10.3390/e26070554","DOIUrl":"https://doi.org/10.3390/e26070554","url":null,"abstract":"Almost two decades ago, Ernesto P. Borges and Bruce M. Boghosian embarked on the intricate task of composing a manuscript to honor the profound contributions of Constantino Tsallis to the realm of statistical physics, coupled with a concise exploration of q-Statistics. Fast-forward to Constantino Tsallis’ illustrious 80th birthday celebration in 2023, where Deniz Eroglu and Ugur Tirnakli delved into Constantino’s collaborative network, injecting renewed vitality into the project. With hearts brimming with appreciation for Tsallis’ enduring inspiration, Eroglu, Boghosian, Borges, and Tirnakli proudly present this meticulously crafted manuscript as a token of their gratitude.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes a novel censored autoregressive conditional Fréchet (CAcF) model with a flexible evolution scheme for the time-varying parameters, which allows deciphering tail risk dynamics constrained by price limits from the viewpoints of different risk preferences. The proposed model can well accommodate many important empirical characteristics of financial data, such as heavy-tailedness, volatility clustering, extreme event clustering, and price limits. We then investigate tail risk dynamics via the CAcF model in the price-limited stock markets, taking entropic value at risk (EVaR) as a risk measurement. Our findings suggest that tail risk will be seriously underestimated in price-limited stock markets when the censored property of limit prices is ignored. Additionally, the evidence from the Chinese Taiwan stock market shows that widening price limits would lead to a decrease in the incidence of extreme events (hitting limit-down) but a significant increase in tail risk. Moreover, we find that investors with different risk preferences may make opposing decisions about an extreme event. In summary, the empirical results reveal the effectiveness of our model in interpreting and predicting time-varying tail behaviors in price-limited stock markets, providing a new tool for financial risk management.
{"title":"Tail Risk Dynamics under Price-Limited Constraint: A Censored Autoregressive Conditional Fréchet Model","authors":"Tao Xu, Lei Shu, Yu Chen","doi":"10.3390/e26070555","DOIUrl":"https://doi.org/10.3390/e26070555","url":null,"abstract":"This paper proposes a novel censored autoregressive conditional Fréchet (CAcF) model with a flexible evolution scheme for the time-varying parameters, which allows deciphering tail risk dynamics constrained by price limits from the viewpoints of different risk preferences. The proposed model can well accommodate many important empirical characteristics of financial data, such as heavy-tailedness, volatility clustering, extreme event clustering, and price limits. We then investigate tail risk dynamics via the CAcF model in the price-limited stock markets, taking entropic value at risk (EVaR) as a risk measurement. Our findings suggest that tail risk will be seriously underestimated in price-limited stock markets when the censored property of limit prices is ignored. Additionally, the evidence from the Chinese Taiwan stock market shows that widening price limits would lead to a decrease in the incidence of extreme events (hitting limit-down) but a significant increase in tail risk. Moreover, we find that investors with different risk preferences may make opposing decisions about an extreme event. In summary, the empirical results reveal the effectiveness of our model in interpreting and predicting time-varying tail behaviors in price-limited stock markets, providing a new tool for financial risk management.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The authors would like to make a tiny but important correction to the published paper [...]
作者希望对已发表的论文做一个微小但重要的更正 [...]
{"title":"Correction: Toikka et al. Some Remarks on the Boundary of Thermodynamic Stability. Entropy 2023, 25, 969","authors":"Alexander Toikka, Georgii Misikov, Maria Toikka","doi":"10.3390/e26070547","DOIUrl":"https://doi.org/10.3390/e26070547","url":null,"abstract":"The authors would like to make a tiny but important correction to the published paper [...]","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141508676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：