Searcharxiv⌕ Search

arXiv subjects

Didier A. Vega-Oliveros

Publications and source records attributed to Didier A. Vega-Oliveros.

11 recordsLinked to original sources

Efficient Fine-Tuning Methods for Portuguese Question Answering: A Comparative Study of PEFT on BERTimbau and Exploratory Evaluation of Generative LLMs

Although large language models have transformed natural language processing, their computational costs create accessibility barriers for low-resource languages such as Brazilian Portuguese. This work presents a systematic evaluation of Parameter-Efficient Fine-Tuning (PEFT) and quantization techniques applied to BERTimbau for Question Answering on SQuAD-BR, the Brazilian Portuguese translation of SQuAD v1. We evaluate 40 configurations combining four PEFT methods (LoRA, DoRA, QLoRA, QDoRA) across two model sizes (Base: 110M, Large: 335M parameters). Our findings reveal three critical insights: (1) LoRA achieves 95.8\% of baseline performance on BERTimbau-Large while reducing training time by 73.5\% (F1=81.32 vs 84.86); (2) higher learning rates (2e-4) substantially improve PEFT performance, with F1 gains of up to +19.71 points over standard rates; and (3) larger models show twice the quantization resilience (loss of 4.83 vs 9.56 F1 points). These results demonstrate that encoder-based models can be efficiently fine-tuned for extractive Brazilian Portuguese QA with substantially lower computational cost than large generative LLMs, promoting more sustainable approaches aligned with \textit{Green AI} principles. An exploratory evaluation of Tucano and Sabiá on the same extractive QA benchmark shows that while generative models can reach competitive F1 scores with LoRA fine-tuning, they require up to 4.2$\times$ more GPU memory and 3$\times$ more training time than BERTimbau-Base, reinforcing the efficiency advantage of smaller encoder-based architectures for this task.

cs.CL↗

Bi-layer voter model: Modeling intolerant/tolerant positions and bots in opinion dynamics

The diffusion of opinions in Social Networks is a relevant process for adopting positions and attracting potential voters in political campaigns. Opinion polarization, bias, targeted diffusion, and the radicalization of postures are key elements for understanding voting dynamics. In particular, social bots are a new element that can have a pronounced effect on the formation of opinions during elections by, for instance, creating fake accounts in social networks to manipulate elections. Here we propose a voter model incorporating bots and radical or intolerant individuals in the decision-making process. The dynamics of the system occur in a multiplex network of interacting agents composed of two layers, one for the dynamics of opinions where agents choose between two possible alternatives, and the other for the tolerance dynamics, in which agents adopt one of two tolerance levels. The tolerance accounts for the likelihood to change opinion in an interaction, with tolerant (intolerant) agents switching opinion with probability $1.0$ ($γ\le 1$). We find that intolerance leads to a consensus of tolerant agents during an initial stage that scales as $τ^+ \sim γ^{-1} \ln N$, who then reach an opinion consensus during the second stage in a time that scales as $τ\sim N$, where $N$ is the number of agents. Therefore, very intolerant agents ($γ\ll 1$) could considerably slow down dynamics towards the final consensus state. We also find that the inclusion of a fraction $σ_{\mathbb{B}}^-$ of bots breaks the symmetry between both opinions, driving the system to a consensus of intolerant agents with the bots' opinion. Thus, bots eventually impose their opinion to the entire population, in a time that scales as $τ_B^- \sim γ^{-1}$ for $γ\ll σ_{\mathbb{B}}^-$ and $τ_B^- \sim 1/σ_{\mathbb{B}}^-$ for $σ_{\mathbb{B}}^- \ll γ$.

physics.soc-ph↗

Detecting climate teleconnections with Granger causality

Climate system teleconnections are crucial for improving climate predictability, but difficult to quantify. Standard approaches to identify teleconnections are often based on correlations between time series. Here we present a novel method leveraging Granger causality, which can infer/detect relationships between any two fields. We compare teleconnections identified by correlation and Granger causality at different timescales. We find that both Granger causality and correlation consistently recover known seasonal precipitation responses to the sea surface temperature pattern associated with the El Niño Southern Oscillation. Such findings are robust across multiple time resolutions. In addition, we identify candidates for unexplored teleconnection responses.

