Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 5 de 5
Filtrar
Más filtros












Base de datos
Intervalo de año de publicación
1.
Entropy (Basel) ; 25(5)2023 Apr 25.
Artículo en Inglés | MEDLINE | ID: mdl-37238465

RESUMEN

Swarm intelligence (SI) is a collective behaviour exhibited by groups of simple agents, such as ants, bees, and birds, which can achieve complex tasks that would be difficult or impossible for a single individual [...].

2.
R Soc Open Sci ; 9(8): 220899, 2022 Aug.
Artículo en Inglés | MEDLINE | ID: mdl-36039282

RESUMEN

Numerous studies over the past decades established that real-world networks typically follow preferential attachment and detachment principles. Subsequently, this implies that degree fluctuations monotonically increase while rising up the 'degree ladder', causing high-degree nodes to be prone for attachment of new edges and for detachment of existing ones. Despite the extensive study of node degrees (absolute popularity), many domains consider node ranks (relative popularity) as of greater importance. This raises intriguing questions-what dynamics are expected to emerge when observing the ranking of network nodes over time? Does the ranking of nodes present similar monotonous patterns to the dynamics of their corresponding degrees? In this paper, we show that surprisingly the answer is not straightforward. By performing both theoretical and empirical analyses, we demonstrate that preferential principles do not apply to the temporal changes in node ranking. We show that the ranking dynamics follows a non-monotonous curve, suggesting an inherent partition of the nodes into qualitatively distinct stability categories. These findings provide plausible explanations to observed yet hitherto unexplained phenomena, such as how superstars fortify their ranks despite massive fluctuations in their degrees, and how stars are more prone to rank instability.

3.
Entropy (Basel) ; 24(3)2022 Feb 28.
Artículo en Inglés | MEDLINE | ID: mdl-35327860

RESUMEN

As state-of-the-art deep neural networks are being deployed at the core level of increasingly large numbers of AI-based products and services, the incentive for "copying them" (i.e., their intellectual property, manifested through the knowledge that is encapsulated in them) either by adversaries or commercial competitors is expected to considerably increase over time. The most efficient way to extract or steal knowledge from such networks is by querying them using a large dataset of random samples and recording their output, which is followed by the training of a student network, aiming to eventually mimic these outputs, without making any assumption about the original networks. The most effective way to protect against such a mimicking attack is to answer queries with the classification result only, omitting confidence values associated with the softmax layer. In this paper, we present a novel method for generating composite images for attacking a mentor neural network using a student model. Our method assumes no information regarding the mentor's training dataset, architecture, or weights. Furthermore, assuming no information regarding the mentor's softmax output values, our method successfully mimics the given neural network and is capable of stealing large portions (and sometimes all) of its encapsulated knowledge. Our student model achieved 99% relative accuracy to the protected mentor model on the Cifar-10 test set. In addition, we demonstrate that our student network (which copies the mentor) is impervious to watermarking protection methods and thus would evade being detected as a stolen model by existing dedicated techniques. Our results imply that all current neural networks are vulnerable to mimicking attacks, even if they do not divulge anything but the most basic required output, and that the student model that mimics them cannot be easily detected using currently available techniques.

4.
Sci Rep ; 10(1): 4587, 2020 03 12.
Artículo en Inglés | MEDLINE | ID: mdl-32165674

RESUMEN

Global financial crises have led to the understanding that classical econometric models are limited in comprehending financial markets in extreme conditions, partially since they disregarded complex interactions within the system. Consequently, in recent years research efforts have been directed towards modeling the structure and dynamics of the underlying networks of financial ecosystems. However, difficulties in acquiring fine-grained empirical financial data, due to regulatory limitations, intellectual property and privacy control, still hinder the application of network analysis to financial markets. In this paper we study the trading of cryptocurrency tokens on top of the Ethereum Blockchain, which is the largest publicly available financial data source that has a granularity of individual trades and users, and which provides a rare opportunity to analyze and model financial behavior in an evolving market from its inception. This quickly developing economy is comprised of tens of thousands of different financial assets with an aggregated valuation of more than 500 Billion USD and typical daily volume of 30 Billion USD, and manifests highly volatile dynamics when viewed using classic market measures. However, by applying network theory methods we demonstrate clear structural properties and converging dynamics, indicating that this ecosystem functions as a single coherent financial market. These results suggest that a better understanding of traditional markets could become possible through the analysis of fine-grained, abundant and publicly available data of cryptomarkets.

5.
PLoS One ; 9(10): e109458, 2014.
Artículo en Inglés | MEDLINE | ID: mdl-25330203

RESUMEN

Prospect theory is widely viewed as the best available descriptive model of how people evaluate risk in experimental settings. According to prospect theory, people are typically risk-averse with respect to gains and risk-seeking with respect to losses, known as the "reflection effect". People are much more sensitive to losses than to gains of the same magnitude, a phenomenon called "loss aversion". Despite of the fact that prospect theory has been well developed in behavioral economics at the theoretical level, there exist very few large-scale empirical studies and most of the previous studies have been undertaken with micro-panel data. Here we analyze over 28.5 million trades made by 81.3 thousand traders of an online financial trading community over 28 months, aiming to explore the large-scale empirical aspect of prospect theory. By analyzing and comparing the behavior of winning and losing trades and traders, we find clear evidence of the reflection effect and the loss aversion phenomenon, which are essential in prospect theory. This work hence demonstrates an unprecedented large-scale empirical evidence of prospect theory, which has immediate implication in financial trading, e.g., developing new trading strategies by minimizing the impact of the reflection effect and the loss aversion phenomenon. Moreover, we introduce three novel behavioral metrics to differentiate winning and losing traders based on their historical trading behavior. This offers us potential opportunities to augment online social trading where traders are allowed to watch and follow the trading activities of others, by predicting potential winners based on their historical trading behavior.


Asunto(s)
Financiación del Capital , Economía del Comportamiento , Modelos Teóricos , Asunción de Riesgos , Humanos , Medios de Comunicación Sociales , Ciencias Sociales
SELECCIÓN DE REFERENCIAS
DETALLE DE LA BÚSQUEDA
...