physics.ao-ph↗

Spatiotemporal data analysis with chronological networks

The amount and size of spatiotemporal data sets from different domains have been rapidly increasing in the last years, which demands the development of robust and fast methods to analyze and extract information from them. In this paper, we propose a network-based model for spatiotemporal data analysis called chronnet. It consists of dividing a geometrical space into grid cells represented by nodes connected chronologically. The main goal of this model is to represent consecutive recurrent events between cells with strong links in the network. This representation permits the use of network science and graphing mining tools to extract information from spatiotemporal data. The chronnet construction process is fast, which makes it suitable for large data sets. In this paper, we describe how to use our model considering artificial and real data. For this purpose, we propose an artificial spatiotemporal data set generator to show how chronnets capture not just simple statistics, but also frequent patterns, spatial changes, outliers, and spatiotemporal clusters. Additionally, we analyze a real-world data set composed of global fire detections, in which we describe the frequency of fire events, outlier fire detections, and the seasonal activity, using a single chronnet.

cs.SI↗

Measuring the engagement level in encrypted group conversations by using temporal networks

Chat groups are well-known for their capacity to promote viral political and marketing campaigns, spread fake news, and create rallies by hundreds of thousands on the streets. Also, with the increasing public awareness regarding privacy and surveillance, many platforms have started to deploy end-to-end encrypted protocols. In this context, the group's conversations are not accessible in plain text or readable format by third-party organizations or even the platform owner. Then, the main challenge that emerges is related to getting insights from users' activity of those groups, but without accessing the messages. Previous approaches evaluated the user engagement by assessing user's activity, however, on limited conditions where the data is encrypted, they cannot be applied. In this work, we present a framework for measuring the level of engagement of group conversations and users, without reading the messages. Our framework creates an ensemble of interaction networks that represent the temporal evolution of the conversation, then, we apply the proposed Engagement Index (EI) for each interval of conversations to assess users' participation. Our results in five datasets from real-world WhatsApp Groups indicate that, based on the EI, it is possible to identify the most engaged users within a time interval, create rankings, and group users according to their engagement and monitor their performance over time.

cs.SI↗

Influence maximization by rumor spreading on correlated networks through community identification

The identification of the minimal set of nodes that maximizes the propagation of information is one of the most relevant problems in network science. In this paper, we introduce a new method to find the set of initial spreaders to maximize the information propagation in complex networks. We evaluate this method in assortative networks and verify that degree-degree correlation plays a fundamental role in the spreading dynamics. Simulation results show that our algorithm is statistically similar, regarding the average size of outbreaks, to the greedy approach in real-world networks. However, our method is much less time consuming than the greedy algorithm.

physics.soc-ph↗

Global Fire Season Severity Analysis and Forecasting

In this paper, we divide the globe into a hexagonal grid and we extracted time series of daily fire counts from each cell to estimate and analyze worldwide fire season severity (FSS), here defined as the accumulated fire detections in a season. The central question here is evaluating the accuracy of time series forecasting methods to estimate short-term (months) and medium-term (seasons) using only historical data of active fire detections. This approach is simple, fast, and use globally available data, making it easier for large scale prediction. Our results comprehend descriptive and predictive analyses of the worldwide seasonal fire activity. We verified that in 99% of the cells, the fire seasons have lengths shorter than seven months and that 57% have their lengths decrease. We also observed a declining tendency in the number of active fire counts during the seasons in 61% cells. However, some regions like the Northeast Brazil and the West Coast of the USA present an increasing trend. We verified that the forecasting error is lower than the mean FSS in 95% of the cells, indicating clear predictability in the FSS.

stat.AP↗

Multifractality in random networks with power-law decaying bond strengths

In this paper we demonstrate numerically that random networks whose adjacency matrices ${\bf A}$ are represented by a diluted version of the Power--Law Banded Random Matrix (PBRM) model have multifractal eigenfunctions. The PBRM model describes one--dimensional samples with random long--range bonds. The bond strengths of the model, which decay as a power--law, are tuned by the parameter $μ$ as $A_{mn}\propto |m-n|^{-μ}$; while the sparsity is driven by the average network connectivity $α$: for $α=0$ the vertices in the network are isolated and for $α=1$ the network is fully connected and the PBRM model is recovered. Though it is known that the PBRM model has multifractal eigenfunctions at the critical value $μ=μ_c=1$, we clearly show [from the scaling of the relative fluctuation of the participation number $I_2$ as well as the scaling of the probability distribution functions $P(\ln I_2)$] the existence of the critical value $μ_c\equiv μ_c(α)$ for $α<1$. Moreover, we characterise the multifractality of the eigenfunctions of our random network model by the use of the corresponding multifractal dimensions $D_q$, that we compute from the finite network-size scaling of the typical eigenfunction participation numbers $\exp\left\langle\ln I_q \right\rangle$.

physics.soc-ph↗

From spatio-temporal data to chronological networks: An application to wildfire analysis

Network theory has established itself as an appropriate tool for complex systems analysis and pattern recognition. In the context of spatiotemporal data analysis, correlation networks are used in the vast majority of works. However, the Pearson correlation coefficient captures only linear relationships and does not correctly capture recurrent events. This missed information is essential for temporal pattern recognition. In this work, we propose a chronological network construction process that is capable of capturing various events. Similar to the previous methods, we divide the area of study into grid cells and represent them by nodes. In our approach, links are established if two consecutive events occur in two different nodes. Our method is computationally efficient, adaptable to different time windows and can be applied to any spatiotemporal data set. As a proof-of-concept, we evaluated the proposed approach by constructing chronological networks from the MODIS dataset for fire events in the Amazon basin. We explore two data analytic approaches: one static and another temporal. The results show some activity patterns on the fire events and a displacement phenomenon over the year. The validity of the analyses in this application indicates that our data modeling approach is very promising for spatio-temporal data mining.

physics.soc-ph↗

The Impact of Social Curiosity on Information Spreading on Networks

Most information spreading models consider that all individuals are identical psychologically. They ignore, for instance, the curiosity level of people, which may indicate that they can be influenced to seek for information given their interest. For example, the game Pokémon GO spread rapidly because of the aroused curiosity among users. This paper proposes an information propagation model considering the curiosity level of each individual, which is a dynamical parameter that evolves over time. We evaluate the efficiency of our model in contrast to traditional information propagation models, like SIR or IC, and perform analysis on different types of artificial and real-world networks, like Google+, Facebook, and the United States roads map. We present a mean-field approach that reproduces with a good accuracy the evolution of macroscopic quantities, such as the density of stiflers, for the system's behavior with the curiosity. We also obtain an analytical solution of the mean-field equations that allows to predicts a transition from a phase where the information remains confined to a small number of users to a phase where it spreads over a large fraction of the population. The results indicate that the curiosity increases the information spreading in all networks as compared with the spreading without curiosity, and that this increase is larger in spatial networks than in social networks. When the curiosity is taken into account, the maximum number of informed individuals is reached close to the transition point. Since curious people are more open to a new product, concepts, and ideas, this is an important factor to be considered in propagation modeling. Our results contribute to the understanding of the interplay between diffusion process and dynamical heterogeneous transmission in social networks.

physics.soc-ph↗

Rumor propagation with heterogeneous transmission in social networks

Rumor models consider that information transmission occurs with the same probability between each pair of nodes. However, this assumption is not observed in social networks, which contain influential spreaders. To overcome this limitation, we assume that central individuals have a higher capacity of convincing their neighbors than peripheral subjects. By extensive numerical simulations we find that the spreading is improved in scale-free networks when the transmission probability is proportional to PageRank, degree, and betweenness centrality. In addition, the results suggest that the spreading can be controlled by adjusting the transmission probabilities of the most central nodes. Our results provide a conceptual framework for understanding the interplay between rumor propagation and heterogeneous transmission in social networks.

physics.soc-ph↗